Dynamic burst discarding scheme for deflection routing in optical burst switching networks

Authors:
Kouji Hirata;Takahiro Matsuda;Tetsuya Takine
Affiliations:
Department of Information and Communications Technology, Division of Electrical, Electronic and Information Engineering, Graduate School of Engineering, Osaka University, 2-1 Yamada-oka, Suita 565 ...;Department of Information and Communications Technology, Division of Electrical, Electronic and Information Engineering, Graduate School of Engineering, Osaka University, 2-1 Yamada-oka, Suita 565 ...;Department of Information and Communications Technology, Division of Electrical, Electronic and Information Engineering, Graduate School of Engineering, Osaka University, 2-1 Yamada-oka, Suita 565 ...
Venue:
Optical Switching and Networking
Year:
2007

Citing 4
Cited 1

Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Design and implementation of a prototype optical deflection network

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Optical burst switching (OBS) - a new paradigm for an optical Internet

Journal of High Speed Networks - Special issue on optical networking
On wavelength translation in all-optical networks

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2

Contention resolution considering multicast traffic in optically burst-switched WDM networks

Photonic Network Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a dynamic burst discarding scheme for deflection routing in optical burst switching networks. In general, deflection routing is effective in lightly loaded situations, whereas it has a contrary effect in congested networks because deflected bursts accelerate network congestion. Thus deflection routing should be employed in lightly loaded networks. Incoming traffic, however, varies in time and location, so that temporal and/or local congestion cannot be avoided. Our proposed scheme resolves this problem in the following way. Each node autonomously detects congestion with local information, and bursts to be deflected are discarded in a probabilistic manner, based on the degree of detected congestion and the numbers of elapsed and remaining hops of those bursts. Simulation experiments show that when congestion happens temporarily, the proposed scheme reduces the burst loss probability, and it utilizes network resources efficiently when local congestion happens.