2,416 research outputs found

    A computational approach for a fluid queue driven by a truncated birth-death process

    Get PDF
    In this paper, we consider a fluid queue driven by a truncated birth-death process with general birth and death rates. We find the equilibrium distribution of the content of the fluid buffer by computing the eigenvalues and eigenvectors of an associated real tridiagonal matrix. We provide efficient procedures which avoid numerical instability, to a greater extent, arising in a straightforward calculation of these quantities by standard procedures. In particular, we reduce the order of the matrix by one and show that this reduced matrix can be made symmetric and hence we could make use of the stable and efficient method of bisection to compute the eigenvalues. The effectiveness of these procedures is illustrated through tables and graphs. \u

    Temporal Correlations of Local Network Losses

    Get PDF
    We introduce a continuum model describing data losses in a single node of a packet-switched network (like the Internet) which preserves the discrete nature of the data loss process. {\em By construction}, the model has critical behavior with a sharp transition from exponentially small to finite losses with increasing data arrival rate. We show that such a model exhibits strong fluctuations in the loss rate at the critical point and non-Markovian power-law correlations in time, in spite of the Markovian character of the data arrival process. The continuum model allows for rather general incoming data packet distributions and can be naturally generalized to consider the buffer server idleness statistics

    Objectives, stimulus and feedback in signal control of road traffic

    Get PDF
    This article identifies the prospective role of a range of intelligent transport systems technologies for the signal control of road traffic. We discuss signal control within the context of traffic management and control in urban road networks and then present a control-theoretic formulation for it that distinguishes the various roles of detector data, objectives of optimization, and control feedback. By reference to this, we discuss the importance of different kinds of variability in traffic flows and review the state of knowledge in respect of control in the presence of different combinations of them. In light of this formulation and review, we identify a range of important possibilities for contributions to traffic management and control through traffic measurement and detection technology, and contemporary flexible optimization techniques that use various kinds of automated learning

    Bounded Delay Scheduling with Packet Dependencies

    Full text link
    A common situation occurring when dealing with multimedia traffic is having large data frames fragmented into smaller IP packets, and having these packets sent independently through the network. For real-time multimedia traffic, dropping even few packets of a frame may render the entire frame useless. Such traffic is usually modeled as having {\em inter-packet dependencies}. We study the problem of scheduling traffic with such dependencies, where each packet has a deadline by which it should arrive at its destination. Such deadlines are common for real-time multimedia applications, and are derived from stringent delay constraints posed by the application. The figure of merit in such environments is maximizing the system's {\em goodput}, namely, the number of frames successfully delivered. We study online algorithms for the problem of maximizing goodput of delay-bounded traffic with inter-packet dependencies, and use competitive analysis to evaluate their performance. We present competitive algorithms for the problem, as well as matching lower bounds that are tight up to a constant factor. We further present the results of a simulation study which further validates our algorithmic approach and shows that insights arising from our analysis are indeed manifested in practice

    A critical look at power law modelling of the Internet

    Get PDF
    This paper takes a critical look at the usefulness of power law models of the Internet. The twin focuses of the paper are Internet traffic and topology generation. The aim of the paper is twofold. Firstly it summarises the state of the art in power law modelling particularly giving attention to existing open research questions. Secondly it provides insight into the failings of such models and where progress needs to be made for power law research to feed through to actual improvements in network performance.Comment: To appear Computer Communication

    The effective bandwidth problem revisited

    Full text link
    The paper studies a single-server queueing system with autonomous service and â„“\ell priority classes. Arrival and departure processes are governed by marked point processes. There are â„“\ell buffers corresponding to priority classes, and upon arrival a unit of the kkth priority class occupies a place in the kkth buffer. Let N(k)N^{(k)}, k=1,2,...,â„“k=1,2,...,\ell denote the quota for the total kkth buffer content. The values N(k)N^{(k)} are assumed to be large, and queueing systems both with finite and infinite buffers are studied. In the case of a system with finite buffers, the values N(k)N^{(k)} characterize buffer capacities. The paper discusses a circle of problems related to optimization of performance measures associated with overflowing the quota of buffer contents in particular buffers models. Our approach to this problem is new, and the presentation of our results is simple and clear for real applications.Comment: 29 pages, 11pt, Final version, that will be published as is in Stochastic Model

    Computational probability

    Get PDF

    Power-Constrained Fuzzy Logic Control of Video Streaming over a Wireless Interconnect

    Get PDF
    Wireless communication of video, with Bluetooth as an example, represents a compromise between channel conditions, display and decode deadlines, and energy constraints. This paper proposes fuzzy logic control (FLC) of automatic repeat request (ARQ) as a way of reconciling these factors, with a 40% saving in power in the worst channel conditions from economizing on transmissions when channel errors occur. Whatever the channel conditions are, FLC is shown to outperform the default Bluetooth scheme and an alternative Bluetooth-adaptive ARQ scheme in terms of reduced packet loss and delay, as well as improved video quality
    • …
    corecore