Sciweavers

914 search results - page 167 / 183
» Branch and Bound on the Network Model
Sort
View
CORR
2011
Springer
178views Education» more  CORR 2011»
12 years 11 months ago
Message and State Cooperation in a Relay Channel When the Relay Has Strictly Causal State Information
—A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and d...
Min Li, Osvaldo Simeone, Aylin Yener
SP
2010
IEEE
156views Security Privacy» more  SP 2010»
13 years 5 months ago
Round-Efficient Broadcast Authentication Protocols for Fixed Topology Classes
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
Haowen Chan, Adrian Perrig
IWQOS
2001
Springer
13 years 12 months ago
Dynamic Core Provisioning for Quantitative Differentiated Service
— Efficient network provisioning mechanisms that support service differentiation and automatic capacity dimensioning are essential to the realization of the Differentiated Servi...
Raymond R.-F. Liao, Andrew T. Campbell
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
13 years 11 months ago
Efficiency of Data Distribution in BitTorrent-Like Systems
BitTorrent (BT) in practice is a very efficient method to share data over a network of clients. In this paper we extend the recent work of Arthur and Panigrahy [1] on modelling the...
Ho-Leung Chan, Tak Wah Lam, Prudence W. H. Wong
JSAC
2007
78views more  JSAC 2007»
13 years 7 months ago
Partially Optimal Routing
— Most large-scale communication networks, such as the Internet, consist of interconnected administrative domains. While source (or selfish) routing, where transmission follows ...
Daron Acemoglu, Ramesh Johari, Asuman E. Ozdaglar