Results 1  10
of
429
Service Disciplines for Guaranteed Performance Service in PacketSwitching Networks
 Proceedings of the IEEE
, 1995
"... While today’s computer networks support only besteffort service, future packetswitching integratedservices networks will have to support realtime communication services that allow clients to transport information with performance guarantees expressed in terms of delay, delay jitter, throughput, ..."
Abstract

Cited by 609 (4 self)
 Add to MetaCart
(Show Context)
While today’s computer networks support only besteffort service, future packetswitching integratedservices networks will have to support realtime communication services that allow clients to transport information with performance guarantees expressed in terms of delay, delay jitter, throughput, and loss rate. An important issue in providing guaranteed performance service is the choice of the packet service discipline at switching nodes. In this paper, we survey several service disciplines that are proposed in the literature to provide perconnection endtoend peqormance guarantees in packetswitching networks. We describe their mechanisms, their similarities and differences, and the performance guarantees they can provide. Various issues and tradeoffs in designing service disciplines for guaranteed performance service are discussed, and a general framework for studying and comparing these disciplines are presented. I.
A Fast File System for UNIX
 ACM Transactions on Computer Systems
, 1984
"... A reimplementation of the UNIX file system is described. The reimplementation provides substantially higher throughput rates by using more flexible allocation policies that allow better locality of reference and can be adapted to a wide range of peripheral and processor characteristics. The new file ..."
Abstract

Cited by 565 (6 self)
 Add to MetaCart
(Show Context)
A reimplementation of the UNIX file system is described. The reimplementation provides substantially higher throughput rates by using more flexible allocation policies that allow better locality of reference and can be adapted to a wide range of peripheral and processor characteristics. The new file system clusters data that is sequentially accessed and provides two block sizes to allow fast access to large files while not wasting large amounts of space for small files. File access rates of up to ten times faster than the traditional UNIX file system are experienced. Long needed enhancements to the programmers’ interface are discussed. These include a mechanism to place advisory locks on files, extensions of the name space across file systems, the ability to use long file names, and provisions for administrative control of resource usage.
Determining Lyapunov Exponents from a Time Series
 Physica
, 1985
"... We present the first algorithms that allow the estimation of nonnegative Lyapunov exponents from an experimental time series. Lyapunov exponents, which provide a qualitative and quantitative characterization of dynamical behavior, are related to the exponentially fast divergence or convergence of n ..."
Abstract

Cited by 495 (1 self)
 Add to MetaCart
We present the first algorithms that allow the estimation of nonnegative Lyapunov exponents from an experimental time series. Lyapunov exponents, which provide a qualitative and quantitative characterization of dynamical behavior, are related to the exponentially fast divergence or convergence of nearby orbits in phase space. A system with one or more positive Lyapunov exponents is defined to be chaotic. Our method is rooted conceptually in a previously developed technique that could only be applied to analytically defined model systems: we monitor the longterm growth rate of small volume elements in an attractor. The method is tested on model systems with known Lyapunov spectra, and applied to data for the BelousovZhabotinskii reaction and CouetteTaylor flow. Contents 1.
On the distribution of the length of the longest increasing subsequence of random permutations
 J. Amer. Math. Soc
, 1999
"... Let SN be the group of permutations of 1, 2,...,N. If π ∈ SN,wesaythat π(i1),...,π(ik) is an increasing subsequence in π if i1 <i2 <·· · <ikand π(i1) < π(i2) < ···<π(ik). Let lN (π) be the length of the longest increasing subsequence. For example, if N =5andπis the permutation 5 1 ..."
Abstract

Cited by 495 (33 self)
 Add to MetaCart
(Show Context)
Let SN be the group of permutations of 1, 2,...,N. If π ∈ SN,wesaythat π(i1),...,π(ik) is an increasing subsequence in π if i1 <i2 <·· · <ikand π(i1) < π(i2) < ···<π(ik). Let lN (π) be the length of the longest increasing subsequence. For example, if N =5andπis the permutation 5 1 3 2 4 (in oneline notation:
The NPcompleteness column: an ongoing guide
 JOURNAL OF ALGORITHMS
, 1987
"... This is the nineteenth edition of a (usually) quarterly column that covers new developments in the theory of NPcompleteness. The presentation is modeled on that used by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NPCompleteness," W. H. Freem ..."
Abstract

Cited by 239 (0 self)
 Add to MetaCart
(Show Context)
This is the nineteenth edition of a (usually) quarterly column that covers new developments in the theory of NPcompleteness. The presentation is modeled on that used by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NPCompleteness," W. H. Freeman & Co., New York, 1979 (hereinafter referred to as "[G&J]"; previous columns will be referred to by their dates). A background equivalent to that provided by [G&J] is assumed, and, when appropriate, crossreferences will be given to that book and the list of problems (NPcomplete and harder) presented there. Readers who have results they would like mentioned (NPhardness, PSPACEhardness, polynomialtimesolvability, etc.) or open problems they would like publicized, should
An O(ND) Difference Algorithm and Its Variations
 Algorithmica
, 1986
"... The problems of finding a longest common subsequence of two sequences A and B and a shortest edit script for transforming A into B have long been known to be dual problems. In this paper, they are shown to be equivalent to finding a shortest/longest path in an edit graph. Using this perspective, a s ..."
Abstract

Cited by 212 (4 self)
 Add to MetaCart
(Show Context)
The problems of finding a longest common subsequence of two sequences A and B and a shortest edit script for transforming A into B have long been known to be dual problems. In this paper, they are shown to be equivalent to finding a shortest/longest path in an edit graph. Using this perspective, a simple O(ND) time and space algorithm is developed where N is the sum of the lengths of A and B and D is the size of the minimum edit script for A and B. The algorithm performs well when differences are small (sequences are similar) and is consequently fast in typical applications. The algorithm is shown to have O(N +D expectedtime performance under a basic stochastic model. A refinement of the algorithm requires only O(N) space, and the use of suffix trees leads to an O(NlgN +D ) time variation.
SSAHA: a fast search method for large DNA databases
 Genome Res
, 2001
"... Article cited in: ..."
(Show Context)
Should Tables Be Sorted?
, 1979
"... We examine optimality questions in the following information retrieval problem: Given a set S of n keys, store them so that queries of the form "Is X \in S?" can be answered quickly. It is shown that, in a rather general model including all the commonlyused schemes, rMn+qi P ro bes to the ..."
Abstract

Cited by 152 (0 self)
 Add to MetaCart
We examine optimality questions in the following information retrieval problem: Given a set S of n keys, store them so that queries of the form "Is X \in S?" can be answered quickly. It is shown that, in a rather general model including all the commonlyused schemes, rMn+qi P ro bes to the table are needed in the worst case, provided the key space is sufficiently large. The effects of smaller key space and arbitrary encoding are also explored.