ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Performance Evaluation
Volume 63, Issues 9-10, October 2006, Pages 1016-1031
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (2049 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.peva.2005.11.005    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2005 Elsevier Ltd All rights reserved.

Performance analysis of timer-based burst assembly with slotted scheduling for optical burst switching networks

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Takuji Tachibanaa, Corresponding Author Contact Information, E-mail The Corresponding Author and Shoji Kasaharab, E-mail The Corresponding Author

aInformation and Network Systems Department, National Institute of Information and Communications Technology, 4–2–1 Nukuikita, Koganei, Tokyo 184–8795, Japan

bDepartment of Systems Science, Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan


Received 3 January 2005; 
revised 26 October 2005. 
Available online 18 January 2006.

Abstract

In this paper, we analyze the performance of a timer-based burst assembly for optical burst switching (OBS) networks. In our analytical model, an ingress edge node has multiple buffers where IP packets are stored depending on their egress edge nodes, and bursts are assembled at the buffers in round-robin manner. Moreover, bursts are transmitted in accordance with slotted scheduling where each burst transmission starts at the slot boundary. We construct a loss model with two independent arrival streams, and explicitly derive the burst loss probability, burst throughput, and data throughput. In numerical examples, we show the effectiveness of our analysis in comparison with the Erlang loss system. It is shown that our model is quite useful for an OBS network with a large number of input and output links.

Keywords: Optical burst switching; Timer-based burst assembly; Queueing model; Erlang loss system; Slotted transmission scheduling

Article Outline

1. Introduction
2. Timer-based burst assembly and slotted transmission scheduling
3. Analytical model
4. Performance analysis
5. Numerical examples
5.1. Impact of burst assembly processing time
5.2. Impact of bursts from the other nodes
5.3. Impact of the number of wavelengths
5.4. Impact of heterogeneous IP packet traffic
6. Conclusions
Acknowledgements
References
Vitae


















Corresponding Author Contact InformationCorresponding author. Tel.: +81 42 327 5209; fax: +81 42 327 7035.

Performance Evaluation
Volume 63, Issues 9-10, October 2006, Pages 1016-1031
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.