Asymptotic analysis of a data-handling system with many sources
SIAM Journal on Applied Mathematics
Effective bandwidths at multi-class queues
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
Effective bandwidths for multiclass Markov fluids and other ATM sources
IEEE/ACM Transactions on Networking (TON)
A histogram-based model for video traffic behavior in an ATM multiplexer
IEEE/ACM Transactions on Networking (TON)
Pricing in computer networks: motivation, formulation, and example
IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
A measurement-based admission control algorithm for integrated service packet networks
IEEE/ACM Transactions on Networking (TON)
Virtual path bandwidth allocation in multiuser networks
IEEE/ACM Transactions on Networking (TON)
Best-effort versus reservations: a simple comparative analysis
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Effective bandwidths with priorities
IEEE/ACM Transactions on Networking (TON)
A framework for robust measurement-based admission control
IEEE/ACM Transactions on Networking (TON)
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Equilibrium bandwidth and buffer allocations for elastic traffics
IEEE/ACM Transactions on Networking (TON)
A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
Measurement-based admission control with aggregate traffic envelopes
IEEE/ACM Transactions on Networking (TON)
Internet pricing with a game theoretical approach: concepts and examples
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
On the relevance of time scales in performance oriented traffic characterizations
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
A pricing model for high speed networks with guaranteed quality of service
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Management of service level agreements for multimedia Internet service using a utility model
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Pricing congestible network resources
IEEE Journal on Selected Areas in Communications
Billing users and pricing for TCP
IEEE Journal on Selected Areas in Communications
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
Dynamic congestion-based pricing of bandwidth and buffer
IEEE/ACM Transactions on Networking (TON)
A new economic generalized particle model for flow control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Pricing the services in dynamic environment: agent pricing model
Transactions on computational collective intelligence II
Hi-index | 0.01 |
Congestion-based pricing of network resources is a common approach in evolving network architectures that support Quality of Service (QoS). Resource usage and QoS will thus fluctuate in response to changes in price, which must be dynamically controlled through feedback. Such feedback algorithms typically assume that network resources behave as Normal goods, i.e., that an increase in the price of a resource results in a decreased demand for that resource. Here, we investigate the sensitivity of resource allocation and the resulting QoS to resource prices in a reservation-based QoS architecture that provides guaranteed bounds on packet loss and end-to-end delay for real-time applications. We derive necessary and sufficient conditions for bandwidth and buffer to act as Normal goods, showing that this depends on the shapes of the utility and QoS functions. We then show that the minimum total cost is a decreasing convex function of loss. When the delay constraints are absent or not binding, we prove that if a resource is a Normal good, then an increase in the price of that resource causes the loss on that link to increase, the loss on all other links to decrease, and the total loss to increase. We also give sufficient conditions to establish that an increase in the price for a resource results in a decreased demand for that resource, an increased demand for the other resource at that node, and an increased demand for resources at all other hops. Finally, when the delay constraint is binding, we give sufficient conditions to establish that an increase in the price of bandwidth at one node results in increased loss and delay at that node, and decreased loss and delay at all other nodes.