Buffer management and cell switching management in wireless packet communications

The buffer management and the cell switching (e.g., packet handoff) management using buffer management scheme are studied in Wireless Packet Communications. First, a throughput improvement method for multi-class services is proposed in Wireless Packet System. Efficient traffic management schemes should be developed to provide seamless access to the wireless network. Specially, it is proposed to regulate the buffer by the Selective- Delay Push-In (SDPI) scheme, which is applicable to scheduling delay-tolerant non-real time traffic and delay-sensitive real time traffic. Simulation results show that the performance observed by real time traffics are improved as compared to existing buffer priority scheme in term of packet loss probability. Second, the performance of the proposed SDPI scheme is analyzed in a single CBR server. The arrival process is derived from the superposition of two types of traffics, each in turn results from the superposition of homogeneous ON-OFF sources that can be approximated by means of a two-state Markov Modulated Poisson Process (MMPP). The buffer mechanism enables the ATM layer to adapt the quality of the cell transfer to the QoS requirements and to improve the utilization of network resources. This is achieved by selective-delaying and pushing-in cells according to the class they belong to. Analytical expressions for various performance parameters and numerical results are obtained. Simulation results in term of cell loss probability conform with our numerical analysis. Finally, a novel cell-switching scheme based on TDMA protocol is proposed to support QoS guarantee for the downlink. The new packets and handoff packets for each type of traffic are defined and a new cutoff prioritization scheme is devised at the buffer of the base station. A procedure to find the optimal thresholds satisfying the QoS requirements is presented. Using the ON-OFF approximation for aggregate traffic, the packet loss probability and the average packet delay are computed. The performance of the proposed scheme is evaluated by simulation and numerical analysis in terms of packet loss probability and average packet delay

Quality of service and resource management in IP and wireless networks

A common theme in the publications included in this thesis is the quality of service and resource management in IP and wireless networks. This thesis presents novel algorithms and implementations for admission control in IP and IEEE 802.16e networks, active queue management in EGPRS, WCDMA, and IEEE 802.16e networks, and scheduling in IEEE 802.16e networks. The performance of different algorithms and mechanisms is compared with the prior art through extensive ns-2 simulations. We show that similar active queue management mechanisms, such as TTLRED, can be successfully used to reduce the downlink delay (and in some cases even improve the TCP goodput) in different bottlenecks of IP, EGPRS, WCDMA, and IEEE 802.16e access networks. Moreover, almost identical connection admission control algorithms can be applied both in IP access networks and at IEEE 802.16e base stations. In the former case, one just has to first gather the link load information from the IP routers. We also note that DiffServ can be used to avoid costly overprovisioning of the backhaul in IEEE 802.16e networks. We present a simple mapping between IEEE 802.16e data delivery services and DiffServ traffic classes, and we propose that IEEE 802.16e base stations should take the backhaul traffic load into account in their admission control decisions. Moreover, different IEEE 802.16e base station scheduling algorithms and uplink channel access mechanisms are studied. In the former study, we show that proportional fair scheduling offers superior spectral efficiency when compared to deficit round-robin, though in some cases at the cost of increased delay. Additionally, we introduce a variant of deficit round-robin (WDRR), where the quantum value depends on the modulation and coding scheme. We also show that there are several ways to implement ertPS in an efficient manner, so that during the silence periods of a VoIP call no uplink slots are granted. The problem here, however, is how to implement the resumption after the silence period while introducing as little delay as possible

Final report on the evaluation of RRM/CRRM algorithms

Deliverable public del projecte EVERESTThis deliverable provides a definition and a complete evaluation of the RRM/CRRM algorithms selected in D11 and D15, and evolved and refined on an iterative process. The evaluation will be carried out by means of simulations using the simulators provided at D07, and D14.Preprin

Resource allocation for multimedia messaging services over EGPRS

