On Describing the Routing Capacity Regions of Networks

Details On Describing the Routing Capacity Regions of Networks On Describing the Routing Capacity Regions of Networks

2010-04-08

arxiv.org/abs/1004.1236v2

Mathematical Methods of Operations Research (MMOR), vol 72, no. 1, pp. 95-106, 2010

Mathematics

Optimization and Control

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Describing the Routing Capacity Regions of Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Describing the Routing Capacity Regions of Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Describing the Routing Capacity Regions of Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-713047