文章基本信息

标题：Optimal Total Exchange in Anonymous Cayley Graphs
本地全文：下载
作者：Sanghoun Oh ; Adnan Mohamed ; Moongu Jeon 等
期刊名称：International Journal of Future Generation Communication and Networking
印刷版ISSN：2233-7857
出版年度：2010
卷号：3
期号：3
出版社：SERSC
摘要：Total exchange or all-to-all personalized communication problem is that each node in a network has a message to be sent to every other node. To solve this communication problem, we present a time-optima algorithm in anonymous Cayley graphs as assuming a single-port full duplex model in which every node is able to send and receive at most one message in each time unit.
关键词：Cayley Graphs; Total Exchange Algorithm; Optimality.