HomepageAbout me, short resume.Short technical survey of my own work.download publications, get a copy of my phd thesis.Free computer code to download.A weekly updated set of links to internet sites.The end page, credits...
WWW.BALMELLI.NET - contact

COMMUNICATION PIC SEMINARS

>home>seminars
Seminar topics

CONTENT-ADDRESSABLE NETWORKS
CONTENT-DISTRIBUTION NETWORKS
NETWORK CALCULUS
TURBO CODES 
MULTIPLE DESCRIPTION CODING
QoS PATHS WITH RESTORATION
AD-HOC WIRELESS NETWORKS
IP TRACEBACK


Organizing committee
Laurent Balmelli 
Dinesh Verma 
Olivier Verscheure
Pascal Frossard 
Dakshi Agrawal 
Anees A Shaikh 
Parviz Kermani 

 

IBM T.J. Watson Center - Seminars in Communications - Announcement

Algorithms for Computing QoS Paths with Restoration

Speaker
Alexander Sprintson 
Technion - Israel Institute of Technology
 
There is a growing interest among service providers to offer their customers new revenue-generating services with Quality of Service (QoS) guarantees e.g., Virtual Private Networks (VPNs). This is facilitated by current efforts to provide resource reservations and explicit path routing, e.g., Multi- Protocol Label Switching (MPLS). A key requirement for such services is that they also be resilient to failures. This goal can be achieved by provisioning primary and restoration paths that satisfy the QoS constraints.

We undertake a comprehensive study of problems related to finding QoS Paths with Restoration. We consider both bottleneck QoS constraints, such as bandwidth, and additive QoS constraints, such as delay and jitter. This is the first study to provide a rigorous solution, with proven guaranties, to the combined problem of computing QoS paths with restoration. It turns out that the widely used approach of disjoint primary and restoration paths is not an optimal strategy. Hence, the proposed algorithms construct a restoration topology, i.e., a set of bridges, each bridge protecting a portion of the primary QoS path. This approach guaranties to find a restoration topology with low cost when one exists.

Joint work with Y. Bejerano, Y. Breitbart, A. Orda, R. Rastogi

Material

 papers: