Muralidharan Sampath Kodialam

Maximum Throughput Routing of Traffic in the Hose Model

A computer-implemented method of computing throughput of a data-routing scheme for a network of nodes interconnected by links and having at least one ingress point and at least one egress point. The method includes: deriving a polynomial-size linear program from a combination of a first linear program and a second linear program and solving the polynomial-size linear program. The first linear program has infinite constraints and minimizes maximum-link utilization of a link in a path between the ingress point and the egress point. The second linear program determines whether any constraint of the first linear program is violated.

Advances in Oblivious Routing of Internet Traffic

Routing is a central topic in networking since it determines the connectivity between users. Recently, with the growing use of the Internet for a wide variety of bandwidth intensive applications, including peer-to-peer and on-demand/real-time multimedia, it has also become important that routing accounts for the quality-ofservice needs of applications and users. A research problem of much current interest is traffic-oblivious routing for ensuring that the network provides the needed quality-of-service despite uncertain knowledge of the carried traffic. Oblivious routing involves using pre-determined paths to route between each ingress-egress node in the network (typically an Internet domain) that do not change with changing traffic patterns. By removing the need to detect changes in traffic in real-time or reconfigure the network in response to it, significant simplification in network management/operations and associated reduction in costs can be achieved. Moreover, oblivious routing has the potential to make the Internet much more robust and predictable in the face of rapidly varying and unpredictable traffic patterns. Theoretical advances in the area have shown that oblivious routing can provide these benefits without compromising capacity efficiency. We survey recent advances in oblivious routing with a view towards its application in (intra-domain) Internet routing.