Separating routing and forwarding: A clean-slate network layer design

Calvert, Kenneth L.; Griffioen, James; Poutievski, Leon

doi:10.1109/broadnets.2007.4550434

Cited by 19 publications

(10 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These two metrics form the basic BF-selection criteria. While fpa-optimized selection is cheaper in computational (18) 3 (29) 3 (12) 5 (20) 3 (10) terms, the fpr-optimized selection will give better results as the actual topology is more precisely considered in this process. However, the fpr describes the overall network performance only indirectly.…”

Section: Performance Indicatorsmentioning

confidence: 99%

Lipsin

Jokela

Zahemszky

Rothenberg

et al. 2009

SIGCOMM Comput. Commun. Rev.

126

View full text Add to dashboard Cite

A large fraction of today's Internet applications are internally publish/subscribe in nature; the current architecture makes it cumbersome and inept to support them. In essence, supporting efficient publish/subscribe requires data-oriented naming, efficient multicast, and in-network caching. Deployment of native IP-based multicast has failed, and overlay-based multicast systems are inherently inefficient. We surmise that scalable and efficient publish/subscribe will require substantial architectural changes, such as moving from endpoint-oriented systems to information-centric architectures.In this paper, we propose a novel multicast forwarding fabric, suitable for large-scale topic-based publish/subscribe. Due to very simple forwarding decisions and small forwarding tables, the fabric may be more energy efficient than the currently used ones. To understand the limitations and potential, we provide efficiency and scalability analysis via simulations and early measurements from our two implementations. We show that the system scales up to metropolitan WAN sizes, and we discuss how to interconnect separate networks.

show abstract

Section: Performance Indicatorsmentioning

confidence: 99%

Lipsin

Jokela

Zahemszky

Rothenberg

et al. 2009

SIGCOMM Comput. Commun. Rev.

126

View full text Add to dashboard Cite

show abstract

“…Future Internet architectures, such as NEBULA [2], also offer multiple choices of routing paths. In addition, source routing approaches that give applications control over routing paths, such as ICING [3] and POMO [4], have been proposed. Even the current IPv4 and IPv6 Internet have the ability to support loose source routing (although it is often disabled by ISPs).…”

Section: Introductionmentioning

confidence: 99%

Network path advising service for the future Internet

Griffioen

2012

2012 IEEE Network Operations and Management Symposium

View full text Add to dashboard Cite

A common feature of emerging future Internet architectures is the ability for applications to select the path, or paths, their packets take between the source and destination. Unlike the current Internet architecture where routing protocols find a single (best) path between a source and destination, future Internet routing protocols will need to present applications with a choice of paths. Even if the routing service can return a list of possible paths, the huge number of potential paths and the need to know the current network conditions of each of the proposed paths will make it virtually impossible for applications to select the best set of paths, or just the best path.In this paper, we present a new network path advising service (NPAS) that helps future applications choose network paths. Given a set of possible paths, the NPAS service helps applications select appropriate paths based on both recent path measurements and end-to-end feedback collected from other applications. We describe the NPAS service abstraction, API calls, and a distributed architecture that achieves scalability by determining the most important things to monitor based on actual usage. Finally, we describe a prototype implementation of the NPAS service.

show abstract

“…For now we just note that some of ICING's components are reminiscent of or inspired by prior mechanisms [7, 10, 11, 13, 17, 19, 24, 28-31, 49, 51, 57, 58, 65, 69], and ICING can enforce many previously proposed policies. However, we know of only one proposal that offers both Path Consent and Path Compliance [18] and none that offers these two properties in an environment that is adversarial, high-speed, and federated. More specifically, this paper's contributions are:…”

Section: Path Compliancementioning

confidence: 99%

“…• High-speed: To work at Internet backbone speeds, a PVM cannot rely on per-packet public key operations (ruling out a signed log in every packet [18]), per-flow state in forwarders (which stymies fail-over), and ideally not even per-flow public key operations.…”

Section: Path Compliancementioning

confidence: 99%

“…However, they do not target an environment that is high-speed and adversarial and federated. For instance, [18,54] use per-packet signatures and assume some centralization; [10,54] require large configuration state in the network and a packet header quadratic in path length; Ethane [19] is centralized; and MPLS [58] is not robust to misbehavior (two nodes on the path can collude to skip a third; more generally there is no proof that a packet follows its path).…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Verifying and enforcing network paths with icing

Naous

Walfish

Nicolosi

et al. 2011

Proceedings of the Seventh COnference on Emerging Networking EXperiments and Technologies

115

View full text Add to dashboard Cite

We describe a new networking primitive, called a Path Verification Mechanism (PVM). There has been much recent work about how senders and receivers express policies about the paths that their packets take. For instance, a company might want fine-grained control over which providers carry which traffic between its branch offices, or a receiver may want traffic sent to it to travel through an intrusion detection service.While the ability to express policies has been well-studied, the ability to enforce policies has not. The core challenge is: if we assume an adversarial, decentralized, and high-speed environment, then when a packet arrives at a node, how can the node be sure that the packet followed an approved path? Our solution, ICING, incorporates an optimized cryptographic construction that is compact, and requires negligible configuration state and no PKI. We demonstrate ICING's plausibility with a NetFPGA hardware implementation. At 93% more costly than an IP router on the same platform, its cost is significant but affordable. Indeed, our evaluation suggests that ICING can scale to backbone speeds.

show abstract

Separating routing and forwarding: A clean-slate network layer design

Cited by 19 publications

References 18 publications

Lipsin

Lipsin

Network path advising service for the future Internet

Verifying and enforcing network paths with icing

Contact Info

Product

Resources

About