Sciweavers

224 search results - page 31 / 45
» Auctions with Severely Bounded Communication
Sort
View
SPAA
2003
ACM
14 years 1 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
TIT
2008
95views more  TIT 2008»
13 years 8 months ago
Error Exponent Regions for Gaussian Broadcast and Multiple-Access Channels
In modern communication systems, different users have different requirements for quality of service (QoS). In this work, QoS refers to the average codeword error probability experi...
Lihua Weng, S. Sandeep Pradhan, Achilleas Anastaso...
ICC
2009
IEEE
159views Communications» more  ICC 2009»
14 years 3 months ago
fP2P-HN: A P2P-Based Route Optimization Solution for Mobile IP and NEMO Clients
— Wireless technologies are rapidly evolving and the users are demanding the possibility of changing its point of attachment to the Internet (i.e. default router) without breakin...
Albert Cabellos-Aparicio, Rubén Cuevas Rum&...
P2P
2008
IEEE
102views Communications» more  P2P 2008»
14 years 2 months ago
Free-Riding, Fairness, and Firewalls in P2P File-Sharing
Peer-to-peer file-sharing networks depend on peers uploading data to each other. Some peers, called free-riders, will not upload data unless there is an incentive to do so. Algor...
Jacob Jan-David Mol, Johan A. Pouwelse, Dick H. J....
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
14 years 8 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...