Packet backbone design differences between commercial network and Container Trial System of LTE/SAE

The mobile networks of earlier and current generations, or 2G and 3G networks, provide users voice and packet services with higher transmission rates and good quality over the same core network. When developing the next generation of mobile networks the current quality of services needs to be maintained. This thesis concentrates on the next generation mobile network, especially on the evolution of the packet network part. The new mobile network has requirements for the common packet backbone network, Mobile Packet Backbone Network, which is additionally discussed in this study. The next generation mobile network, called LTE/SAE, is currently under testing. The test system is called Container Trial System. It is a mini sized LTE/SAE site. The LTE/SAE is studied in this thesis concentrating on the evolved packet core, the SAE part of the composition. The empirical part of the study compares the LTE/SAE Container Trial System and commercial network designs and additionally produces documentation for internal personnel and customers. The research is performed by comparing the documentations and specifications of both the Container Trial System and commercial network. Since the LTE commercial network is not yet constructed, the comparison is done theoretically. The purpose is furthermore to find out if there are any design issues that could be done differently in the next version of the Container Trial System.

VoIP Traffic Shaping Analyses in Metropolitan Area Networks

This paper represents VoIP shaping analyses in devices that apply the three Quality of Service techniques – IntServ, DiffServ and RSVP. The results show queue management and packet stream shaping based on simulation of the three mostly demanded services – VoIP, LAN emulation and transaction exchange. Special attention is paid to the VoIP as the most demanding service for real time communication.

Quality of Service System Approximation in IP Networks

This paper is sponsored by the Ministry of Education and Research of the Republic of Bulgaria in the framework of project No 105 “Multimedia Packet Switching Networks Planning with Quality of Service and Traffic Management”.

A scheme for synchronizing clocks connected by a packet communication network

Consider a communication system in which a transmitter equipment sends fixed-size packets of data at a uniform rate to a receiver equipment. Consider also that these equipments are connected by a packet-switched network, which introduces a random delay to each packet. Here we propose an adaptive clock recovery scheme able of synchronizing the frequencies and the phases of these devices, within specified limits of precision. This scheme for achieving frequency and phase synchronization is based on measurements of the packet arrival times at the receiver, which are used to control the dynamics of a digital phase-locked loop. The scheme performance is evaluated via numerical simulations performed by using realistic parameter values. (C) 2011 Elsevier By. All rights reserved.

Reduced waiting times using a fast switching dual-polarization DDQPSK receiver in a packet switched network

In this paper, we demonstrate a fast switching dual polarization DDQPSK packet switched receiver with very short waiting times. The system employs mth power DDQPSK decoding for high frequency offset tolerance, and Stokes parameter estimation for robust polarization demultiplexing.

Implementation of a Control Loop Experiment in a Network-Based Control System With LonWorks Technology and IP Networks

Considering the increasing popularity of network-based control systems and the huge adoption of IP networks (such as the Internet), this paper studies the influence of network quality of service (QoS) parameters over quality of control parameters. An example of a control loop is implemented using two LonWorks networks (CEA-709.1) interconnected by an emulated IP network, in which important QoS parameters such as delay and delay jitter can be completely controlled. Mathematical definitions are provided according to the literature, and the results of the network-based control loop experiment are presented and discussed.

A Random Access Protocol incorporating Multi-Packet Reception, Retransmission Diversity and Successive Interference Cancellation

8th International Workshop on Multiple Access Communications (MACOM2015), Helsinki, Finland.

Multipath policy routing in packet switched networks

Dissertação apresentada para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Enhancing MPLS QoS routing algorithms by using the network protection degree paradigm

IP based networks still do not have the required degree of reliability required by new multimedia services, achieving such reliability will be crucial in the success or failure of the new Internet generation. Most of existing schemes for QoS routing do not take into consideration parameters concerning the quality of the protection, such as packet loss or restoration time. In this paper, we define a new paradigm to develop new protection strategies for building reliable MPLS networks, based on what we have called the network protection degree (NPD). This NPD consists of an a priori evaluation, the failure sensibility degree (FSD), which provides the failure probability and an a posteriori evaluation, the failure impact degree (FID), to determine the impact on the network in case of failure. Having mathematical formulated these components, we point out the most relevant components. Experimental results demonstrate the benefits of the utilization of the NPD, when used to enhance some current QoS routing algorithms to offer a certain degree of protection

Admission Control for TCP Flows Using Packet Classes and Edge-to-edge Measurements of Aggregates

