Results 1 
8 of
8
Distributed dynamic scheduling for endtoend rate guarantees in wireless ad hoc networks
 In Wireless Ad Hoc Networks. In Proc. ACM MobiHoc, UrbanaChampaign, IL
, 2005
"... We present a framework for the provision of deterministic endtoend bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility conditions, multihop sessions are dynamically offered allocations, further translated to link demands. Using a distributed Time Division Multipl ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
(Show Context)
We present a framework for the provision of deterministic endtoend bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility conditions, multihop sessions are dynamically offered allocations, further translated to link demands. Using a distributed Time Division Multiple Access (TDMA) protocol nodes adapt to the demand changes on their adjacent links by local, conflictfree slot reassignments. As soon as the demand changes stabilize, the nodes must incrementally converge to a TDMA schedule that realizes the global link (and session) demand allocation. We first derive sufficient local feasibility conditions for certain topology classes and show that trees can be maximally utilized. We then introduce a converging distributed link scheduling algorithm that exploits the logical tree structure that arises in several ad hoc network applications. Decoupling bandwidth allocation to multihop sessions from link scheduling allows support of various endtoend Quality of Service (QoS) objectives. We focus on the maxmin fairness (MMF) objective and design an endtoend asynchronous distributed algorithm for the computation of the session MMF rates. Once the endtoend algorithm converges, the link scheduling algorithm converges to a TDMA schedule that realizes these rates. We demonstrate the applicability of this framework through an implementation over an existing wireless technology. This implementation is free of restrictive assumptions of previous TDMA approaches: it does not require any apriori knowledge on the number of nodes in the network nor even networkwide slot synchronization.
RESOURCE ALLOCATION AND PRICING FOR QOS MANAGEMENT IN COMPUTER NETWORKS
, 1999
"... Computer networks must accommodate a wide variety of applications, ranging from simple file transfer programs to complex multimedia applications. Many of these applications require certain Quality of Service (QoS) guarantees for their proper operation. QoS guarantees include bounds on the packet de ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
Computer networks must accommodate a wide variety of applications, ranging from simple file transfer programs to complex multimedia applications. Many of these applications require certain Quality of Service (QoS) guarantees for their proper operation. QoS guarantees include bounds on the packet delay, delay variation and loss rate. These guarantees can be provided through the allocation of network resources such as, processor time, buffer space and link bandwidth. Properly allocating network resources remains a challenging problem due to the number of users, diversity of network applications and the finite supply of resources. Furthermore, these resources are expected to have costs associated with their usage (amount and renegotiation). Given this environment, two important resource allocation issues are addressed in this thesis. First, methods are needed to reduce the amount of resources and renegotiations required to provide a desired QoS (thereby reducing the cost and increasing the utilization). Second, network administrators are interested in allocating and managing resources to all users in an efficient and fair manner. Determining an
A General Theory of Constrained MaxMin Rate Allocation for Multicast Networks
 IEEE ICON’00
, 2000
"... This paper presents a general theory of network maxmin rate assignment as a lexicographic optimization. The model includes multicast and lower bound constraints. The model for multicast allows the sender to send at the maximum rate allowed by the network and the receivers. Equivalent optimality con ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper presents a general theory of network maxmin rate assignment as a lexicographic optimization. The model includes multicast and lower bound constraints. The model for multicast allows the sender to send at the maximum rate allowed by the network and the receivers. Equivalent optimality conditions, especially those which can be coded into practical algorithms, are derived. A reference parallel algorithm is also derived. The theoretical results clearly show the important role of the advertised rates in automatable optimality conditions. The theory also shows that, once the singlelink problem is solved, the multilink (network) problem can be simply solved by recursively applying the algorithm for singlelink problem. 1.
ABR Rate Control for Multimedia Traffic Using Microeconomics
 Proceedings of the International Conference on ATM
, 1999
"... Multimedia applications are expected to play a more prevalent role in integrated service networks. One method of efficiently transmitting such traffic uses the ABR service class. However, rate control for this class becomes more difficult due to the bursty and somewhat unpredictable behavior of mult ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Multimedia applications are expected to play a more prevalent role in integrated service networks. One method of efficiently transmitting such traffic uses the ABR service class. However, rate control for this class becomes more difficult due to the bursty and somewhat unpredictable behavior of multimedia traffic. This paper presents a microeconomicbased ABR rate control technique that models the network as competitive markets. Prices are affixed to ABR bandwidth based upon supply and demand, and users purchase bandwidth to maximize their individual QoS. This yields a stateless rate control method that provides Paretooptimal and QoSfair bandwidth distributions, as well as high utilization. Simulation results using actual MPEGcompressed video traffic show utilization over 95 % and better QoS control than maxmin or demandbased weighted maxmin.
A Theory Of Maxmin Rate Allocation With Minimal Rate Guarantee
, 2000
"... this technical report we present a general maxmin theory that supports minimal and peak flow rate constraints (MFR and PFR, respectively). In order to differentiate both problems, we will call the former simply as the maxmin problem (MM) and the later will be referenced as the constrained maxmin pro ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
this technical report we present a general maxmin theory that supports minimal and peak flow rate constraints (MFR and PFR, respectively). In order to differentiate both problems, we will call the former simply as the maxmin problem (MM) and the later will be referenced as the constrained maxmin problem (CMM). Note that the MM problem can be seen 1
unknown title
"... This paper presents a general theory of network maxmin rate assignment as a lexicographic optimization. The model includes multicast and lower bound constraints. The model for multicast allows the sender to send at the maximum rate allowed by the network and the receivers. Equivalent optimality con ..."
Abstract
 Add to MetaCart
This paper presents a general theory of network maxmin rate assignment as a lexicographic optimization. The model includes multicast and lower bound constraints. The model for multicast allows the sender to send at the maximum rate allowed by the network and the receivers. Equivalent optimality conditions, especially those which can be coded into practical algorithms, are derived. A reference parallel algorithm is also derived. The theoretical results clearly show the important role of the advertised rates in automatable optimality conditions. The theory also shows that, once the singlelink problem is solved, the multilink (network) problem can be simply solved by recursively applying the algorithm for singlelink problem. I.
Submitted to ICNP’99. Minimum Rate Guarantee without PerFlow Information
"... This paper introduces a scalable maxmin flow control protocol which guarantees the minimum rate for each connectionoriented flow without requiring perflow information. The protocol is called MRASAP (Minimum Rate guaranteeing Adaptive Sourcelink Accounting Protocol). MRASAP is an extension of AS ..."
Abstract
 Add to MetaCart
(Show Context)
This paper introduces a scalable maxmin flow control protocol which guarantees the minimum rate for each connectionoriented flow without requiring perflow information. The protocol is called MRASAP (Minimum Rate guaranteeing Adaptive Sourcelink Accounting Protocol). MRASAP is an extension of ASAP [Tsa98a, Kim99], the first exact maxmin flow control protocol for besteffort connectionoriented traffic in integrated service networks, without requiring perflow accounting at the intermediate network node. In the classical maxmin computation, only the maximum rate constraints are considered; in this paper the minimum rate requirements are treated similarly as the maximum rate constraints. Existing protocols that achieve exact maxmin optimality with minimum rate guarantee require perflow information and complex computation such as sorting of the minimum rates at the switch. By generalizing the concept of constraint, the complex sorting and perflow accounting required in the existing protocols are avoided. Simulation demonstrates fast convergence to optimality. The convergence of MRASAP is also proved analytically. Key words: Generalized maxmin, flow control, and minimum rate guarantee. 1.