Hierarchical traffic grooming: A tutorial-Reference-Cited by-同舟云学术

Hierarchical traffic grooming: A tutorial

Published:2014-08 Issue: Volume:69 Page:147-156
ISSN:1389-1286
Container-title:Computer Networks
language:en
Short-container-title:Computer Networks

Author:

Wang Hui,Rouskas George N.

Publisher

Elsevier BV

Subject

Computer Networks and Communications

Reference32 articles.

1. Traffic grooming in WDM networks: past and future;Dutta;IEEE Netw.,2002

2. Cost-effective traffic grooming in WDM rings;Gerstel;IEEE/ACM Trans. Network.,2000

3. Grooming of arbitrary traffic in SONET/WDM BLSRs;Wan;IEEE J. Sel. Area. Commun.,2000

4. On optimal traffic grooming in WDM rings;Dutta;IEEE J. Sel. Area. Commun.,2002

5. V.R. Konda, T.Y. Chow, Algorithm for traffic grooming in optical networks to minimize the number of transceivers, in: IEEE Workshop on High Performance Switching and Routing, 2001, pp. 218–221.

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Symmetry-free routing and spectrum assignment: a universal algorithm based on first-fit;Journal of Optical Communications and Networking;2024-08-12

2. First-Fit: A Universal Algorithm for Spectrum Assignment;GLOBECOM 2023 - 2023 IEEE Global Communications Conference;2023-12-04

3. Symmetry-free algorithm for spectrum allocation: parallel implementations and evaluation;Journal of Optical Communications and Networking;2023-09-11

4. A symmetry-free spectrum allocation heuristic for elastic optical networks;Optical Switching and Networking;2023-05

5. Parameterized First Fit (PFF): Eliminating Symmetry in Spectrum Allocation;GLOBECOM 2022 - 2022 IEEE Global Communications Conference;2022-12-04