Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy

Fuller, Vince; Li, T.; Yu, Jiadi; Varadhan, K.

doi:10.17487/rfc1519

Cited by 312 publications

(168 citation statements)

References 1 publication

Supporting

Mentioning

159

Contrasting

Unclassified

Order By: Relevance

“…To minimize the size of the routing table, IP addresses are assigned in blocks based on their prefixes [41]. As a result, the size of the largest routing tables today is about 70,000 entries [122], which is three orders of magnitude smaller than the total number of hosts, which is about 72 million [89].…”

Section: Routing Lookupmentioning

confidence: 99%

“…While this factor may not be significant if k is small, a more serious issue that potentially limits the scalability of the algorithm is that in its basic form it requires that an entry be maintained for each destination, where in reality, to achieve scalability, routers really maintain the longest-prefix of a group of destinations that share the same route [41]. Since our algorithm works in the context of one ISP, we can maintain an entry for each egress node instead of each destination.…”

Section: Scalabilitymentioning

confidence: 99%

See 1 more Smart Citation

Stateless Core: A Scalable Approach for Quality of Service in the Internet

Stoica¹,

Zhang²

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Today's Internet provides one simple service: best effort datagram delivery. This minimalist service allows the Internet to be stateless, that is, routers do not need to maintain any fine grained information about traffic. As a result of this stateless architecture, the Internet is both highly scalable and robust. However, as the Internet evolves into a global commercial infrastructure that is expected to support a plethora of new applications such as IP telephony, interactive TV, and e-commerce, the existing best effort service will no longer be sufficient. In consequence, there is an urgent need to provide more powerful services such as guaranteed services, differentiated services, and flow protection.Over the past decade, there has been intense research toward achieving this goal. Two classes of solutions have been proposed: those maintaining the stateless property of the original Internet (e.g., Differentiated Services), and those requiring a new stateful architecture (e.g., Integrated Services). While stateful solutions can provide more powerful and flexible services such as per flow bandwidth and delay guarantees, they are less scalable than stateless solutions. In particular, stateful solutions require each router to maintain and manage per flow state on the control path, and to perform per flow classification, scheduling, and buffer management on the data path. Since today's routers can handle millions of active flows, it is difficult, if not impossible, to implement such solutions in a scalable fashion. On the other hand, while stateless solutions are much more scalable, they offer weaker services.The key contribution of this dissertation is to bridge this long-standing gap between stateless and stateful solutions in packet switched networks such as the Internet. Our thesis is that "it is actually possible to provide services as powerful and as flexible as the ones implemented by a stateful network using a stateless network". To prove this thesis, we propose a novel technique called Dynamic Packet State (DPS). The key idea behind DPS is that, instead of having routers maintain per flow state, packets carry the state. In this way, routers are still able to process packets on a per flow basis, despite the fact that they do not maintain any per flow state. Based on DPS, we develop a network architecture called Stateless Core (SCORE) in which core routers do not maintain any per flow state. Yet, using DPS to coordinate actions of edge and core routers along the path traversed by a flow allows us to design distributed algorithms that emulate the behavior of a broad class of stateful networks in SCORE networks.In this dissertation we describe complete solutions including architectures, algorithms and implementations which address three of the most important problems in today's Internet: providing guaranteed services, differentiated services, and flow protection. Compared to existing solutions, our solutions eliminate the most complex operations on both the data and control paths in the network core, i...

show abstract

Section: Routing Lookupmentioning

confidence: 99%

Section: Scalabilitymentioning

confidence: 99%

Stateless Core: A Scalable Approach for Quality of Service in the Internet

Stoica¹,

Zhang²

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The simplest example of such dependency can be seen in an IP address following the Classless Inter-Domain Routing (CIDR) scheme [10], [16] Access lists illustrate yet another parameter relationship: once an access list is created, an identifier is provided for it. This identifier must then be used to attach the access list to a specific interface.…”

Section: Dependencies At Service Configuration Levelmentioning

confidence: 99%

Automated Validation of Service Configuration on Network Devices

Hallé

Deca

Cherkaoui

et al. 2004

Management of Multimedia Networks and Services

View full text Add to dashboard Cite

Abstract. Due to the significant development of network services in the past few years, their validation has become increasingly difficult. The advent of novel approaches to the issue of validation is therefore vital for keeping services manageable, safe, and reliable. We present a model for the validation of service configurations on network devices. A service configuration is modelled by a tree structure, and its properties are described by validation rules expressed in terms of these tree elements. By using an existing logical formalism called TQL, we have succeeded in expressing complex dependencies between parameters, and in automatically checking these dependencies against real-world network descriptions in feasible time.

show abstract

“…Extrapolations showed that with continued growth, this would inevitably lead to routing tables and routing traffic throughout the Internet expanding beyond all reasonable bounds. [20]. Secondly, address blocks are now in general allocated to Internet service providers, not directly to user sites.…”

Section: Scaling the Current Routing And Addressing Systemmentioning

confidence: 99%

Prospects for Internet technology

Carpenter

Crowcroft

1997

Distrib. Syst. Engng.

View full text Add to dashboard Cite

This paper surveys the current developments in Internet technology, with a particular emphasis on performance, and the growing need for various guarantees of quality of service. It discusses hardware technologies for increased bandwidth, mechanisms for requesting and providing specific qualities of service, and various scaling issues. Finally it discusses mechanisms needed for (but not the economics of) the Internet in the mass market. To this end, we survey changes in the areas of addressing, and flow management.

show abstract

Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy

Cited by 312 publications

References 1 publication

Stateless Core: A Scalable Approach for Quality of Service in the Internet

Stateless Core: A Scalable Approach for Quality of Service in the Internet

Automated Validation of Service Configuration on Network Devices

Prospects for Internet technology

Contact Info

Product

Resources

About