DISTRIBUTED ROUTING IN NETWORKS USING AFFINITY PROPAGATION

被引:0
作者
Shamaiah, Manohar [1 ]
Lee, Sang Hyun [1 ]
Vishwanath, Sriram [1 ]
Vikalo, Haris [1 ]
机构
[1] Univ Texas Austin, Dept Elect & Comp Engn, Austin, TX 78712 USA
来源
2011 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING | 2011年
关键词
Affinity propagation; Distributed routing;
D O I
暂无
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
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.
引用
收藏
页码:3036 / 3039
页数:4
相关论文
共 5 条
  • [1] Statistical mechanics of Steiner trees
    Bayati, M.
    Borgs, C.
    Braunstein, A.
    Chayes, J.
    Ramezanpour, A.
    Zecchina, R.
    [J]. PHYSICAL REVIEW LETTERS, 2008, 101 (03)
  • [2] Dahl G., 1998, OPER RES LETT
  • [3] Clustering by passing messages between data points
    Frey, Brendan J.
    Dueck, Delbert
    [J]. SCIENCE, 2007, 315 (5814) : 972 - 976
  • [4] Givoni I. E., 2009, NEURAL COMP, V21
  • [5] Lee S. H., 2011, IEEE ICASSP UNPUB