The General Packet Radio Service (GPRS) is a new bearer service for GSM that greatly simplifies wireless access to packet data networks, such as the Internet, corporate LANs or to mobile portals. It applies a packet radio standard to transfer user data packets in wellorganized way between Mobile Stations (MS) and external packet data networks. The Enhanced General Packet Radio Service (EGPRS) is an extension of GPRS, offering much greater capacity. These enhancements have allowed the introduction of new services like Multimedia Messaging Services (MMS). MMS enables messaging with full content versatility, including images, audio, video, data and text, from terminal to terminal or from terminal to e-mail. The Wireless Application Protocol (WAP) is the WAP Forum standard for the presentation and delivery of wireless information and telephony services on mobile phones and other wireless terminals. In this thesis it is indicated that efficient radio resource allocation is necessary for managing different types of traffic in order to maintain the quality demands for different types of services. A theoretical model of MMS and WAP traffic is developed, and based on this model a simulator is implemented in Java programming language. This thesis proposes two techniques to improve the radio resource allocation algorithm performance called "radio link condition diversification" and "interactive traffic class prioritization". The radio link condition diversification technique defines minimum radio link quality that allows the user to receive their packets. The interactive traffic class prioritization technique defines different priorities for WAP packets and for MMS packets. Both techniques give good results in increasing user's perception of services and increasing network efficiency. This thesis indicates also that the prioritization mechanism successfully improves the response time of the interactive service by up to 80% with a setting of priority for interactive traffic class and decreasing the performance of the background traffic. This decrease is within a range acceptable by the end-user and that the link conditions limit mechanism has an advantage in terms of resource utilization

Beyond State Machine: Modular Software Reference Architecture Design Based on RTOS – an Industrial Experience Report

Technology based industry is characterized by the accelerated need for innovation to meet market requirements, therefore, it is important to harness a solid framework for a faster and improved new product development. This article presents a novel reference architecture design to support applications with complex embedded software workflows. The design is focused on context management in the application layer and handling input data from peripherals. The architecture was successfully implemented in an electronic smart safe custom embedded hardware; however, it can be used in any embedded product with task concurrency and complex software workflow.ITESO, A. C

EVEREST IST - 2002 - 00185 : D23 : final report

