SERVICE DISCIPLINES PERFORMANCE FOR BEST-EFFORT POLICIES IN WWW TRAFFIC OVER PACKET-SWITCHED WIRELESS CELLULAR NETWORKS

Size: px
Start display at page:

Download "SERVICE DISCIPLINES PERFORMANCE FOR BEST-EFFORT POLICIES IN WWW TRAFFIC OVER PACKET-SWITCHED WIRELESS CELLULAR NETWORKS"

Transcription

1 SERVICE DISCIPLINES PERFORMANCE FOR BEST-EFFORT POLICIES IN WWW TRAFFIC OVER PACKET-SWITCHED WIRELESS CELLULAR NETWORKS Wessam AJIB * Philippe GODLEWSKI * Loic LE BRIS + * Ecole Nationale Superieure des Telecommunications Department of Computer Sciences and Networks 6, Rue Barrault Paris FRANCE + Bouygues Telecom Research and Development 51, Avenue de lõeurope 789 Velizy FRANCE Abstract This paper studies the performance of several service disciplines proposed for packet-switched wireless networks such as General Packet Radio Service (GPRS). The GPRS is one of the major services currently standardized by the European Telecommunications Standards Institute (ETSI), for GSM Phase +. It has to satisfy the increasing demand for mobile data communications and the recent development of data applications. GPRS has to provide packet switched data services over GSM network and is considered as an evolution towards the third generation Universal Mobile Telecommunications System (UMTS). The World Wide Web (WWW) service is expected to be one of the important traffic applications that employ GPRS. Several service disciplines are proposed in this paper in order to provide best possible performance for WWW traffic in GPRS like network. We describe their mechanisms, similarities and differences. These policies performance is studied in terms of throughput, delay and loss rate by simulating the WWW traffic application on GPRS downlink transmissions. This work is done in the context of GPRS but can be generalized to divers packet switching radio mobile networks. Key words: GPRS, Access control, wireless packet, G-3G migration issues. I. Introduction In addition to speech applications, the Global System for Mobile communications (GSM) can provide some circuit switched data services such as Short Messaging Service (SMS). Due to recent developments in mobile data applications and the emerging market to multimedia transmissions, there is an increasing demand for more advanced data services in GSM network. This has instigated to standardization of two data bearer services as part of GSM phase +, namely, High Speed Circuit- Switched Data Service (HSCSD) and General Packet Radio Service (GPRS). HSCSD allows a mobile station (MS) to access simultaneously more than one radio channel operated in circuit switched mode, thereby increasing the MS transmission rate to 6 kbit/s. For applications generating bursty traffic (e.g. , WWW and telemetry) a packet switched bearer is more bandwidth efficient than a circuit switched one. Thus the purpose of GPRS is to statistically multiplex bursty data traffic efficiently. The physical channels available in the cell are shared dynamically between GPRS and other GSM services and the ones associated to GPRS are called Packet Data Channels (PDCHs). The layers of GPRS radio interface (defined in [6] and overviewed in [5-7-8]) are exhibited in figure 1. The SubNetwork Dependent Convergence Protocol (SNDCP) layer maps network level characteristics onto the ones of the underlying network. Under the SNDCP, the Logical Link Control (LLC) layer provides a highly reliable ciphered logical link between the tow entities. Radio Link Control (RLC) layer [1] performs the segmentation and reassembly of LLC-PDUs into RLC data blocks. Besides, it provides an acknowledgment mechanism based on selective repeat ARQ protocol [3-7]. The functions of Medium Access Control (MAC) layer [1] enable multiple MSs to share a common transmission medium, which may consists of one or several physical channels i.e., PDCHs. The physical layer provides services for information transfer over PDCHs between the MS and the network. The basic radio packet in GPRS is the RLC/MAC block, called simply block. It uses a sequence of four timeslots on a PDCH, called block period, to be transmitted [1]. A Temporary Block Flow (TBF) is a

2 physical connection used to support the transfer of a number of blocks. It is identified by a Temporary Flow Identity (TFI). By including the TFI in each block, the multiplexing of blocks destined for (or originated from) different MSs on the same PDCH is performed. New types of packet data logical channels are defined and mapped dynamically onto a 5-multiframe [6]. They include Packet Broadcast Channels (PBCCH), Packet Common Control Channels (such as: Random Access (PRACH) and Access Grant (PAGCH)) and traffic channels. Netwok Layer SNDCP PDP = IP, X.5, É etc. SNDCP GGSN different proposed scheduling solutions and to discuss their similarities and their differences. Finally, conclusions are given in sectionêvi. II. procedures of MAC layer The functions of MAC layer are related to the management of shared transmission resources (i.e. PDCHs) and control block receptions. MAC layer arbitrates access to the shared medium between a multitude of MSs and the network for uplink and downlink traffic direction. One or more PDCHs can be assigned to a MS and one or more MSs can use one PDCH. Two MAC modes are defined: the packet idle mode where no TBF exists and the packet transfer mode where radio resource providing a TBF is allocated to MS. The MAC procedures, in both idle and transfer modes, command cell re-selection, system information broadcasting and paging procedures. LLC RLC MAC PLL Physical RF LLC RLC MAC PLL Physical RF The network may initiate a downlink transfer by paging procedures if the MS is in ÒstandbyÓ Mobility Management (MM) state. Once the MS is in "ready" MM state, the network sends a packet downlink assignment, on PAGCH, including the assignment parameters such as the list of assigned PDCHs and then it transmits data blocks operating with RLC acknowledgment mechanism. MS Radio interface Um Figure 1. The GPRS radio interface Network In this paper, we centralise our studies on MAC layer procedures and particularly on the scheduling issue. The rest of this paper is organized as follows. The next section contains a brief description of MAC layer functions in GPRS system. The third section discusses the services to be offered by GPRS service and the parameters of Quality of Service (QoS) used in GPRS system. The applications that have to be supported by GPRS are presented and this section focuses on the WWW application. A model of this application is exhibited and discussed in the context of cellular networks. The scheduling issue is reviewed in the forth section. In this section, we proposed various scheduling algorithms to be used at MAC layer in order to appropriate the radio resources to different users, which are actives momentarily in the cell. The fifth section includes the simulation results, whose objective is to evaluate the performance of WWW traffic in GPRS system when the amount of radio resources allocated to GPRS is fixe. These simulations tend to compare the performance of The uplink TBF establishment begins when the higher layers in MS indicates that there is a TBF to be established. Different methods are described in [1] in order to establish an uplink transmission (e.g. short access, one phase access and two phases access). This paper assumes only the method of one phase access, and hence, the MS transmits an access request, on PRACH, and performs the access persistence control mechanism []. A new mechanism (called Access request Retransmission Announced Protocol or AQRAP) is proposed in [] toward an amelioration of MAC performance. The network responds to the access request, on PAGCH, by (i) a packet uplink assignment defining the medium access mechanism, (ii) packet queuing notification or (iii) packet access reject. Upon packet assignment receipt, the MS transmits the data blocks acting with RLC protocol. Three medium access modes, for uplink transmission, are supported: dynamic, extended dynamic and fixed. The MS, in dynamic allocation, monitors the Uplink State Flag (USF) field, contained in downlink blocks, in order to recognise its assigned uplink block periods. The extended dynamic allocation is a simple extension of dynamic one adapted to deliver large volume data packets. Within this mode, a USF value indicates the assigned

