Sciweavers

4 search results - page 1 / 1
» Using Type-of-Relationship (ToR) Graphs to Select Disjoint P...
Sort
View
GLOBECOM
2007
IEEE
13 years 11 months ago
Using Type-of-Relationship (ToR) Graphs to Select Disjoint Paths in Overlay Networks
— Routing policies used in the Internet can be restrictive, limiting communication between source-destination pairs to one path, when often better alternatives exist. To avoid ro...
Sameer Qazi, Tim Moors
INFOCOM
1997
IEEE
13 years 9 months ago
Addressing Network Survivability Issues by Finding the K-Best Paths through a Trellis Graph
Due to the increasing reliance of our society on the timely and reliable transfer of large quantities of information (suchas voice, data, and video)across high speed communication...
Stavros D. Nikolopoulos, Andreas Pitsillides, Davi...
ICMCS
2007
IEEE
125views Multimedia» more  ICMCS 2007»
13 years 11 months ago
A Framework for Provisioning Overlay Network Based Multimedia Distribution Services
In this paper, we present a graph-theoretic framework for provisioning overlay network based multimedia distribution services to a diverse set of receivers. Considering resource l...
Dewan Tanvir Ahmed, Shervin Shirmohammadi
TON
2002
117views more  TON 2002»
13 years 4 months ago
Generalized loop-back recovery in optical mesh networks
Current means of providing loop-back recovery, which is widely used in SONET, rely on ring topologies, or on overlaying logical ring topologies upon physical meshes. Loop-back is d...
Muriel Médard, Richard A. Barry, Steven G. ...