Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/19375
DC FieldValueLanguage
dc.contributorDepartment of Electronic and Information Engineering-
dc.creatorWu, J-
dc.creatorTse, CK-
dc.creatorLau, FCM-
dc.creatorHo, IWH-
dc.date.accessioned2014-12-19T04:14:16Z-
dc.date.available2014-12-19T04:14:16Z-
dc.identifier.isbn9781467357609-
dc.identifier.issn0271-4310-
dc.identifier.urihttp://hdl.handle.net/10397/19375-
dc.description2013 IEEE International Symposium on Circuits and Systems, ISCAS 2013, Beijing, 19-23 May 2013en_US
dc.language.isoenen_US
dc.titleAn adaptive routing algorithm for load balancing in communication networksen_US
dc.typeConference Paperen_US
dc.identifier.spage2295-
dc.identifier.epage2298-
dc.identifier.doi10.1109/ISCAS.2013.6572336-
dcterms.abstractIn this paper, we study the packet routing process in communication networks. For efficient and reliable data transmission, the traffic load should be as uniformly distributed as possible in the network and the average distance travelled by the data should be short. The Internet has been demonstrated to have small-world and scale-free properties in its topology. Under the shortest path routing strategy, the traffic intensity of high degree nodes is much higher, thus causing congestion of the whole network. We propose an adaptive routing algorithm, which takes into consideration both the network structure property and the dynamic traffic information. Simulation results show that the proposed algorithm can effectively balance the traffic in the network and improve the overall traffic performance.-
dcterms.bibliographicCitationProceedings - IEEE International Symposium on Circuits and Systems, 2013, 6572336, p. 2295-2298-
dcterms.issued2013-
dc.identifier.scopus2-s2.0-84883352773-
dc.relation.ispartofbookProceedings - IEEE International Symposium on Circuits and Systems-
dc.identifier.rosgroupidr62925-
dc.description.ros2012-2013 > Academic research: refereed > Refereed conference paper-
Appears in Collections:Conference Paper
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
Citations as of Sep 5, 2020

Page view(s)

142
Last Week
0
Last month
Citations as of Oct 25, 2020

Google ScholarTM

Check

Altmetric


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