Sciweavers

552 search results - page 35 / 111
» Routing complexity of faulty networks
Sort
View
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 4 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 1 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
ISCC
1999
IEEE
14 years 11 hour ago
On Network Survivability Algorithms Based on Trellis Graph Transformations
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...
Soulla Louca, Andreas Pitsillides, George Samaras
PIMRC
2008
IEEE
14 years 2 months ago
Radio resource allocation in OFDMA multihop cellular cooperative networks
Multihop cellular networks (MeNs) is an extension of single hop cellular networks (SCNs) having benefits of a fixed base station and flexible ad hoc networks. The radio resource ma...
Cheol Jeong, Hyung-Myung Kim
ICPADS
1998
IEEE
13 years 11 months ago
Fault Tolerant All-to-All Broadcast in General Interconnection Networks
With respect to scalability and arbitrary topologies of the underlying networks in multiprogramming and multithread environment, fault tolerance in acknowledged ATAB and concurren...
Yuzhong Sun, Paul Y. S. Cheung, Xiaola Lin, Keqin ...