A Study of the Routing Capacity Regions of Networks Conference Paper

abstract

• The routing capacity region of networks with multiple unicast sessions can be characterized using Farkas' lemma as an infinite set of linear inequalities. In this paper this result is sharpened by exploiting properties of the solution satisfied by each rate-tuple on the boundary of the capacity region, and a finite description of the routing capacity region which depends on network parameters is offered. For the special case of undirected ring networks additional results on the complexity of the description are provided. 2008 IEEE.

name of conference

• 2008 42nd Asilomar Conference on Signals, Systems and Computers

authors

• Savari, Serap

published proceedings

• 2008 42ND ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1-4

author list (cited authors)

• Kakhbod, A., Savari, S. A., & Yazdi, S.

citation count

• 1

complete list of authors

• Kakhbod, Ali||Savari, Serap A||Yazdi, SM Sadegh Tabatabaei

publication date

• October 2008

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Conference record / Asilomar Conference on Signals, Systems & Computers. Asilomar Conference on Signals, Systems & Computers  Journal

keywords

• Linear Programming
• Multicast Sessions
• Network Capacity
• Routing

Digital Object Identifier (DOI)

• 10.1109/ACSSC.2008.5074831

International Standard Book Number (ISBN) 13

• 978-1-4244-2940-0

start page

• 2226

end page

• +

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Facssc.2008.5074831