3,870 research outputs found
Recommended from our members
FHCF: A simple and efficient scheduling scheme for IEEE 802.11e wireless networks
The IEEE 802.11e medium access control (MAC) layer protocol is an emerging standard to support quality of service (QoS) in 802.11 wireless networks. Some recent works show that the 802.11e hybrid coordination function (HCF) can improve signi¯cantly the QoS support in 802.11 networks. A simple HCF referenced scheduler has been proposed in the 802.11e which takes into account the QoS requirements of °ows and allocates time to stations on the basis of the mean sending rate. As we show in this paper, this HCF referenced scheduling algorithm is only e±cient and works well for °ows with strict constant bit rate (CBR) characteristics. However, a lot of real-time applications, such as videoconferencing, have some variations in their packet sizes, sending rates or even have variable bit rate (VBR) characteristics. In this paper we propose FHCF, a simple and e±cient scheduling algorithm for 802.11e that aims to be fair for both CBR and VBR °ows. FHCF uses queue length estimations to tune its time allocation to mobile stations. We present analytical model evaluations and a set of simulations results, and provide performance comparisons with the 802.11e HCF referenced scheduler. Our performance study indicates that FHCF provides good fairness while supporting bandwidth and delay requirements for a large range of network loads
First-Passage Time and Large-Deviation Analysis for Erasure Channels with Memory
This article considers the performance of digital communication systems
transmitting messages over finite-state erasure channels with memory.
Information bits are protected from channel erasures using error-correcting
codes; successful receptions of codewords are acknowledged at the source
through instantaneous feedback. The primary focus of this research is on
delay-sensitive applications, codes with finite block lengths and, necessarily,
non-vanishing probabilities of decoding failure. The contribution of this
article is twofold. A methodology to compute the distribution of the time
required to empty a buffer is introduced. Based on this distribution, the mean
hitting time to an empty queue and delay-violation probabilities for specific
thresholds can be computed explicitly. The proposed techniques apply to
situations where the transmit buffer contains a predetermined number of
information bits at the onset of the data transfer. Furthermore, as additional
performance criteria, large deviation principles are obtained for the empirical
mean service time and the average packet-transmission time associated with the
communication process. This rigorous framework yields a pragmatic methodology
to select code rate and block length for the communication unit as functions of
the service requirements. Examples motivated by practical systems are provided
to further illustrate the applicability of these techniques.Comment: To appear in IEEE Transactions on Information Theor
Application of learning algorithms to traffic management in integrated services networks.
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN027131 / BLDSC - British Library Document Supply CentreGBUnited Kingdo
Resource management research in ethernet passive optical networks
The last decades, we have witnessed different phenomenology in the telecommunications sector. One of them is the widespread use of the Internet, which has brought a sharp increase in traffic, forcing suppliers to continuously expand the capacity of networks. In the near future, Internet will be composed of long-range highspeed optical networks; a number of wireless networks at the edge; and, in between, several access technologies. Today one of the main problems of the Internet is the bottleneck in the access segment. To address this issue the Passive Optical Networks (PONs) are very likely to succeed, due to their simplicity, low-cost, and increased bandwidth.
A PON is made up of fiber optic cabling and passive splitters and couplers that distribute an optical signal to connectors that terminate each fiber segment. Among the different PON technologies, the Ethernet-PON (EPON) is a great alternative to satisfy operator and user needs, due to its cost, flexibility and interoperability with other technologies. One of the most interesting challenges in such technologies relates to the scheduling and allocation of resources in the upstream (shared) channel, i.e., the resource management.
The aim of this thesis is to study and evaluate current contributions and propose new efficient solutions to address the resource management issues mainly in EPON. Key issues in this context are future end-user needs, quality of service (QoS) support, energy-saving and optimized service provisioning for real-time and elastic flows.
This thesis also identifies research opportunities, issue recommendations and proposes novel mechanisms associated with access networks based on optical fiber technologies.Postprint (published version
Scheduling algorithms for high-speed data service over CATV
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 1998.Includes bibliographical references (leaf 54).by Richard R. Rabbat.M.S
- …