The emergence of new interactive and peer-to-peer broadband services is fostering the growth of subscriber access bandwidth as well as broadband penetration, resulting in a continuous increase in traffic in metro and core networks by a factor of 10 every five years. State-of-the-art Internet Protocol (IP) based core network architectures are expected to suffer from severe scalability problems with respect to complexity, power, and cost. Novel architectural approaches will be required as a basis for the future converged packet transport infrastructure offering petabit networking capabilities at much lower power and cost. We describe a scalable, future-proof architecture which reduces complexity as far as possible by shifting packet processing to the edges of the network, aggregating traffic into large containers, and applying simple circuit switching whenever possible, preferably in the photonic layer. Novel approaches for optimized traffic management contribute to the simplification of processing, protocols, network control, and management. The expected savings, together with service-driven quality of service (QoS) provisioning, can open new ways for implementing high leverage transport networks and deriving new revenues.

Energy-efficient transport for the future Internet

During the past decade, the packet classification problem has been widely studied to accelerate network applications such as access control, traffic engineering and intrusion detection. In our research, we found that although a great number of packet classification algorithms have been proposed in recent years, unfortunately most of them stagnate in mathematical analysis or software simulation stages and few of them have been implemented in commercial products as a generic solution. To fill the gap between theory and practice, in this paper, we propose a novel packet classification algorithm named HyperSplit. Compared to the well-known HiCuts and HSM algorithms, HyperSplit achieves superior performance in terms of classification speed, memory usage and preprocessing time. The practicability of the proposed algorithm is manifested by two facts in our test: HyperSplit is the only algorithm that can successfully handle all the rule sets; HyperSplit is also the only algorithm that reaches more than 6Gbps throughput on the Octeon3860 multi-core platform when tested with 64-byte Ethernet packets against 10K ACL rules.

/pdf/packet-classification-algorithms-from-theory-to-practice-1c4vefjn14.pdf

Packet Classification Algorithms: From Theory to Practice

Latency is increasingly becoming a performance bottleneck for Internet Protocol (IP) networks, but historically, networks have been designed with aims of maximizing throughput and utilization. This paper offers a broad survey of techniques aimed at tackling latency in the literature up to August 2014, as well as their merits. A goal of this work is to be able to quantify and compare the merits of the different Internet latency reducing techniques, contrasting their gains in delay reduction versus the pain required to implement and deploy them. We found that classifying techniques according to the sources of delay they alleviate provided the best insight into the following issues: 1) The structural arrangement of a network, such as placement of servers and suboptimal routes, can contribute significantly to latency; 2) each interaction between communicating endpoints adds a Round Trip Time (RTT) to latency, particularly significant for short flows; 3) in addition to base propagation delay, several sources of delay accumulate along transmission paths, today intermittently dominated by queuing delays; 4) it takes time to sense and use available capacity, with overuse inflicting latency on other flows sharing the capacity; and 5) within end systems, delay sources include operating system buffering, head-of-line blocking, and hardware interaction. No single source of delay dominates in all cases, and many of these sources are spasmodic and highly variable. Solutions addressing these sources often both reduce the overall latency and make it more predictable.

/pdf/reducing-internet-latency-a-survey-of-techniques-and-their-ed3oogdolv.pdf

Reducing Internet Latency: A Survey of Techniques and Their Merits

We present Sincronia, a near-optimal network design for coflows that can be implemented on top on any transport layer (for flows) that supports priority scheduling. Sincronia achieves this using a key technical result --- we show that given a "right" ordering of coflows, any per-flow rate allocation mechanism achieves average coflow completion time within 4X of the optimal as long as (co)flows are prioritized with respect to the ordering. Sincronia uses a simple greedy mechanism to periodically order all unfinished coflows; each host sets priorities for its flows using corresponding coflow order and offloads the flow scheduling and rate allocation to the underlying priority-enabled transport layer. We evaluate Sincronia over a real testbed comprising 16-servers and commodity switches, and using simulations across a variety of workloads. Evaluation results suggest that Sincronia not only admits a practical, near-optimal design but also improves upon state-of-the-art network designs for coflows (sometimes by as much as 8X).

Sincronia: near-optimal network design for coflows

