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

Mosharaf, K.; Lambadaris, Ioannis; Talim, J.

doi:10.1016/j.osn.2005.06.004

Cited by 12 publications

(2 citation statements)

References 18 publications

(14 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this context, Call Admission Control (CAC) plays a crucial role by determining how the system resources should be shared among the different service classes in order to achieve good performance. The design of CAC has been subject of many studies in literature; for instance, for wireless networks (see [1], [2]) and wired network (see [3], [4]). Aiming at optimizing the resource allocation, optimality studies have also been conducted.…”

Section: Introductionmentioning

confidence: 99%

Optimal CAC in MultiService Resource Sharing System with Preemptive Priority

Carvalho¹,

Coutinho²,

Costa³

2009

Anais Do XXVII Simpósio Brasileiro De Telecomunicações

View full text Add to dashboard Cite

Resumo-Uma análise de um sistema de compartilhamento de recursos multiserviçoé apresentada neste trabalho. A principal contribuiçãoé o projeto de um Controle de Admissão de chamadas (CAC)ótimo que considera o impacto do conjunto de atividades envolvidas em uma operação de preempção em sua decisãoótima, o que até então não foi estudo na literatura. Nós usamos o processo Semi-Markoviano de Decisão para modelar o comportamento do sistema. Nós mostramos por meio de uma análise das medidas de Qualidade de Serviço (QoS) que o desempenho do CACótimoé fortemente afetado quando os custos relacionados com a operação de preempçãoé variado.

show abstract

Section: Introductionmentioning

confidence: 99%

Optimal CAC in MultiService Resource Sharing System with Preemptive Priority

Carvalho¹,

Coutinho²,

Costa³

2009

Anais Do XXVII Simpósio Brasileiro De Telecomunicações

View full text Add to dashboard Cite

show abstract

“…We have published the research work presented in this thesis in several interna tional conferences [42][43][44][45][46][47][48][49] and technical journals [50,51].…”

Section: O N Tr Ib U Tio N S O F Th Is T H E Sismentioning

confidence: 99%

Resource management and service differentiation in WDM networks

Mosharaf¹

Self Cite

View full text Add to dashboard Cite

Direction du Patrimoine de I'edition A bstractIn this thesis, we present our recent research work in the area of optical Wavelength Division Multiplexing (WDM) networks, an im portant area which promises to be the focus of ongoing and future research. A WDM network consists of optical wavelength routing nodes interconnected by point-to-point fiber links in an arbitrary topology.WDM allows simultaneous transmission of multiple wavelengths within a single fiber.Although each wavelength can have a transmission capacity up to ten gigabit per second, some traffic streams may require lower bandwidth. To utilize the wavelengths more efficiently, traffic grooming is deployed to share the capacity of a wavelength among users with different bandwidth granularities. In WDM networks, the Routing and Wavelength Assignment (RWA) problem is an im portant issue. Service Differentiation, Quality of Service (QoS), and Fairness Management arestill open research problems in WDM grooming/non-grooming networks. The main contribution of this work is to formulate these problems for both grooming and non-grooming networks in the framework of the Markov Decision Process theory to determine the optimal dynamic wavelength allocation policies. Due to the huge size of the state space for realistic networks, the optimal policy determination is not possible in practice. Hence, heuristic algorithms are proposed with close performance to the optimal solution and lower computational complexity than the optimal. Another contribution of this proposal is to estimate the blocking performance of the system in order to dimension the network links. This work is a fundamental research study on resource management and has great value in future QoS-aware WDM networks.iv Reproduced with

show abstract

Simultaneous effect of connection admission control in distance and bandwidth capacity on WDM network performance

Lima

Cesar

2007

Photon Netw Commun

View full text Add to dashboard Cite

This article presents an algorithm for dynamicrouting and wavelength assignment (D-RWA) in an optical WDM network. The approach is based on a genetic algorithm (GA) and it includes a connection admission control (CAC), to provide a network with simultaneous fairness in distance and bandwidth capacity. The algorithm is evaluated by means of computer simulations using a mesh network with two types of node architectures capable of performing traffic grooming. Combining the two types of nodes, the performance of four network configurations is compared. Assuming that one of the two node types is more costly, two sparse node allocations are suggested to maintain the network cost-effective. The algorithm assigns wavelengths to the ligthpaths, routes the traffic streams, manages the grooming of sub-wavelength tributaries onto full wavelength channels, provides fairness, and minimizes the overall blocking probability of connection requests. Numerical results attest the usefulness of the proposed approach considering several scenarios of distance and bandwidth capacity classes of requests. Simultaneous and isolated simulations of the two fairness schemes are also compared, emphasizing the versatility of the algorithm.

show abstract

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

Abstract: We investigate a Call Admission Control (CAC)

Cited by 12 publications

References 18 publications

Optimal CAC in MultiService Resource Sharing System with Preemptive Priority

Optimal CAC in MultiService Resource Sharing System with Preemptive Priority

Resource management and service differentiation in WDM networks

Simultaneous effect of connection admission control in distance and bandwidth capacity on WDM network performance

Contact Info

Product

Resources

About