3 block periods on several PDCHs. In the case of fixed allocation, a certain amount of assigned block periods are fixed at the establishment of the TBF. Handling with this mode, a packet uplink assignment is sent to the MS, when needed, to update the amount of assigned resources. III. QoS and applications in GPRS The services that have to be offered by GPRS system are point-to-multipoint (PTM) services and Point-To- Point (PTP) services, for either connectionless network protocols such as Internet Protocol (IP) and Connection Oriented Network Protocols (CONP) i.e. X.5. Within the GPRS Phase 1, only PTP service is defined as a bearer service type and the QoS parameters (precedence, reliability, delay and throughput) are defined as a subscriberõs QoS profile for certain GPRS application []. The service precedence (priority) indicates the relative priority of maintaining the service under abnormal conditions. The reliability indicates the transmission characteristics requested by an application i.e., the probability of loss of, duplication of, mis-sequencing of or corruption of data units. The delay parameter defines the maximum values for the mean delay and the 95- percentil delay to be incurred by data transfer through GPRS network. The throughput QoS parameter donates two QoS classes requested by the user. The first one is the maximum bit rate and the second is the mean bit rate. Firstly, the GPRS phaseê1 system will principally support best effort services. Therefore, the policies concerning guaranteed services are not taking into account in these studies. The performance criterions defined in this paper and used in simulations are the following. The first is the average value of throughput per user, which imitates the quantity of data correctly received in the cell normalized by the number of users in the cell. The second parameter is the average value of delay requested to transmit a packet where a packet corresponds to a network data unit. A packet is transmitted within one TBF, and therefore, TBF designs sometimes the data blocks of a packet. The third parameter is the packet loss rate where a packet is considered lost if it is not received correctly. In case a TBF is abnormally released, all the data blocks belonging to this TBF are considered incorrectly transmitted. This is justified by the inability of higher layers (e.g. LLC) that buffering data to assemble data blocks in data units (e.g. LLC frames). The GPRS network may support a set of additional services, which include: accessing information stored in data base centers on demand only (e.g., WWW or minitel-like), messaging services (e.g., ), conversational services (e.g., File Transfer Protocol (FTP) service or Internet's Telnet application) and tele-action services de (e.g., credit carte validation, lottery transactions or surveillance system ) In this paper, only the accessing information stored in database centers (i.e. WWW application) is considered. This application can be modeled as the non real time service proposed in [9] in order to be used as a testoperating environment in UMTS. This model consists of a session arrival process model. A packet service session contains one or several packet calls where a packet call corresponds to the downloading of a WWW document. After the document is downloading, the user is consuming amount of time called reading time. A packet call constitutes of a bursty sequence of datagrammes. The number of datagrammes in a packet call can be geometrically distributed random variable with a mean set to 5. The distribution, of datagramme size, used is a Pareto distribution with cut-off. So, the datagramme size is defined as min (MaxPS, P) where MaxPS is the maximum allowed datagramme size, MaxPS = bytes and P is normal Pareto distributed random variable and its PDF is: F x (x) = 1 Ð (81,5 / x) 1,1. Assuming that the average inter-arrival time between packets is small enough to transmit all the datagrammes of one packet call within one TBF, the TBF length is considered as the summation of all datagrammes length within one packet call. One packet call corresponds to a Network Packet Data Unit (N-PDU) and it will be simply called a packet. One datagramme Reading time One session Packet call Figure. The WWW application model The GPRS enables the cost effective and efficient use of network resources for packet data applications that exhibits one or more of the following characteristics []: (i) intermittent, non periodic data transmissions, (ii) frequent transmissions of small volumes of data and (iii) infrequent transmissions of larger volumes of data.

4 IV. The scheduling algorithms This paper considers only the uplink WWW traffic in GPRS context network. However, the proposed scheduling algorithms can be used also for downlink traffic as well as for varied traffic applications. Those algorithms could be furthermore exploited for diversified packet switching wireless networks. The MAC layer arbitrates the access to the shared medium between a multitude of MSs and the network. This layer has to manage scheduling algorithms, which define how radio resources are assigned to disparate MSs. In This paper, physical channels in the cell are considered shared between GPRS and other GSM services in a fixed manner and a fixed boundary delimits the physical channels associated to GPRS (i.e. PDCHs) and the ones associated to other GSM services (i.e. circuit switched services). Hence, the number of PDCHs in the cell is fixed. Accordingly, two scheduling algorithms have to be defined. The first concerns the distribution of physical channels between different MSs. It is executed at the connection establishment. This algorithm is not the subject of this paper; so, the following ÒsimpleÓ algorithm is used. Considering that the network knows the number of MSs assigned to each PDCH and a PDCH 1 is supposed more loaded than PDCH if the MSs associated to PDCH 1 are more numerous than the ones associated to PDCH. When a MS, whose multislot class is x, establishes a TBF, the network allocates the least loaded x PDCHs. The Timing Advance Index (TAI) defines the maximum number of MSs associated to a PDCH. The amount of MSs actives (establishing a TBF) in the cell is also limited by the maximum value of TFI. A 1 A A 3 A A 5 R A 6 R 3 R 1 A 7 A 8 A 9 R 5 É É É É É É É A i donates arrival moment of the TBF i. R i donates the release moment of the TBF i. Figure 3. The first scheduling algorithm The figure 3 considers six PDCHs and contains a scenario explaining the first scheduling algorithm explained above. In this figure, a line contains the number of mobile stations to which the PDCH is assigned and the evolution of this number with the successive events where the line number gives the PDCH number. Every column involves the number of MSs assigned to the PDCH at the event of the column. The symbol A i signifies the arrival moment of the TBF i and R i expresses the release event of the TBF i. The second algorithm defines the allocation of block periods belonging to the same PDCH among MSs to which this PDCH is assigned. It is executed within the transmission of data blocks. This scheduling issue is also a network dependent choice and the scheduling algorithm depends on the access medium allocation mode for uplink transmissions i.e. dynamic, extended dynamic or fixed. Referring to [], we would prefer a scheduling algorithm to be efficient, protective, and simple. Efficient. An algorithm is more efficient than another one if it meets the same performance under a heavier load of traffic. Protective. It is not largely affected by abnormal traffic conditions such as load network fluctuations. Simple. An algorithm has to be conceptually simple to allow tractable analysis and mechanically simple to allow high speed implementations. The first scheduling algorithm, proposed in this study, is called "dynamic". It tends to be as fair as possible among the different mobile station which occupying the same PDCH. The objective of this algorithm is to assign the bloc periods of a PDCH equitably to all users of this PDCH. Resource assignment (i.e. partitioning of block periods) is updated at each new user arrival and at least at each bloc period. This mechanism operates like a set of FIFO queues (one queue per user) served by a Round Robin server whose allocation cycle is one bloc period as presented in figureê1. It is protective and efficient; just it is not simple to be implemented. Moreover, it needs an important quantity of signaling. It can be used with dynamic mode of allocation in uplink traffic. MS 1 MS MS 3 MS : : : MS N Figure. Dynamic scheduling Round Robin

5 The second proposed one is called ÒFirst Come First ServedÓ or FCFS scheduling algorithm. It avoids the interference of blocks originated from distinct MSs on the same PDCH. An arriving set of blocks will be transmitted together and this user monopolizes the PDCH until the end of set transmission. The other sets of blocks (new arriving originated from other users or retransmitted blocks) have to delay in a FIFO queue according to their arriving. When the current user releases the PDCH, the next set of blocks is served. If some blocks are negatively acknowledged, a new set of blocks is formed and then treated as a new arriving set of blocks. To compare this algorithm by queue presentation of the dynamic scheduling, one queue for all MSs and a deterministic server can present this algorithm. This algorithm is compatible with the fixed mode of medium access in the case of uplink transmissions. It is simple to be conceived, analyzed and implemented however it is not especially efficient or protective. Within the FCFS algorithm, the retransmitted blocks have to await the liberation of the PDCH, and hence, grow significantly the transmission delay of a TBF. The raison is that sometimes a set of retransmitted blocks has to await the transmission of several sets of blocks originated from other users, and usually these sets are considerably larger than the set of retransmitted blocks. The third proposed algorithm (called ÒFCFS with priorityó) employs the same scheduling policy FCFS and gives a transmission priority to the set of blocks. This priority depends only on how many times the block has been sent. The retransmitted blocks will be prioritized (on the blocks originated from other users and transmitted for the first time) to be transmitted. This policy is simple to be conceived and to be implemented and it attends to ameliorate the transmission delay of a TBF. The forth algorithm is called "FCFS with windows". It is characterized by an important parameter (bitmap length noted W). This parameter can corresponds to the bitmap field included in the packet uplink assignment in the case of fixed mode allocation. The proposed mechanism reallocates the resources (bloc periods of a PDCH) equitably among the users of this PDCH each "allocation cycle" ( W/x bloc periods, where x is the MS multislot class). In the beginning of each allocation cycle, the next bloc periods (within an allocation cycle) are reserved equitably for the different users. The number of block periods reserved for one MSs during one allocation cycle is limited by the parameter W. The new arriving users within an allocation cycle await the beginning of next allocation cycle to depart the transmission. This algorithm can be seen as a realistic implementation of the Fluid fair Queuing (FFQ) scheduling mechanism [11]. The parameter W can be adapted to the application characteristics and to traffic conditions (signaling quantity and channel quality). This mechanism is less simple than the other algorithms conceptually. However, it seems to be more adapted mechanically to the specific characteristics of RLC/MAC mechanism in GPRS transmission system. It can be used for downlink traffic or for uplink traffic with fixed, dynamic or extended dynamic mode of allocation. It is adapted to infrequent transmission of large TBF and intermittent transmissions. It is protective, efficient and simple to be implemented. This algorithm is studied for different values of the parameter, W. V. Simulation results All the layers of radio interface are introduced in our simulator in order to give the performance of GPRS system using the largest possible number of radio interface parameters. The following list contains some input parameters and their values. SNDCP header length: bytes LLC header length: 7 bytes Length of a LLC frame: 150 bytes LLC acknowledgment mode: Ack Max number of retransmission of a LLC frame: 3 RLC acknowledgment mode: Ack Max number of retransmission of a data block: 7 Coding channel scheme used for data blocks: CS- Coding channel scheme used for control blocks: CS-1 Block error rate (BLER) for data blocks = % Block error rate (BLER) for control blocks = % Max number of active MSs in the cell: 3 (limited by TAI value) Max MSs assigned to a PDCH: 16 (limited by TFI value) Multislot class of MSs: or Average load per MS: 5 kbit/s. Average number of datagramme in a packet: 5 Average length of one datagramme: 80 bytes Number of traffic PDCH: or 8 Number of PDCH carrying PAGCH: 1. One simulation time: 000s The paging procedures are not considered since it is assumed that all the MS in the cell are in ÒReadyÓ MM state. The performance parameters are evaluated in function of the input load in the cell, which is given by the number of mobile stations in the cell. The output performance parameters are the average value of throughput and delay introduced in section III. The packet loss rate values are insignificant in out simulation environment, and hence, those values are not taking into account. The scheduling algorithm used by default in these simulations is the ÒdynamicÓ one. The first figure (i.e. figures 5 and 6) show the influence of (i) multislot class of MSs, (ii) number of PDCHs in the cell and (iii) number of MSs in the cell on WWW performance over GPRS system.

6 Figure 5 gives the average value of throughput per user versus the number of MSs for different values of multislot class and number of PDCHs. We observe that this average value used in our studies does not depend on the number of PDCH multislot class of MSs. Fixing the number of PDCHs in the cell, the throughput is approximately fixe when the number of MSs crows in advance of a specific limit. The value of this limit is 8 MSs in the case of a cell with PDCHs and is 18 MSs for 8 PDCHS. This particular value of MSs number corresponds to a transmission ÒcapacityÓ of the cell. The throughput diminishes just as soon as the MSs number grows larger than the cell ÒcapacityÓ. When the number of PDCHs is multiplied by two, the cell ÒcapacityÓ progresses greater than the double. Comparing the throughput for the two values of PDCHs number used, when throughput decreases, the throughput for 8 PDCH is slightly greater than the double of throughput for PDCH. Figure 5 exhibits the transmission delay of a TBF versus the number of MSs in the cell. The transmission delay ÒexplodesÓ (i.e. increases rapidly) when the number of MSs exceeds the ÒcapacityÓ of the cell. Preceding this particular value, approximately the transmission delay is inversely proportional to the number of PDCHs in the cell. Theoretically, the throughput, as considered in this paper, has to be not significantly influenced by the scheduling algorithms. Figure 7 and 5 confirms that it is not influenced significantly by the value of W or by the scheduling algorithm. Figure 8 gives the transmission delay versus the number of MSs for 8 PDCH and users multislot class of, and figure 9 supposes PDCH and multislot class set to. The value of (W = 3) gives the best performance but implementing it demands more of signaling procedures and signaling resources o----- multislot cl. =, PDCH n = *----- multislot cl. =, PDCH n = The average delay vs the MSs number (dynamic scheduling) -----x----- multislot cl. =, PDCH n = multislot cl. =, PDCH n = Figure 6. Delay versus the number of MSs Throughput vs the MSs number (Different W)( multislot cl. =, PDCH n = 8) o----- multislot classe =, PDCH n = -----*----- multislot classe =, PDCH n = -----x----- multislot classe =, PDCH n = multislot classe =, PDCH n = FCFS with windows W= x----- FCFS with windows W= Figure 5. Throughput versus the number of MSs. Figures 7, 8 and 9 show the performance of the forth algorithm (FCFS with windows) using different values of the bitmap length parameter, W. Three values of W are chosen: 18, 6 and 3. Figure 7 presents the throughput versus the number of MSs in the cell. It assumes 8 PDCHs in the cell and MSs mulltislot class set to Figure 7. Throughput for different values of W (multislot class =, PDCH number = 8)

7 Delay vs the MSs number (Different W)( multislot cl. =, PDCH n = ) FCFS with windows W= x----- FCFS with windows W=6 simplicity, is as follows: Dynamic, FCFS with Windows, FCFS with priority and finally FCFS. The dynamic algorithm furnishes the best efficiency and needs the largest quantity of signaling. However, the ÒFCFS with WindowsÓ can compromise the simplicity protection and efficiency criteria. 0 Delay vs the MSs number (Different schedulings) (multislot cl. =, PDCH n = ) FCFS -----*----- Dynamic -----<----- FCFS with priority Figure 8. Delay for different values of W (multislot class =, PDCH number = ) 6 0 Delay vs the MSs number (Different W) (multislot cl. =, PDCH n = 8) FCFS with windows W= x----- FCFS with windows W=6 Figure. The delay for different scheduling policies (multislot class =, PDCH number = ) 0 Delay vs the MSs number (Different schedulings) (multislot cl. =, PDCH n = 8) FCFS -----*----- Dynamic -----<----- FCFS with priority Figure 9. Delay for different values of W (multislot class =, PDCH number = 8) 5 Figures and 11 display the performance comparison of the different proposed scheduling algorithms. Those figures contain the transmission delay of a TBF versus the number of MSs in the cell. This comparison takes into account the efficiency of the algorithms. The dynamic scheduling algorithm is the most efficient one. Next, the ÒFCFS with windowsó algorithm ameliorates the performance comparing to FCFS and ÒFCFS with priorityó policies. At last, The ÒFCFS with priorityó mechanism is more efficient than the FCFS. The amount of signaling needed by each algorithm corresponds to the criteria of implementation simplicity. The scheduling algorithm classification, according to their increasing Figure 11. The delay for different scheduling policies (multislot class =, PDCH number = ) Our simulation results show the benefits of the proposed algorithms and compare the performance of the ÒclassicalÓ scheduling algorithms and the new ones in GPRS context. Those results confirmed that ÒFCFS with windowsó is slightly as efficient as the ÒdynamicÓ one. It needs a quantity of signaling less than the one needed the ÒdynamicÓ one. It can be adapted to different applications

8 and notably for bursty ones and infrequent transmissions of small volume of data. VI. Conclusion In this paper, we discuss the scheduling issue in packet switching radio mobile networks (GPRS like). The procedures of MAC layer in GPRS are clarified briefly and thereafter we focus on the resource allocation procedures. QoS parameters and Traffic applications supported by GPRS network and particularly the WWW application are exhibited. The WWW application can give a valuable model of infrequent transmission of large volume of data and presents one of important applications that will employ GPRS. Varied scheduling algorithms are proposed and their performances are analyzed by simulation methods. Our simulation results show the benefits of the proposed algorithm and compare theirs performances in GPRS context. Simulations improve that transmission delay is significantly influenced by multislot class of MSs and by the number of PDCHs in the cell. They shows the amelioration of transmission delay when the multislot class grows. The dynamic scheduling algorithm gives the best performance. On the other side, it is the lest simple one. The ÒFCFS with windowsó proposed algorithm is slightly as efficient as the dynamic one, and it is notably more simple and more adapted to the specific characteristics of a packet switching data network such as GPRS service. In this paper, the best effort service was studied. However, the introduction of guaranteed performance services in GPRS network requires more complicated studies of the scheduling issue. References [1] ETSI Doc. Draft EN, GSM 0.60: ÒGPRS, MS- BSS interface, RLC/MAC ProtocolÓ, ver , 07/1999. [] ETSI Doc. EN, GSM 0.60: ÒGPRS, Service Description StageÊ1Ó, ver. 6..1, 08/1999. [3] W. Ajib and P. Godlewski, "Acknowledgment Proce-dures at Radio Link Control level in GPRS", proc. of ACM MSWiM'99, Seattle, Aug [] W. Ajib and P. Godlewski, ÒA proposal of an Access persistence Protocol over Data Wireless NetworksÓ, proc. of IEEE IPCCCÕ00, Phoenix, AR, Feb. 000 [5] G. Brasche and B. Walke, ÒConcepts, Services and Protocols of the New GSM phase + (GPRS)Ó, IEEE Comm. Mag. pp. 9-, August [6] ETSI Doc. TS, GSM 03.6: ÒOverall description of the GPRS radio interface Ó, ver , 07/1999. [7] W. Ajib and P. Godlewski, "Acknowledgment operations in the RLC layer of GPRS", proc. IEEE MoMuC'99, San Diego, CA. Nov [8] J. Cai and D.J. Goodman, "General Packet Radio Service in GSM", IEEE Comm. Mag. Oct. 1997, pp [9] ETSI Doc. TR, UMTS ÒUMTS: Selection procedures for the choice of radio transmission technologies of the UMTSÓ, ver. 3..0, /1998: [] Hui Zhang, ÒService Disciplines for Guaranteed Performance Service in Packet-Switching NetworksÓ, Proceedings of IEEE, Oct [11] L. Kleinrock. ÒQueuing systems Volume II: Computer ApplicationsÓ. Wiley, 1976.

RESOURCE ALLOCATION FOR INTERACTIVE TRAFFIC CLASS OVER GPRS

RESOURCE ALLOCATION FOR INTERACTIVE TRAFFIC CLASS OVER GPRS RESOURCE ALLOCATION FOR INTERACTIVE TRAFFIC CLASS OVER GPRS Edward Nowicki and John Murphy 1 ABSTRACT The General Packet Radio Service (GPRS) is a new bearer service for GSM that greatly simplify wireless

More information

A Performance Evaluation of Internet Access via the General Packet Radio Service of GSM

A Performance Evaluation of Internet Access via the General Packet Radio Service of GSM A Performance Evaluation of Internet Access via the General Packet Radio Service of GSM Simon Hoff, Michael Meyer, Andreas Schieder Ericsson Eurolab Deutschland Ericsson Allee 1, 52134 Herzogenrath, Germany

More information

Radio Resource Allocation in GSM/GPRS Networks

Radio Resource Allocation in GSM/GPRS Networks Radio Resource Allocation in GSM/GPRS Networks Jean-Lien C. Wu 1, Wei-Yeh Chen 2, and Hung-Huan Liu 1 1 Department of Electronic Engineering, National Taiwan University of Science and Technology, 43, Keelung

More information

GSM Network and Services

GSM Network and Services GSM Network and Services GPRS - sharing of resources 1 What is the problem? Many data applications are very bursty in its traffic pattern: http, smtp, pop, telnet,... Why reserve physical resources at

More information

Introduction to EDGE. 2.1 What Is EDGE?

Introduction to EDGE. 2.1 What Is EDGE? 2 Introduction to EDGE This chapter is the first of a series dedicated to EDGE. It introduces the different EDGE concepts from a global point of view, explaining how they have been introduced into the

More information

GPRS Systems Performance Analysis

GPRS Systems Performance Analysis GPRS Systems Performance Analysis Fátima de Lima Procópio Duarte, Antonio A.F. Loureiro, Leonardo Barbosa e Oliveira, Cláudio Márcio de Souza Vicente Federal University of Minas Gerais, Belo Horizonte,

More information

NOVEL PRIORITISED EGPRS MEDIUM ACCESS REGIME FOR REDUCED FILE TRANSFER DELAY DURING CONGESTED PERIODS

NOVEL PRIORITISED EGPRS MEDIUM ACCESS REGIME FOR REDUCED FILE TRANSFER DELAY DURING CONGESTED PERIODS NOVEL PRIORITISED EGPRS MEDIUM ACCESS REGIME FOR REDUCED FILE TRANSFER DELAY DURING CONGESTED PERIODS D. Todinca, P. Perry and J. Murphy Dublin City University, Ireland ABSTRACT The goal of this paper

More information

AN ANALYSIS OF DELAY OF SMALL IP PACKETS IN CELLULAR DATA NETWORKS

AN ANALYSIS OF DELAY OF SMALL IP PACKETS IN CELLULAR DATA NETWORKS AN ANALYSIS OF DELAY OF SMALL IP PACKETS IN CELLULAR DATA NETWORKS Hubert GRAJA, Philip PERRY and John MURPHY Performance Engineering Laboratory, School of Electronic Engineering, Dublin City University,

More information

CURRENT wireless personal communication systems are

CURRENT wireless personal communication systems are Efficient Radio Resource Allocation in a GSM and GPRS Cellular Network David E Vannucci & Peter J Chitamu Centre for Telecommunications Access and Services School of Electrical and Information Engineering

More information

PERFORMANCE OF THE GPRS RLC/MAC PROTOCOLS WITH VOIP TRAFFIC

PERFORMANCE OF THE GPRS RLC/MAC PROTOCOLS WITH VOIP TRAFFIC PERFORMANCE OF THE GPRS RLC/MAC PROTOCOLS WITH VOIP TRAFFIC Boris Bellalta 1, Miquel Oliver 1, David Rincón 2 1 Universitat Pompeu Fabra, Psg. Circumval lació 8, 83 - Barcelona, Spain, boris.bellalta,

More information

2G/3G Mobile Communication Systems

2G/3G Mobile Communication Systems 2G/3G Mobile Communication Systems Winter 2012/13 Integrated Communication Systems Group Ilmenau University of Technology Outline 2G Review: GSM Services Architecture Protocols Call setup Mobility management

More information

General Packet Radio Service (GPRS)

General Packet Radio Service (GPRS) General Packet Radio Service (GPRS) What is GPRS? GPRS (General Packet Radio Service) a packet oriented data service for IP and X.25 over GSM networks enables packet-switched services on the resources

More information

Performance Evaluation of VoIP Services using Different CODECs over a UMTS Network

Performance Evaluation of VoIP Services using Different CODECs over a UMTS Network Performance Evaluation of VoIP Services using Different CODECs over a UMTS Network Jianguo Cao School of Electrical and Computer Engineering RMIT University Melbourne, VIC 3000 Australia Email: j.cao@student.rmit.edu.au

More information

Handoff in GSM/GPRS Cellular Systems. Avi Freedman Hexagon System Engineering

Handoff in GSM/GPRS Cellular Systems. Avi Freedman Hexagon System Engineering Handoff in GSM/GPRS Cellular Systems Avi Freedman Hexagon System Engineering Outline GSM and GSM referemce model GPRS basics Handoffs GSM GPRS Location and Mobility Management Re-selection and routing

More information

Mobile Network Evolution Part 1. GSM and UMTS

Mobile Network Evolution Part 1. GSM and UMTS Mobile Network Evolution Part 1 GSM and UMTS GSM Cell layout Architecture Call setup Mobility management Security GPRS Architecture Protocols QoS EDGE UMTS Architecture Integrated Communication Systems

More information

Measured Performance of GSM HSCSD and GPRS

Measured Performance of GSM HSCSD and GPRS Measured Performance of GSM HSCSD and Jouni Korhonen Olli Aalto Andrei Gurtov Heimo Laamanen Sonera Corporation P.O.Box 97 51 Helsinki, Finland Abstract In this paper we present results of measurements

More information

Wireless Access of GSM

Wireless Access of GSM Wireless Access of GSM Project Report FALL, 1999 Wireless Access of GSM Abstract: Global System for Mobile communications (GSM) started to be developed by Europeans when the removal of many European trade

More information

Computer Networks. Chapter 5 Transport Protocols

Computer Networks. Chapter 5 Transport Protocols Computer Networks Chapter 5 Transport Protocols Transport Protocol Provides end-to-end transport Hides the network details Transport protocol or service (TS) offers: Different types of services QoS Data

More information

QoS of Internet Access with GPRS

QoS of Internet Access with GPRS Dept. of Prof. Dr. P. Tran-Gia QoS of Internet Access with GPRS Dirk Staehle 1, Kenji Leibnitz 1, and Konstantin Tsipotis 2 1 [staehle,leibnitz]@informatik.uni-wuerzburg.de 2 Libertel-Vodafone k.tsipotis@libertel.nl

More information

Applying Active Queue Management to Link Layer Buffers for Real-time Traffic over Third Generation Wireless Networks

Applying Active Queue Management to Link Layer Buffers for Real-time Traffic over Third Generation Wireless Networks Applying Active Queue Management to Link Layer Buffers for Real-time Traffic over Third Generation Wireless Networks Jian Chen and Victor C.M. Leung Department of Electrical and Computer Engineering The

More information

TCP in Wireless Networks

TCP in Wireless Networks Outline Lecture 10 TCP Performance and QoS in Wireless s TCP Performance in wireless networks TCP performance in asymmetric networks WAP Kurose-Ross: Chapter 3, 6.8 On-line: TCP over Wireless Systems Problems

More information

Protocol Overhead in GPRS. White Paper

Protocol Overhead in GPRS. White Paper Protocol Overhead in GPRS White Paper Protocol Overhead in GPRS 2002-09-04 Ascom 2009. All rights reserved. TEMS is a trademark of Ascom. All other trademarks are the property of their respective holders.

More information

Introduction VOIP in an 802.11 Network VOIP 3

Introduction VOIP in an 802.11 Network VOIP 3 Solutions to Performance Problems in VOIP over 802.11 Wireless LAN Wei Wang, Soung C. Liew Presented By Syed Zaidi 1 Outline Introduction VOIP background Problems faced in 802.11 Low VOIP capacity in 802.11

More information

Improved Channel Allocation and RLC block scheduling for Downlink traffic in GPRS

Improved Channel Allocation and RLC block scheduling for Downlink traffic in GPRS Improved Channel Allocation and RLC block scheduling for Downlink traffic in GPRS Haibo Wang, Devendra Prasad, Xin Zhou Jimena Martinez Llorente, François Delawarde, Gwénaël Coget, Patrick Eggers, Hans

More information

GSM GPRS. Course requirements: Understanding Telecommunications book by Ericsson (Part D PLMN) + supporting material (= these slides)

GSM GPRS. Course requirements: Understanding Telecommunications book by Ericsson (Part D PLMN) + supporting material (= these slides) GSM Example of a PLMN (Public Land Mobile Network) At present most successful cellular mobile system (over 200 million subscribers worldwide) Digital (2 nd Generation) cellular mobile system operating

More information

CS263: Wireless Communications and Sensor Networks

CS263: Wireless Communications and Sensor Networks CS263: Wireless Communications and Sensor Networks Matt Welsh Lecture 4: Medium Access Control October 5, 2004 2004 Matt Welsh Harvard University 1 Today's Lecture Medium Access Control Schemes: FDMA TDMA

More information

TCOM 370 NOTES 99-12 LOCAL AREA NETWORKS AND THE ALOHA PROTOCOL

TCOM 370 NOTES 99-12 LOCAL AREA NETWORKS AND THE ALOHA PROTOCOL 1. Local Area Networks TCOM 370 NOTES 99-12 LOCAL AREA NETWORKS AND THE ALOHA PROTOCOL These are networks spanning relatively short distances (e.g. within one building) for local point-to-point and point-to-multipoint

More information

TCP and Wireless Networks Classical Approaches Optimizations TCP for 2.5G/3G Systems. Lehrstuhl für Informatik 4 Kommunikation und verteilte Systeme

TCP and Wireless Networks Classical Approaches Optimizations TCP for 2.5G/3G Systems. Lehrstuhl für Informatik 4 Kommunikation und verteilte Systeme Chapter 2 Technical Basics: Layer 1 Methods for Medium Access: Layer 2 Chapter 3 Wireless Networks: Bluetooth, WLAN, WirelessMAN, WirelessWAN Mobile Networks: GSM, GPRS, UMTS Chapter 4 Mobility on the

More information

DISCUSSION. Sophia-Antipolis, France August 16-20, 1999. Agenda item: 14.4 Golden Bridge Technology CPCH Delay Measurements for TS25.

DISCUSSION. Sophia-Antipolis, France August 16-20, 1999. Agenda item: 14.4 Golden Bridge Technology CPCH Delay Measurements for TS25. TSG RAN WG 2#6 Sophia-Antipolis, France August 16-20, 1999 TSGR2#6(99)802 Agenda item: 14.4 Source: Golden Bridge Technology Title: CPCH Delay Measurements for TS25.331, RRC Protocol Document for: Discussion

More information

Index. Common Packet Channel (CPCH) 25 Compression 265, 279 82, 288 header compression 284

Index. Common Packet Channel (CPCH) 25 Compression 265, 279 82, 288 header compression 284 bindex.fm Page 296 Tuesday, March 22, 2005 7:17 AM Index 2G, 2.5G, 3G 13 3GPP 118 Release 5 (Rel 5) 124 Release 6 (Rel 6) 125 Release 97/98 (Rel 97/98) 119 Release 99 (Rel 99) 120 4 3GPP2 129 4G 13, 44

More information

Backgrounds regarding data transmission in GSM and UMTS mobile networks for Sunny WebBox / Sunny Boy Control

Backgrounds regarding data transmission in GSM and UMTS mobile networks for Sunny WebBox / Sunny Boy Control GSM Backgrounds regarding data transmission in GSM and UMTS mobile networks for Sunny WebBox / Sunny Boy Control Contents In addition to telephony, services for digital fax and data transmission were already

More information

DYNAMIC RADIO RESOURCE MANAGEMENT IN GSM/GPRS USING SCALABLE RESOURCE ALLOCATION TECHNIQUE

DYNAMIC RADIO RESOURCE MANAGEMENT IN GSM/GPRS USING SCALABLE RESOURCE ALLOCATION TECHNIQUE DYNAMIC RADIO RESOURCE MANAGEMENT IN GSM/GPRS USING SCALABLE RESOURCE ALLOCATION TECHNIQUE Seok Y Tang, Shyamalie Thilakawardana and Rahim Tafazolli Mobile Communications Research Group Centre for Communications

More information

Agilent General Packet Radio Service (GPRS) Network Optimization Measurement Challenges Using Drive Testing

Agilent General Packet Radio Service (GPRS) Network Optimization Measurement Challenges Using Drive Testing Agilent General Packet Radio Service (GPRS) Network Optimization Measurement Challenges Using Drive Testing Application Note 1377-2 Increase your knowledge of GPRS. Learn about GPRS: measurement model

More information

Transport Layer Protocols

Transport Layer Protocols Transport Layer Protocols Version. Transport layer performs two main tasks for the application layer by using the network layer. It provides end to end communication between two applications, and implements

More information

Analysis of IP Network for different Quality of Service

Analysis of IP Network for different Quality of Service 2009 International Symposium on Computing, Communication, and Control (ISCCC 2009) Proc.of CSIT vol.1 (2011) (2011) IACSIT Press, Singapore Analysis of IP Network for different Quality of Service Ajith

More information

ALCATEL CRC Antwerpen Fr. Wellesplein 1 B-2018 Antwerpen +32/3/240.8550; Suresh.Leroy@alcatel.be +32/3/240.7830; Guy.Reyniers@alcatel.

ALCATEL CRC Antwerpen Fr. Wellesplein 1 B-2018 Antwerpen +32/3/240.8550; Suresh.Leroy@alcatel.be +32/3/240.7830; Guy.Reyniers@alcatel. Contact: ALCATEL CRC Antwerpen Fr. Wellesplein 1 B-2018 Antwerpen +32/3/240.8550; Suresh.Leroy@alcatel.be +32/3/240.7830; Guy.Reyniers@alcatel.be Voice over (Vo) was developed at some universities to diminish

More information

Copyright. GSM - Phase 2+ From GSM to GPRS. From GSM to GPRS. Motivations. General Packet Radio Service (GPRS) HSCSD EDGE GPRS

Copyright. GSM - Phase 2+ From GSM to GPRS. From GSM to GPRS. Motivations. General Packet Radio Service (GPRS) HSCSD EDGE GPRS Copyright HSCSD EDGE GPRS GSM - Phase 2+ Quest opera è protetta dalla licenza Creative Commons NoDerivs-NonCommercial. Per vedere una copia di questa licenza, consultare: http://creativecommons.org/licenses/nd-nc/1.0/

More information

CMU200: 2 2,5 Generation of Mobile Communication Systems GSM / GPRS / EGPRS. 2 MAR Re 1 1 CMU 200 GSM / GPRS / EGPRS

CMU200: 2 2,5 Generation of Mobile Communication Systems GSM / GPRS / EGPRS. 2 MAR Re 1 1 CMU 200 GSM / GPRS / EGPRS CMU200: 2 2,5 Generation of Mobile Communication Systems GSM / GPRS / EGPRS 2 MAR Re 1 1 08/00 of GSM, GPRS and EGPRS Basic Information about: u Physical Resource u GMSK and 8PSK u Mapping u Coding Schemes

More information

EDGE: Enhanced Data Rates for GSM Evolution

EDGE: Enhanced Data Rates for GSM Evolution EDGE: Enhanced Data Rates for GSM Evolution SIDDARTH WANDRE ID: 999-29-3194 CS 548: Broadband Networks ILLINOIS INSTITUTE OF TECHNOLOGY Abstract:- This paper gives an overview of the EDGE concept. It gives

More information

IEEE 802.16 Broadband Wireless Access Working Group. ATM Based MAC Layer Proposal for the 802.16 Air Interface Specification

IEEE 802.16 Broadband Wireless Access Working Group. ATM Based MAC Layer Proposal for the 802.16 Air Interface Specification Project Title Date Submitted Source Re: Abstract Purpose Notice Release IEEE Patent Policy IEEE 802.16 Broadband Wireless Access Working Group ATM Based MAC Layer Proposal for the 802.16 Air Interface

More information

Configuring QoS in a Wireless Environment

Configuring QoS in a Wireless Environment Configuring QoS in a Wireless Environment This chapter describes how to configure quality of service (QoS) on your Cisco wireless interface. With this feature, you can provide preferential treatment to

More information

ETSI TS 122 060 V3.5.0 (2000-10)

ETSI TS 122 060 V3.5.0 (2000-10) TS 122 060 V3.5.0 (2000-10) Technical Specification Digital cellular telecommunications system (Phase 2+) (GSM); Universal Mobile Telecommunications System (UMTS); General Packet Radio Service (GPRS);

More information

Quality of Service. Traditional Nonconverged Network. Traditional data traffic characteristics:

Quality of Service. Traditional Nonconverged Network. Traditional data traffic characteristics: Quality of Service 1 Traditional Nonconverged Network Traditional data traffic characteristics: Bursty data flow FIFO access Not overly time-sensitive; delays OK Brief outages are survivable 2 1 Converged

More information

Deployment Aspects for VoIP Services over HSPA Networks

Deployment Aspects for VoIP Services over HSPA Networks Nash Technologies Your partner for world-class custom software solutions & consulting Deployment Aspects for VoIP Services over HSPA Networks Jens Mueckenheim, Enrico Jugl, Thomas Wagner, Michael Link,

More information

1. The subnet must prevent additional packets from entering the congested region until those already present can be processed.

1. The subnet must prevent additional packets from entering the congested region until those already present can be processed. Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because routers are receiving packets faster than they can forward them, one

More information

Mobile Communications Chapter 9: Mobile Transport Layer

Mobile Communications Chapter 9: Mobile Transport Layer Mobile Communications Chapter 9: Mobile Transport Layer Motivation TCP-mechanisms Classical approaches Indirect TCP Snooping TCP Mobile TCP PEPs in general Additional optimizations Fast retransmit/recovery

More information

Quality of Service in the Internet. QoS Parameters. Keeping the QoS. Traffic Shaping: Leaky Bucket Algorithm

Quality of Service in the Internet. QoS Parameters. Keeping the QoS. Traffic Shaping: Leaky Bucket Algorithm Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:

More information

Responses by TG1 (2000-09-14) included

Responses by TG1 (2000-09-14) included 20 00-09-14 I EEE 802.16.1-00/04 Comparison between TG3 Functional Requirements Document and TG1 proposed MAC Prepared by TG3 (2000-09-14) Comments in black Responses by TG1 (2000-09-14) included Green

More information

Quality of Service Analysis of site to site for IPSec VPNs for realtime multimedia traffic.

Quality of Service Analysis of site to site for IPSec VPNs for realtime multimedia traffic. Quality of Service Analysis of site to site for IPSec VPNs for realtime multimedia traffic. A Network and Data Link Layer infrastructure Design to Improve QoS in Voice and video Traffic Jesús Arturo Pérez,

More information

Module 5. Broadcast Communication Networks. Version 2 CSE IIT, Kharagpur

Module 5. Broadcast Communication Networks. Version 2 CSE IIT, Kharagpur Module 5 Broadcast Communication Networks Lesson 9 Cellular Telephone Networks Specific Instructional Objectives At the end of this lesson, the student will be able to: Explain the operation of Cellular

More information

General Packet Radio Service (GPRS): Mobility- and Session Management

General Packet Radio Service (GPRS): Mobility- and Session Management ehrstuhl für ommunikationsnetze Prof. Dr.-Ing. Jörg Eberspächer General Packet Radio Service (GPRS): Mobility- and Session Management ITG-Fachgruppe 5.2.4 "IP und Mobility June 20, 2001. Tagung amp-intfort

More information

Technical Specification LTE; Evolved Universal Terrestrial Radio Access (E-UTRA); Layer 2 - Measurements (3GPP TS 36.314 version 11.1.

Technical Specification LTE; Evolved Universal Terrestrial Radio Access (E-UTRA); Layer 2 - Measurements (3GPP TS 36.314 version 11.1. TS 136 314 V11.1.0 (2013-02) Technical Specification LTE; Evolved Universal Terrestrial Radio Access (E-UTRA); Layer 2 - Measurements (3GPP TS 36.314 version 11.1.0 Release 11) 1 TS 136 314 V11.1.0 (2013-02)

More information

Seamless Congestion Control over Wired and Wireless IEEE 802.11 Networks

Seamless Congestion Control over Wired and Wireless IEEE 802.11 Networks Seamless Congestion Control over Wired and Wireless IEEE 802.11 Networks Vasilios A. Siris and Despina Triantafyllidou Institute of Computer Science (ICS) Foundation for Research and Technology - Hellas

More information

Congestion Control Review. 15-441 Computer Networking. Resource Management Approaches. Traffic and Resource Management. What is congestion control?

Congestion Control Review. 15-441 Computer Networking. Resource Management Approaches. Traffic and Resource Management. What is congestion control? Congestion Control Review What is congestion control? 15-441 Computer Networking What is the principle of TCP? Lecture 22 Queue Management and QoS 2 Traffic and Resource Management Resource Management

More information

In Dedicated Channel model, two alternatives are considered: Transmission of one single packet Sequence of packet transmission.

In Dedicated Channel model, two alternatives are considered: Transmission of one single packet Sequence of packet transmission. Department of Signal Theory and Communications - Technical University of Catalonia (UPC) Campus Nord-Edificio D4 - C/ Jordi Girona -3-834 Barcelona-Spain E_mail: angelah@tsc.upc.es, ferranc@tsc.upc.es

More information

Protocols and Architecture. Protocol Architecture.

Protocols and Architecture. Protocol Architecture. Protocols and Architecture Protocol Architecture. Layered structure of hardware and software to support exchange of data between systems/distributed applications Set of rules for transmission of data between

More information

Throughput Analysis of WEP Security in Ad Hoc Sensor Networks

Throughput Analysis of WEP Security in Ad Hoc Sensor Networks Throughput Analysis of WEP Security in Ad Hoc Sensor Networks Mohammad Saleh and Iyad Al Khatib iitc Stockholm, Sweden {mohsaleh, iyad}@iitc.se ABSTRACT This paper presents a performance investigation

More information

QoS Parameters. Quality of Service in the Internet. Traffic Shaping: Congestion Control. Keeping the QoS

QoS Parameters. Quality of Service in the Internet. Traffic Shaping: Congestion Control. Keeping the QoS Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:

More information

1 Introduction to mobile telecommunications

1 Introduction to mobile telecommunications 1 Introduction to mobile telecommunications Mobile phones were first introduced in the early 1980s. In the succeeding years, the underlying technology has gone through three phases, known as generations.

More information

A Statistical Estimation of Average IP Packet Delay in Cellular Data Networks

A Statistical Estimation of Average IP Packet Delay in Cellular Data Networks A Statistical Estimation of Average IP Packet Delay in Cellular Data Networks Hubert GRAJA, Philip PERRY and John MURPHY Performance Engineering Laboratory, Computer Science Department,University College

More information

Data Networks Summer 2007 Homework #3

Data Networks Summer 2007 Homework #3 Data Networks Summer Homework # Assigned June 8, Due June in class Name: Email: Student ID: Problem Total Points Problem ( points) Host A is transferring a file of size L to host B using a TCP connection.

More information

3GPP LTE Radio Link Control (RLC) Sub Layer

3GPP LTE Radio Link Control (RLC) Sub Layer 3GPP LTE Radio Link Control (RLC) Sub Layer 2009 Inc. All Rights Reserved. LTE RLC Sub Layer Functions Acknowledged, Unacknowledged and Transparent Mode Operation Concatenation, Segmentation and Reassembly

More information

Priority-Coupling A Semi-Persistent MAC Scheduling Scheme for VoIP Traffic on 3G LTE

Priority-Coupling A Semi-Persistent MAC Scheduling Scheme for VoIP Traffic on 3G LTE Priority-Coupling A Semi-Persistent MAC Scheduling Scheme for VoIP Traffic on 3G LTE S. Saha * and R. Quazi ** * Helsinki University of Technology, Helsinki, Finland ** University of Dhaka, Dhaka, Bangladesh

More information

CSMA/CA. Information Networks p. 1

CSMA/CA. Information Networks p. 1 Information Networks p. 1 CSMA/CA IEEE 802.11 standard for WLAN defines a distributed coordination function (DCF) for sharing access to the medium based on the CSMA/CA protocol Collision detection is not

More information

First Midterm for ECE374 03/24/11 Solution!!

First Midterm for ECE374 03/24/11 Solution!! 1 First Midterm for ECE374 03/24/11 Solution!! Note: In all written assignments, please show as much of your work as you can. Even if you get a wrong answer, you can get partial credit if you show your

More information

Performance Analysis of AQM Schemes in Wired and Wireless Networks based on TCP flow

Performance Analysis of AQM Schemes in Wired and Wireless Networks based on TCP flow International Journal of Soft Computing and Engineering (IJSCE) Performance Analysis of AQM Schemes in Wired and Wireless Networks based on TCP flow Abdullah Al Masud, Hossain Md. Shamim, Amina Akhter

More information

06/02/ Local & Metropolitan Area Networks. Overview. Medium Access Sublayer (1) ACOE322

06/02/ Local & Metropolitan Area Networks. Overview. Medium Access Sublayer (1) ACOE322 1 Local & Metropolitan Area Networks ACOE322 Lecture 2 Medium Access Control and Logical Link Control 1 Overview The architecture of a LAN is best described in terms of a layering of protocols that organize

More information

GSM Channels. Physical & Logical Channels. Traffic and Control Mutltiframing. Frame Structure

GSM Channels. Physical & Logical Channels. Traffic and Control Mutltiframing. Frame Structure GSM Channels Physical & Logical Channels Traffic and Control Mutltiframing Frame Structure Engr. Mian Shahzad Iqbal Lecturer Department of Telecommunication Engineering Radio Interface The radio interface

More information

Active Queue Management (AQM) based Internet Congestion Control

Active Queue Management (AQM) based Internet Congestion Control Active Queue Management (AQM) based Internet Congestion Control October 1 2002 Seungwan Ryu (sryu@eng.buffalo.edu) PhD Student of IE Department University at Buffalo Contents Internet Congestion Control

More information

Local Area Networks transmission system private speedy and secure kilometres shared transmission medium hardware & software

Local Area Networks transmission system private speedy and secure kilometres shared transmission medium hardware & software Local Area What s a LAN? A transmission system, usually private owned, very speedy and secure, covering a geographical area in the range of kilometres, comprising a shared transmission medium and a set

More information

Attenuation (amplitude of the wave loses strength thereby the signal power) Refraction Reflection Shadowing Scattering Diffraction

Attenuation (amplitude of the wave loses strength thereby the signal power) Refraction Reflection Shadowing Scattering Diffraction Wireless Physical Layer Q1. Is it possible to transmit a digital signal, e.g., coded as square wave as used inside a computer, using radio transmission without any loss? Why? It is not possible to transmit

More information

Packet Queueing Delay in Wireless Networks with Multiple Base Stations and Cellular Frequency Reuse

Packet Queueing Delay in Wireless Networks with Multiple Base Stations and Cellular Frequency Reuse Packet Queueing Delay in Wireless Networks with Multiple Base Stations and Cellular Frequency Reuse Abstract - Cellular frequency reuse is known to be an efficient method to allow many wireless telephone

More information

Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc

Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc (International Journal of Computer Science & Management Studies) Vol. 17, Issue 01 Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc Dr. Khalid Hamid Bilal Khartoum, Sudan dr.khalidbilal@hotmail.com

More information

Note! The problem set consists of two parts: Part I: The problem specifications pages Part II: The answer pages

Note! The problem set consists of two parts: Part I: The problem specifications pages Part II: The answer pages Part I: The problem specifications NTNU The Norwegian University of Science and Technology Department of Telematics Note! The problem set consists of two parts: Part I: The problem specifications pages

More information

GSM Phase 2+ General Packet Radio Service GPRS: Architecture, Protocols, and Air Interface

GSM Phase 2+ General Packet Radio Service GPRS: Architecture, Protocols, and Air Interface Copyright 1999 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for

More information

Performance Issues of TCP and MPEG-4 4 over UMTS

Performance Issues of TCP and MPEG-4 4 over UMTS Performance Issues of TCP and MPEG-4 4 over UMTS Anthony Lo A.Lo@ewi.tudelft.nl 1 Wiskunde end Informatica Outline UMTS Overview TCP and MPEG-4 Performance Summary 2 1 Universal Mobile Telecommunications

More information

then, we require that, in order to support the offered load, (1)

then, we require that, in order to support the offered load, (1) Capacity of an IEEE 802.11b Wireless LAN supporting VoIP To appear in Proc. IEEE Int. Conference on Communications (ICC) 2004 David P. Hole and Fouad A. Tobagi Dept. of Electrical Engineering, Stanford

More information

3GPP Wireless Standard

3GPP Wireless Standard 3GPP Wireless Standard Shishir Pandey School of Technology and Computer Science TIFR, Mumbai April 10, 2009 Shishir Pandey (TIFR) 3GPP Wireless Standard April 10, 2009 1 / 23 3GPP Overview 3GPP : 3rd Generation

More information

Forced Low latency Handoff in Mobile Cellular Data Networks

Forced Low latency Handoff in Mobile Cellular Data Networks Forced Low latency Handoff in Mobile Cellular Data Networks N. Moayedian, Faramarz Hendessi Department of Electrical and Computer Engineering Isfahan University of Technology, Isfahan, IRAN Hendessi@cc.iut.ac.ir

More information

Architecture Overview NCHU CSE LTE - 1

Architecture Overview NCHU CSE LTE - 1 Architecture Overview NCHU CSE LTE - 1 System Architecture Evolution (SAE) Packet core networks are also evolving to the flat System Architecture Evolution (SAE) architecture. This new architecture optimizes

More information

3GPP TS 05.15 V8.1.0 (2006-01)

3GPP TS 05.15 V8.1.0 (2006-01) TS 05.15 V8.1.0 (2006-01) Technical Specification 3rd Generation Partnership Project; Technical Specification Group GSM/EDGE Radio Access Network; Release independent Downlink Advanced Receiver Performance

More information

6.1. Why do LANs tend to use broadcast networks? Why not use networks consisting of multiplexers and switches?

6.1. Why do LANs tend to use broadcast networks? Why not use networks consisting of multiplexers and switches? TUTORIAL 2 (EKT 332) 6.1. Why do LANs tend to use broadcast networks? Why not use networks consisting of multiplexers and switches? Why broadcast network? -The computers in a LAN are separated by a short

More information

BCS THE CHARTERED INSTITUTE FOR IT. BCS HIGHER EDUCATION QUALIFICATIONS BCS Level 5 Diploma in IT COMPUTER NETWORKS

BCS THE CHARTERED INSTITUTE FOR IT. BCS HIGHER EDUCATION QUALIFICATIONS BCS Level 5 Diploma in IT COMPUTER NETWORKS BCS THE CHARTERED INSTITUTE FOR IT BCS HIGHER EDUCATION QUALIFICATIONS BCS Level 5 Diploma in IT COMPUTER NETWORKS Friday 2 nd October 2015 Morning Answer any FOUR questions out of SIX. All questions carry

More information

Architecture of distributed network processors: specifics of application in information security systems

Architecture of distributed network processors: specifics of application in information security systems Architecture of distributed network processors: specifics of application in information security systems V.Zaborovsky, Politechnical University, Sait-Petersburg, Russia vlad@neva.ru 1. Introduction Modern

More information

3GPP TS 34.109 V3.10.0 (2004-09)

3GPP TS 34.109 V3.10.0 (2004-09) TS 34.109 V3.10.0 (2004-09) Technical Specification 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Terminal logical test interface; Special conformance testing

More information

A Short Look on Power Saving Mechanisms in the Wireless LAN Standard Draft IEEE 802.11

A Short Look on Power Saving Mechanisms in the Wireless LAN Standard Draft IEEE 802.11 A Short Look on Power Saving Mechanisms in the Wireless LAN Standard Draft IEEE 802.11 Christian Röhl, Hagen Woesner, Adam Wolisz * Technical University Berlin Telecommunication Networks Group {roehl,

More information

Configuring QoS in a Wireless Environment

Configuring QoS in a Wireless Environment 12 CHAPTER This chapter describes how to configure quality of service (QoS) on your Cisco wireless mobile interface card (WMIC). With this feature, you can provide preferential treatment to certain traffic

More information

ARIB STD-T64-C.S0042 v1.0 Circuit-Switched Video Conferencing Services

ARIB STD-T64-C.S0042 v1.0 Circuit-Switched Video Conferencing Services ARIB STD-T-C.S00 v.0 Circuit-Switched Video Conferencing Services Refer to "Industrial Property Rights (IPR)" in the preface of ARIB STD-T for Related Industrial Property Rights. Refer to "Notice" in the

More information

VoIP over Wireless Opportunities and Challenges

VoIP over Wireless Opportunities and Challenges Prof. Dr. P. Tran-Gia VoIP over Wireless Opportunities and Challenges Universität Würzburg Lehrstuhl für verteilte Systeme H.323 RTP Codec Voice-over-IP over Wireless (VoIPoW) UDP IMS G723.1 SIP G729 HSDPA

More information

LTE Performance and Analysis using Atoll Simulation

LTE Performance and Analysis using Atoll Simulation IOSR Journal of Electrical and Electronics Engineering (IOSR-JEEE) e-issn: 2278-1676,p-ISSN: 2320-3331, Volume 9, Issue 6 Ver. III (Nov Dec. 2014), PP 68-72 LTE Performance and Analysis using Atoll Simulation

More information

Improving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation

Improving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation Improving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation R.Navaneethakrishnan Assistant Professor (SG) Bharathiyar College of Engineering and Technology, Karaikal, India.

More information

RLC/MAC Uplink Transfer

RLC/MAC Uplink Transfer FORMATION GPRS - TD SIB RLC/MAC Uplink Transfer Access procedure: one phase access CHANNEL REQUEST One Phase Access IMMEDIATE ASSIGNMENT Request Reference / PDCH description / TBF parameters IMMEDIATE_ASSIGNMENT

More information

4 Internet QoS Management

4 Internet QoS Management 4 Internet QoS Management Rolf Stadler School of Electrical Engineering KTH Royal Institute of Technology stadler@ee.kth.se September 2008 Overview Network Management Performance Mgt QoS Mgt Resource Control

More information

ADH Technology Co. Ltd.

ADH Technology Co. Ltd. ADH Technology Co. Ltd. ADH8012 GSM GPRS Modem User s Manual www.adh-tech.com.tw sales@adh-tech.com.tw Page 1 Content ADH8012 GSM GPRS Modem User s Manual... 1 1. Introduction... 3 2. Product concept...

More information

Priority-Based Congestion Control Algorithm for Cross-Traffic Assistance on LTE Networks

Priority-Based Congestion Control Algorithm for Cross-Traffic Assistance on LTE Networks Priority-Based Congestion Control Algorithm for Cross-Traffic Assistance on LTE Networks Lung-Chih Tung, You Lu, Mario Gerla Department of Computer Science University of California, Los Angeles Los Angeles,

More information

VoIP-Kapazität im Relay erweiterten IEEE 802.16 System

VoIP-Kapazität im Relay erweiterten IEEE 802.16 System VoIP-Kapazität im Relay erweiterten IEEE 802.16 System 21. ComNets-Workshop Mobil- und Telekommunikation Dipl.-Ing. Karsten Klagges ComNets Research Group RWTH Aachen University 16. März 2012 Karsten Klagges

More information

On the Traffic Capacity of Cellular Data Networks. 1 Introduction. T. Bonald 1,2, A. Proutière 1,2

On the Traffic Capacity of Cellular Data Networks. 1 Introduction. T. Bonald 1,2, A. Proutière 1,2 On the Traffic Capacity of Cellular Data Networks T. Bonald 1,2, A. Proutière 1,2 1 France Telecom Division R&D, 38-40 rue du Général Leclerc, 92794 Issy-les-Moulineaux, France {thomas.bonald, alexandre.proutiere}@francetelecom.com

More information

ETSI TS 100 912 V8.4.0 (2000-08)

ETSI TS 100 912 V8.4.0 (2000-08) TS 100 912 V8.4.0 (2000-08) Technical Specification Digital cellular telecommunications system (Phase 2+); Radio subsystem synchronization (GSM 05.10 version 8.4.0 Release 1999) GLOBAL SYSTEM FOR MOBILE

More information

Extended-rtPS Algorithm for VoIP Services in IEEE 802.16 systems

Extended-rtPS Algorithm for VoIP Services in IEEE 802.16 systems Extended-rtPS Algorithm for VoIP Services in IEEE 802.16 systems Howon Lee, Taesoo Kwon and Dong-Ho Cho Department of Electrical Engineering and Computer Science Korea Advanced Institute of Science and

More information