TCP flows from applications such as the web or ftp are well supported by a Guaranteed Minimum Throughput Service (GMTS), which provides a minimum network throughput to the flow and, if possible, an extra throughput. We propose a scheme for a GMTS using Admission Control (AC) that is able to provide different minimum throughput to different users and that is suitable for "standard" TCP flows. Moreover, we consider a multidomain scenario where the scheme is used in one of the domains, and we propose some mechanisms for the interconnection with neighbor domains. The whole scheme uses a small set of packet classes in a core-stateless network where each class has a different discarding priority in queues assigned to it. The AC method involves only edge nodes and uses a special probing packet flow (marked as the highest discarding priority class) that is sent continuously from ingress to egress through a path. The available throughput in the path is obtained at the egress using measurements of flow aggregates, and then it is sent back to the ingress. At the ingress each flow is detected using an implicit way and then it is admission controlled. If it is accepted, it receives the GMTS and its packets are marked as the lowest discarding priority classes; otherwise, it receives a best-effort service. The scheme is evaluated through simulation in a simple "bottleneck" topology using different traffic loads consisting of "standard" TCP flows that carry files of varying sizes

All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching

All-optical label swapping (AOLS) forms a key technology towards the implementation of all-optical packet switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the way in which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This paper studies all-optical label stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this paper, an integer lineal program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more

WCDMA HSPA performance counters for monitoring 3G-radio access network

The objective of this project was to gather all the counters which are used on HSPA performance monitoring. The main purpose was to create a compact packet of HSPA performance counters and radio network monitoring which Ericsson's employees can then use in their daily work. The study includes a short introduction to the architecture of the 3G-radio access network. The HSPA technology and HSPA performance are presented including a functional description of performance counters and KPIs, which are used for performance management and monitoring. The theory part of the study also covers an overview of performance management in OSS-RC. The final part of the study covers an overview of the performance management tools, in-troducing how the counters are represented in these interfaces. MOShell and OSS-RC are tools used in this study. Tools were selected because the MOShell is Ericsson's inter-nal management tool and OSS-RC is a tool designed for customers.

Mobility Management in Packet Switched Mobile Networks

Nykyisin matkaviestinverkot ovat osa jokapäiväistä elämää. Merkittävimpiä eroja kiinteiden ja matkaviestinverkkojen välillä on käyttäjän liikkuvuus, joka voidaan määritellä mahdollisuudeksi soittaa ja vastaanottaa puheluita missä ja milloin tahansa. Työ selittää termin liikkuvuus ja määrittää ongelmat, jotka täytyy ratkaista liikkuvuuden aikaansaamiseksi sekä tavat, joilla nämä ongelmat on ratkaistu matkaviestinverkoissa. Työ luo yleiskatsauksen liikkuvuuden aikaansaamisessa käytettäviin menetelmiin, joita ovat haku, sijainnin päivitys, sijainnin seuranta ja kanavan vaihto. Työ keskittyy liikkuvuuteen kolmannen sukupolven matkaviestinverkkojen paketti-kytkentäisessä osassa, esimerkkinä liikkuvuuden hallinta UMTS:ssa (Universal Mobile Telecommunications System). Erot paketti- ja piirikytkentäisen osan välillä tuodaan esille ja selitetään. Jotta käyttäjät ja heidän päätteensä voisivat liikkua, tiedon täytyy kulkea verkon eri osien välillä. Merkinanto verkkoelementtien välillä ja liikkuvuuden mahdollistavien toimenpiteiden suoritus tehdään yhteyskäytännön avulla. Työ kuvaa yhteyskäytännöt, jotka ovat osallisena liikkuvuuden tarjontaan. Painopiste on GPRS:n liikkuvuuden-hallintayhteyskäytännössä, GMM:ssä. GMM protokollan prototyypin toteutus on esitetty työn käytännön osassa.

Managing Packet Data (Sessions) in 3G Mobile Networks

Tällä hetkellä kolmannen sukupolven matkapuhelinjärjestelmät ovat siirtyneet kaupalliseen vaiheeseen. Universal Mobile Telecommunication System (UMTS) on eräs kolmannen sukupolven matkapuhelinjärjestelmä, jota tullaan käyttämään Euroopassa. Diplomityön päämääränä on tutkia, kuinka pakettivälitteistä tiedonsiirtoa hallitaan UMTS - verkoissa. Diplomityö antaa yleiskuvan toisen sukupolven matkapuhelinjärjestelmien datapalveluiden kehityksestä kolmannen sukupolven nopeisiin matkapuhelinjärjestelmiin. Pakettivälitteisen verkon verkkoarkkitehtuuri on esitetty sekä sen, diplomityön kannalta, tärkeimpien osien toiminnallisuus on selvitetty. Myös pakettipohjaisten datayhteyksien eli istuntojen muodostaminen ja vapauttaminen sekä aktiivisen yhteyden ominaisuuksien muokkaaminen on esitetty tässä diplomityössä. Yhteydenhallintaprotokolla, Session Management (SM), on yksi protokolla, joka osallistuu pakettidatayhteyden hallintaan. SM -protokolla on käsitelty työssä yksityiskohtaisesti. SM -protokollan SDL toteutus on esitetty diplomityön käytännönosassa