Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
4.5
2.7
Journals
Applied Sciences
Special Issues
Next Generation Inter-Domain Policy Routing
share announcement

Next Generation Inter-Domain Policy Routing

A special issue of Applied Sciences (ISSN 2076-3417). This special issue belongs to the section "Electrical, Electronics and Communications Engineering".

Deadline for manuscript submissions: closed (31 December 2021) | Viewed by 13365

Special Issue Editor

Dr. Pedro Amaral

E-Mail Website
Guest Editor
1. Instituto de Telecomunicações, Lisboa, Portugal;
2. Departamento de Engenharia Eletrotécnica, Faculdade de Ciências e Tecnologia Universidade Nova de Lisboa, 2825-149 Caparica, Portugal
Interests: routing modelling for implementation and correctness verification; software defined networks and network function virtualization for 5G network slicing and vertical service integration; intelligent management of networks; artificial intelligence use for resource distribution optimization problems in networks

Special Issue Information

Dear Colleagues,

Inter-domain routing on the Internet is performed by the de-facto standard Border Gateway Protocol (BGP). Using BGP, each autonomous system (AS) can execute its own policy to select and export routes. Although simple and widely adopted, the current BGP architecture has several limitations: it does not provide mechanisms to select end-to-end paths and it is prone to routing bottlenecks that can be aggravated by BGP update manipulations and prefix-highjacking; it lacks in providing policy coordination mechanisms; and its correct operation depends on a series of practical limits in the used policies that hinder its ability to respond efficiently to the needs of modern networks.

Over the years, fundamental research has produced models of distributed policy routing protocols allowing a better understanding of the needed properties for correct protocol operation both for single and multipath solutions. Parallel to this, the advances in network softwarization and virtualization are increasing their reach in the network ecosystem and open the possibility to overcome the ossification of the interdomain routing system. This paves the way for novel inter-domain routing implementations and the exploration of new approaches. Several degrees of routing centralization can be explored and model-free approaches using black box optimization techniques based in recent artificial intelligent advances can be used to overcome the BGP-based system shortcomings in the future Internet.

Contributions to this issue containing research contributions in the field of policy-based multipath inter-domain routing are welcome. Examples of topics include, but are not limited to the following:

  • Modeling of distributed policy-based protocols with multiple optimality criteria with or without multipath forwarding capabilities
  • Current Internet networking studies
  • New inter-domain routing architectures
  • Inter-domain routing virtualization and softwarization
  • Programmable inter-domain policy routing
  • Artificial Intelligence-powered control planes for inter-domain routing
  • Machine Learning and Big Data tools in inter-domain policy routing

Dr. Pedro Amaral
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Applied Sciences is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • routing
  • routing protocols
  • multipath routing
  • routing models
  • policy routing
  • SDN
  • routing virtualization
  • intelligent control plane
  • inter-domain routing
  • AI-powered routing

