Sciweavers

139 search results - page 25 / 28
» Bandwidth on AT-Free Graphs
Sort
View
AHSWN
2008
92views more  AHSWN 2008»
13 years 9 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 9 months ago
Picking up the Pieces: Self-Healing in Reconfigurable Networks
We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity...
Jared Saia, Amitabh Trehan
COR
2004
111views more  COR 2004»
13 years 9 months ago
Multiple multicast tree allocation in IP network
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
Chae Y. Lee, Hee K. Cho
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 8 months ago
Fractional Repetition Codes for Repair in Distributed Storage Systems
Abstract—We introduce a new class of exact MinimumBandwidth Regenerating (MBR) codes for distributed storage systems, characterized by a low-complexity uncoded repair process tha...
Salim Y. El Rouayheb, Kannan Ramchandran
TIT
2010
98views Education» more  TIT 2010»
13 years 4 months ago
Pairwise intersession network coding on directed networks
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow ...
Chih-Chun Wang, Ness B. Shroff