TY - GEN
T1 - The capacity region of a collection of multicast sessions in an undirected ring network
AU - Yazdi, S. M.Sadegh Tabatabaei
AU - Savari E, Serap A.
AU - Carlson, Kelli
AU - Kramer, Gerhard
PY - 2007
Y1 - 2007
N2 - A finite set of inequalities is given that characterizes the routing rate region for an undirected ring network in which the source and destination vertices of each communication session form a string of adjacent vertices. The result uses an extension of the Japanese theorem for communication problems with multiple multicast sessions and an interpretation of the extension in terms of the collection of minimum length routing trees for the various multicast sessions. It is further demonstrated that routing is rate optimal in this case using new extensions to progressive d-separating edge set bounds.
AB - A finite set of inequalities is given that characterizes the routing rate region for an undirected ring network in which the source and destination vertices of each communication session form a string of adjacent vertices. The result uses an extension of the Japanese theorem for communication problems with multiple multicast sessions and an interpretation of the extension in terms of the collection of minimum length routing trees for the various multicast sessions. It is further demonstrated that routing is rate optimal in this case using new extensions to progressive d-separating edge set bounds.
UR - http://www.scopus.com/inward/record.url?scp=47749121782&partnerID=8YFLogxK
U2 - 10.1109/ICPPW.2007.80
DO - 10.1109/ICPPW.2007.80
M3 - Conference contribution
AN - SCOPUS:47749121782
SN - 0769529348
SN - 9780769529349
T3 - Proceedings of the International Conference on Parallel Processing Workshops
BT - 2007 International Conference on Parallel Processing Workshops, ICPPW
T2 - 2007 International Conference on Parallel Processing Workshops, ICPPW 2007
Y2 - 10 September 2007 through 14 September 2007
ER -