Optimal path selection for minimizing the differential delay in Ethernet-over-SONET

Computer Networks

Volumn 50, Issue 13, 2006, Pages 2349-2363

  Ahuja, Satyajeet ^a   Krunz, Marwan ^a   Korkmaz, Turgay ^b  

^a University of Arizona   (United States)

^b University of Texas at San Antonio   (United States)

Author keywords

Differential delay; Ethernet over SONET SDH; Path selection; Virtual concatenation

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); HEURISTIC METHODS; LOCAL AREA NETWORKS; PROBLEM SOLVING; VIRTUAL REALITY;

CONSTRAINED PATH SELECTION; DIFFERENTIAL DELAY; ETHERNET-OVER-SONET/SDH; VIRTUAL CONCATENATION;

MOTION PLANNING;

EID: 33745663988     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2005.09.034     Document Type: Article

References (20)

1. ITU-T Standard G.707, Network node interface for the synchronous digital hierarchy, 2000.
2. ANSI T1.105-2001, Synchronous optical network (SONET): Basic description including multiplexing structure, rates and formats, 2001.
3. IETF RFC 1577, Classical IP and ARP over ATM, June, 1994.
4. IETF RFC 2615, PPP over SONET/SDH, June, 1999.
5. ITU-T Standard G.7041, Generic framing procedure, February, 2003.
6. Ramamurti V., Siwko J., Young G., and Pepe M. Initial implementations of point-to-point Ethernet over SONET/SDH transport. IEEE Communications Magazine 42 (2004) 64-70
7. ITU-T Standard G.7042, Link capacity adjustment scheme for virtually concatenated signals, 2001.
8. Shaikh A., Rexford J., and Shin K.G. Evaluating the impact of stale link state on quality-of-service routing. IEEE/ACM Transactions on Networking 9 2 (2001) 162-176
9. Lorenz D.H., and Orda A. QoS routing in networks with uncertain parameters. IEEE/ACM Transactions on Networking 6 6 (1988) 768-778
10. Korkmaz T., and Krunz M. Bandwidth-delay constrained path selection under inaccurate state information. IEEE/ACM Transactions on Networking 11 3 (2003) 384-398
11. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (2000), W.H. Freeman, San Francisco, CA
12. *prune: An algorithm for finding k shortest paths subject to multiple constraints, in: Proceedings of the IEEE INFOCOM Conference, 2001, pp. 743-749.
13. G. Eppstein, Finding the k shortest paths, in: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, vol. 1, November, 1994, pp. 154-165.
14. E.I. Chong, S.R. Sanjeev Rao Maddila, S.T. Morley, On finding single-source single-destination shortest paths, in: The Seventh International Conference on Computing and Information (ICCI '95), July, 1995, pp. 40-47.
15. F. Kuipers, T. Korkmaz, M. Krunz, P. Van Mieghem, An overview of constraint-based path selection algorithms for QoS routing, IEEE Communications-Feature Topic on IP-Oriented Quality of Service (QOS), December, 2002, pp. 50-55.
16. T. Korkmaz, M. Krunz, Routing multimedia traffic with QoS guarantees, vol. 5, September, 2003, pp. 429-443.
17. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network flows: Theory, Algorithm, and Applications (1993), Prentice Hall, Inc
18. McDysan D.E. QoS & Traffic Management in IP & ATM Networks (2000), McGraw-Hill
19. Papoulis A., and Pillai S.U. Probability, Random Variables and Stochastic Processes (2002), McGraw-Hill Higher Education
20. Waxman B.M. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications 69 (1988) 1617-1622