Resource dimensioning in WDM networks under state-based routing schemes

Zhang, Xiaolan J.; Kim, Sunil; Lumetta, Steven S.

doi:10.1109/broadnets.2007.4550458

Cited by 8 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It has been classified into deterministic dimensioning methods for static traffic and statistical dimensioning methods for dynamic traffic [ 13 ]. The statistical methods are further divided into first passage models [29][30][31] for incremental dynamic traffic and blocking models [7][8][9][32][33][34] for dynamic traffic in which the lightpath arrives/departs according to a statistical model. A heuristic algorithm for routing was proposed in [ 34 ], which is used for dimensioning WDM ring networks.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The functions in ( 2 ) represent the number of wavelength channels using the Erlang B formula for a specific link BP (ie, B l = 1 % ) in ( 8 ). In ( 8 ), arg min represents the minimum integer value of a wavelength.…”

Section: Subject Tomentioning

confidence: 99%

“…The emergence of high data rate newly developed Internet and mobile applications, including video communication, peer-to-peer and distributed computing, and healthcare applications are also generating high-bandwidth but variable short-lived traffic demands [ 6 ]. The volume of variable traffic demands will further increase when dynamic WDM networking becomes stable and more cost efficient [7][8][9]. Resource dimensioning, including wavelength channel and switch port optimization as well as resource allocation to sustain dynamic traffic, has become a challenging problem for dynamic WDM networks.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Joint routing, link capacity dimensioning, and switch port optimization for dynamic traffic in optical networks

Khan

Khattak

et al. 2021

ETRI Journal

View full text Add to dashboard Cite

This paper considers a challenging problem: to simultaneously optimize the cost and the quality of service in opaque wavelength division multiplexing (WDM) networks. An optimization problem is proposed that takes the information including network topology, traffic between end nodes, and the target level of congestion at each link/ node in WDM networks. The outputs of this problem include routing, link channel capacities, and the optimum number of switch ports locally added/dropped at all switch nodes. The total network cost is reduced to maintain a minimum congestion level on all links, which provides an efficient trade-off solution for the network design problem. The optimal information is utilized for dynamic traffic in WDM networks, which is shown to achieve the desired performance with the guaranteed quality of service in different networks. It was found that for an average link blocking probability equal to 0.015, the proposed model achieves a net channel gain in terms of wavelength channels ( 𝛾 w ) equal to 35.72 % , 39.09 % , and 36.93 % compared to shortest path first routing and 𝛾 w equal to 29.41 % , 37.35 % , and 27.47 % compared to alternate routing in three different networks.

show abstract