Sciweavers

365 search results - page 29 / 73
» Weight properties of network codes
Sort
View
82
Voted
INFOCOM
2007
IEEE
15 years 4 months ago
Towards Topology Aware Networks
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
Christos Gkantsidis, Gagan Goel, Milena Mihail, Am...
73
Voted
INFOCOM
2003
IEEE
15 years 3 months ago
A Multicast Transmission Schedule for Scalable Multi-Rate Distribution of Bulk Data Using Non-Scalable Erasure-Correcting Codes
–This paper addresses the efficient multicast dissemination of bulk data from a single server to numerous clients. The challenge is complex: a client may commence reception at ar...
Yitzhak Birk, Diego Crupnicoff
ICDCS
2009
IEEE
15 years 6 months ago
MOPS: Providing Content-Based Service in Disruption-Tolerant Networks
—Content-based service, which dynamically routes and delivers events from sources to interested users, is extremely important to network services. However, existing content-based...
Feng Li, Jie Wu
COCOA
2008
Springer
14 years 11 months ago
Strong Formulations for 2-Node-Connected Steiner Network Problems
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...
71
Voted
JSAC
2008
85views more  JSAC 2008»
14 years 9 months ago
A distributed minimum variance estimator for sensor networks
A distributed estimation algorithm for sensor networks is proposed. A noisy time-varying signal is jointly tracked by a network of sensor nodes, in which each node computes its es...
Alberto Speranzon, Carlo Fischione, Karl Henrik Jo...