Results 1 - 10
of
13
Dynamics of Internet Routing Information
- Proceedings of SIGCOMM '93
, 1993
"... The Internet is a complex mesh of networks that use a common suite (TCP/IP) of networking protocols. A key feature of the Internet is that all of these constituent networks are interconnected, thereby providing system wide communication. The magnitude and pattern of the flow of routing information d ..."
Abstract
-
Cited by 42 (0 self)
- Add to MetaCart
(Show Context)
The Internet is a complex mesh of networks that use a common suite (TCP/IP) of networking protocols. A key feature of the Internet is that all of these constituent networks are interconnected, thereby providing system wide communication. The magnitude and pattern of the flow of routing information directly represents the connectivity stability of the Internet. The NSFNET backbone network provides transit services to a large portion of the global Internet and maintains routing tables reflecting this current connectivity. These routing tables are constantly updated based on information received by the attached networks. This paper investigates the dynamics of routing information flow as presented to the NSFNET backbone network.
The Fuzzball
- Proc. ACM SIGCOMM 88 Symposium
, 1988
"... The Fuzzball is an operating system and applications library designed for the PDP11 family of computers. It was intended as a development platform and research pipewrench for the DARPA/NSF Internet, but has occasionally escaped to earn revenue in commercial service. It was designed, implemented a ..."
Abstract
-
Cited by 35 (5 self)
- Add to MetaCart
(Show Context)
The Fuzzball is an operating system and applications library designed for the PDP11 family of computers. It was intended as a development platform and research pipewrench for the DARPA/NSF Internet, but has occasionally escaped to earn revenue in commercial service. It was designed, implemented and evolved over a seventeen-year era spanning the development of the ARPANET and TCP/IP protocol suites and can today be found at Internet outposts from Hawaii to Italy standing watch for adventurous applications and enduring experiments. This paper describes the Fuzzball and its applications, including a description of its novel congestion avoidance/control and timekeeping mechanisms.<E-110> Keywords: protocol testing, network testing, performance evaluation, Internet architecture, TCP/IP protocols, congestion control, internetwork time synchronization.<E-132> 1. Introduction<E-128> The Fuzzball is a software package consisting of a fast, compact operating system, support for the DARPA/...
Measurements of Wide Area Internet Traffic
, 1989
"... Measurement and analysis of current behavior are valuable techniques for the study of computer networks. In addition to providing insight into the operation and usage patterns of present networks, the results can be used to create realistic models of existing traffic sources. Such models are a key c ..."
Abstract
-
Cited by 33 (5 self)
- Add to MetaCart
Measurement and analysis of current behavior are valuable techniques for the study of computer networks. In addition to providing insight into the operation and usage patterns of present networks, the results can be used to create realistic models of existing traffic sources. Such models are a key component of the analytic and simulation studies often undertaken in the design of future networks. This paper presents measurements of wide area Internet traffic gathered at the junction between a large industrial research laboratory and the rest of the Internet. Using bar graphs and histograms, it shows the statistics obtained for packet counts, byte counts, and packet length frequencies, broken down by major transport protocols and network services. For the purpose of modeling wide area traffic, the histograms are of particular interest because they concisely characterize the distribution of packet lengths produced by different wide area network services such as file transfer, remote login...
A brief history of NTP time: Memoirs of an Internet timekeeper
- ACM SIGCOMM COMPUT. COMMUN. REV
, 2003
"... This paper traces the origins and evolution of the Network Time Protocol (NTP) over two decades of continuous operation. The technology has been continuously improved from hundreds of milliseconds in the rowdy Internet of the early 1980s to tens of nanoseconds in the Internet of the new century. It ..."
Abstract
-
Cited by 19 (0 self)
- Add to MetaCart
This paper traces the origins and evolution of the Network Time Protocol (NTP) over two decades of continuous operation. The technology has been continuously improved from hundreds of milliseconds in the rowdy Internet of the early 1980s to tens of nanoseconds in the Internet of the new century. It includes a blend of history lessons, technology milestones and series of experiments that shape, define and record the early history of the Internet and NTP. This narrative is decidedly personal, since the job description for an Internet timekeeper is highly individualized and invites very few applicants. There is no attempt here to present a comprehensive tutorial, only a almanac of personal observations, eclectic minutiae and fireside chat. Many souls have contributed to the technology, some of which are individually acknowledged in this paper, the rest too numerous left to write their own memoirs.
Theory and New Primitives for Safely Connecting Routing Protocol Instances
"... Recent studies have shown that the current primitives for connecting multiple routing protocol instances (OSPF 1, OSPF 2, EIGRP 10, etc.) are pervasively deployed in enterprise networks and the Internet. Furthermore, these primitives are extremely vulnerable to routing anomalies (route oscillations, ..."
Abstract
-
Cited by 11 (3 self)
- Add to MetaCart
(Show Context)
Recent studies have shown that the current primitives for connecting multiple routing protocol instances (OSPF 1, OSPF 2, EIGRP 10, etc.) are pervasively deployed in enterprise networks and the Internet. Furthermore, these primitives are extremely vulnerable to routing anomalies (route oscillations, forwarding loops, etc.) and at the same time too rigid to support some of today’s operational objectives. In this paper, we propose a new theory to reason about routing properties across multiple routing instances. The theory directly applies to both link-state and vector routing protocols. Each routing protocol still makes independent routing decisions and may consider a combination of routing metrics, including bandwidth, delay, cost, and reliability. While the theory permits a range of solutions, we focus on a design that requires no changes to existing routing protocols. Guided by the theory, we derive a new set of connecting primitives, which are not only provably safe but also more expressive than the current version. We have implemented and validated the new primitives using XORP. The results confirm that our design can support a large range of desirable operational goals, including those not achievable today, safely and with little manual configuration. Categories and Subject Descriptors:
Sharing In A Privately Owned Workstation Environment
, 1988
"... Private workstations interconnected by networks have become widely available as sources of computing cycles. Each workstation is typically owned by a single user in order to provide a high quality of service for the owner. In most cases, an owner does not have computing demands as large as the capac ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Private workstations interconnected by networks have become widely available as sources of computing cycles. Each workstation is typically owned by a single user in order to provide a high quality of service for the owner. In most cases, an owner does not have computing demands as large as the capacity of the workstation. Therefore, most of the workstations are often under utilized. Nevertheless, some users have demands that exceed the capacities of their workstations. The desire to satisfy the requirements of users who need extra capacity without lowering the quality of service of owners of under utilized workstations raises the following challenging question: Can we provide a high quality of service in a highly utilized workstation cluster? The problem identified by this question is how to share workstation capacity with minimal interferencewith the local activity of workstation owners. This thesis addresses this problem of capacity sharing by exploring issues involved with the formation of a processor from a workstation cluster. The capacity of the processor bank comes from the donation of workstations during periods that the stations are not used During periods of usage, the workstations are withdrawn from the processor bank. We examined the amount of capacity available for donation, and the characteristics of the donation and withdrawal periods. A design
Flow labelled IP over ATM: design and rationale
- SIGCOMM Comput. Commun. Rev
"... We describe a system in which layer 2 switching is placed directly under the control of layer 3 routing protocols on a hop-by-hop basis. Specifically, ATM switching is controlled by IP. We couple each ATM switch with a general purpose computer running IP routing and management protocols. We define a ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
We describe a system in which layer 2 switching is placed directly under the control of layer 3 routing protocols on a hop-by-hop basis. Specifically, ATM switching is controlled by IP. We couple each ATM switch with a general purpose computer running IP routing and management protocols. We define a default ATM virtual channel identifier (VCI) to be used for transmitting IP packets over ATM links. We then define mechanisms which allow specific flows to be transmitted on specific ATM VCIs. The resulting system obeys IP’s semantics for routing and forwarding, and takes advantage of ATM’s switching hardware to accelerate the forwarding of packets. While this system takes advantage of ATM hardware, the ATM signalling, routing, and man-agement architecture (as specified by the ATM Forum) is replaced by the protocols and practices currently in use for IP routing and management.
Theory and New Primitives for Safely Connecting Routing Protocol Instances
, 2010
"... Recent studies have shown that the current primitives for connect-ing multiple routing protocol instances (OSPF 1, OSPF 2, EIGRP 10, etc.) are pervasively deployed in enterprise networks and the Internet. Furthermore, these primitives are extremely vulnerable to routing anomalies (route oscillations ..."
Abstract
- Add to MetaCart
(Show Context)
Recent studies have shown that the current primitives for connect-ing multiple routing protocol instances (OSPF 1, OSPF 2, EIGRP 10, etc.) are pervasively deployed in enterprise networks and the Internet. Furthermore, these primitives are extremely vulnerable to routing anomalies (route oscillations, forwarding loops, etc.) and at the same time too rigid to support some of today’s operational objectives. In this paper, we propose a new theory to reason about routing properties across multiple routing instances. The theory di-rectly applies to both link-state and vector routing protocols. Each routing protocol still makes independent routing decisions and may consider a combination of routing metrics, including bandwidth, delay, cost, and reliability. While the theory permits a range of so-lutions, we focus on a design that requires no changes to existing routing protocols. Guided by the theory, we derive a new set of connecting primitives, which are not only provably safe but also more expressive than the current version. We have implemented and validated the new primitives using XORP. The results confirm that our design can support a large range of desirable operational goals, including those not achievable today, safely and with little manual configuration. Categories and Subject Descriptors:
High-Speed Network Architectnre
, 1988
"... Summary Research and development of high speed communication networks is a national priority. Such networks serve two purposes, providing backbone connections that are used simultane-ously by many pairs of communicating machines and providing high-throughput connections for an individual pair of mac ..."
Abstract
- Add to MetaCart
Summary Research and development of high speed communication networks is a national priority. Such networks serve two purposes, providing backbone connections that are used simultane-ously by many pairs of communicating machines and providing high-throughput connections for an individual pair of machines. It is the thesis of!his paper that it is possible to construct a sin-gle high-speed network. technology that accommodates both needs. We argue a commwtication and switching fabric for such a technology can be built from existing electronic parts that will operate two orders of magnitude faster than existing systems. Faster electronic parts available in the future will enable the same technology to be extended to even higher speeds.
Status of this Memo
, 1991
"... This RFC suggests improvements in the NSFNET routing architecture to accommodate a more flexible interface to the Backbone clients. This memo provides information for the Internet community. It does not specify an Internet standard. Distribution of this memo is unlimited. ..."
Abstract
- Add to MetaCart
(Show Context)
This RFC suggests improvements in the NSFNET routing architecture to accommodate a more flexible interface to the Backbone clients. This memo provides information for the Internet community. It does not specify an Internet standard. Distribution of this memo is unlimited.
