Proceedings ArticleDOI
Bandwidth allocation, bit rate and pricing
Jyrki Joutsensalo,Ari Viinikainen,Timo Hämäläinen,Jarmo Siltanen +3 more
- Vol. 1, pp 379-383
Reads0
Chats0
TLDR
A packet scheduling method which guarantees bandwidth of the connection and optimizes revenue of the network service provider and a mechanism for guaranteeing a specified mean bandwidth for different service classes is presented.Abstract:
In this paper we present a packet scheduling method which guarantees bandwidth of the connection and optimizes revenue of the network service provider. A closed form formula for updating the adaptive weights of a packet scheduler is derived from a revenue-based optimization problem. The weight updating procedure is fast and independent on the assumption of the connections' statistical behavior. The features of the algorithm are simulated and analyzed with a call admission control (CAC) mechanism. We also show in context with the CAC procedure a mechanism for guaranteeing a specified mean bandwidth for different service classes.read more
Citations
More filters
Journal ArticleDOI
A game theoretical formulation of integrated admission control and pricing in wireless networks
TL;DR: An integrated pricing and admission control policy is produced that achieves the network provider's optimum utility, while ensuring the satisfaction of all sides, in a competitive environment with several wireless network providers offering high data rate services.
Proceedings ArticleDOI
NGL02-6: Game Theoretical Formulation of Admission Control and Pricing in Wireless Networks: The Case of Cooperating Providers
TL;DR: This work considers the existence of a visiting provider in the area, that can accept sessions from the home provider, to absorb overflow traffic due to instant lack of resources, and generates an admission control scheme that can improve the utility for the provider, while at the same time ensures the satisfaction of all sides involved.
Proceedings ArticleDOI
Packet scheduling with revenue optimization and weighted delay minimization
TL;DR: An adaptive packet scheduling model for networks providing quality of service that minimizes the weighted mean delays of the connections for specified pricing classes, while also maximizing the revenue of the service provider.
Proceedings ArticleDOI
Revenue Maximizing Game and Its Extension for Multicell Wireless Access Networks
TL;DR: The effect of load balancing with the pricing policy, the performance improvement compared to a conventional method of association via simulation, and the integrated purchasing and pricing scheme that shows cell breathing effect are demonstrated.
References
More filters
An Architecture for Differentiated Service
TL;DR: An architecture for implementing scalable service differentiation in the Internet achieves scalability by aggregating traffic classification state which is conveyed by means of IP-layer packet marking using the DS field [DSFIELD].
Journal ArticleDOI
Rate control for communication networks: shadow prices, proportional fairness and stability
TL;DR: This paper analyses the stability and fairness of two classes of rate control algorithm for communication networks, which provide natural generalisations to large-scale networks of simple additive increase/multiplicative decrease schemes, and are shown to be stable about a system optimum characterised by a proportional fairness criterion.
Journal ArticleDOI
Fair end-to-end window-based congestion control
Jeonghoon Mo,Jean Walrand +1 more
TL;DR: The existence of fair end-to-end window-based congestion control protocols for packet-switched networks with first come-first served routers is demonstrated using a Lyapunov function.
Assured Forwarding PHB Group
TL;DR: This document defines a general use Differentiated Services (DS) [Blake] Per-Hop-Behavior (PHB) Group called Assured Forwarding (AF), which provides delivery of IP packets in four independently forwarded AF classes.
Journal ArticleDOI
Utility-based rate control in the Internet for elastic traffic
Richard J. La,Venkat Anantharam +1 more
TL;DR: This work investigates the fundamental problem of achieving the system optimal rates in the sense of maximizing aggregate utility, in a distributed manner, using only the information available at the end hosts of the network by introducing a pricing scheme.