Sciweavers

107 search results - page 15 / 22
» Optimizing Replication, Communication, and Capacity Allocati...
Sort
View
INFOCOM
2011
IEEE
12 years 11 months ago
Utility optimization for dynamic peer-to-peer networks with tit-for-tat constraints
— We consider a peer-to-peer network where nodes can send and receive files amongst their peers. File requests are generated randomly, and each new file can correspond to a dif...
Michael J. Neely, Leana Golubchik
ISCC
2005
IEEE
14 years 1 months ago
Optimal Delay-Constrained Minimum Cost Loop Algorithm for Local Computer Network
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
Yong-Jin Lee, Mohammed Atiquzzaman
INFOCOM
2006
IEEE
14 years 1 months ago
Dedicated Channels as an Optimal Network Support for Effective Transfer of Massive Data
— Instantaneous Fair Sharing (IFS) is a traditional network ideal prescribing to share the network capacity among competing applications fairly during any infinitesimal time int...
Sergey Gorinsky, Nageswara S. V. Rao
ICC
2007
IEEE
154views Communications» more  ICC 2007»
13 years 11 months ago
Topology Management in CogMesh: A Cluster-Based Cognitive Radio Mesh Network
As the radio spectrum usage paradigm shifting from the traditional command and control allocation scheme to the open spectrum allocation scheme, wireless mesh networks meet new opp...
Tao Chen, Honggang Zhang, Gian Mario Maggio, Imric...
INFOCOM
2010
IEEE
13 years 6 months ago
Making the Case for Random Access Scheduling in Wireless Multi-hop Networks
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
Apoorva Jindal, Ann Arbor, Konstantinos Psounis