TY - GEN
T1 - A self-learning route selection scheme using multi-path searching packets in an OBS network
AU - Ishii, Daisuke
AU - Yamanaka, Naoaki
AU - Sasase, Iwao
PY - 2005/11/15
Y1 - 2005/11/15
N2 - In an OBS network, some contention resolution schemes at a core router have been proposed. However, in terms of the optical device technology, it is difficult to implement the contention resolution schemes such as optical buffers at a core router. In this paper, we propose the scheme that reduces the probability of burst contention by controlling the route at an edge router without resolving burst contention at a core router. Each edge router learns a suitable route to the destination edge router autonomously by using newly employed feedback packets and search packets. Due to the self-learning at each edge router, the traffic load is distributed in an OBS network. Therefore, our proposed scheme can reduce the probability of burst contention. According to computer simulations, under nonuniform traffic, our proposed scheme can reduce approximately one decade smaller burst loss probability compared with the conventional shortest path routing method.
AB - In an OBS network, some contention resolution schemes at a core router have been proposed. However, in terms of the optical device technology, it is difficult to implement the contention resolution schemes such as optical buffers at a core router. In this paper, we propose the scheme that reduces the probability of burst contention by controlling the route at an edge router without resolving burst contention at a core router. Each edge router learns a suitable route to the destination edge router autonomously by using newly employed feedback packets and search packets. Due to the self-learning at each edge router, the traffic load is distributed in an OBS network. Therefore, our proposed scheme can reduce the probability of burst contention. According to computer simulations, under nonuniform traffic, our proposed scheme can reduce approximately one decade smaller burst loss probability compared with the conventional shortest path routing method.
UR - http://www.scopus.com/inward/record.url?scp=27644560429&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=27644560429&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:27644560429
SN - 0780389247
T3 - 2005 Workshop on High Performance Switching and Routing, HPSR 2005
SP - 346
EP - 350
BT - 2005 Workshop on High Performance Switching and Routing, HPSR 2005
T2 - 2005 Workshop on High Performance Switching and Routing, HPSR 2005
Y2 - 12 May 2005 through 14 May 2005
ER -