waashk/dblp huggingface dataset:
peakedness measures for traffic characterization in high-speed networks. in high-speed networks based on asynchronous transfer mode (atm), variable bit rate (vbr) sources generate bursty cell streams which share link bandwidth wherever multiplexing occurs. in theory, the bandwidth requirement per stream to support a given quality-of-service at a multiplexer should generally decrease as the number of streams increases. in practice, high statistical multiplexing gain is difficult to achieve because good traffic characterizations are usually not available. this paper proposes the use of peakedness-based measures to capture the statistical information from traffic streams needed to determine bandwidth allocations. the standard definition of peakedness applies only to point process models of traffic. yet fluid models of traffic have certain advantages in terms of tractability. hence, we introduce a new measure called {\it modified peakedness}, which encompasses point process and fluid models under a common framework. we develop some of its properties and specialize it to several common traffic models. finally, we study the effectiveness of the peakedness/modified peakedness as burstiness measures for real-time traffic.
implementation and analysis of ip multicast over atm. today it is evident that atm technology will have its role in the future of internetworking. two major internet backbone service providers, sprint and mci, have marketed their investments in atm as a way to push more bandwidth into their internet infrastructures. regardless of whether atm technology will thrive in the wan or lan, it is also evident that the internet protocol (ip), which has been the glue of the internet allowing it to endure exponential growth, must be well supported over atm. ip multicast (protocol extensions to ip that allow ip packets from one source to be distributed to multiple destinations) is an essential part of ip which has allowed multimedia applications, for example, to more efficiently use internet resources. in this paper we describe an implementation of one model of supporting ip multicast over atm, the multicast over atm model developed by the ietf. we discuss empirical measurements gathered in a testbed with both a wan and a lan component that give insights into the behavior of this model. we detail some of the shortcomings of this model and discuss potential modifications to improve it. ideas for other approaches to ip multicast over atm are also described.
robust box bounds: throughput guarantees for closed multiclass queueing networks with minimal stochastic assumptions. to use queuing theory to analyze real systems such as computer communications networks, one makes assumptions that are, strictly speaking, untrue. the authors provide an exact analysis for cases with greatly relaxed assumptions. service times can have general increasing failure rate distributions, different by class even at fifo nodes. routing can be arbitrary, including dependencies along the route, provided the number of visits to each node is a random variable. only the mean service time and mean visit rates at nodes need be specified. a lower throughput bound is found which gives a minimum guaranteed throughput for each class; together with the familiar multiclass asymptotic upper bounds they give a convex feasible region in a multidimensional throughput space. a detailed analysis is given for systems with fifo and infinite-server nodes, and the extension to processor-sharing nodes is described. the results can be reinterpreted as a set of bounds on the separate throughputs. this is equivalent to a circumscribed rectangular region called the robust box bounds
sr: a bandwidth-reservation mac protocol for multimedia applications over all-optical wdm multi-rings. the paper describes sr3 (synchronous round robin with reservations), a collision-free medium access control protocol for all-optical slotted packet networks based on wdm multi-channel ring topologies where nodes are equipped with one fixed-wavelength receiver and one wavelength-tunable transmitter. sr3 is derived from the srr and mmr protocols previously proposed by the same authors for the same class of all-optical networks. srr and mmr already achieve an efficient exploitation of the available bandwidth, while guaranteeing a throughput-fair access to each node. sr3, in addition, allows nodes to reserve slots, thereby achieving a stronger control on access delays; it is thus well suited to meet tight delay requirements, as it is the case for multimedia applications. simulation results show that sr3 provides very good performance to guaranteed quality traffic, but also brings significant performance improvements for best-effort traffic.
pricing strategies under heterogeneous service requirements. this paper analyzes a communication network, used by customers with heterogeneous service requirements. we investigate priority queueing as a way to establish service differentiation. it is assumed that there is an infinite population of customers, who join the network as long as their utility (which is a function of the queueing delay) is larger than the price of the service. we focus on the specific situation with two types of users: one type is delay-sensitive ('voice'), whereas the other is delay-tolerant ('data'); these preferences are reflected in their utility curves. two models are considered: in the first the network determines the priority class of the users, whereas the second model leaves this choice to the users. for both models we determine the prices that maximize the provider's profit. importantly, these situations do not coincide. our analysis uses elements from queueing theory, but also from microeconomics and game theory (e.g., the concept of a nash equilibrium). we conclude the paper by considering a model in which throughput (rather than delay) is the main performance measure. again the pricing strategy exploits the heterogeneity in service requirements and willingness-to-pay.
metaring fairness control schemes in all-optical wdm rings. wdm rings are receiving significant attention in the field of all-optical networks because their implementation appears to be feasible with state-of-the-art components. several mac protocols were recently proposed in order to resolve contentions among nodes sharing the available wavelengths in wdm rings. these mac protocols achieve high efficiency but unsatisfactory fairness, due to the asymmetric position of sources with respect to destinations. thus, in order to improve fairness, it is necessary to adopt a fairness control scheme. in this paper we discuss the adaptation of the metaring fairness control scheme to the context of wdm multi-channel rings. several alternatives are considered and compared via simulation.
using partial differential equations to model tcp mice and elephants in large ip networks. in this paper we propose a new fluid model approach in which a different description of the dynamics of traffic sources is adopted, exploiting partial differential equations. this new description of the source dynamics allows the natural representation of short-lived as well as long-lived tcp connections, with no sacrifice in the scalability of the model. in addition, the use of partial differential equations permits the description of distributions, instead of averages, thus providing better accuracy in the results.the comparison between the performance estimates obtained with fluid models and with ns-2 simulations proves the accuracy of the proposed modeling approach.
cycles and waiting times in symmetric exhaustive and gated multiserver multiqueue systems. the authors consider symmetric multiserver multiqueue systems in the cases of exhaustive and gated service disciplines, and present exact analytical results for the average server cycle and vacation times, as well as approximate closed-form expressions for the average customer waiting time, thus complementing the results obtained by the same authors (1990) for the one-limited service discipline. arrival processes at each queue are assumed to be poisson, with the same rate for all queues; service times and walk times are modeled with independent, identically distributed random variables with arbitrary distributions. the two cases in which at most one server or any number of servers can simultaneously attend a queue are considered
priority service and max-min fairness. we study a priority service where users are free to choose the priority of their traffic, but are charged accordingly by the network. we assume that each user chooses priorities to maximize its own net benefit, and model the resulting interaction among users as a noncooperative game. we show that there exists an unique equilibrium for this game and that in equilibrium the bandwidth allocation is weighted max-min fair.
towards optimal policing in atm networks. this paper proposes a framework for optimal policing in atm networks. a general approach to modeling controllers which implement the policing function is described using finite-state automata. the theory of finite-state accepting automata and regular expressions enables the symbolic computation of the worst-case source and therefore provides a basis for the formulation and derivation of optimal bandwidth enforcement schemes. exhaustive searches are performed for small cases to find optimal finite-state automata. these optimal results are extended to obtain near-optimal solutions for higher-state automata. the optimal and near-optimal finite-state automata are compared to existing schemes, such as leaky buckets, and improvement in terms of cell loss rate of the declared source is achieved.
bandwidth sharing: objectives and algorithms. this paper concerns the design of distributed algorithms for sharing network bandwidth resources among contending flows. the classical fairness notion is the so-called max-min fairness. the alternative proportional fairness criterion has recently been introduced by kelly; we introduce a third criterion, which is naturally interpreted in terms of the delays experienced by ongoing transfers. we prove that fixed-size window control can achieve fair bandwidth sharing according to any of these criteria, provided scheduling at each link is performed in an appropriate manner. we then consider a distributed random scheme where each traffic source varies its sending rate randomly, based on binary feedback information from the network. we show how to select the source behavior so as to achieve an equilibrium distribution concentrated around the considered fair rate allocations. this stochastic analysis is then used to assess the asymptotic behavior of deterministic rate adaption procedures.
the use of communications networks to increase personal privacy. communications networks can separate as well as join information. this ability can be used to increase personal privacy in an environment where advances in technology makes it possible to collect and correlate increasing amounts of information about individuals. the tools and principles necessary to increase personal privacy are demonstrated by creating an anonymous credit card, in which a person's identity and purchases are separated, and a national health insurance plan, in which treatment, payment and an individual's identity are separated. an analysis technique is developed to determine how well the information is separated.
local fairness in general-topology networks with convergence routing. convergence routing is a unique variant of deflection routing which ensures that packets (or cells) will converge to their destinations along a global sense of direction. in this work we show how a global sense of direction can be used in an arbitrary network for the design of a control algorithm which (a) ensures fair access in switch-based local area networks, (b) is efficient with respect to performance measures we have developed, and (c) is easily interfaced to the convergence routing mechanism. we present performance measures which assess the new access- and flow-control algorithm: (i) locality- only the sub-network containing conflicting traffic streams gets involved in the fairness regulation; (ii) scalability-the data-structure sizes used in the algorithm are a function of the switching node degree, and use constant space control signals of only a-bit (the atm standard, for example, dedicates four bits in the header of each cell to generic flow-control); (iii) linear access-time measured by the "the maximal clique in the conflict-graph to which a node belongs", and a frequency which is inverse linear in this parameter (when the traffic pattern stabilizes).
time scale analysis of an atm queueing system with long-range dependent traffic. several types of network traffic have been shown to exhibit long-range dependence (lrd). in this work, we show that the busy period of an atm system driven by a long-range dependent process can be very large. we introduce a new traffic model based on a fractional brownian motion envelope process. we show that this characterization can be used to predict queueing dynamics. furthermore, we derive a new framework for computing delay bounds in atm networks based on this traffic model. we show that it agrees with results given by large deviation theory with less computational complexity.
error control for messaging applications in a wireless environment. the paper investigates error control mechanisms for mobile messaging applications, such as e-mail, fax, and credit card verification. although existing protocols provide efficient error control over conventional networks, wireless networks present significant new challenges. the radio link introduces noise and multipath interference causing long periods of increased error rate, while host motion requires changing communication paths that can cause packet delay, misordering, duplication, and loss. furthermore, scarce radio resources make bandwidth efficiency desirable. using measurements from a field-deployed pcs system in boulder colorado, the authors identify two types of reception area. they highlight the benefits of powerful error control mechanisms in the fringe reception areas, especially selective acknowledgments and combining data from multiple transmissions.
multi-hour, multi-traffic class network design for vp-based wide-area dynamically reconfigurable atm networks. the virtual path (vp) concept has been gaining attention in terms of effective deployment of atm (asynchronous transfer mode) networks in recent years. in this paper, we discuss a multi-hour, multi-traffic class network (capacity) design model for providing specified quality-of-service in dynamically reconfigurable atm networks. our approach is based on statistical multiplexing of traffic within a traffic class by using a virtual path for the class and deterministic multiplexing of different virtual paths, and on providing dynamic bandwidth and reconfigurability through the virtual path concept depending on traffic load during the course of the day. we show that, for test problems based on realistic network data, our approach does between 6% to 20% better than a local shortest path heuristic in terms of network cost. we also show that considering network dynamism through variation of traffic during the course of a day by doing dynamic bandwidth and virtual path reconfiguration can save between 10% to 14% in network design costs compared to a static network based on maximum busy hour traffic.
modeling and analysis of a single server queue with autocorrelated traffic. in performance analysis of computer and communication systems, the designer is often faced with two challenges: modelling an input process accurately and then solving a resulting queueing problem. the authors present a modelling methodology called qtes (quantized transform-expand-sample) which can be used to model the interarrival distribution (histogram) accurately and to capture the effect of autocorrelations approximately. they then show that a difficult queueing problem (using a qtes input with autocorrelations) can be solved. the method is analytically tractable and numerically robust as shown by various examples.
multiplexing spacer outputs on cell emissions. in atm networks, one effective way to provide service guarantees is to shape individual traffic streams at various points in the network. in the paper, the authors present a method for multiplexing a large number of single-stream spacer outputs on cell emissions rather than on cell arrivals. the method not only approximates first come first served (fcfs) multiplexing of such outputs but also better suits bursty arrivals. a number of performance related issues of the proposed method are identified and examined.
multi-channel copy networks: architecture, performance model, fairness, and cell sequencing. this paper develops a copy network architecture that can maintain the cell sequence integration multichannel atm switching. the architecture is internally nonblocking. assuming that cells appear with fanout request values that are distributed independently from cell to cell, we also formulate a method of analyzing the performance of the copy network. we conduct a numerical study for the proposed architecture using this method, and the effects of key network and traffic variables are quantified under arbitrary types of fanout distribution.
charging schemes for atm networks based on virtual effective bandwidths. in this paper, we propose charging schemes for atm networks based on the concept of virtual effective bandwidths (veb). vebs were initially developed by the authors to support real-time connection admission control (cac) in a framework where traffic sources with different quality of service (qos) requirements are multiplexed into the same finite length queue. vebs allow different qos requirements to be related which is important for charging purposes. we propose three charging schemes which can be included in real-time cac: the first one depends solely on the resource requirements of the call; the second is dependent on resource as well as qos requirements of the call; the third is dependent on the current traffic intensity of the other connections also.
performance analysis of multistage interconnection networks with shared-buffered switching elements for atm switching. the performance evaluation of multistage self-routing interconnection networks for asynchronous transfer mode (atm) switching is carried out by means of an analytical approach. the switching elements in the interconnection network are provided with a buffer shared among all the inlets and outlets of the element and no backpressure signals are exchanged between adjacent stages. two analytical models are considered: the scalar model and the vectorial model. in the former case the addresses of the packets in the same buffer are assumed to be mutually independent, whereas in the latter case the model keeps memory of the addresses of the packets stored in the buffer across consecutive time slots. the vectorial model provides performance measures much more accurate than the scalar model
estimation and removal of clock skew from network delay measurements. packet delay and loss traces are frequently used by network engineers, as well as network applications, to analyze network performance. the clocks on the end-systems used to measure the delays, however, are not always synchronized, and this lack of synchronization reduces the accuracy of these measurements. therefore, estimating and removing relative skews and offsets from delay measurements between sender and receiver clocks are critical to the accurate assessment and analysis of network performance. in this paper we introduce a linear programming based algorithm to estimate the clock skew in network delay measurements and compare it with three other algorithms. we show that our algorithm has the time complexity of $o(n)$, leaves the delay after the skew removal positive, and is robust in the sense that the error margin of the skew estimate is independent of the magnitude of the skew. we use traces of real internet delay measurements to assess the algorithm, and compare its performance to that of three other algorithms. furthermore, we show through simulation that our algorithm is unbiased, and that the sample variance of the skew estimates is better(smaller) than existing algorithms.
a method for analysing the performance aspects of the fault-tolerance mechanisms in fddi. the ability of error recovery mechanisms to make the fiber distributed data interface (fddi) satisfy real-time performance constraints in the presence of errors is analyzed. a complicating factor in these analyses is the rarity of the error occurrences, which makes direct simulation unattractive. therefore, a fast simulation technique, called injection simulation, which makes it possible to analyze the performance of fddi, including its fault tolerance behavior, was developed. the implementation of injection simulation for polling models of fddi is discussed, along with simulation results
bulk multicast transport protocol. bmtp offers rate controlled multicast with reliability, high throughput, and support for large numbers of receivers. a multicast sender needs feedback from receivers to recover from errors and to choose an appropriate send rate, but must avoid being overwhelmed as the number of receivers grows. bmtp does this by keeping the rate at which each receiver sends feedback inversely proportional to a running estimate of the number of receivers. bmtp bases its send rate on the minimum of the receive rates observed by the receivers, causing the sender to slow down in the face of packet loss or competing traffic, and to speed up when there is spare network capacity. bmtp's nak-based retransmission rarely sends any data more than twice, a substantial improvement over iterated unicast. rabin's information dispersal algorithm can reduce this re-send rate as close as desired to the underlying loss rate of the network. simulations with 1000 receivers substantiate these claims. the acm portal is published by the association for computing machinery. copyright © 2010 acm, inc. terms of usage privacy policy code of ethics contact us useful downloads: adobe acrobat quicktime windows media player real player
performance modelling of a multi-buffered banyan switch under bursty traffic. the authors present an analytical model of a buffered banyan asynchronous transfer mode (atm) switch which allows complex switching elements, bursty traffic, and nonuniform destination distributions and permits the analysis of large-scale switches. the atm switch is analyzed by decomposing it into individual switching elements. each switching element is then analyzed numerically in isolation assuming that its arrival and service processes are known. the parameters of the arrival and service processes of the switching elements are obtained using an iterative scheme. the results obtained are approximate and validation tests have shown that they have good accuracy. using this model, the cell loss, throughput, and the mean time to traverse the switch were obtained for different traffic parameters and buffer sizes within a switching element