Please use this identifier to cite or link to this item: https://doi.org/10.1109/ICC.2006.255168
DC FieldValue
dc.titleAdaptive proportional flow routing in optical burst switching networks
dc.contributor.authorLu, J.
dc.contributor.authorMohan, G.
dc.contributor.authorChua, K.C.
dc.date.accessioned2014-06-19T02:58:10Z
dc.date.available2014-06-19T02:58:10Z
dc.date.issued2006
dc.identifier.citationLu, J.,Mohan, G.,Chua, K.C. (2006). Adaptive proportional flow routing in optical burst switching networks. IEEE International Conference on Communications 6 : 2581-2586. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/ICC.2006.255168" target="_blank">https://doi.org/10.1109/ICC.2006.255168</a>
dc.identifier.isbn1424403553
dc.identifier.issn05361486
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/69217
dc.description.abstractIn this paper, we investigate the problem of multipath dynamic traffic routing in optical burst switching (OBS) networks. In this work, traffic is split among the multiple link-disjoint paths between each source and destination pair. Taking into consideration the packet reordering problem, we propose a new adaptive proportional routing scheme that operates on flow level. The objective of the proposed scheme is to reduce the overall burst loss in the network and at the same time avoid the packet out-of-sequence arrival problem. This is achieved by adaptively adjusting the traffic flow proportions assigned to the multiple paths between a source and destination pair based on the measurement of the impact of the offered traffic load on each of them in the past. When a new flow arrives, an appropriate path is chosen for it based on the calculated flow proportions. In addition, burst assembly time between different paths can also be adjusted to further enhance the performance. Through extensive simulations, we show that the proposed flow-based multi-path traffic routing approach not only provides significantly better burst loss performance than the basic equal-proportion and hop-length based traffic routing algorithms, but is also void of any packet re-orderings. © 2006 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ICC.2006.255168
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1109/ICC.2006.255168
dc.description.sourcetitleIEEE International Conference on Communications
dc.description.volume6
dc.description.page2581-2586
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

2
checked on Jul 18, 2019

Page view(s)

58
checked on Jul 5, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.