Performance analysis of timer-based burst assembly with slotted scheduling for optical burst switching networks |
| |
| Affiliation: | 1. Information and Network Systems Department, National Institute of Information and Communications Technology, 4–2–1 Nukuikita, Koganei, Tokyo 184–8795, Japan;2. Department of Systems Science, Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan;1. Department of Chemistry, Faculty of Science, Banaras Hindu University, Varanasi 221005, U.P., India;2. Department of Chemistry, Indian Institute of Technology, Banaras Hindu University, Varanasi 221005, U.P., India;3. Department of Chemistry and Biochemistry, University of Maryland Baltimore County, Baltimore, MD 21250, USA;1. Departamento de Estatística, Centro de Ciências Exatas e da Natureza, Universidade Federal da Paraíba, CEP 58051-900 João Pessoa (PB), Brazil;2. Centro de Informática, Universidade Federal de Pernambuco, Av. Jornalista Anibal Fernandes, s/n - Cidade Universitária, CEP 50740-560 Recife (PE), Brazil |
| |
| 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: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
