1,721,160 research outputs found
An Adaptive Algorithm for Measurement-based Admission Control in Integrated Services Packet Networks
No full textRecommended from our members
On the Benefits of Random Linear Coding for Unicast Applications in Disruption Tolerant Networks
No full text561-56
A New Algorithm for Measurement-based Admission Control in Integrated Services Packet Network
No full textNetwork loss tomography using striped unicast probes
No full textIn this paper, we explore the use of end-to-end unicast traffic as measurement probes to infer link-level loss rates. We
leverage off of earlier work that produced efficient estimates for
link-level loss rates based on end-to-end multicast traffic measurements. We design experiments based on the notion of transmitting
stripes of packets (with no delay between transmission of successive packets within a stripe) to two or more receivers. The purpose
of these stripes is to ensure that the correlation in receiver observations matches as closely as possible what would have been observed if a multicast probe followed the same path to the receivers.
Measurements provide good evidence that a packet pair to distinct
receivers introduces considerable correlation which can be further
increased by simply considering longer stripes. Using an M/M/1/K
model for a link, we theoretically confirm this benefit for stripes.
We also use simulation to explore how well these stripes translate
into accurate link-level loss estimates. We observe good accuracy
with packet pairs, with a typical error of about 1%, which significantly decreases as stripe length is increased
Recommended from our members
Explicit loss inference in multicast tomography
No full textNetwork performance tomography involves correlating end-to-end performance measures over different network paths to infer the performance characteristics on their intersection. Multicast based inference of link-loss rates is the first paradigm for the approach. Existing algorithms generally require numerical solution of polynomial equations for a maximum-likelihood estimator (MLE), or iteration when applying the expectation maximization (EM) algorithm. The purpose of this note is to demonstrate a new estimator for link-loss rates that is computationally simple, being an explicit function of the measurements, and that has the same asymptotic variance as the MLE, to first order in the link-loss rates
Source Time Scale and Optimal Buffer/Bandwidth Trade-off for Regulated Traffic in an ATM Node
No full textIn this paper, we study the problem of resource allocation and control for an ATM node with regulated traffic. Both guaranteed lossless service and statistical service with small loss probability are considered. We investigate the relationship between source characteristics and the buffer/bandwidth trade-off under both services. Our contributions are the following. For guaranteed lossless service, we find that the optimal resource allocation scheme suggests a time scale separation of sources sharing an ATM node with finite bandwidth and buffer space, with the optimal buffer/bandwidth trade-off is determined by the sources' time scale. For statistical service with a small loss probability, we present a new approach for estimating the loss probability in a shared buffer multiplexor with the so called "extremal" on-off, periodic sources. Under this approach, the optimal resource allocation for statistical service is achieved by maximizing both the benefits of buffering sharing and bandwid..
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
- …
