Sciweavers

410 search results - page 24 / 82
» Upgrading Shortest Paths in Networks
Sort
View
ISCC
2002
IEEE
101views Communications» more  ISCC 2002»
15 years 11 months ago
Partial path protection for WDM networks: end-to-end recovery using local failure information
In this paper, we propose a new protection scheme, which we term partial path protection (PPP), to select endto-end backup paths using local information about network failures. PP...
Hungjen Wang, Eytan Modiano, Muriel Médard
TON
2008
96views more  TON 2008»
15 years 6 months ago
MICRON: a framework for connection establishment in optical networks
Traffic grooming in optical networks has gained significance due to the prevailing sub-wavelength requirement of end users. Optical networks get upgraded to the latest technology s...
Srinivasan Ramasubramanian, Arun K. Somani
ICDCS
2010
IEEE
15 years 6 months ago
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
DSN
2004
IEEE
15 years 10 months ago
Fault Tolerant Energy Aware Data Dissemination Protocol in Sensor Networks
In this paper we present a data dissemination protocol for efficiently distributing data through a sensor network in the face of node and link failures. Our work is motivated by t...
Gunjan Khanna, Saurabh Bagchi, Yu-Sung Wu
INFOCOM
2003
IEEE
15 years 11 months ago
Exploiting Parallelism to Boost Data-Path Rate in High-Speed IP/MPLS Networking
Abstract—Link bundling is a way to increase routing scalability whenever a pair of Label Switching Routers in MPLS are connected by multiple parallel links. However, link bundlin...
Indra Widjaja, Anwar Elwalid