Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
This paper addresses the issue of capacity fairness in WDM networks with traffic grooming capabilities, supporting lower- rate circuit-switched traffic streams. Traffic grooming in WDM networks, is defined as the act of multiplexing, demultiplexing and switching lower rate traffic streams onto higher capacity lightpaths. In such a network, in addition to add/drop and full wavelength switching features, some or all of the network nodes can be provided with the capability to switch lower-rate traffic streams from one wavelength on an input port to another wavelength on an output port. Call requests arrive randomly and can request a lower-rate traffic connection to be established between the node pair. The call requests that ask for capacity nearer to the full wavelength capacity are bound to experience higher blocking than those that ask for a smaller fraction. This difference in loss performance is more pronounced as the traffic switching capability of the network is increased. In this paper, we study the capacity fairness of existing dynamic wavelength assignment algorithms.
Proceedings of SPIE – SPIE
Published: Sep 22, 2000
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.