Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the first international conference on Information and computation economies
Public Access to the Internet
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Congestion Pricing: Paying Your Way in Communication Networks
IEEE Internet Computing
Tussle in cyberspace: defining tomorrow's internet
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
The Direction of Value Flow in Connectionless Networks
NGC '99 Proceedings of the First International COST264 Workshop on Networked Group Communication
A Distributed Protocol for Multi-Class QoS Provision in Noncooperative Many-Switch Systems
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
Analysis of a static pricing scheme for priority services
IEEE/ACM Transactions on Networking (TON)
Accurate, scalable in-network identification of p2p traffic using application signatures
Proceedings of the 13th international conference on World Wide Web
Transport layer identification of P2P traffic
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Internet traffic classification using bayesian analysis techniques
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
BLINC: multilevel traffic classification in the dark
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Policing congestion response in an internetwork using re-feedback
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
A BGP-based mechanism for lowest-cost routing
Distributed Computing - Special issue: PODC 02
Net neutrality: the technical side of the debate: a white paper
ACM SIGCOMM Computer Communication Review
Flow rate fairness: dismantling a religion
ACM SIGCOMM Computer Communication Review
Early application identification
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Delay tolerant bulk data transfers on the internet
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
IEEE Spectrum
Toward the accurate identification of network applications
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
Pricing congestible network resources
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We propose Trade & Cap (T&C), an economics-inspired mechanism that incentivizes users to voluntarily coordinate their consumption of the bandwidth of a shared resource (e.g., a DSLAM link) so as to converge on what they perceive to be an equitable allocation, while ensuring efficient resource utilization. Under T&C, rather than acting as an arbiter, an Internet Service Provider (ISP) acts as an enforcer of what the community of rational users sharing the resource decides is a fair allocation of that resource. Our T&C mechanism proceeds in two phases. In the first, software agents acting on behalf of users engage in a strategic trading game in which each user agent selfishly chooses bandwidth slots to reserve in support of primary, interactive network usage activities. In the second phase, each user is allowed to acquire additional bandwidth slots in support of a presumed open-ended need for fluid bandwidth, catering to secondary applications. The acquisition of this fluid bandwidth is subject to the remaining ''buying power'' of each user and by prevalent ''market prices'' - both of which are determined by the results of the trading phase and a desirable aggregate cap on link utilization. We present analytical results that establish the underpinnings of our T&C mechanism, including game-theoretic results pertaining to the trading phase, and pricing of fluid bandwidth allocation pertaining to the capping phase. Using real network traces, we present extensive experimental results that demonstrate the benefits of our scheme, which we also show the salient features of an efficient implementation architecture, settling the basis for a practical implementation of the system.