Quality of Service Oriented Traffic Engineering

Total Page:16

File Type:pdf, Size:1020Kb

Quality of Service Oriented Traffic Engineering Quality of Service oriented Traffic Engineering Methods for Multi-Service Cellular Networks Dienstgüte-orientierte verkehrstheoretische Methoden für die Bereitstellung unterschiedlicher Dienste in zellularen Netzen Der Technischen Fakultät der Universität Erlangen-Nürnberg zur Erlangung des Grades DOKTOR INGENIEUR vorgelegt von LARISSA N. POPOVA Erlangen – 2009 Als Dissertation genehmigt von der Technischen Fakultät der Friedrich-Alexander-Universität Erlangen-Nürnberg Tag der Einreichung: 07. Dezember 2009 Tag der Promotion: 12. February 2010 Dekan: Prof. Dr.-Ing. Reinhard German Berichterstatter: Prof. Dr.-Ing. Villy Baek Iversen Prof. Dr.-Ing. Wolfgang Koch To my husband Denis and my sons Konstantin and Maxim Acknowledgment First of all, I would like to thank my supervisor Prof. Wolfgang Koch, for giving me the opportunity to pursue my Ph.D. at his Institute of Mobile Communication and for providing an environment where it was a pleasure to work. I am grateful to him for the fruitful discussions on my work, for his continued support and faith in the success of my research. I am indebted to Prof. Villy Baek Iversen for his kind-hearted mentoring, for reviewing my thesis, and for making my memorable stay at Technical University of Denmark, Lyngby, possible. I am very grateful to Dr. Wolfgang Gerstacker for his interest in my work, for his great encouragement, and for finding time to participate in the defense of this work. I would also like to thank all my colleagues at the Telecommunications Laboratory in Erlangen for creating pleasant and humorous atmosphere. Special thanks go to my roommate Armin Schmidt, for interesting scientific and non- scientific discussions, as well as for his technical LaTeX support. Finally, I would like to give thanks to my parents, Liudmila and Nikolay for their con- tinued love and support. And my deepest thanks I owe to my husband, Denis, who tireless supported me to the realization of my thesis, for his patience and love. Contents Introduction 1 Contribution of the Thesis 3 Einführung 5 Zusammenfassung 7 1. Universal Mobile Telecommunications System (UMTS) 9 1.1. SystemArchitecture ................................ 9 1.2. WCDMAConcept ................................... 10 1.3. RadioResourceManagement............................ 12 1.4. Techniques for Radio Resource Utilization . 13 1.4.1. PowerControl ................................ 13 1.4.2. Handover Control . 14 1.4.3. Call Admission Control . 14 1.4.4. Congestion Control . 14 1.5. Summary . 15 Part I. Traffic Modeling for Wireless Networks 17 2. Traffic Concepts and Models 19 2.1. MathematicalBackground: BasicModel . 19 2.1.1. Birth-DeathProcess ............................. 19 2.2. Markovian Queuing Systems . 21 2.2.1. M/M/1System................................ 22 2.2.2. Erlang’s Loss System . 24 2.2.2.1. Blocked-Call-Cleared – Erlang B . 25 2.3. Traffic Models for Wireless Networks . 26 2.3.1. General Remarks on Existing Traffic Models: Drawbacks and Chal- lenges ..................................... 26 2.4. Summary . 29 3. Connection Level Performance Modelling for Multi-Rate Loss System with WCDMA Radio Interface 31 3.1. Motivation ....................................... 31 3.2. SingleCellCapacityModel ........................... 32 3.3. Connection dependent Model with Transmission Rate Reduction Policy . 33 3.4. Multi-CellCapacityModel. 37 viii Contents 3.4.1. Restricted Network Accessibility - Modeling of Other-Cell Inter- ference..................................... 38 3.4.2. Proposed algorithm . 39 3.5. AnalyticalSystemPerformance. 43 3.5.1. Performance evaluation analysis . 43 3.6. Summary . 45 4. Joint Connection and Packet Level Analysis for Multi-Rate Loss System with WCDMA Radio Interface 47 4.1. MotivationandRelatedWork. 47 4.2. Multi-CellTwo-LevelCapacityModel . 48 4.2.1. Connection Level . 49 4.2.2. A Novel Model for Packet Level Performance Evaluation . 49 4.2.2.1. Blocked-Call-Held (BCH) Model (Fry-Molina Model) at packetlevel ............................ 50 4.2.2.2. Blocked-Call-Interfered (BCI) . 52 4.2.3. Performance Measures . 54 4.3. PerformanceResults ................................ 56 4.3.1. Impact of the Traffic Mix . 56 4.3.2. Analyzing trends by load change . 58 4.3.3. Adjustment of loss rates at packet level . 59 4.3.4. Impact of the Activity Factor . 60 4.4. Summary . 61 5. Extended Analysis of Two-Level Performance Model for Multi-Rate Delay System with WCDMA Radio Interface 63 5.1. MotivationandRelatedWork. 63 5.1.1. On the Generality of the Algorithm . 63 5.2. Unified Analytical Traffic Model . 64 5.3. SystemPerformanceAnalysis. 66 5.3.1. CallAdmissionandHandlingPolicy . 66 5.3.2. Comparison of Blocked-Call-Buffered (BCB) model with Blocked- Call-Held(BCH) ............................... 67 5.3.3. Behavior of the System with Soft Blocking . 67 5.3.4. Probability of Getting Service without Priority Classes . 68 5.4. Summary . 70 Part II. Traffic Management for Wireless Networks 73 6. Mobile-to-Mobile: A Novel Concept for Spectrum Efficient Data Transfer in WCDMA 75 6.1. Motivation ....................................... 75 6.2. Cooperative Communications in Wireless Networks (General Concepts, Strategies,Principles) ............................... 77 6.3. Mobile-to-Mobile(M2M)Concept . 80 6.4. ConceptAnalysisandEvaluation. 83 6.4.1. Model Characteristics and Assumptions . 83 Contents ix 6.4.2. RadioInterfaceRestrictions . 83 6.4.3. M2M Propagation Model . 84 6.4.3.1. Pathloss and Shadowing . 84 6.4.3.2. Fading . 86 6.5. M2M-GroupOrganizationPolicy. 86 6.6. CooperativeDataTransferPolicy. 90 6.7. Performance Evaluation of M2M Data Transfer: Verification of Basic Func- tionality......................................... 94 6.7.1. Simulation Scenarios . 94 6.7.2. Traffic Model: Pure M2M File Transfer . 94 6.7.3. Performance Measures . 95 6.7.4. Comparison of M2M File with conventional UMTS Data Transmis- sion....................................... 95 6.7.5. ImpactofMulticastTechnique. 99 6.7.6. Impact of Group Update Interval . 100 6.7.7. Effect of the Restrictions in the Group Organization Policy . 101 6.8. Direct Mobile-to-Mobile Data Transfer for mixed traffic scenario with ser- vicedifferentiation ................................. 103 6.8.1. Traffic Model: Incorporating Speech User Population into the Model103 6.8.2. Simulation Scenarios . 103 6.8.3. Impact of Cross-Traffic on the M2M Performance: Uplink Interfer- ence.......................................104 6.8.4. Comparison of M2M File Dissemination and Conventional UMTS Data Transmission for Mixed Traffic Scenarios . 106 6.9. Dependability of Mobile-to-Mobile Data Transfer . 109 6.9.1. Practicallyrelevantschedulingpolicy . 109 6.9.2. Impact of Group Size on Inter-Group Interference . 110 6.9.3. Effect of Restricted base station (BS) Support . 112 6.10.Summary . 117 7. Enhanced Scheduling by Network Coding Supported M2M Data Transfer119 7.1. MotivationandRelatedWork. 119 7.2. NetworkCodingBasics.............................. 121 7.3. network coding (NC) applied to M2M Data Transfer . 123 7.4. NumericalResults.................................. 127 7.4.1. Simulation Environment . 127 7.4.2. Traffic Scenario . 128 7.4.3. Performance Measures . 129 7.4.4. Performance Comparison of Simple M2M Algorithm with network coding – mobile-to-mobile (NC-M2M) File Dissemination . 129 7.4.5. Impact of Extended M2M User Availability and Users’ Mobility . 130 7.4.6. Steady State System Performance . 132 7.4.7. Further Benefits of NC-M2M File Dissemination: Released Uplink . 132 7.5. Enhanced Network Coding for Operation on Data of Arbitrary Size . 134 7.5.1. Generations: Optimized Packet Combination . 134 7.6. NumericalResults.................................. 135 x Contents 7.6.1. Memory Requirements and Computational Complexity . 136 7.6.2. Analysis of Relationship between Different Figures of Merit . 137 7.6.2.1. Generation Distribution Strategy . 137 7.6.2.2. Generation Size and File Size . 138 7.6.2.3. Quality of Service (QoS) Requirements . 140 7.7. Efficient Large File Distribution in UMTS supported by Network Coded M2M Data Transfer with Multiple Generations . 142 7.7.1. Comparison of NC-MG-m2m File Sharing with Replicate-and-Forward M2M Data Dissemination . 142 7.7.1.1. Practical Issues . 144 7.8. Summary . 144 8. Conclusions 147 A. Kendall Notation 149 B. Binomial-Poisson-Pascal traffic (BPP) Paradigm 151 C. Convolution Algorithm 155 D. Advanced Propagation Models 157 List of Acronyms 161 List of Symbols 163 PartI.............................................. 163 PartII............................................. 164 List of Figures 165 List of Tables 169 Bibliography 171 Introduction The rapid growth of wireless multimedia services and their demand for high data rates put considerable load on the valuable and limited resources of cellular wireless net- works. The third generation of wireless networks makes use of the packet-switching technology to achieve higher efficiency and better utilization of the scarce radio re- sources. However, new opportunities entail new challenges. As the capabilities and flexibility of networks increase, the demand for radio resources becomes less homo- geneous. In order to provide services in a heterogeneous environment of 3G systems more efficiently, it is necessary to predict the limits of the traffic load such that upper bounds for probabilities of call blocking and packet dropping for all classes of demands can be maintained. Typically, the downlink is the potential bottleneck, since all data transmissions have to be organized by providing individual
Recommended publications
  • Measuring, Modelling and Understanding Internet Traffic
    PRODUCED ON ACID-FREE PAPER MEASURING, UNDERSTANDING AND MODELLING INTERNET TRAFFIC Nicolas Hohn SUBMITTED IN TOTAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY JULY 2004 DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING THE UNIVERSITY OF MELBOURNE AUSTRALIA A mes parents, pour leur amour, encouragement et constant support, sans qui rien ne serait. iii Abstract This thesis concerns measuring, understanding and modelling Internet traffic. We first study the origins of the statistical properties of Internet traffic, in particular its scaling behaviour, and propose a constructive model of packet traffic with physically motivated parameters. We base our analysis on a large amount of empirical data measured on different networks, and use a so called semi-experimental approach to isolate certain features of traffic we seek to model. These results lead to the choice of a particular Poisson cluster process, known as Bartlett-Lewis point process, for a new packet traffic model. This model has a small number of parameters with simple networking meaning, and is mathematically tractable. It allows us to gain valuable insight on the underlying mechanisms creating the observed statistics. In practice, Internet traffic measurements are limited by the very large amount of data generated by high bandwidth links. This leads us to also investigate traffic sampling strate- gies and their respective inversion methods. We argue that the packet sampling mechanism currently implemented in Internet routers is not practical when one wants to infer the sta- tistics of the full traffic from partial measurements. We advocate the use of flow sampling for many purposes. We show that such sampling strategy is much easier to invert and can give reasonable estimates of higher order traffic statistics such as distribution of number of packets per flow and spectral density of the packet arrival process.
    [Show full text]
  • Formative Evaluation of Optical Network Projects in Metropolitan Area
    D. »urepiÊ, I. Boπnjak, T. Bauk: Formative Evaluation of Optical Network Projects in Metropolitan Area DANKO »UREPI∆, B.Eng. Traffic Infrastructure Hrvatske telekomunikacije Review Planinska 1a, 10000 Zagreb, Republika Hrvatska U.D.C.: 629.052.3 IVAN BO©NJAK, D.Sc. Accepted: Jun. 23, 2003 Fakultet prometnih znanosti Approved: Dec. 15, 2003 VukeliÊeva 4, 10000 Zagreb, Republika Hrvatska TON»I BAUK, B.Eng. Hrvatske telekomunikacije Planinska 1a, 10000 Zagreb, Republika Hrvatska FORMATIVE EVALUATION OF OPTICAL NETWORK PROJECTS IN METROPOLITAN AREA ABSTRACT Unlike most of the old approaches to planning network facilities, we adapt new paradigm with for- The paper discusses the approach to formative and sum- mative evaluation where teletraffic engineering and mative evaluation of alternative solutions for next generation service management interact in different levels of optical access network. Unlike most of the old approaches systems description. Beyond the standardised techni- to planning of network facilities, we adapt the new paradigm cal solutions at the physical and logical layer, huge where teletraffic engineering and service management inter- act at different levels of systems description. The basic thesis work has to deliver effective solutions to customers is that formative traffic evaluation has to be the key part of and other stakeholders: network operators, service initial and ongoing project activities in deploying new tech- providers, vendors, local community, etc. nological solutions in urban telecommunications network. The basic thesis is that formative traffic evalua- Passive Optical Network (PON) is analysed as one effective tion has to be part of initial and ongoing project ac- solution because it satisfies the broadband traffic require- tivities in developing and deploying new solutions in ments with minimal amount of optical equipment and fiber metropolitan area access networks.
    [Show full text]
  • Network Traffic Modeling
    Chapter in The Handbook of Computer Networks, Hossein Bidgoli (ed.), Wiley, to appear 2007 Network Traffic Modeling Thomas M. Chen Southern Methodist University, Dallas, Texas OUTLINE: 1. Introduction 1.1. Packets, flows, and sessions 1.2. The modeling process 1.3. Uses of traffic models 2. Source Traffic Statistics 2.1. Simple statistics 2.2. Burstiness measures 2.3. Long range dependence and self similarity 2.4. Multiresolution timescale 2.5. Scaling 3. Continuous-Time Source Models 3.1. Traditional Poisson process 3.2. Simple on/off model 3.3. Markov modulated Poisson process (MMPP) 3.4. Stochastic fluid model 3.5. Fractional Brownian motion 4. Discrete-Time Source Models 4.1. Time series 4.2. Box-Jenkins methodology 5. Application-Specific Models 5.1. Web traffic 5.2. Peer-to-peer traffic 5.3. Video 6. Access Regulated Sources 6.1. Leaky bucket regulated sources 6.2. Bounding-interval-dependent (BIND) model 7. Congestion-Dependent Flows 7.1. TCP flows with congestion avoidance 7.2. TCP flows with active queue management 8. Conclusions 1 KEY WORDS: traffic model, burstiness, long range dependence, policing, self similarity, stochastic fluid, time series, Poisson process, Markov modulated process, transmission control protocol (TCP). ABSTRACT From the viewpoint of a service provider, demands on the network are not entirely predictable. Traffic modeling is the problem of representing our understanding of dynamic demands by stochastic processes. Accurate traffic models are necessary for service providers to properly maintain quality of service. Many traffic models have been developed based on traffic measurement data. This chapter gives an overview of a number of common continuous-time and discrete-time traffic models.
    [Show full text]
  • Ethernet LAN (Angolul Link Layer) NET
    Computer Networks Sándor Laki ELTE-Ericsson Communication Networks Laboratory ELTE FI – Department Of Information Systems [email protected] http://lakis.web.elte.hu Based on the slides of Laurent Vanbever. Further inspiration: Scott Shenker & Jennifer Rexford & Phillipa Gill Last week on Computer Networks Overview What is a network made of? Three main components End-points Switches Links Overview How to share network resources? Resource handling Two different approaches for sharing Reservation On-demand Reserve the needed Send data when needed bandwidth in advance Packet-level multiplexing Flow-level multiplexing Pros & Cons Pros Cons Predictable performance Low efficiency Bursty traffic Short flows Simple and fast switching Complexity of circuit establ./teard. once circuit established Increased delay New circuit is needed in case of failures Implementation Reservation On-demand Circuit-switching Packet-switching e.g. landline phone networks e.g. Internet Packets Overview How to organize the network? Tier-1 ISP Tier-1 ISP IXP Tier-2 ISP Tier-2 ISP Access ISP Access ISP This week How does communication happen? How do we characterize it? Briefly… The Internet should allow processes on different hosts to exchange data everything else is just commentary… Ok, but how to do that in a complex system like the Internet? University net Phone company CabelTV company Enterprise net To exchange data, Alice and Bob use a set of network protocols Alice Bob A protocol is like a conversational convention The protocol defines the order and rules the parties
    [Show full text]
  • Internet Research: Comments on Formulating the Problem
    Internet Research: Comments on Formulating the Problem Gathered by Sally Floyd, with contributions from Deborah Estrin, Greg Minshall, Vern Paxson, Lixia Zhang, and others. January 21, 1998 1 Introduction Development and deployment in the infrastructure is of necessity incremental. This note contains a discussion about formulating the research Explicit examined assumptions are better than implicit un- problem for Internet research. examined ones. The goal of this note is to further the discussion of implicit Changes in the Internet can be unanticipated and uncon- and explicit assumptions in network research. In particular, trolled. this note tries to articulate one such set of assumptions for In- The Internet architecture and scale make requirements for ternet research. Each of these assumptions is shared by some global consistency problematic. subset of the network research community, though perhaps Some research problems have their own natural time none of these assumptions are shared universally. The goal scales. of this paper is not to argue the validity of the assumptions, but to articulate them, to invite discussion of con¯icting or shared sets of assumptions, and to consider the implications 3 Discussion of the assumptions of these assumptions in formulating problems in Internet re- search. This process would aim for both a greater convergence Robustness is more important than ef®ciency. of underlying assumptions, and a more explicit and examined Robustness has been one of the great strengths of the Inter- discussion of those assumptions. net, integral to its design from the very beginning [Clark88]. In some sense, this note is in the tradition of Shenker et al.©s One of our overriding assumptions is that it is critical not to paper on ºPricing in Computer Networks: Reshaping the Re- subordinate robustness to the goal of more closely approxi- search Agendaº [Shenker96], which is a discussion about for- mating optimal ef®ciency.
    [Show full text]
  • Third Annual Workshop on Meteorological and Environmental Inputs to Aviation Systems
    National Aeronautics and Space Ad ministration NASA CP-2104 PROCEEDINGS: THIRD ANNUAL WORKSHOP ON METEOROLOGICAL AND ENVIRONMENTAL INPUTS TO AVIATION SYSTEMS APRIL 3-5,1979 UNIVERSITY OF TENNESSEE SPACE INSTITUTE EDITORS: DENNIS W. CAMP WALTER FROST FAA-RD-79-49 i APPROVAL PROCEEDINGS: THIRD ANNUAL WORKSHOP ON METEOROLOGICAL AND ENVIRONMENTAL INPUTS TO AVIATION SYSTEMS Edited by Dennis W. Camp and Walter Frost The i formation in this report has been reviewed for t chni a1 content. Review of any information concerning Department of Defense or nuclear energy activities or programs has been made by the MSFC Security Classification Officer. This report, in its entirety, has been deter- mined to be unclassified. ahcmCHARLES A. LUNDQUIST / Director, Space Sciences Laboratory TECHNICAL REPORT STANDARD TITLE PAGE 1 REPORT NO, 12 GOVERNNENT ACCESSION NO. 13 RECIPIENT’S CATALOG NO. Proceedings. Third Annual Workshop on Meteorological and Environmental Inputs to Aviation Systems 6 PERFORMING ORGANIZATION CODE The University of Tennessee Space Institute Tullahoma, Tennessee 37388 12 SPONSORING AGENCY NAME AND ADDRESS Conference Publicat ion istration, Washington, D C 20553 mospheric Administration, The proceedings of a workshop on meteorological and environmental inputs to aviation systems held at The University of Tennessee Space Institute, Tullahoma, Tennessee, Apr.11 3-5, 1979, are reported The workshop was jointly sponsored by NASA, NOAA, and FAA and brought together many disciplines of the aviation communities in round table discussions The
    [Show full text]
  • The Internet
    The Internet G iovanni N eglia U niversità di Palerm o 2006/2007 Slides by courtesy of prof. B ianchi G. Bianchi, G. Neglia Traditional approach to Internet Teaching 1. transmission technologies • physical carriers, modulation, etc 2. data link protocols • reliable transfer of bits from point to point 3. Packet switching • Historical perspective, then technologies, routing, protocols, finally IP 4. Packet forwarding • Glue IP routing with layer 2, ARP,... 5. Transport protocols, application protocols • In a rush!! (just a bit of TCP, HTTP, …) G. Bianchi, G. Neglia 1 A pproach adopted in this course (almost) Top-Down ° Applications are indeed important ° What you see is what you learn first ß Start focusing on internet application programming ° Notion of sockets (no Java programming this year) ° Transport layer as application developement platform ß Web as driving application ° Limited details on other apps G. Bianchi, G. Neglia Course objectives & limits ß O B J ECTIV ES : ° U nderstanding w hat type of netw ork the Internet really is. ° U nderstanding w hy protocols have been designed as they are ° achieving capability to respond to laym an (the m ost critical) questions ° know ing w hat to read, w hen tech problem s arise ß LIM ITS : ° Scope lim ited to “just” inter-netw orking; no netw orking (no m ention to w hat’s below the internet protocol – dealt w ith in past courses) ° Lim ited to basic classical Internet (no m ention to recent developem ents) G. Bianchi, G. Neglia 2 Teaching Material Book and notes ° Nicola Blefari Melazzi, dispense, versione 4.2 (in italian), 2003 • Available online • In progress (310 pages at the moment) ° James F.
    [Show full text]
  • Next‐Generation Firewall Performance Benchmarking Methodology Draft
    Next‐Generation Firewall Performance Benchmarking Methodology Draft draft‐balarajah‐bmwg‐ngfw‐performance‐02 IETF 101, London, March 20, 2018 Bala Balarajah / Carsten Rossenhövel Goals . Provide benchmarking terminology and methodology for next‐generation network security devices including . Next‐generation firewalls (NGFW) . Intrusion detection and prevention solutions (IDS/ IPS) . Unified threat management (UTM) . Web Application Firewalls (WAF) . Strongly improve the applicability, reproducibility and transparency of benchmarks . Align the test methodology with today's increasingly complex layer 7 application use cases Table of Contents (1) 1. Introduction 2. Requirements 3. Scope 4. Test Setup . Test Bed Configuration . DUT/SUT Configuration . Test Equipment Configuration 5. Test Bed Considerations 6. Reporting . Key Performance Indicators Table of Contents (2) 7. Benchmarking Tests 1. Throughput Performance With NetSecOPEN Traffic Mix 2. Concurrent TCP Connection Capacity With HTTP Traffic 3. TCP/HTTP Connections Per Second 4. HTTP Transactions Per Second 5. HTTP Throughput 6. HTTP Transaction Latency 7. Concurrent SSL/TLS Connection Capacity 8. SSL/TLS Handshake Rate 9. HTTPS Transactions Per Second 10. HTTPS Throughput Test Setup Aggregation Solution Aggregation Switch/Router Switch/Router (optional) Under Test (optional) Emulated Router(s) Emulated Router(s) (optional) (optional) Emulated Clients Emulated Servers Test Equipment Test Equipment Feature Profiles NGFW Initial NGFW Future NG‐IPS AD WAF BPS SSL Broker SSL Inspection x Intrusion (IPS/IPS) x Web Filtering X Antivirus x Anti Spyware x Anti Botnet x DLP x DDoS x Certificate Validation x Logging and Reporting x App Identification x Key Performance Indicator (KPI) Definitions . TCP Concurrent Connections . TCP Connection Setup Rate . Application Transaction Rate . TLS Handshake Rate .
    [Show full text]
  • Measurement and Modelling of Internet Traffic Over 2.5 and 3G Cellular Core Networks
    DISSERTATION Measurement and Modelling of Internet Traffic over 2.5 and 3G Cellular Core Networks ausgef¨uhrt zum Zwecke der Erlangung des akademischen Grades eines Doktors der technischen Wissenschaften eingereicht an der Technischen Universit¨at Wien Fakult¨at f¨ur Elektrotechnik und Informationstechnik von DI Philipp Svoboda Wanriglgasse 1/5 A-1160 Wien Osterreich¨ geboren am 25. M¨arz 1978 in Wien Matrikelnummer: 9825199 Wien, im November 2008 Begutachter: Univ. Prof. Dr. Markus Rupp Institut f¨ur Nachrichtentechnik und Hochfrequenztechnik Technische Universit¨at Wien Osterreich¨ Univ. Prof. Dr. Andreas Kassler Computer Science Department Karlstadt University Sweden Abstract HE task of modeling data traffic in networks is as old as the first commercial telephony systems. TIn the recent past in mobile telephone networks the focus has moved from voice to packet- switched services. The new cellular mobile networks of the third generation (UMTS) and the evolved second generation (GPRS) offer the subscriber the possibility of staying online everywhere and at any time. The design and dimensioning is well known for circuit switched voice systems, but not for mobile packet-switched systems. The terms user expectation, grade of service and so on need to be defined. To find these parameters it is important to have an accurate traffic model that delivers good traffic estimates. In this thesis we carried out measurements in a live 3G core network of an Austrian operator, in order to find appropriate models that can serve as a solid basis for traffic simulations. A requirement for this work was a measurement system, which is able to capture and decode network traffic on various interfaces of the mobile core network.
    [Show full text]
  • Multiplexing Traffic at the Entrance to Wide-Area Networks
    Multiplexing Traf®c at the Entrance to Wide-Area Networks RamoÂn CaÂceres Ph.D. Dissertation Report No. UCB/CSD 92/717 Computer Science Division University of California Berkeley CA 94720 December 1992 [email protected] -ii- Multiplexing Traf®c at the Entrance to Wide-Area Networks Copyright 1992 by RamoÂn CaÂceres - iii - A mis padres, Mon y Mirtha. -iv- Abstract Many application-level traf®c streams, or conversations, are multiplexed at the points where local-area networks meet the wide-area portion of an internetwork. Multiplexing policies and mechanisms acting at these points should provide good performance to each conversation, allocate network resources fairly among conversations, and make ef®cient use of network resources. In order to characterize wide-area network traf®c, we have analyzed traces from four Inter- net sites. We identify characteristics common to all conversations of each major type of traf®c, and ®nd that these characteristics are stable across time and geographic site. Our results contrad- ict many prevalent beliefs. For example, previous simulation models of wide-area traf®c have assumed bulk transfers ranging from 80 Kilobytes to 2 Megabytes of data. In contrast, we ®nd that up to 90% of all bulk transfers involve 10 Kilobytes or less. This and other ®ndings may affect results of previous studies and should be taken into account in future models of wide-area traf®c. We derive from our traces a new workload model for driving simulations of wide-area internetworks. It generates traf®c for individual conversations of each major type of traf®c.
    [Show full text]
  • UNITED STATES SECURITIES and EXCHANGE COMMISSION Washington, D.C
    UNITED STATES SECURITIES AND EXCHANGE COMMISSION Washington, D.C. 20549 - -------------------------------------------------------------------------------- FORM 10-K (Mark One) |X| ANNUAL REPORT PURSUANT TO SECTION 13 OR 15(d) OF THE SECURITIES EXCHANGE ACT OF 1934 [FEE REQUIRED] For the fiscal year ended December 31, 1996 OR | | TRANSITION REPORT PURSUANT TO SECTION 13 OR 15(d) OF THE EXCHANGE ACT OF 1934 [NO FEE REQUIRED] For the transition period from _______ to _______ Commission file number 0-19551 - -------------------------------------------------------------------------------- Atlantic Tele-Network, Inc. (Exact name of registrant as specified in its charter) Delaware Chase Financial Center (State or other jurisdiction of P.O. Box 1730 incorporation or organization) St. Croix, U.S. Virgin Islands (Address of principal executive offices) 00821 47-0728886 (Zip Code) I.R.S. Employer Identification No.) (809) 777-8000 (Registrant's telephone number, including area code) _______________________________________________ Securities registered pursuant to Section 12(b) of the Act: Name of each exchange on Title of each class which registered ---------------------------- ---------------------------- Common Stock, Par Value $.01 per Share American Stock Exchange Securities registered pursuant to Section 12(g) of the Act: Title of each class - ---------------------------- None _______________________________________ Indicate by check mark whether the registrant (1) has filed all reports required to be filed by Section 13 or 15(d) of the Securities
    [Show full text]
  • Teletraffic Engineering Course Brief and Outline
    f Electr o ica ol l a School of Electrical and Information Engineering o h n c d S University of the Witwatersrand, Johannesburg I n g f n o i r r m ee at in ion Eng ELEN7015 { Teletraffic Engineering Course Brief and Outline: 2015 Course Lecturer: Dr L. Cheng Room: CM4 380 Tel: 011 7177228 Email: [email protected] 1 Course Background and Purpose Teletraffic engineering, based on teletraffic theory, provides the means to analyse, design and monitor networks to ensure that the networks carry end user and signalling information to the satisfaction of end users. Teletraffic started early in the history of telephony with a Danish School- master wondering about the capacity of the village telephone exchange. As switched circuits grew in complexity, a large body of theory and practice emerged for engineering telephone networks to carry voice traffic with acceptable quality of service using measures such as the probability of an attempt to make a call failing because all equipment is busy. With the emergence of packet switched networks the subject expanded. Approaches to engineering packet switched networks to carry user packets have much in common with switched circuit networks but required extensions. Engineering of packet networks for traffic also has its own nuances. Teletraffic theory is rooted in probability. Ideally, the student should be well versed in probability concepts. However, as this is often not the case, the course is structure with the opportunity to learn or refresh key concepts in probablity and to reinforce this learning through computer exercises. 2 Course Outcomes By the end of the course the student will demonstrate ability to: 1.
    [Show full text]