A generalized framework for analyzing time-space switched optical networks

Srinivasan, R.; Somani, Arun K.

doi:10.1109/49.974674

Cited by 70 publications

(56 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some complementary studies related to this problem can be found in [1,3,14]. A few analytical models have been proposed in the literature to compute the blocking probabilities in multirate WDM networks with grooming capabilities [8][9][10]. In [10], a capacity correlation model is presented for evaluation of blocking probabilities in a multi-hop single wavelength path, whereas [9] discusses the numerical computation of the blocking rates in a two-class network without capacity correlation between the links.…”

Section: Introductionmentioning

confidence: 99%

A call admission control for service differentiation and fairness management in WDM grooming networks

Mosharaf

Lambadaris

Talim

2005

Optical Switching and Networking

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 99%

A call admission control for service differentiation and fairness management in WDM grooming networks

Mosharaf

Lambadaris

Talim

2005

Optical Switching and Networking

View full text Add to dashboard Cite

show abstract

“…In [24], the authors propose a connection admission control scheme to ensure fairness in terms of connection blocking. A theoretical capacity correlation model is presented in [25] to compute the blocking probability for WDM networks with constrained grooming capability. In [26], two route-computation algorithms are proposed and compared, and the results indicate that, in order to achieve good performance in a dynamic environment, different grooming policies and route-computation algorithms need to be used under different network states.…”

Section: A Previous Workmentioning

confidence: 99%

A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks

Zhu

Zang

Zhu

et al. 2003

IEEE/ACM Trans. Networking

275

View full text Add to dashboard Cite

Abstract-As the operation of our fiber-optic backbone networks migrates from interconnected SONET rings to arbitrary mesh topology, traffic grooming on wavelength-division multiplexing (WDM) mesh networks becomes an extremely important research problem. To address this problem, we propose a new generic graph model for traffic grooming in heterogeneous WDM mesh networks. The novelty of our model is that, by only manipulating the edges of the auxiliary graph created by our model and the weights of these edges, our model can achieve various objectives using different grooming policies, while taking into account various constraints such as transceivers, wavelengths, wavelength-conversion capabilities, and grooming capabilities. Based on the auxiliary graph, we develop an integrated traffic-grooming algorithm (IGABAG) and an integrated grooming procedure (INGPROC) which jointly solve several traffic-grooming subproblems by simply applying the shortest-path computation method. Different grooming policies can be represented by different weightassignment functions, and the performance of these grooming policies are compared under both nonblocking scenario and blocking scenario. The IGABAG can be applied to both static and dynamic traffic grooming. In static grooming, the traffic-selection scheme is key to achieving good network performance. We propose several traffic-selection schemes based on this model and we evaluate their performance for different network topologies.Index Terms-Graph model, mesh network, optical network, traffic grooming, wavelength-division multiplexing (WDM).

show abstract

“…For every new incoming connection request, each of these sub-problems is then solved separately to determine the route, wavelength and time slot on which to route the request. In [2,3], the authors consider the general problem of on-line routing in WDM-TDM switched networks with Optical Time Slot Interchangers (OTSIs), while in [4], the authors propose a generalized network model called the Trunk Switched Network (TSN) to facilitate the modeling and analysis of WDM-TDM switched networks. An analytical model is developed to evaluate the blocking performance of TSNs.…”

Section: Introductionmentioning

confidence: 99%

“…A connection between a source node and a destination node is setup by assigning time slots on every link in the routing path. Intermediate nodes along the path then switch time slots from one link to the next [4].…”

Section: Introductionmentioning

confidence: 99%