Bandwidth sensitive routing in diffServ networks with heterogeneous bandwidth requirements

This paper studies the problem of finding optimal routes for premium class traffic in a DiffServ network such that (1) loop-freedom is guaranteed in the entire network under hop-by-hop routing assumption; and (2) the maximum relative congestion among all links is minimized. This problem is called the Extended Optimal Premium Routing (eOPR) problem, which is proven to be NP-hard. We use the integer programming method to mathematically formulate the eOPR problem and find the optimal solutions for small scale networks. We also study heuristic algorithms in order to handle large scale networks. Simulation results are compared with the optimal solutions obtained by solving the integer programming models. The results show that the Bandwidth-inversion Shortest Path (BSP) algorithm can be a good candidate to route premium traffic in DiffServ networks.published_or_final_versio

Quality of service assurance for the next generation Internet

The provisioning for multimedia applications has been of increasing interest among researchers and Internet Service Providers. Through the migration from resource-based to service-driven networks, it has become evident that the Internet model should be enhanced to provide support for a variety of differentiated services that match applications and customer requirements, and not stay limited under the flat best-effort service that is currently provided. In this paper, we describe and critically appraise the major achievements of the efforts to introduce Quality of Service (QoS) assurance and provisioning within the Internet model. We then propose a research path for the creation of a network services management architecture, through which we can move towards a QoS-enabled network environment, offering support for a variety of different services, based on traffic characteristics and user expectations

A traffic engineering system for DiffServ/MPLS networks

This thesis presents an approach to traffic engineering that uses DiffServ and MPLS technologies to provide QoS guarantees over an IP network. The specific problem described here is how best to route traffic within the network such that the demands can be carried with the requisite QoS while balancing the load on the network. A traffic engineering algorithm that determines QoS guaranteed label-switched paths (LSPs) between specified ingress-egress pairs is proposed and a system that uses such an algorithm is outlined. The algorithm generates a solution for the QoS routing problem of finding a path with a number of constraints (delay, jitter, loss) while trying to make best of resource utilisation. The key component of the system is a central resource manager responsible for monitoring and managing resources within the network and making all decisions to route traffic according to QoS requirements. The algorithm for determining QoS-constrained routes is based on the notion of effective bandwidth and cost functions for load balancing. The network simulation of the proposed system is presented here and simulation results are discussed

Quality Of Service Enhancement In Ip Based Networks Using Diffserv

Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2003Thesis (M.Sc.) -- İstanbul Technical University, Institute of Science and Technology, 2003Bu çalışmada, Diffserv mimarisi ile internet üzerinde servis kalitesi sağlama tartışılmıştır. Son on yılda IP tabanlı internette servis kalitesi sağlanamıyordu. İnternette bugün sağlanabilen tek servis ‘Best Effort (BE)’ adı verilen servistir. Yani, ağ, herhangi bir paketi hedefine ulaştırırken mümkün olan en verimli yolu kullanır ancak herhangi bir garanti ya da kaynak ayırımı yapmaz. Başka bir deyişle, trafik mümkün olduğu kadar hızlı ve herhangi bir zaman sınırı ya da miktar açısından garanti verilmeden işlenir. İnternetin ticari bir yapıya bürünmesiyle ‘Servis Kalitesi’ sağlanma ihtiyacı daha da artmıştır. Bu ihtiyaç farklı mimarilerin doğmasına yol açmıştır: IntServ ve DiffServ olmak üzere.Tez çalışmasında DiffServ mimarisi problem ve avantajlarıyla ele alınmıştır. Son bölümde ise NS2 ağ simulasyon yazılımı kullanılarak DiffServ implementasyonları yapılmış sonuçları karşılaştırmalı olarak verilmiştir.In this study improving Quality of Service (QoS) on the Internet with DiffServ architecture is discussed. Within the past decade, it is certainly not support for Quality of Service (QoS) over the IP-based ubiquitous Internet. The Internet as it stands today only support one service class called -Best-Effort (BE) Service. The network would make an earnest attempt to deliver packets to their destinations but with no guarantees and/or special resources allocated for any of the packets. With another words, traffic is processed as quickly as possible but there is no guarantee as to timeliness or actual delivery or even how much can be delivered (i.e. throughput). With the rapid transformation of the Internet into a commercial infrastructure, demands for Quality of Service (QoS) have rapidly developed. This need was resulted to different architectures: IntServ and DiffServ. In the study some DiffServ implementations are discussed with their problems and gains. At the last section with using NS2 simulation programming language some DiffServ implementations are given with the compared results.Yüksek LisansM.Sc

A novel approach to quality-of-service provisioning in trusted relay Quantum Key Distribution networks

In recent years, noticeable progress has been made in the development of quantum equipment, reflected through the number of successful demonstrations of Quantum Key Distribution (QKD) technology. Although they showcase the great achievements of QKD, many practical difficulties still need to be resolved. Inspired by the significant similarity between mobile ad-hoc networks and QKD technology, we propose a novel quality of service (QoS) model including new metrics for determining the states of public and quantum channels as well as a comprehensive metric of the QKD link. We also propose a novel routing protocol to achieve high-level scalability and minimize consumption of cryptographic keys. Given the limited mobility of nodes in QKD networks, our routing protocol uses the geographical distance and calculated link states to determine the optimal route. It also benefits from a caching mechanism and detection of returning loops to provide effective forwarding while minimizing key consumption and achieving the desired utilization of network links. Simulation results are presented to demonstrate the validity and accuracy of the proposed solutions.Web of Science28118116

Internet QoS for DiffServ-Enabled Routers

Differentiated Service Model (DiffServ) is currently a popular research topic as a low-cost method to bring QoS to today's Internet backbone network. In this paper, the author introduces the techniques and methodologies that used to design and implement DiffServ-enabled (DS-enabled) routers. The adaptations of DS-enabled routers are designed to cater to the low Internet connectivity within Universiti Teknologi PETRONAS LAN. The author has implemented basic DiffServ setting using three CISC03725 routers. Based on these DiffServ-enabled routers, the author set up a small scale lab network to study DiffServ QoS features: priority dropping (discrimination among different service classes), QoS guarantees and measuring QoS using various formal metrics (delay and throughput). Furthermore, the author present problems encountered during study, and the proposed solutions

A Survey of PCN-Based Admission Control and Flow Termination

Pre-congestion notification (PCN) provides feedback\ud about load conditions in a network to its boundary nodes. The PCN working group of the IETF discusses the use of PCN to implement admission control (AC) and flow termination (FT) for prioritized realtime traffic in a DiffServ domain. Admission control (AC) is a well-known flow control function that blocks admission requests of new flows when they need to be carried over a link whose admitted PCN rate already exceeds an admissible rate. Flow termination (FT) is a new flow control function that terminates some already admitted flows when they are carried over a link whose admitted PCN rate exceeds a supportable rate. The latter condition can occur in spite of AC, e.g., when traffic is rerouted due to network failures.\ud This survey gives an introduction to PCN and is a primer for\ud this new technology. It presents and discusses the multitude of architectural design options in an early stage of the standardization process in a comprehensive and streamlined way before only a subset of them is standardized by the IETF. It brings PCN from the IETF to the research community and serves as historical record