Sciweavers

18 search results - page 2 / 4
» Efficient algorithms for shared backup allocation in network...
Sort
View
INFOCOM
2002
IEEE
13 years 10 months ago
Distributed Partial Information Management (DPIM) Schemes for Survivable Networks - Part I
—This paper describes a novel framework, called Distributed Partial Information Management (or DPIM). It addresses several major challenges in achieving efficient shared path pr...
Chunming Qiao, Dahai Xu
INFOCOM
2000
IEEE
13 years 10 months ago
Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
Murali S. Kodialam, T. V. Lakshman
CN
2006
85views more  CN 2006»
13 years 5 months ago
A scalable and decentralized fast-rerouting scheme with efficient bandwidth sharing
This paper focuses on the protection of virtual circuits (Label Switched Paths, LSPs) in a (G)MPLS (Generalised Multi-Protocol Label Switching) network. The proposed algorithm is ...
Simon Balon, Laurent Mélon, Guy Leduc
CORR
2010
Springer
248views Education» more  CORR 2010»
13 years 5 months ago
Optimal Spectrum Sharing in MIMO Cognitive Radio Networks via Semidefinite Programming
Abstract--In cognitive radio (CR) networks with multipleinput multiple-output (MIMO) links, secondary users (SUs) can exploit "spectrum holes" in the space domain to acce...
Ying Jun Zhang, Anthony Man-Cho So
TCOM
2008
192views more  TCOM 2008»
13 years 5 months ago
Joint source coding, routing and power allocation in wireless sensor networks
This paper proposes a cross-layer optimization framework for the wireless sensor networks. In a wireless sensor network, each sensor makes a local observation of the underlying phy...
Jun Yuan, Wei Yu