Abstract

This paper presents the design of a cell-switching wavelength division multiplexing (WDM) local area network (LAN), which constitutes a key component of a next-generation internet (NGI) consortium project recently funded by DARPA. An important goal of the NGI project is to support bandwidth-on-demand services with quality-of-service (QOS) guarantee over WDM networks. As a first step toward this goal, we have developed several fast scheduling algorithms for flexible bandwidth reservations and fair sharing of unreserved bandwidth in a WDM broadcast network with fast-tunable transceivers. Unlike circuit-based bandwidth reservation schemes that impose a fixed schedule precomputed on setup, our scheme deals with bursty traffic by allocating network resources dynamically using very efficient algorithms. Our algorithms are based on a new concept of computing maximal weighted matchings, which is a generalization of maximal matchings on unweighted graphs. We prove that our algorithms can support total reserved bandwidth of up to 50% of the network capacity, and in that case constant delay bounds are also established. Simulations show that our algorithms can in practice support much higher reserved bandwidth-up to 90% of network capacity, and with much better delay bounds, even for burst traffic. In addition to the bandwidth guarantee, the unreserved bandwidth can be shared fairly among the users using our fair access algorithms with case to 100% network utilization in simulations.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.