Internet usages have changed with the emergence of value added services relying on a higher interactivity and needs for a better quality of experience (QoE). Telecommunication operators have to face a continuing growth of new types of Internet traffic (video, games, telepresence, etc.) imposing not only a more efficient utilization of their network infrastructure resources, but also the generation of new revenues to pursue investments and sustain the increasing demand. Such services generally cross multiple domains, but inter-domain routing protocols still have some limitations in terms of service assurance. For example, BGP's single route announce for a destination limits potential traffic engineering features (e.g. no quality of service price/efficiency optimisation, inter-domain shared route protection, inter-domain load balancing, etc.). In order to provision end-to-end inter-domain connections that obey to constraints such as bandwidth, delay, jitter, and packet loss for these services, an interesting approach is to compute end-to-end (e2e) paths over multiple inter-domain routes. This will allow establishing more efficiently the inter-domain connections with respect to requested QoS constraints and sharing these constraints (and associated revenues) among multiple operators to globally accept more demands in the system, while keep satisfying the customer QoE. To address these challenges, we propose an efficient distributed inter-domain algorithm that computes such constrained paths among a set of domains, exploring multiple inter-domain routes. We demonstrate that our algorithm not only increases success rate in delivering feasible paths, but also admits more connections and keeps a reasonable runtime.

/pdf/distributed-e2e-qos-based-path-computation-algorithm-over-28tb5zfynq.pdf

Distributed E2E QoS-Based Path Computation Algorithm over Multiple Inter-domain Routes

This paper presents VLM+, a Virtual Link (VL) Embedding algorithm supporting Quality of Service (QoS). VLM+ has been developed evolving its Mixed Integer Programming (MIP) based Virtual Link Mapping algorithm precursor (VLM), whose analytical model has been enhanced including the ability to fulfill VL end-to-end QoS requirements and to prioritise VL requests according to their QoS class or revenue profile. Additionally, VLM+ supports three different physical resource sharing policies, this providing Physical Infrastructure Providers (PIPs) with high flexibility in the allocation of resources to embed QoS-constrained VLs. VLM+ has been designed and evaluated targeting next generation networks, conceived around SDN and NFV paradigms and expected to support, among others, delay critical services. VLM+ performance has been evaluated via simulation and compared to VLM, Shortest Path First (SPF) and Constrained SPF algorithms. Promising quantitative results demonstrate VLM+ ability to embed VLs fulfilling end-to-end QoS requirements, still achieving an efficient resource utilisation and at a moderate cost in terms of increased complexity and convergence time.

Virtual Link Mapping for delay critical services in SDN-enabled 5G networks

Service response time is considered as one of the most important quality parameters of a web service. This paper focuses on the microservices selection problem that how to select a service invocation path with the shortest response time. We propose a novel distributed microservices selection framework (DMSF) which is distributed and can be easily integrated into common microservices architectures. A distributed microservices selection algorithm (DMSA) is developed within the framework, which incorporates the aspects of both source routing algorithm and distributed routing algorithm. DMSF attempts to reduce the time complexity of service selection and communication overhead while ensuring the shortest response time. The experiment results show that DMSF outperforms the existing frameworks in terms of time complexity, communication overhead and response time.

A Shortest-Response-Time Assured Microservices Selection Framework

Computing inter-domain multiprotocol label switching traffic engineering label switched path MPLS-TE LSP through a pre-determined sequence of domains is quite straight as each path computation element PCE, using the backward recursive PCE-based computation BRPC, knows who is the next to be contacted in order to continue the computation. The optimality of the inter-domain MPLS-TE LSP path depends strongly on the choice of the pre-determined sequence of domains on which the calculation works. In this paper, we propose a novel procedure allowing a forward discovery of multiple inter-domain sequences and the computation of constrained inter-domain paths for MPLS-TE LSPs over these domains sequences. Other issues around the inter-domain path computation, such as route discovery and inter-domain loop avoidance, are investigated. Experimental evaluation shows that our solution is effective in terms of protocol and algorithmic efficiency and provides satisfiable performance with high success rate, reasonable message overhead and runtime.

/pdf/multi-constrained-path-computation-for-inter-domain-qos-1n43ilsgcz.pdf

Multi-constrained path computation for inter-domain QoS-capable services

The shortest secure path (routing) problem in communication networks has to deal with multiple attack layers e.g., man-in-the-middle, eavesdropping, packet injection, packet insertion, etc. Consider different probabilities for each such attack over an edge, probabilities that can differ across edges. Furthermore, a usage of a single shortest paths (for routing) implies possible traffic bottleneck, which should be avoided if possible, which we term pathneck security avoidance. Finding all Pareto–optimal solutions for the multi-criteria single-source single-destination shortest secure path problem with non-negative edge lengths might yield a solution with an exponential number of paths. In the first part of this paper, we study specific settings of the multi-criteria shortest secure path problem, which are based on prioritized multi-criteria and on k-shortest secure paths. In the second part, we show a polynomial-time algorithm that, given an undirected graph G and a pair of vertices (s, t), finds prioritized multi-criteria 2-disjoint (vertex/edge) shortest secure paths between s and t. In the third part of the paper, we introduce the k-disjoint all-criteria-shortest secure paths problem, which is solved in time \(O(\min (k|E|, |E|^{3/2}))\).

Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths

Many applications in the Internet today demand high end-to-end Quality of Service (QoS) assurance, such as bandwidth, delay, jitter and packet loss constraints. Also they seek better utilization of the network resources, while satisfying customer needs. Multi-constrained optimal path (MCOP) QoS routing problem attempts to find a feasible path that satisfies the requested QoS constraints, while maintaining high utilization of network resources. This problem is known to be intractable and several heuristic and approximation algorithms have been proposed. In practice, the network state information available for making the routing decisions at each node is often inaccurate. The effectiveness and performance of the routing algorithms can significantly be degraded by this outdated information and should not be treated as exact when selecting feasible paths. This research proposes an efficient heuristic algorithm called Distributed Heuristic Multi-Constrained Optimal Path (DHMCOP) for the MCOP problem, when the link state information is inaccurate. The proposed algorithm incorporates the aspects of both source and distributed routing. It attempts to minimize the computational complexity and protocol overhead while ensuring that the QoS guarantees are satisfied. The algorithm consists of a k-shortest path algorithm, a control message structure for resource reservation and a cost function for path optimization. The extensive simulation results show that the proposed algorithm outperforms the existing ones in terms of success ratio and control overhead.

Hybrid Multi-constrained Optimal Path QoS Routing with Inaccurate Link State

Popular Tasks used by Researchers

How can I help with your research?

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

We encountered an error while loading the panel. Please try refreshing the page.

Something went wrong

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

Anyone with the link can view this chat. You can switch it back to private anytime.

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Newton Perera

Author Tools

Chat about Author

Papers

Hybrid Multi-constrained Optimal Path QoS Routing with Inaccurate Link State