Published Papers (3 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

Jump to: Review

15 pages, 528 KiB  
Article
On the Competitiveness of Oblivious Routing: A Statistical View
by Gábor Németh
Appl. Sci. 2021, 11(20), 9408; https://0-doi-org.brum.beds.ac.uk/10.3390/app11209408 - 11 Oct 2021
Cited by 1 | Viewed by 1001
Abstract
Oblivious routing is a static algorithm for routing arbitrary user demands with the property that the competitive ratio, the proportion of the maximum congestion to the best possible congestion, is minimal. Oblivious routing turned out surprisingly efficient in this worst-case sense: in undirected [...] Read more.
Oblivious routing is a static algorithm for routing arbitrary user demands with the property that the competitive ratio, the proportion of the maximum congestion to the best possible congestion, is minimal. Oblivious routing turned out surprisingly efficient in this worst-case sense: in undirected graphs, we pay only a logarithmic performance penalty, and this penalty is usually smaller than 2 in directed graphs as well. However, compared to an optimal adaptive algorithm, which never causes congestion when subjected to a routable demand, oblivious routing surely has congestion. The open question is of how often is the network in a congested state. In this paper, we study two performance measures naturally arising in this context: the probability of congestion and the expected value of congestion. Our main result is the finding that, in certain directed graphs on n nodes, the probability of congestion approaches 1 in some undirected graphs, despite the competitive ratio being O(1). Full article
(This article belongs to the Special Issue Next Generation Inter-Domain Policy Routing)
►▼ Show Figures

Figure 1

23 pages, 3788 KiB  
Article
A Multicast Routing Scheme for the Internet: Simulation and Experimentation in Large-Scale Networks
by Davide Careglio, Fernando Agraz and Dimitri Papadimitriou
Appl. Sci. 2021, 11(18), 8645; https://0-doi-org.brum.beds.ac.uk/10.3390/app11188645 - 17 Sep 2021
Cited by 1 | Viewed by 1894
Abstract
With the globalisation of the multimedia entertainment industry and the popularity of streaming and content services, multicast routing is (re-)gaining interest as a bandwidth saving technique. In the 1990’s, multicast routing received a great deal of attention from the research community; nevertheless, its [...] Read more.
With the globalisation of the multimedia entertainment industry and the popularity of streaming and content services, multicast routing is (re-)gaining interest as a bandwidth saving technique. In the 1990’s, multicast routing received a great deal of attention from the research community; nevertheless, its main problems still remain mostly unaddressed and do not reach the acceptance level required for its wide deployment. Among other reasons, the scaling limitation and the relative complexity of the standard multicast protocol architecture can be attributed to the conventional approach of overlaying the multicast routing on top of the unicast routing topology. In this paper, we present the Greedy Compact Multicast Routing (GCMR) scheme. GMCR is characterised by its scalable architecture and independence from any addressing and unicast routing schemes; more specifically, the local knowledge of the cost to direct neighbour nodes is enough for the GCMR scheme to properly operate. The branches of the multicast tree are constructed directly by the joining destination nodes which acquire the routing information needed to reach the multicast source by means of an incremental two-stage search process. In this paper we present the details of GCMR and evaluate its performance in terms of multicast tree size (i.e., the stretch), the memory space consumption, the communication cost, and the transmission cost. The comparative performance analysis is performed against one reference algorithm and two well-known protocol standards. Both simulation and emulation results show that GCMR achieves the expected performance objectives and provide the guidelines for further improvements. Full article
(This article belongs to the Special Issue Next Generation Inter-Domain Policy Routing)
►▼ Show Figures

Figure 1

Review

Jump to: Research

30 pages, 4222 KiB  
Review
SDN-OpenFlow Topology Discovery: An Overview of Performance Issues
by Raniyah Wazirali, Rami Ahmad and Suheib Alhiyari
Appl. Sci. 2021, 11(15), 6999; https://0-doi-org.brum.beds.ac.uk/10.3390/app11156999 - 29 Jul 2021
Cited by 43 | Viewed by 9629
Abstract
Software-defined networking (SDN) is an innovative architecture that separates the control plane from the data plane to simplify and speed up the management of large networks. This means the control logic has been moved from the network hardware level to the centralized control [...] Read more.
Software-defined networking (SDN) is an innovative architecture that separates the control plane from the data plane to simplify and speed up the management of large networks. This means the control logic has been moved from the network hardware level to the centralized control management level. Therefore, the use of the OpenFlow Discovery Protocol (OFDP) is one of the most common protocols used to discover the network topology in a data plane and then transmit it to the control plane for management. However, OFDP has various shortcomings in its performance such as exchanging too many messages between both levels (control and data), which in turn increases the load on the SDN-Controller. Additionally, since the application layer depends entirely on the network topologies plotted in the control plane, it is very important to obtain accurate network topology information from data plane. Therefore, after providing background on topology discovery protocols to the reader, we will concentrate on performance issues. The present study identifies and discuss the primary concerns involved in the complex query process, infrastructure, influencing factors, and challenges for the topology discovery process. Furthermore, this paper will present several recent studies that have overcome and enhanced these issues. In addition, open discussion and future work concerning these issues are also discussed. Full article
(This article belongs to the Special Issue Next Generation Inter-Domain Policy Routing)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-3
Back to TopTop