Loading [a11y]/accessibility-menu.js
The BEST challenge for next-generation Ethernet services | IEEE Conference Publication | IEEE Xplore

The BEST challenge for next-generation Ethernet services


Abstract:

Service providers are starting to offer next-generation E-Line (point-to-point) and E-LAN (multipoint-to-multipoint) Ethernet services over their existing SONET/SDH netwo...Show More

Abstract:

Service providers are starting to offer next-generation E-Line (point-to-point) and E-LAN (multipoint-to-multipoint) Ethernet services over their existing SONET/SDH networks. While Ethernet typically is "best-effort", these emerging services are expected to be "carrier-class" with strict bandwidth guarantees. Consequently, spanning tree creation, critical to any Ethernet network is fundamentally changed; each tree hop now needs to have sufficient capacity to meet the requisite bandwidth demands. In this paper, we introduce the bandwidth-endowed spanning tree (BEST) problem. Unlike the polynomial complexity of standard spanning tree algorithms, BEST is NP-complete, raising questions about the scalability of these services. We propose offline and online algorithms and study their performance using extensive simulations. We show that leveraging the Virtual Concatenation protocol (ITU-T G.707) is key to practical algorithms that are both effective and efficient. Inspite of the theoretical hardness, the online algorithms we propose are a good match to "optimal", offline integer programming benchmarks, demonstrating the viability of next-generation Ethernet services.
Date of Conference: 13-17 March 2005
Date Added to IEEE Xplore: 22 August 2005
Print ISBN:0-7803-8968-9
Print ISSN: 0743-166X
Conference Location: Miami, FL, USA

References

References is not available for this document.