An adaptive access control scheme based on trust degrees for edge computing

In networks with identifier/locator separation, packets from a source to a destination are generally tunneled from the source’s ingress tunnel router (ITR) to the destination’s egress tunnel router (ETR). In addition, the source’s ITR often caches the destination’s identifier-to-locator mapping for a certain duration, called cache timeout, in order to avoid frequently querying mapping servers. When the destination moves from an old ETR to a new one, its identifier-to-locator mapping changes accordingly, which makes the destination’s identifier-to-locator mapping cached at some ITRs outdated. While several approaches have been proposed to address this issue, they either cannot deal with all types of outdated mappings cached at the ITRs or face the triangular routing problem. Accordingly, in this paper, we propose a timer-based pointer forwarding (TBPF) approach that can deal with all types of outdated mappings and avoid the triangular routing problem. We present numerical results to compare TBPF with existing approaches and show that TBPF is a very promising solution for dealing with outdated mappings.

Dealing With Mobility-Caused Outdated Mappings in Networks With Identifier/Locator Separation

The locator/ID separation protocol (LISP) proposed for addressing the scalability issue of the current Internet has gained much interest. LISP separates the identifier and locator roles of IP addresses by end point identifiers (EIDs) and locators, respectively. In particular, while EIDs are used in the application and transport layers for identifying nodes, locators are used in the network layer for locating nodes in the network topology. In LISP, packets are tunneled from ingress tunnel routers (ITRs) to egress tunnel routers in a map-and-encapsulation manner. For this purpose, an ITR caches on demand some mappings between EIDs and locators. Since hosts roam from place to place, however, their EID-to-locator mappings change accordingly. Thus, an ITR cannot store a mapping permanently but maintains for every mapping a timer whose default value is set to a given cache timeout. If the cache timeout for a mapping is too short, an ITR frequently queries the mapping system (control plane), resulting in a high traffic load on the control plane. On the other hand, if the cache timeout for a mapping is too long, the mapping could be outdated, resulting in packet loss and associated overheads. Therefore, it is desirable to set appropriate cache timeout for mapping items. In this paper, we analytically determine the optimal cache timeout for EID-to-locator mappings cached at ITRs to minimize the control plane load while remaining efficient for mobility. The results presented here provide valuable insights and guidelines for deploying LISP.

Optimal Cache Timeout for Identifier-to-Locator Mappings with Handovers

Content Centric Networking (CCN) is one of the representative Information Centric Networking (ICN) architectures. In CCN, data objects are accessed instead of end hosts, and each router maintains a large size of routing table consisting of all name prefixes announced by content servers. To improve the scalability of CCN, an alternative name space relating to Router IDentifier (RID) has been proposed for forwarding the interest instead of using the name prefix of data object, and a name mapping system is applied for mapping data objects related names to RID related names. In this paper we propose dynamic interest transmission scheme in CCN with name mapping (DIT-NM), in which interest can be forwarded towards dynamically chosen RID through dynamically chosen interface associated with the RID according to real-time monitoring network status and traffic load information. The performance of the proposed scheme is evaluated using realistic network topologies with respect to latency and network link utilization. We also compare with the basic CCN model and multi-repository single path (MRSP) to highlight the advantages of our scheme. Achieved results demonstrate the effectiveness of the proposed scheme in reducing latency, improving robustness and balancing overall traffic distribution in name-mapping CCN environment.

DITNM: Dynamic interest transmission scheme in Content Centric Networking with name mapping

Information centric network (ICN) is becoming a prevailing design for future Internet to provide data objects to end customers. One crucial problem in ICN is to design routing and forwarding strategy so that traffic can be transmitted efficiently even with the dynamics of network link. In this paper, we consider content centric network (CCN), which is one of the promising candidate architecture design for ICN. Particularly, we consider the scalable CCN with name mapping system, which improves scalability by using router Identifier as name prefix to forward interests. We address the issue of improving link failure resiliency for CCN by designing a dynamic interest transmission approach. We propose the link failure resilient interest transmission algorithm (LFRIT) to enhance link failure resiliency by considering both network traffic and link status information. Additionally, we propose the advanced design of LFRIT (A-LFRIT), which calculates and updates the forwarding table centrally for link updates to further improve network robustness. Numerous simulations are conducted to evaluate the proposed approach under realistic network topologies with respect to packet loss, latency, and network link utilization. Simulation results demonstrate that the packet loss probability and data retrieval delay of A-LFRIT can reduce to 50% of the basic CCN and multi-repository single path approaches.