Deliverable públic del projecte europeu EVERESTThis deliverable constitutes the final report of the project IST-2002-001858 EVEREST. After its successful completion, the project presents this document that firstly summarizes the context, goal and the approach objective of the project. Then it presents a concise summary of the major goals and results, as well as highlights the most valuable lessons derived form the project work. A list of deliverables and publications is included in the annex.Postprint (published version

Dynamic pricing for 3G networks using admission control and traffic differentiation

Published in Networks, 2005. Jointly held with the 2005 IEEE 7th Malaysia International Conference on Communication., 2005 13th IEEE International Conference on (Volume:2 )In the pricing of network resources, network operators and service providers aim at facilitating the use of the limited network resources in a manner that would encourage responsibility among the end-users and lead to the maximisation of profits. The optimum tariff rates used for charging the mobile services are affected by factors like the market forces affecting the industry. However, the tariff rates generally increase with the achieved QoS level. Next generation networks will offer higher QoS, hence users need incentives to utilise the enhanced capacity. In this paper, we propose a pricing approach that introduces service profiles into a DiffServ-enabled network, whose prices and QoS levels depend on the degree of congestion in the network. The use of the UMTS connection admission control to support the proposed pricing scheme is explored. An emulation testbed is used to evaluate the scheme.In the pricing of network resources, network operators and service providers aim at facilitating the use of the limited network resources in a manner that would encourage responsibility among the end-users and lead to the maximisation of profits. The optimum tariff rates used for charging the mobile services are affected by factors like the market forces affecting the industry. However, the tariff rates generally increase with the achieved QoS level. Next generation networks will offer higher QoS, hence users need incentives to utilise the enhanced capacity. In this paper, we propose a pricing approach that introduces service profiles into a DiffServ-enabled network, whose prices and QoS levels depend on the degree of congestion in the network. The use of the UMTS connection admission control to support the proposed pricing scheme is explored. An emulation testbed is used to evaluate the scheme

Cross-layer Assisted TCP Algorithms for Vertical Handoff

The ever expanding growth of the wireless access to the Internet in recent years has led to the proliferation of wireless and mobile devices to connect to the Internet. This has created the possibility of mobile devices equipped with multiple radio interfaces to connect to the Internet using any of several wireless access network technologies such as GPRS, WLAN and WiMAX in order to get the connectivity best suited for the application. These access networks are highly heterogeneous and they vary widely in their characteristics such as bandwidth, propagation delay and geographical coverage. The mechanism by which a mobile device switches between these access networks during an ongoing connection is referred to as vertical handoff and it often results in an abrupt and significant change in the access link characteristics. The most common Internet applications such as Web browsing and e-mail make use of the Transmission Control Protocol (TCP) as their transport protocol and the behaviour of TCP depends on the end-to-end path characteristics such as bandwidth and round-trip time (RTT). As the wireless access link is most likely the bottleneck of a TCP end-to-end path, the abrupt changes in the link characteristics due to a vertical handoff may affect TCP behaviour adversely degrading the performance of the application. The focus of this thesis is to study the effect of a vertical handoff on TCP behaviour and to propose algorithms that improve the handoff behaviour of TCP using cross-layer information about the changes in the access link characteristics. We begin this study by identifying the various problems of TCP due to a vertical handoff based on extensive simulation experiments. We use this study as a basis to develop cross-layer assisted TCP algorithms in handoff scenarios involving GPRS and WLAN access networks. We then extend the scope of the study by developing cross-layer assisted TCP algorithms in a broader context applicable to a wide range of bandwidth and delay changes during a handoff. And finally, the algorithms developed here are shown to be easily extendable to the multiple-TCP flow scenario. We evaluate the proposed algorithms by comparison with standard TCP (TCP SACK) and show that the proposed algorithms are effective in improving TCP behavior in vertical handoff involving a wide range of bandwidth and delay of the access networks. Our algorithms are easy to implement in real systems and they involve modifications to the TCP sender algorithm only. The proposed algorithms are conservative in nature and they do not adversely affect the performance of TCP in the absence of cross-layer information.Käytämme enenevissä määrin kannettavia päätelaitteita (esim. matkapuhelin, kannettava tietokone) erilaisiin sovelluksiin kuten sähköpostin lukemiseen, verkon selaamiseen, musiikin lataamiseen ja kuuntelemiseen, pelien pelaamiseen ja laskujen maksamiseen riippumatta olinpaikastamme tai liikkuvuudestamme. Pystymme yhdistämään laitteemme Internetiin milloin tahansa missä tahansa. Langattomat verkot, jotka mahdollistavat laitteen kytkemisen Internetiin radion kautta käyttävät moninaisia teknologioita ja eroavat laajalti ominaisuuksiltaan. Esimerkiksi langaton lähiverkko (WLAN), jota voidaan käyttää rakennuksen sisällä, on matkapuhelinverkkoa (esim. GPRS) nopeampi verkko, kun taas GPRS-kenttä voi ulottua kokonaisen kaupungin tai maan alueelle ja laajemmallekin. Kannettava päätelaite, jossa on monia radioliittymiä, voi siirtyä käyttämään mitä tahansa monista saatavilla olevistaverkoista riippuen olinpaikasta tai käytettävän sovelluksen tarpeista. Verkonvaihto viittaa tähän verkosta toiseen siirtymiseen, ja se tunnetaan vertikaalisena verkonvaihtona, kun siirtymisen kohteena olevien verkkojen teknologia eroaa toisistaan. TCP on tietoliikenneohjelmisto, jota sekä tiedon lähettäjä että vastaanottaja käyttävät kuljettamaan sovelluksen tiedon luotettavasti. TCP säätelee tiedon lähetysnopeutta riippuen Internetin resurssien saatavuudesta. TCP:n käyttäytyminen riippuu päästä-päähän polun ominaisuuksista ja erityisesti pullonkaulayhteydestä, siitä yhteydestä, jolla on minimikapasiteetti polulla. Langaton yhteys, joka yhdistää kannettavan laitteen Internetiin on usein pullonkaulayhteys, ja äkillinen muutos sen ominaisuuksissa vertikaalisen siirtymän aikana vaikuttaa merkittävästi TCP:n suorituskykyyn ja siten koko sovelluksen laatuun. Tämä työssä on keskitytty tutkimaan TCP:n toimintaa vertikaalisessa verkonvaihdon yhteydessä ja suunnittelemaan algoritmeja, jotka parantavat sen suorituskykyä vertikaalisen verkonvaihdon yhteydessä. Suunnitellut algoritmit käyttävät hyväksi tietoa vertikaaliseen verkonvaihtoon liittyvien langattomien yhteyksien ominaisuuksista. Ensimmäinen tapaustutkimuskohde liittyy WLAN-GPRS -ympäristöön, jossa TCP saa minimimäärän tietoa verkonvaihtoon liittyen. Tulokset näyttävät, että TCP:n suorituskykyä voidaan parantaa huomattavasti. Tutkimusta on laajennettu kattamaan verkonvaihto yleisemmässä tapauksessa käyttäen karkeita arvioita ko. verkkojen ominaisuuksista. Kehitettyjen algoritmien toiminnallisuus on evaluoitu simulaatiokokeilla kattaen laajan joukon ominaisuuksiltaan erilaisia verkkoja. Tulokset osoittavat, että TCP-suorituskykyä voidaan parantaa vertikaalisen verkonvaihdon yhteydessä huomattavasti tätä lähestymistapaa käyttäen. Kehitetyt algoritmit voivat olla hyödyksi etsiessämme ratkaisuja kannettavien laitteiden todellisen käytön tarpeisiin

Quality of service optimization of multimedia traffic in mobile networks

Mobile communication systems have continued to evolve beyond the currently deployed Third Generation (3G) systems with the main goal of providing higher capacity. Systems beyond 3G are expected to cater for a wide variety of services such as speech, data, image transmission, video, as well as multimedia services consisting of a combination of these. With the air interface being the bottleneck in mobile networks, recent enhancing technologies such as the High Speed Downlink Packet Access (HSDPA), incorporate major changes to the radio access segment of 3G Universal Mobile Telecommunications System (UMTS). HSDPA introduces new features such as fast link adaptation mechanisms, fast packet scheduling, and physical layer retransmissions in the base stations, necessitating buffering of data at the air interface which presents a bottleneck to end-to-end communication. Hence, in order to provide end-to-end Quality of Service (QoS) guarantees to multimedia services in wireless networks such as HSDPA, efficient buffer management schemes are required at the air interface. The main objective of this thesis is to propose and evaluate solutions that will address the QoS optimization of multimedia traffic at the radio link interface of HSDPA systems. In the thesis, a novel queuing system known as the Time-Space Priority (TSP) scheme is proposed for multimedia traffic QoS control. TSP provides customized preferential treatment to the constituent flows in the multimedia traffic to suit their diverse QoS requirements. With TSP queuing, the real-time component of the multimedia traffic, being delay sensitive and loss tolerant, is given transmission priority; while the non-real-time component, being loss sensitive and delay tolerant, enjoys space priority. Hence, based on the TSP queuing paradigm, new buffer managementalgorithms are designed for joint QoS control of the diverse components in a multimedia session of the same HSDPA user. In the thesis, a TSP based buffer management algorithm known as the Enhanced Time Space Priority (E-TSP) is proposed for HSDPA. E-TSP incorporates flow control mechanisms to mitigate congestion in the air interface buffer of a user with multimedia session comprising real-time and non-real-time flows. Thus, E-TSP is designed to provide efficient network and radio resource utilization to improve end-to-end multimedia traffic performance. In order to allow real-time optimization of the QoS control between the real-time and non-real-time flows of the HSDPA multimedia session, another TSP based buffer management algorithm known as the Dynamic Time Space Priority (D-TSP) is proposed. D-TSP incorporates dynamic priority switching between the real-time and non-real-time flows. D-TSP is designed to allow optimum QoS trade-off between the flows whilst still guaranteeing the stringent real-time component’s QoS requirements. The thesis presents results of extensive performance studies undertaken via analytical modelling and dynamic network-level HSDPA simulations demonstrating the effectiveness of the proposed TSP queuing system and the TSP based buffer management schemes