Virtual Path Layout in ATM Path with Given Hop Count-Reference-Cited by-同舟云学术

Virtual Path Layout in ATM Path with Given Hop Count

Published:2001 Issue: Volume: Page:527-537
ISSN:0302-9743
Container-title:Networking — ICN 2001
language:
Short-container-title:

Author:

Choplin Sébastien

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-47734-9_52

Reference19 articles.

1. W. Aiello, S. N. Bhatt, F. R. K. Chung, A. L. Rosenber, and R. K. Sitaraman. Augmented ring networks. Technical Report UM-CS-1997-036, University of Massachusetts, Amherst, Computer Science, June, 1997.

2. Becchetti and Gaibisso. Lower bounds for the virtual path layout problem in ATM networks. In Theory and Practice of Informatics, Seminar on Current Trends in Theory and Practice of Informatics, LNCS, volume 24. 1997.

3. Lect Notes Comput Sci;J.-C. Bermond,1998

4. J-C. Bermond, N. Marlin, D. Peleg, and S. Perennes. Virtual Paths Layout with Low Congestion or Low Diameter in ATM Networks. In 1ére rencontre francophone… ALGOTEL’ 99, Mai 1999.

5. Pascal Chanas. Dimensionnement de réseaux ATM. PhD thesis, CNET Sophia, Sept. 1998.

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

1. Two-edge disjoint survivable network design problem with relays: a hybrid genetic algorithm and Lagrangian heuristic approach;Engineering Optimization;2013-02-26

2. Two-Edge Disjoint Survivable Network Design Problem with Relays;Operations Research and Cyber-Infrastructure;2009

3. Two-Hop Virtual Path Layout in Tori;Structural Information and Communication Complexity;2004

4. Directed virtual path layouts in ATM networks;Theoretical Computer Science;2003-01