DocumentCode
2147810
Title
Distributed routing in networks using affinity propagation
Author
Shamaiah, Manohar ; Lee, Sang Hyun ; Vishwanath, Sriram ; Vikalo, Haris
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA
fYear
2011
fDate
22-27 May 2011
Firstpage
3036
Lastpage
3039
Abstract
This paper applies affinity propagation (AP) to develop distributed solutions for routing over networks. AP is a message passing algorithm for unsupervised learning. This paper demonstrates that AP can be generalized and applied to a wide class of problems in networking. In particular, AP can be used to develop distributed routing mechanisms for networks. Simulation results demonstrate that the proposed schemes compare favorably with the existing methods.
Keywords
learning (artificial intelligence); message passing; pattern clustering; telecommunication network routing; affinity propagation; distributed network routing; message passing algorithm; unsupervised learning; Approximation algorithms; Clustering algorithms; Euclidean distance; Optimization; Resource management; Routing; Wireless communication; Affinity propagation; Distributed routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on
Conference_Location
Prague
ISSN
1520-6149
Print_ISBN
978-1-4577-0538-0
Electronic_ISBN
1520-6149
Type
conf
DOI
10.1109/ICASSP.2011.5946298
Filename
5946298
Link To Document