Journal ArticleDOI
Backbone Network Design and Performance Analysis: A Methodology for Packet Switching Networks
C. Monma,Diane Sheng +1 more
TLDR
This methodology is useful for investigating cost/performance tradeoffs of various network capabilities and components, thus providing a means for identifying potential cost and performance bottlenecks for different packet technologies and to guide capability requirements for new technologies.Abstract:
This paper describes a packet network design and analysis (PANDA) model which captures the important features of different packet technologies. This model evolved from many iterations with technology developers and network planners over several years. The main contribution is a methodology for designing low-cost backbone packet networks with satisfactory performance which is both practical and useful. This methodology is useful for investigating cost/performance tradeoffs of various network capabilities and components, thus providing a means for identifying potential cost and performance bottlenecks for different packet technologies and to guide capability requirements for new technologies.read more
Citations
More filters
Journal ArticleDOI
Hub Location and the p-Hub Median Problem
TL;DR: A p-hub median is defined, analogous to a p-median, and integer programming formulations for the multiple and single allocation p-Hub median problems are presented, and two new heuristics for the single allocations p- hub median problem are evaluated.
Journal ArticleDOI
Hub location in backbone/tributary network design: a review
TL;DR: A review of earlier algorithmic work on hub location problems in the particular context of communications networks is provided, drawing from the literature on facility location, network design, telecommunications, computer systems and transportation.
Journal ArticleDOI
Avoiding local optima in the p -hub location problem using tabu search and grasp
TL;DR: New heuristics for thep-hub location problem are described, based on tabu search and on a greedy randomized adaptive search procedure (GRASP), capable of examining several local optima, so that, overall, superior solutions are found.
Journal ArticleDOI
Heuristics for the p-hub location problem
TL;DR: Examination of heuristics that work with an incumbent set of hubs and systematically substitute other nodes for the incumbents based on local improvement measures are described.
References
More filters
Journal ArticleDOI
The Queueing Network Analyzer
TL;DR: This paper describes the Queueing Network Analyzer (QNA), a software package developed at Bell Laboratories to calculate approximate congestion measures for a network of queues and uses two parameters to characterize the arrival processes and service times.
Book
Analysis and synthesis of computer systems
Erol Gelenbe,Isi Mitrani +1 more
TL;DR: This paper presents a monographs on characterisation and control of Achievable Performance Control of Performance in Mutliple-Resource Systems and a Queue with Server of Walking Type.
Journal ArticleDOI
Approximate Analysis of General Queuing Networks by Decomposition
TL;DR: An approximate method for the analysis of general queuing networks is proposed, based on the method of decomposition where the total network is broken up into subsystems; e.g., queuing stations of the type GI/G/1 or subnets.
Journal ArticleDOI
On the Topological Design of Distributed Computer Networks
Mario Gerla,Leonard Kleinrock +1 more
TL;DR: This article surveys the modeling, analysis, and design of computercommunication networks developed with the packet-switched Advanced Research Projects Agency Network (ARPANET) in mind, although the principles extend to more general networks.
Journal ArticleDOI
Introduction to Queueing Theory (2nd ed.).
Marcel F. Neuts,Robert B. Cooper +1 more