We study the superposition process of a class of independent renewal processes with long-range dependence. It is known that under two different scalings in time and space either fractional Brownian motion or a stable Levy process may arise in the rescaling asymptotic limit. It is shown here that in a third, intermediate scaling regime a new limit process appears, which is neither Gaussian nor stable. The new limit process is characterized by its cumulant generating function and some of its properties are discussed.

A simple explanation is given of an anomaly often detected in traffic measurement when packet timings are truncated to nearest whole numbers. The correct observed discrete distribution is then calculated from an underlying continuous distribution.

of power and storage resources. In this paper we explain about packet pair property in First-In-First-Out queuing networks and shown you how it can measure through bottleneck link bandwidth. The First-In-First-Out queuing network judges the difference in two packet landing times with equal sizes from same

This document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the "Internet Official Protocol Standards " (STD 1) for the standardization state and status of this protocol. Distribution of this memo is unlimited. Copyright Notice Copyright (c) 2009 IETF Trust and the persons identified as the

Multifractal behavior was recently observed in several traces of IP WAN traffic. This paper proposes a novel multifractal traffic model, which characterizes the joint process of packet ar-rivals and packet sizes. The construction of the traffic process is based on stochastic L-Systems, which were

process (dBMAP) that jointly characterizes the packet arrival process and the packet size distribution. In the proposed dBMAP, packet arrivals occur according to a discrete-time Markov modulated Poisson process (dMMPP) and each arrival is characterized by a packet size with a general distribution that may

Network arrivals are often modeled as Poisson processes for analytic simplicity, even though a number of traffic studies have shown that packet interarrivals are not exponentially distributed. We evaluate 24 wide-area traces, investigating a number of wide-area TCP arrival processes (session

This paper introduces a technique for applying packet arrival rate based queue management to class based scheduling algorithms. This enables a DiffServ architecture with very low packet latency, loss, and high link utilisation. Simulation results demonstrate that the proposed technique

Abstract-This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving

Abstruct-The stability of a queueing network with interdependent servers is considered. The dependency of servers is described by the definition of their subsets that can be activated simultaneously. Multihop packet radio networks (PRN’s) provide a motivation for the consideration of this system