Network management includes several operations that aim to maximize Fault, Configuration, Account, Performance and Security (FCAPS) goals. Performance improvement often relies on multiple criteria, leading to NP-Hard optimisation problems. Very often, optimization mechanisms are narrowed to a specific scenario or present deployment issues due to their associated complexity. Others, despite reducing complexity, have accuracy issues that lead to the selection of non-optimal solutions. MeTHODICAL is an accurate optimisation technique for path selection in multihoming scenarios that enhances network management FCAPS goals by being flexible enough to operate on distinct scenarios, supporting different applications and services and with reduced deployment complexity.

/pdf/multihoming-aware-optimization-mechanism-23uflryqj8.pdf

Multihoming aware optimization mechanism

IP multihoming is a networking concept with a deceptively simple definition in theory. In practice, however, multihoming has proved difficult to implement and optimize for. Moreover, it is a concept, which, once adopted in the core Internet architecture, has significant impact on operation and maintenance. A trivial definition of multihoming would state that an end-node or an end-site has multiple first-hop connections to the network. In this chapter, we survey and summarize in a comprehensive manner recent developments in IP multihoming. After introducing the fundamentals, we present the architectural goals and system design principles for multihoming, and review different approaches. We survey multihoming support at the application, session, transport, and network layers, covering all recent proposals based on a locator-identifier split approach. We critically evaluate multihoming support in these proposals and detail recent developments with respect to multihoming and mobility management.

Multihoming: A Comprehensive Review

The Internet routing system is facing a serious scaling challenge due to the rapid growth of the global routing table. For the purpose of reducing routing table size, many studies have developed a lot of new routing solutions. After the paper introduces the background of the Internet routing system, a classification of new routing solutions is presented. Then, a typical scalable routing algorithms and architectures become the focus, and their basic ideas and characteristics are deeply analyzed and compared. Finally, some key issues and ideas for future research are discussed.

/pdf/scalable-routing-for-the-internet-jicrhu8h14.pdf

Scalable Routing for the Internet

Scalability analysis of the Internet has resulted in two main concerns: rapid growth of the forwarding table and BGP’s poor convergence properties when distributing hundreds of thousands of routes. HIDRA [5], a backward-compatible architecture designed with feasibility-of-implementation in mind, has been proposed as one solution to reduce the size of the default-free zone (DFZ) forwarding table. This work extends HIDRA, greatly reducing the number of routes maintained by BGP, yet preserves a practical, incremental deployment strategy. The proposed protocol also provides end networks direct, finer-grained control over the distribution of packets flowing into their network and provides for efficient mobility support. The new mapping protocol is prototyped on a small network testbed and shown to work in all tested circumstances, including normal network operation, link failures, and transitional routing environments. Additionally, IP Mobility is discussed and shown to work in this environment without triangle routing and only minimal additional overhead.

/pdf/reactive-encapsulation-mappings-in-hidra-1ewkacdfqf.pdf

Reactive Encapsulation Mappings in HIDRA

In recent years, the Internet has grown so large that the future scalability of the Internet has become a major concern. The two primary scalability concerns are the size of the forwarding table and the ability for BGP to converge while distributing hundreds of thousands of routes. HIDRA [5, 9] is a new Internet routing architecture that is backwards-compatible with existing routing technologies and protocols that focuses on feasibility-of-implementation. HIDRA remedies the first Internet scalability concern by proposing a means to reduce the number of entries in the default-free zone (DFZ) forwarding table. This project extends HIDRA by designing a complete reactive routing implementation. This addresses the second Internet scalability concern by reducing the number of routes maintained by BGP. Adding reactive routing still allows for incremental deployment of HIDRA and also provides a means for finer route control with support for load-balancing and host mobility. This paper provides background information on HIDRA, discusses reactive routing design details, and validates complete HIDRA behavior though a series of experimental tests and results.

/pdf/reactive-routing-in-hidra-networks-5bbqxtidyz.pdf

Reactive Routing in HIDRA Networks

The size of the Internet’s forwarding table is growing rapidly, generating concerns about the ability for high performance routing equipment to economically keep pace. The primary contributors to this growth are end site multihoming, traffic engineering, and in the foreseeable future, IPv6 deployment. This paper presents HIDRA, a hierarchal network architecture designed to reduce both the immediate size of the Internet’s forwarding table as well as its growth rate while maximizing compatibility with the existing In­ ternet architecture. This includes the ability to use exist­ ing high performance routers, existing routing protocols, and existing number allocation policies. HIDRA is prototyped on a small network testbed and shown to work in a limited set of circumstances, including normal network operation, link failures, traf­ fic engineering, and mixed “legacy” Internet and HIDRA topologies. The potential reduction of the Internet’s for­ warding table is also analyzed.

/pdf/hidra-hierarchical-inter-domain-routing-architecture-4rndc4l1q1.pdf

HIDRA: Hierarchical Inter-Domain Routing Architecture

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

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

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

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.

Daniel Nelson

Author Tools

Chat about Author

Papers

HIDRA: Hierarchical Inter-Domain Routing Architecture

Reactive Encapsulation Mappings in HIDRA