The Capacity Region of a Collection of Multicast Sessions in an Undirected Ring Network

Authors:
S. M. Sadegh Tabatabaei Yazdi;Serap A. Savari;Kelli Carlson;Gerhard Kramer
Affiliations:
University of Michigan, USA;University of Michigan, USA;University of Michigan, USA;Bell Labs, USA
Venue:
ICPPW '07 Proceedings of the 2007 International Conference on Parallel Processing Workshops
Year:
2007

Citing 0
Cited 1

On the multimessage capacity region for undirected ring networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

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.