Multi-priority traffic grooming, providing sub-wavelength traffics of different priorities with varying grooming policies,
is an essential functionality for IP over WDM networks. It focuses on QoS guarantee and bigger accommodation for high
priority traffics by using specific grooming policy and preemption mechanism. But even when the preemption is
proposed, high priority traffics with high bandwidth requirements often experience a relatively high blocking. To resolve
this issue, a traffic-partition mechanism is proposed, which partitions a traffic flow and spreads it over multiple paths. In
particular, it considers number difference of o-e-o process over different paths in order to choose adapted paths to avoid
receiving buffer overflow, which derives from different transmission delays over various lightpaths. The mechanism also
explores a way to integrate with preemption algorithm to achieve better blocking performance. The simulation results
show that it can effectively lower blocking probability for high priority traffics and bring a useful gain in network access
fairness among traffics with different bandwidth requirements.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.