181 research outputs found
Performance enhancement of large scale networks with heterogeneous traffic.
Finally, these findings are applied towards improving the performance of the Differentiated Services architecture by developing a new Refined Assured Forwarding framework where heterogeneous traffic flows share the same aggregate class. The new framework requires minimal modification to the existing Diffserv routers. The efficiency of the new architecture in enhancing the performance of Diffserv is demonstrated by simulation results under different traffic scenarios.This dissertation builds on the notion that segregating traffic with disparate characteristics into separate channels generally results in a better performance. Through a quantitative analysis, it precisely defines the number of classes and the allocation of traffic into these classes that will lead to optimal performance from a latency standpoint. Additionally, it weakens the most generally used assumption of exponential or geometric distribution of traffic service time in the integration versus segregation studies to date by including self-similarity in network traffic.The dissertation also develops a pricing model based on resource usage in a system with segregated channels. Based on analytical results, this dissertation proposes a scheme whereby a service provider can develop compensatory and fair prices for customers with varying QoS requirements under a wide variety of ambient traffic scenarios.This dissertation provides novel techniques for improving the Quality of Service by enhancing the performance of queue management in large scale packet switched networks with a high volume of traffic. Networks combine traffic from multiple sources which have disparate characteristics. Multiplexing such heterogeneous traffic usually results in adverse effects on the overall performance of the network
An Analytical Model for the Hybrid PQ-WFQ Scheduling Scheme for WiMAX Networks
Abstract-The provisioning of differentiated QoS is an important objective in the design and implementation of IEEE 802.16/WiMAX-based broadband wireless networks. To this end, the hybrid scheduling mechanism that combines various fundamental scheduling principles, e.g., priority queueing (PQ), earliest deadline first (EDF), weight fair queue (WFQ), and round robin (RR) within a hierarchical structure for bandwidth and buffer sharing has been proposed to support the differential QoS requirements in WiMAX networks. This paper proposes analytical models for the hybrid scheduling scheme that integrates PQ and WFQ in the presence of non-bursty Poisson arrival process and bursty Markov Modulate Poisson Process (MMPP), respectively. We derive the expressions for the performance metrics including the mean number of packets in the queue, throughput, mean queueing delay and packet loss probability, and fairness of individual traffic flows. The model is adopted to investigate the effects of the weight of the WFQ policy and traffic burstiness on the performance of the hybrid scheduling system
Queueing-Theoretic End-to-End Latency Modeling of Future Wireless Networks
The fifth generation (5G) of mobile communication networks is envisioned to enable a variety of novel applications. These applications demand requirements from the network, which are diverse and challenging. Consequently, the mobile network has to be not only capable to meet the demands of one of these applications, but also be flexible enough that it can be tailored to different needs of various services. Among these new applications, there are use cases that require low latency as well as an ultra-high reliability, e.g., to ensure unobstructed production in factory automation or road safety for (autonomous) transportation. In these domains, the requirements are crucial, since violating them may lead to financial or even human damage. Hence, an ultra-low probability of failure is necessary.
Based on this, two major questions arise that are the motivation for this thesis. First, how can ultra-low failure probabilities be evaluated, since experiments or simulations would require a tremendous number of runs and, thus, turn out to be infeasible. Second, given a network that can be configured differently for different applications through the concept of network slicing, which performance can be expected by different parameters and what is their optimal choice, particularly in the presence of other applications.
In this thesis, both questions shall be answered by appropriate mathematical modeling of the radio interface and the radio access network. Thereby the aim is to find the distribution of the (end-to-end) latency, allowing to extract stochastic measures such as the mean, the variance, but also ultra-high percentiles at the distribution tail. The percentile analysis eventually leads to the desired evaluation of worst-case scenarios at ultra-low probabilities. Therefore, the mathematical tool of queuing theory is utilized to study video streaming performance and one or multiple (low-latency) applications. One of the key contributions is the development of a numeric algorithm to obtain the latency of general queuing systems for homogeneous as well as for prioritized heterogeneous traffic. This provides the foundation for analyzing and improving end-to-end latency for
applications with known traffic distributions in arbitrary network topologies and consisting of one or multiple network slices.Es wird erwartet, dass die fünfte Mobilfunkgeneration (5G) eine Reihe neuartiger Anwendungen ermöglichen wird. Allerdings stellen diese Anwendungen sowohl sehr unterschiedliche als auch überaus herausfordernde Anforderungen an das Netzwerk. Folglich muss das mobile Netz nicht nur die Voraussetzungen einer einzelnen Anwendungen erfüllen, sondern auch flexibel genug sein, um an die Vorgaben unterschiedlicher Dienste angepasst werden zu können. Ein Teil der neuen Anwendungen erfordert hochzuverlässige Kommunikation mit niedriger Latenz, um beispielsweise unterbrechungsfreie Produktion in der Fabrikautomatisierung oder Sicherheit im (autonomen) Straßenverkehr zu gewährleisten. In diesen Bereichen ist die Erfüllung der gestellten Anforderungen besonders kritisch, da eine Verletzung finanzielle oder sogar personelle Schäden nach sich ziehen könnte. Eine extrem niedrige Ausfallwahrscheinlichkeit ist daher von größter Wichtigkeit.
Daraus ergeben sich zwei wesentliche Fragestellungen, welche diese Arbeit motivieren. Erstens, wie können extrem niedrige Ausfallwahrscheinlichkeiten evaluiert werden. Ihr Nachweis durch Experimente oder Simulationen würde eine extrem große Anzahl an Durchläufen benötigen und sich daher als nicht realisierbar herausstellen. Zweitens, welche Performanz ist für ein gegebenes Netzwerk durch unterschiedliche Konfigurationen zu erwarten und wie kann die optimale Konfiguration gewählt werden. Diese Frage ist insbesondere dann interessant, wenn mehrere Anwendungen gleichzeitig bedient werden und durch sogenanntes Slicing für jeden Dienst unterschiedliche Konfigurationen möglich sind.
In dieser Arbeit werden beide Fragen durch geeignete mathematische Modellierung der Funkschnittstelle sowie des Funkzugangsnetzes (Radio Access Network) adressiert. Mithilfe der Warteschlangentheorie soll die stochastische Verteilung der (Ende-zu-Ende-) Latenz bestimmt werden. Dies liefert unterschiedliche stochastische Metriken, wie den Erwartungswert, die Varianz und insbesondere extrem hohe Perzentile am oberen Rand der Verteilung. Letztere geben schließlich Aufschluss über die gesuchten schlimmsten Fälle, die mit sehr geringer Wahrscheinlichkeit eintreten können. In der Arbeit werden Videostreaming und ein oder mehrere niedriglatente Anwendungen untersucht. Zu den wichtigsten Beiträgen zählt dabei die Entwicklung einer numerischen Methode, um die Latenz in allgemeinen Warteschlangensystemen für homogenen sowie für priorisierten heterogenen Datenverkehr zu bestimmen. Dies legt die Grundlage für die Analyse und Verbesserung von Ende-zu-Ende-Latenz für Anwendungen mit bekannten Verkehrsverteilungen in beliebigen Netzwerktopologien mit ein oder mehreren Slices
Renegotiation based dynamic bandwidth allocation for selfsimilar VBR traffic
The provision of QoS to applications traffic depends heavily on how different traffic types are categorized and classified, and how the prioritization of these applications are managed. Bandwidth is the most scarce network resource. Therefore, there is a need for a method or system that distributes an available bandwidth in a network among different applications in such a way that each class or type of traffic receives their constraint QoS requirements.
In this dissertation, a new renegotiation based dynamic resource allocation method for variable bit rate (VBR) traffic is presented. First, pros and cons of available off-line methods that are used to estimate selfsimilarity level (represented by Hurst parameter) of a VBR traffic trace are empirically investigated, and criteria to select measurement parameters for online resource management are developed. It is shown that wavelet analysis based methods are the strongest tools in estimation of Hurst parameter with their low computational complexities, compared to the variance-time method and R/S pox plot. Therefore, a temporal energy distribution of a traffic data arrival counting process among different frequency sub-bands is considered as a traffic descriptor, and then a robust traffic rate predictor is developed by using the Haar wavelet analysis. The empirical results show that the new on-line dynamic bandwidth allocation scheme for VBR traffic is superior to traditional dynamic bandwidth allocation methods that are based on adaptive algorithms such as Least Mean Square, Recursive Least Square, and Mean Square Error etc. in terms of high utilization and low queuing delay. Also a method is developed to minimize the number of bandwidth renegotiations to decrease signaling costs on traffic schedulers (e.g. WFQ) and networks (e.g. ATM). It is also quantified that the introduced renegotiation based bandwidth management scheme decreases heavytailedness of queue size distributions, which is an inherent impact of traffic self similarity.
The new design increases the achieved utilization levels in the literature, provisions given queue size constraints and minimizes the number of renegotiations simultaneously. This renegotiation -based design is online and practically embeddable into QoS management blocks, edge routers and Digital Subscriber Lines Access Multiplexers (DSLAM) and rate adaptive DSL modems
Quality-of-service management in IP networks
Quality of Service (QoS) in Internet Protocol (IF) Networks has been the subject of
active research over the past two decades. Integrated Services (IntServ) and
Differentiated Services (DiffServ) QoS architectures have emerged as proposed
standards for resource allocation in IF Networks. These two QoS architectures
support the need for multiple traffic queuing systems to allow for resource
partitioning for heterogeneous applications making use of the networks. There have
been a number of specifications or proposals for the number of traffic queuing
classes (Class of Service (CoS)) that will support integrated services in IF Networks,
but none has provided verification in the form of analytical or empirical investigation
to prove that its specification or proposal will be optimum.
Despite the existence of the two standard QoS architectures and the large volume of
research work that has been carried out on IF QoS, its deployment still remains
elusive in the Internet. This is not unconnected with the complexities associated with
some aspects of the standard QoS architectures. [Continues.
Performance evaluation of multicast networks and service differentiation mechanisms in IP networks
The performance of a communication network depends on how well the network is designed in terms of delivering the level of service required by a given type of traffic. The field of teletraffic theory is concerned with quantifying the three-way relationship between the network, its level of service and the traffic arriving at the network. In this thesis, we study three different problems concerning this three-way relationship and present models to assist in designing and dimensioning networks to satisfy the different quality of service demands.
In the first part of the thesis, we consider service differentiation mechanisms in packet-switched IP networks implementing a Differentiated Services (DiffServ) architecture. We study how bandwidth can be divided in a weighted fair manner between persistent elastic TCP flows, and between these TCP flows and streaming real-time UDP flows. To this end, we model the traffic conditioning and scheduling mechanisms on the packet and the flow level. We also model the interaction of these DiffServ mechanisms with the TCP congestion control mechanism and present closed-loop models for the sending rate of a TCP flow that reacts to congestion signals from the network.
In the second part, we concentrate on non-persistent elastic TCP traffic in IP networks and study how flows can be differentiated in terms of mean delay by giving priority to flows based on their age. We study Multi Level Processor Sharing (MLPS) disciplines, where jobs are classified into levels based on their age or attained service. Between levels, a strict priority discipline is applied; the level containing the youngest jobs has the highest priority. Inside a particular level, any scheduling discipline could be used. We present an implementation proposal of a two-level discipline, PS+PS, with the Processor Sharing discipline used inside both levels. We prove that, as long as the hazard rate of the job-size distribution is decreasing, which is the case for Internet traffic, PS+PS, and any MLPS discipline that favors young jobs, is better than PS with respect to overall mean delay.
In the final part, we study distribution-type streaming traffic in a multicast network, where there is, at most, one copy of each channel transmission in each network link, and quantify the blocking probability. We derive an exact blocking probability algorithm for multicast traffic in a tree network based on the convolution and truncation algorithm for unicast traffic. We present a new convolution operation, the OR-convolution, to suit the transmission principle of multicast traffic, and a new truncation operator to take into account the case of having both unicast and multicast traffic in the network. We also consider different user models derived from the single-user model.reviewe
Analytical evaluation of multicast packet delivery and user clustering schemes in high-speed cellular networks
International audienceTransmission on data-oriented radio interfaces of cellular networks has been primarily designed for unicast applications. Nevertheless, unicast may not optimize the resource usage when the same content has to be transmitted to several users in the same cell. In this context, multicast seems to be an efficient means to convey data. In this paper, we develop an analytical model that allows the computation of the mean bitrate for both multicast and multiple-unicast transmission schemes. Furthermore, we propose a multicast transmission scheme called the equal-bitrate (EB) algorithm that allocates bandwidth to mobiles according to their instantaneous channel quality. We compare it to adaptations of the well-known Max-SNR and Round Robin (RR) to multicast. We propose to group users into clusters. The clustering method combines multicast and unicast transmission schemes according to the userÂ’s average channel conditions.We use the analytical model to evaluate the proposed solutions. We compare the resulting performance against pure multicast and multiple-unicast approaches. We show that EB algorithm offers a good trade-off between throughput and fairness. Also, we show that mixed clustering achieves good performance compared to conventional clustering methods
Recommended from our members
Intelligent based Packet Scheduling Scheme using Internet Protocol/Multi-Protocol Label Switching (IP/MPLS) Technology for 5G. Design and Investigation of Bandwidth Management Technique for Service-Aware Traffic Engineering using Internet Protocol/Multi-Protocol Label Switching (IP/MPLS) for 5G
Multi-Protocol Label Switching (MPLS) makes use of traffic engineering (TE)
techniques and a variety of protocols to establish pre-determined highly
efficient routes in Wide Area Network (WAN). Unlike IP networks in which
routing decision has to be made through header analysis on a hop-by-hop
basis, MPLS makes use of a short bit sequence that indicates the forwarding
equivalence class (FEC) of a packet and utilises a predefined routing table to
handle packets of a specific FEC type. Thus header analysis of packets is not
required, resulting in lower latency. In addition, packets of similar
characteristics can be routed in a consistent manner. For example, packets
carrying real-time information can be routed to low latency paths across the
networks. Thus the key success to MPLS is to efficiently control and distribute
the bandwidth available between applications across the networks.
A lot of research effort on bandwidth management in MPLS networks has
already been devoted in the past. However, with the imminent roll out of 5G,
MPLS is seen as a key technology for mobile backhaul. To cope with the 5G
demands of rich, context aware and multimedia-based user applications, more
efficient bandwidth management solutions need to be derived.
This thesis focuses on the design of bandwidth management algorithms, more
specifically QoS scheduling, in MPLS network for 5G mobile backhaul. The
aim is to ensure the reliability and the speed of packet transfer across the
network. As 5G is expected to greatly improve the user experience with
innovative and high quality services, users’ perceived quality of service (QoS)
needs to be taken into account when deriving such bandwidth management
solutions. QoS expectation from users are often subjective and vague. Thus
this thesis proposes the use of fuzzy logic based solution to provide service aware and user-centric bandwidth management in order to satisfy
requirements imposed by the network and users.
Unfortunately, the disadvantage of fuzzy logic is scalability since dependable
fuzzy rules and membership functions increase when the complexity of being
modelled increases. To resolve this issue, this thesis proposes the use of neuro-fuzzy to solicit interpretable IF-THEN rules.The algorithms are
implemented and tested through NS2 and Matlab simulations. The
performance of the algorithms are evaluated and compared with other
conventional algorithms in terms of average throughput, delay, reliability, cost,
packet loss ratio, and utilization rate.
Simulation results show that the neuro-fuzzy based algorithm perform better
than fuzzy and other conventional packet scheduling algorithms using IP and
IP over MPLS technologies.Tertiary Education Trust Fund (TETFUND
Building a Digital Twin for network optimization using graph neural networks
Network modeling is a critical component of Quality of Service (QoS) optimization. Current networks implement Service Level Agreements (SLA) by careful configuration of both routing and queue scheduling policies. However, existing modeling techniques are not able to produce accurate estimates of relevant SLA metrics, such as delay or jitter, in networks with complex QoS-aware queueing policies (e.g., strict priority, Weighted Fair Queueing, Deficit Round Robin). Recently, Graph Neural Networks (GNNs) have become a powerful tool to model networks since they are specifically designed to work with graph-structured data. In this paper, we propose a GNN-based network model able to understand the complex relationship between the queueing policy (scheduling algorithm and queue sizes), the network topology, the routing configuration, and the input traffic matrix. We call our model TwinNet, a Digital Twin that can accurately estimate relevant SLA metrics for network optimization. TwinNet can generalize to its input parameters, operating successfully in topologies, routing, and queueing configurations never seen during training. We evaluate TwinNet over a wide variety of scenarios with synthetic traffic and validate it with real traffic traces. Our results show that TwinNet can provide accurate estimates of end-to-end path delays in 106 unseen real-world topologies, under different queuing configurations with a Mean Absolute Percentage Error (MAPE) of 3.8%, as well as a MAPE of 6.3% error when evaluated with a real testbed. We also showcase the potential of the proposed model for SLA-driven network optimization and what-if analysis.This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020-118011GB-C21), funded by MCIN/ AEI/, Spain10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA), Spain and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia, Spain and the European Social Fund.Peer ReviewedPostprint (published version
A VOICE PRIORITY QUEUE (VPQ) SCHEDULER FOR VOIP OVER WLANs
The Voice over Internet Protocol (VoIP) application has observed the fastest
growth in the world of telecommunication. The Wireless Local Area Network
(WLAN) is the most assuring of technologies among the wireless networks, which
has facilitated high-rate voice services at low cost and good flexibility. In a voice
conversation, each client works as a sender and as a receiver depending on the
direction of traffic flow over the network.
A VoIP application requires a higher throughput, less packet loss and a higher
fairness index over the network. The packets of VoIP streaming may experience drops
because of the competition among the different kinds of traffic flow over the network.
A VoIP application is also sensitive to delay and requires the voice packets to arrive
on time from the sender to the receiver side without any delay over WLANs.
The scheduling system model for VoIP traffic is still an unresolved problem. A
new traffic scheduler is necessary to offer higher throughput and a higher fairness
index for a VoIP application. The objectives of this thesis are to propose a new
scheduler and algorithms that support the VoIP application and to evaluate, validate
and verify the newly proposed scheduler and algorithms with the existing scheduling
algorithms over WLANs through simulation and experimental environment.
We proposed a new Voice Priority Queue (VPQ) scheduling system model and
algorithms to solve scheduling issues. VPQ system model is implemented in three
stages. The first stage of the model is to ensure efficiency by producing a higher
throughput and fairness for VoIP packets. The second stage will be designed for
bursty Virtual-VoIP Flow (Virtual-VF) while the third stage is a Switch Movement
(SM) technique. Furthermore, we compared the VPQ scheduler with other well
known schedulers and algorithms. We observed in our simulation and experimental
environment that the VPQ provides better results for the VoIP over WLANs
- …