Dynamic Interest Transmission Approach for Improving Link Failure Resiliency in Content Centric Network

It has been widely accepted that core-edge separation architecture can improve routing scalability of the Internet. On the other hand, autonomous system (AS) level hybrid routing protocol has been proposed, where AS numbers are used for inter-domain routing instead of IP prefixes. It is expected that the combination of core-edge separation architecture and AS level hybrid routing can further improve the routing scalability. However, there is a lack of quantitative analysis on the routing scalability improvement for such system. In this letter, we derive a theoretic routing scalability model for analyzing the core-edge separation Internet with hybrid routing protocol, in which the core networks and edge networks comprise of ASes with different business types. The simulation result demonstrates the accuracy of the theoretic model and it is shown that the routing scalability has been improved significantly with routing table size reducing to 0.8% of the original value.

A Routing Scalability Model for Core-Edge Separation Internet with Hybrid Routing

Locator/ID Separation Protocol (LISP) is an efficient proposal for solving the severe routing scalability problems existing in the current IPv4-based Internet and the future IPv6-based Internet. However, the basic LISP architecture does not specify how to support mobility in detail. As mobility is a fundamental issue faced by the future Internet, LISP mobility architecture (LISP-MN) was proposed recently to extend LISP to support mobility. Nevertheless, LISP-MN is a host-based mobility approach which requires software changes in end systems. To some extent, such a design breaks the primary design principles of LISP, which is a network-based protocol and requires no modification to the hosts. In addition, LISP-MN faces the same inherent problems as other host-based approaches (e.g., MIPv4, MIPv6), such as handover latency, packet loss, and signalling overhead. To solve the above problems, this paper proposes MobileID, which is a network-based localized mobility approach for LISP. In our design, a mobile node is not aware of its mobility and does not participate in handover signalling. Instead, the network takes the responsibility for managing mobility on behalf of the mobile node. We present a general overview of MobileID architecture, and introduce the detailed protocol operations in terms of the basic MobileID handover process and the route optimization procedures. Furthermore, we describe a MobileID analytic model, and compare MobileID handover performance with three representative mobility solutions, i.e., LISP-MN, MIPv6 and PMIPv6. Numerical results show the superior performance of MobileID. The handover latency of MobileID is much lower than those of LISP-MN and MIPv6, and it becomes lower than that of PMIPv6 in case of a long wireless link delay.

A Network-Based Localized Mobility Approach for Locator/ID Separation Protocol

The invention discloses a fault-toleration processing method and system for a multi-home terminal in an integrated network. In the method, if no multi-home terminal exists formerly, an access switching router allocates switching-routing identifiers for the multi-home terminal, establishes mapping information and reports the mapping information to home domain mapping servers, and mapping information synchronization is performed among all the home domain mapping servers of the multi-home terminal so as to complete location registration; and if the multi-home terminal exists already, the access switching router modifies the mapping information of the multi-home terminal after discovering a change of an access state of the multi-home terminal and reports the modified mapping information to the home domain mapping server of the located domain of the access switching router, and mapping information update is performed among all the home domain mapping servers of the multi-home terminal and the updated mapping information are announced to the access switching router of a communication opposite end so as to complete location update. According to the method and system disclosed by the invention, the fault-toleration processing function of the multi-home terminal in the internet can be rapidly and completely realized and the reliability and the usability of the network transmission are increased.

Fault-toleration processing method and system for multi-home terminal in integrated network

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.

Jia Chen

Author Tools

Chat about Author

Papers

A Routing Scalability Model for Core-Edge Separation Internet with Hybrid Routing

A Network-Based Localized Mobility Approach for Locator/ID Separation Protocol

Fault-toleration processing method and system for multi-home terminal in integrated network