Journal of High Speed Networks - Volume 3, issue 1

Authors: Felderman, Robert | DeSchon, Annette | Cohen, Danny | Finn, Gregory

Article Type: Research Article

Abstract: ATOMIC is an inexpensive high-speed LAN built by USC/ISI. It is based upon Mosaic technology developed for fine-grain, message-passing, massively paraIiel computation. Each Mosaic processor is capable of routing variable length packets, while providing added value through simultaneous computing and buffering. ATOMIC adds a general routing capability to the native Mosaic wormhole routing through store-and-forward and path concatenation. ATOMIC aggregate bandwidth scales as the number of nodes increases, and it has a small interface cost. Each ATOMIC channel has a data carrying capacity of 480 Mb/s. A prototype ATOMIC LAN has been constructed along with host interfaces and software that …provides full TCP/IP compatibility. Using ATOMIC, 1500-byte packets have been exchanged between hosts at an aggregate transfer rate of more than 1 Gb/s. Other tests have demonstrated throughput of 5.25 million packets per second over a single Mosaic channel. The architecture is flexible both in topology and functionality. This paper describes the architecture and performance of ATOMIC. Show more

Keywords: Local Area Network, Gigabit, Performance, Mosaic

DOI: 10.3233/JHS-1994-3101

Citation: Journal of High Speed Networks, vol. 3, no. 1, pp. 1-29, 1994

Authors: Mukherjee, Amamath | Strikwerda, John C.

Article Type: Research Article

Abstract: We present an approximate analysis of a queue with a dynamically changing input rate that is based on implicit or explicit feedback information. This is motivated by proposals for adaptive congestion control algorithms, [6] and [15], where the sender's window size at the transport level is adjusted based on perceived congestion level of a bottleneck node. We develop an analysis methodology for a simplified system; however, it is powerful enough to answer important questions regarding stability, convergence (or oscillations), fairness and the significant effect that delayed feedback plays on performance. This paper quantitatively identifies the cause of the these …effects, vis-a-vis the system parameters and properties of the algorithm used. Several conservation laws and balance equations governing this system are given. The model is fairly general and can be applied to evaluate the performance of a wide range of feedback control schemes. It is an extension of the classical Fokker-Planck equation. Because the Fokker-Planck equation models diffusion, it addresses traffic variability, and in a sense, extends earlier fluid approximation analyses. Show more

Keywords: Congestion Control, Fokker-Planck Equations, Transient Queueing Analysis, Diffusion Processes, Computer Networks, Distributed Agreement

DOI: 10.3233/JHS-1994-3102

Citation: Journal of High Speed Networks, vol. 3, no. 1, pp. 31-56, 1994

Authors: Ren, Zhixing | Meditch, James S.

Article Type: Research Article

Abstract: Future broadband networks will need to support transmission and switching at rates ranging from hundreds of Gbits/s to a Tbits/s or more. A feasible approach in the realization of such networks is the use of sets of parallel links or channels which are termed trunk groups or channel groups. In this paper, we examine an optimal bandwidth allocation scheme for multichanne1 systems to switch trunk groups. This new multichannel switching system features a simple architecture, high throughput, high channel utilization, and other properties such as preserving packet sequence, being robust to unbalanced input traffic loads, providing fair access to network …transmission resources, and fast packet processing via a pipeline structure. Numerical results show that the multichannel system can achieve a throughput of 91% per channel for a trunk group of 32 channels while also providing very low average cell delay performance in the presence of correlated inputs. Show more

Keywords: Broadband Networks, Multichannel Systems, Queueing Analysis

DOI: 10.3233/JHS-1994-3103

Citation: Journal of High Speed Networks, vol. 3, no. 1, pp. 57-79, 1994

Authors: Steenstrup, M.

Article Type: Research Article

Abstract: Route generation and message forwarding in large diverse internetworks is subject to multiple service-related constraints, referred to as policies, imposed both by the service providers (in terms of offered services and restrictions on these services) and by the users (in terms of service requirements). We present an approach to policy routing, called Inter-Domain Policy Routing (IDPR), designed to operate in an internetwork composed of thousands of separately administered networks. The primary objective of IDPR is to provide traffic with routes that satisfy the users' service requirements while respecting the service providers' service restrictions. In this paper, we present an overview …of IDPR, concentrating on those aspects of IDPR that make it well suited to policy routing in large internetworks with diversity among users and service providers. Show more

Keywords: Policy Routing, Internetwork

DOI: 10.3233/JHS-1994-3104

Citation: Journal of High Speed Networks, vol. 3, no. 1, pp. 81-105, 1994