The BEST challenge for next-generation Ethernet services

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2005, Pages 1049-1059

  Risbood, Pankaj ^a   Acharya, Swarup ^a   Gupta, Bhawna ^a  

^a NOKIA RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ETHERNET SERVICES; ONLINE ALGORITHMS; SPANNING TREE CREATION; THEORETICAL HARDNESS;

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; INTEGER PROGRAMMING; LOCAL AREA NETWORKS; TELECOMMUNICATION SERVICES; TREES (MATHEMATICS);

TELECOMMUNICATION NETWORKS;

EID: 25844448095     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. R. Santitoro, "Metro Ethernet Services - A Technical Overview," http.www.metroethernetforum.org/metro-ethernet-services.pdf, 2003.
2. T.H. Corman, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, McGraw-Hill, 2nd edition, 2001.
3. M. R. Garey and D. S. Johnson, Computers and intractability - A Guide to the Theory of NP-Completeness, Freeman, 1979.
4. R. Ravi, A. Agrawal and P. Klein, "When trees collide: An approximation algorithm for the generalized steiner problem on networks," SIAM Journal on Computing, vol. 24, 1995.
5. D. Banerjee and B. Mukherjee, "Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study," IEEE/ACM Transactions on Networking (TON), vol. 8, October 2000.
6. A. Narula-Tam and E. Modiano, "Survivable routing of logical topologies in WDM networks," IEEE Infocom, 2001.
7. B. Yang, A.H. Esfahanian, L. Ni and P. Mohapatra, "A tree building technique for overlay multicast in diffserve domain," International Conference on Internet Computing, 2003.
8. J. M. Kleinberg, "Single source unsplittable flow," FOCS, 1996.
9. Y. Dinitz, N. Garg and M.X. Goemans, "On single source unsplittable flow problem," Combinatorica, vol. 19, November 1999.
10. R.C. Prim, "Shortest connection networks and some generalizations," Bell System Technical Journal, November 1957.
11. S. Acharya, B. Gupta, P. Risbood, A. Srivastava and Y. Chang, "Precomputing high quality routes for bandwidth guaranteed traffic," IEEE GLOBECOM, 2004.
12. T.C. Hu, "Optimum communication spanning trees," SIAM Journal on Computing, vol. 3, September 1974.
13. T.C. Hu, Integer Programming and Network Flows, Addison-Wesley Reading, Mass, 1969.
14. T. Radzik, "Fast deterministic approximation for the multicommodity flow problem," SODA, pp. 486-492, 1995.
15. S. Acharya, B. Gupta, P. Risbood and A. Srivastava, "PESO: low overhead protection for Ethernet over SONET transport," IEEE INFOCOM, 2004.