Paper
11 October 2001 QoS in optical burst switching networks
Junjun Wan, Xiaofei Liu, Xiaohan Sun, Mingde Zhang
Author Affiliations +
Proceedings Volume 4604, Fiber Optic Components, Subsystems, and Systems for Telecommunications; (2001) https://doi.org/10.1117/12.444593
Event: International Symposium on Optoelectonics and Microelectronics, 2001, Nanjing, China
Abstract
The rapid development in both Internet application and emerging optical technology is bringing about fundamental changes in networking philosophies. To support the burst traffic on the Internet efficiently, optical burst switching is a way to streamline both protocol and hardware in building the next generation optical Internet. In this paper, we first give an overview of the optical burst switching schemes and burst reservation concepts. After comparisons, we find that the one called Just-Enough-Time (JET) performs the best and allows service differentiation. In the JET mechanism, a parameter, QoS offset time, acts as a very important character. Then we mainly discuss how to choose an appropriate QoS offset time with a dynamic programming model, which is constructed to find out the balance between the loss probability and the utilization of the buffering. Finally, we propose a bran-new strategy, which changes the QoS offset time according to the load of different service. In this way, we can further improve the utilization of the channel, meanwhile, with the loss probability guaranteed.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Junjun Wan, Xiaofei Liu, Xiaohan Sun, and Mingde Zhang "QoS in optical burst switching networks", Proc. SPIE 4604, Fiber Optic Components, Subsystems, and Systems for Telecommunications, (11 October 2001); https://doi.org/10.1117/12.444593
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
Back to Top