This document requests one DSCP from the IANA for real-time traffic
classes similar to voice conforming to the Expedited Forwarding Per
Hop Behavior, and admitted using a CAC procedure involving
authentication, authorization, and capacity admission, as compared to
a class of real-time traffic conforming to the Expedited Forwarding
Per Hop Behavior but not subject to capacity admission or subject to
very coarse capacity admission. It also recommends that certain
classes of video traffic described in RFC 4594 and which have similar
requirements be require admission using a CAC procedure involving
authentication, authorization, and capacity admission. One of the
reasons behind this is the need for classes of traffic that are
handled under special policies, such as the non-preemptive Emergency
Telecommunication Service, the US DoD's Assured Service (which is
similar to MLPP), or e-911. Capacity-admitted traffic classes need
separation from traffic not subject to admission control, from which
they can deterministically obtain their service requirements,
including SLA matters.

A Differentiated Services Code Point (DSCP) for Capacity-Admitted Traffic

This document describes a general architecture for flow admission and
termination based on pre-congestion information in order to protect
the quality of service of established inelastic flows within a single
DiffServ domain. Status

/pdf/pre-congestion-notification-pcn-architecture-2t9o7ljr7j.pdf

Pre-Congestion Notification (PCN) Architecture

A technique for end-to-end admission control of real-time packet flows is disclosed. In one embodiment, the technique may be realized as a method for end-to-end admission control of real-time packet flows in a network having a plurality of network elements. The method may include transmitting at least one probe packet from a first network element to a second network element via a network path, determining, at at least one intermediate network element on the network path, at least one flow rate associated with a plurality of packets, marking at least one predetermined bit in the at least one probe packet if the at least one flow rate is greater than a predetermined rate, and controlling an admission of additional packets into the network based at least in part on the marking of the at least one predetermined bit in the at least one probe packet.

Technique for end-to-end admission control of real-time packet flows

In the core of a high-capacity network, service differentiation may
still be needed to support applications' utilization of the
network. Applications with similar traffic characteristics and
performance requirements are mapped into Diffserv service classes
based on end- to-end behavior requirements of the applications.
However, some network segments may be configured in such a way that a
single forwarding treatment may satisfy the traffic characteristics
and performance requirements of two or more service classes. In these
cases, it may be desirable to aggregate two or more Diffserv service
classes into a single forwarding treatment. This document provides
guidelines for the aggregation of Diffserv service classes into
forwarding treatments. This memo provides information for the Internet
community.

Aggregation of Diffserv Service Classes

This document describes a deployment model for pre-congestion notification (PCN) operating in a large DiffServ-based region of the Internet. PCN-based admission control protects the quality of service of existing flows in normal circumstances, whilst if necessary (eg after a large failure) pre-emption of some flows preserves the quality 
of service of the remaining flows. Each link has a configured-admission-rate and a configured-pre-emption-rate, and a router marks packets that exceed these rates. Hence routers give an early warning of their own potential congestion, before packets need to be dropped. 
Gateways around the edges of the PCN-region convert measurements of packet rates and their markings into decisions about whether to admit new flows, and (if necessary) into the rate of excess traffic that 
should be pre-empted. Per-flow admission states are kept at the gateways only, while the PCN markers that are required for all routers operate on the aggregate traffic - hence there is no scalability impact on interior routers.

An edge-to-edge Deployment Model for Pre-Congestion Notification: Admission Control over a DiffServ Region

Pre-Congestion Notification (PCN) is a means for protecting quality of service for inelastic traffic admitted to a Diffserv domain. The overall PCN architecture is described in RFC 5559. This memo describes the requirements for the signaling applied within the PCN- domain: (1) PCN-feedback-information is carried from the PCN-egress-node to the Decision Point; (2) the Decision Point may ask the PCN-ingress-node to measure, and report back, the rate of sent PCN-traffic between that PCN-ingress-node and PCN-egress-node. The Decision Point may be either collocated with the PCN-ingress-node or a centralized node (in the first case, (2) is not required). The signaling requirements pertain in particular to two edge behaviors, Controlled Load (CL) and Single Marking (SM).

/pdf/requirements-for-signaling-of-pre-congestion-information-in-4iuym7nngo.pdf

Requirements for Signaling of Pre-Congestion Information in a Diffserv Domain

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.

K. Chan

Author Tools

Chat about Author