Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
111
Simulation-based Results of Weighted Fair Queuing Algorithms for ATM Networks
- TELECOMMUNICATION SYSTEMS (1998) 1-19
, 1998
"... The behavior of the ideal General Processor Sharing (gps) discipline and different per-VC queuing algorithms approximating this ideal scheme, namely the Self Clocked Fair Queuing, the Packet by packet Generalized Processor Sharing, and the Virtual Starting Time disciplines, are studied in this paper ..."
Abstract
- Add to MetaCart
The behavior of the ideal General Processor Sharing (gps) discipline and different per-VC queuing algorithms approximating this ideal scheme, namely the Self Clocked Fair Queuing, the Packet by packet Generalized Processor Sharing, and the Virtual Starting Time disciplines, are studied
Decoupled Generalized Processor Sharing: A Fair Queuing Principle for Adaptive Multimedia Applications
"... Traditionally targeted to best-effort packet-switching networks, adaptive applications implement a variety of mechanisms to make use of variable quality bearing service. In the framework of integrated services networks, relaxing quality of service (QoS) requirements through the use of such applicati ..."
Abstract
- Add to MetaCart
of such applications allows a greater operation flexibility and increases statistical multiplexing gains. However, these applications must be given some QoS guarantees, relative to minimum service, bounded transmission delay, and fair sharing of the available bandwidth. This paper focuses on a fair queuing, fluid
Leap Forward Virtual Clock: An O(log log N) Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness
, 1996
"... We describe an efficient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds almost identical to that of PGPS fair queuing, along with throughput fairness. Our scheme can be implemented with a worst-case time O(log log N) per packet (inclusive of sorting costs), wh ..."
Abstract
-
Cited by 12 (0 self)
- Add to MetaCart
mechanism that keeps the server clock from lagging too far behind the packet tags. We prove that our scheme guarantees a fair share of the available bandwidth to each of the backlogged users, while precisely matching the delay bounds of PGPS schemes. In order to improve computational efficiency, we
Dynamic Priorities: A Technique for Fairly and Efficiently Sharing a Resource Between Several Services
"... We propose a scheme for the fair and efficient sharing of an unbuffered resource, such as bandwidth or capacity, by various services. The scheme assigns a nominal capacity to each service class and implements a form of virtual partitioning by means of state-dependent priorities. That is, instead of ..."
Abstract
- Add to MetaCart
We propose a scheme for the fair and efficient sharing of an unbuffered resource, such as bandwidth or capacity, by various services. The scheme assigns a nominal capacity to each service class and implements a form of virtual partitioning by means of state-dependent priorities. That is, instead
Fluid Model for a Data Network with -Fair Bandwidth Sharing and General Document Size Distributions: Two Examples of Stability
"... Abstract: The design and analysis of congestion control mechanisms for mod-ern data networks such as the Internet is a challenging problem. Mathematical models at various levels have been introduced in an eort to provide insight to some aspects of this problem. A model introduced and studied by Robe ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
by Roberts and Massoulie [13] aims to capture the dynamics of document arrivals and departures in a network where bandwidth is shared fairly amongst
ows that correspond to continuous transfers of individual elastic documents. Here we consider this model under a family of bandwidth sharing policies
Comparison of TCP Reno and TCP Vegas via Fluid Approximation
, 1998
"... We compare the efficiency of the flow control of two versions of TCP, the transmission control protocol of the Internet: the current version called Reno, and a recently proposed version called Vegas. By means of a fluid approximation, we show that due to the use of round-trip times measurement, the ..."
Abstract
-
Cited by 37 (0 self)
- Add to MetaCart
, the window dynamics of TCP Vegas are much more stable than those of TCP Reno, resulting in a much more efficient utilization of the network resources. In addition, whereas TCP Reno discriminates against users with long propagation delays, TCP Vegas fairly shares the available bandwidth between the users
IMPROVING QOS IN WLAN USING DYNAMIC WEIGHTED FAIR SCHEDULING
, 2008
"... ii The demand for end-to-end Quality of Service (QoS) in Wireless Local Area Networks (WLANs) is becoming ever more important due to the trend towards converged communication networks. However, providing QoS in WLANs is more challenging than wired networks due to the mobility of Stations (STA), inte ..."
Abstract
- Add to MetaCart
), interference, and channel fading. The recently accepted QoS mechanism in WLAN; the IEEE 802.11e has limitations in providing fairness to different types of traffic. In a shared medium like WLAN, fair bandwidth allocation is important to provide an acceptable level of QoS and prevent starvation of traffic
EXTENSIONS OF PROPORTIONAL-FAIR SHARING ALGORITHMS FOR MULTI-ACCESS CONTROL OF MOBILE COMMUNICATIONS: CONSTRAINTS, FINITE QUEUES AND BURSTY DATA PROCESSES
"... Abstract We are concerned with the scheduling decisions (allocation of transmitter time, bandwidth and power) for multi-access mobile communications for data communications when the channels are randomly time varying. Time is divided into small scheduling intervals, called slots, and information on ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
on the channel rates for the various users is available at the start of the slot, when the user selections are made. There is a conflict between selecting the user that can get the most immediate data through and helping users with poor average throughputs. The Proportional Fair Sharing method (PFS) deals
Social Sharing of Connectivity Resources: Control and Encouragement of Unselfishness in Mobile Environments
"... In the last years has clearly emerged the opportunity of extending traditional single-hop wireless technologies for Internet connectivity, by introducing practical effective solutions to dynamically use the best multi-hop heterogeneous paths available at runtime. Our primary idea is to enable, via p ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
cooperative sharing, from balancing energy consumption of collaborative nodes to maximizing overall bandwidth. In particular, this work-in-progress paper originally concentrates on the challenging issue of promoting connectivity sharing via effective forms of network management and control, capable of i
Towards Reconfigurable Embedded Medical Systems
"... Moore’s Law has allowed processor performance to double approximately every 18 months due to continuous breakthroughs in transistor technology. Although processor performance is paramount to high-performance computing, the world of embedded systems has other priorities: namely the minimization of po ..."
Abstract
- Add to MetaCart
Moore’s Law has allowed processor performance to double approximately every 18 months due to continuous breakthroughs in transistor technology. Although processor performance is paramount to high-performance computing, the world of embedded systems has other priorities: namely the minimization
Results 1 - 10
of
111
