Sciweavers

76 search results - page 14 / 16
» Can Shortest-path Routing and TCP Maximize Utility
Sort
View
SPAA
1999
ACM
14 years 21 days ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...
INFOCOM
2005
IEEE
14 years 2 months ago
Network equilibrium of heterogeneous congestion control protocols
— When heterogeneous congestion control protocols that react to different pricing signals share the same network, the resulting equilibrium may no longer be interpreted as a solu...
Ao Tang, Jiantao Wang, Steven H. Low, Mung Chiang
INFOCOM
2011
IEEE
12 years 11 months ago
Experimental evaluation of optimal CSMA
Abstract—By ‘optimal CSMA’ we denote a promising approach to maximize throughput-based utility in wireless networks without message passing or synchronization among nodes. De...
Bruno Nardelli, Jinsung Lee, Kangwook Lee, Yung Yi...
MOBICOM
1996
ACM
14 years 16 days ago
Low-Loss TCP/IP Header Compression for Wireless Networks
Wireless is becoming a popular way to connect mobile computers to the Internet and other networks. The bandwidth of wireless links will probably always be limited due to propertie...
Mikael Degermark, Mathias Engan, Björn Nordgr...
NETWORKING
2004
13 years 9 months ago
Pricing Differentiated Services: A Game-Theoretic Approach
The goal of this paper is to study pricing of differentiated services and its impact on the choice of service priority at equilibrium. We consider both TCP connections as well as n...
Eitan Altman, Dhiman Barman, Rachid El Azouzi, Dav...