Results 1 
6 of
6
The Statistical EndtoEnd Delay Guarantee for Networks with Selfsimilar Traffic
, 2003
"... ... In this paper, we further extend our statistical delay analysis to cover the entire network. We first show that the superposition of two selfsimilar processes remains selfsimilar. Then we show that the selfsimilar properties will not be altered by any server mechanism (e.g. switch with dif ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
... In this paper, we further extend our statistical delay analysis to cover the entire network. We first show that the superposition of two selfsimilar processes remains selfsimilar. Then we show that the selfsimilar properties will not be altered by any server mechanism (e.g. switch with different scheduling policies). With the above, we can derive the statistical endtoend delay guarantee for a switched network.
Efficient Computation Methods to Calculate the Worst Case Cell Delay for . . .
, 2003
"... ... In this paper, we present our approach in finding this worst case cell delay within an ATM switch. In terms of computation complexity, we find out that our proposed method is no harder than any other existing methods in finding such worse case delay. Furthermore, while other researchers tackl ..."
Abstract
 Add to MetaCart
... In this paper, we present our approach in finding this worst case cell delay within an ATM switch. In terms of computation complexity, we find out that our proposed method is no harder than any other existing methods in finding such worse case delay. Furthermore, while other researchers tackle different schedulers with different approaches, our method is general enough and is applicable to schedulers that adopt the FIFO, Static Priority (SP), Earliest Deadline First (EDF) and Generalized Processor Sharing (GPS) scheduling policies. In addition, our proposed "Fixed Points" method can trade off accuracy with computation complexity for performance improvement. As a result, our proposed method has shown to be superior to all existing methods in terms of computation complexity. Through our simulation experiments based on realtime MPEG video traffic, we arrived with the following observations: 1. If the deadlines are not greater than 0.2205 second, there is no significant improvement on the performances of connection admission control when more than 5 segments are used; 2. The fixed points computation method could efficiently reduce the computation complexity of the connection admission control by more than 50% with little performance loss; 3. Comparing to the FIFO Scheduler, the EDF scheduler has an advantage only in the region where traffic is less bursty and posses a wider range in deadlines.
doi:10.1155/2012/154038 Review Article Asymptotic Identity in MinPlus Algebra: A Report on CPNS
, 2011
"... which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Network calculus is a theory initiated primarily in computer communication networks, especially in the aspect of realtime communications, whereminplus algebra plays a role. C ..."
Abstract
 Add to MetaCart
(Show Context)
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Network calculus is a theory initiated primarily in computer communication networks, especially in the aspect of realtime communications, whereminplus algebra plays a role. Cyberphysical networking systems (CPNSs) are recently developing fast and models in data flows as well as systems in CPNS are, accordingly, greatly desired. Thoughminplus algebra may be a promising tool to linearize any node in CPNS as can be seen from its applications to the Internet computing, there are tough problems remaining unsolved in this regard. The identity in minplus algebra is one problem we shall address. We shall point out the confusions about the conventional identity in the minplus algebra and present an analytical expression of the asymptotic identity that may not cause confusions. 1.
Some New Findings on the Selfsimilarity Property in Communications Networks and on Statistical Endtoend Delay Guarantee
, 2003
"... Realtime communication requires performance guarantee from the underlying network. In order to analyse the network performance, we must find the traffic characterization in every server of the network. Due to the strong experimental evidence that network traffic is selfsimilar in nature, it is imp ..."
Abstract
 Add to MetaCart
Realtime communication requires performance guarantee from the underlying network. In order to analyse the network performance, we must find the traffic characterization in every server of the network. Due to the strong experimental evidence that network traffic is selfsimilar in nature, it is important to study the problems to see whether the superposition of two self similar processes retains the property of selfsimilarity and whether the service of a server changes the selfsimilarity property of the input traffic. In this paper, we first discusses some definitions and superposition properties of selfsimilar processes. Then we gives a model of a single server with infinite buffer and prove that when the queue length has finite secondorder moment, the input process being strong asymptotically secondorder selfsimilar(sass) is equivalent to the output process also bearing the sass property. Given the method for determinating the worst case cell delay for an ATM switch with self similar input traffic, we can determine the endtoend delay for such realtime communications in an ATM network by summing the cell delay experienced by each of the ATM switch along each connection.
Statistical delay analysis on an ATM switch with selfsimilar input traffic ✩
, 1999
"... ATM networks being a connectionoriented technology are providing service for realtime communication. Before two hosts can communicate, a connection has to be established between them. After a connection ..."
Abstract
 Add to MetaCart
(Show Context)
ATM networks being a connectionoriented technology are providing service for realtime communication. Before two hosts can communicate, a connection has to be established between them. After a connection
Title: Performance Comparison between Different Variations of DBIND Traffic Constraint Functions for MPEG Video Streams under an ATM Network 1
"... By the results of the comparision simulation, we derive that: 1. If the deadlines are not greater than 0.2205 second, the performances of CAC using segment number greater than 5 is the same; 2. Fixed point method could efficiently reduce the computation complexty of the connection admission control ..."
Abstract
 Add to MetaCart
(Show Context)
By the results of the comparision simulation, we derive that: 1. If the deadlines are not greater than 0.2205 second, the performances of CAC using segment number greater than 5 is the same; 2. Fixed point method could efficiently reduce the computation complexty of the connection admission control by more than 50 % with little performance loss; 3. Comparing to FIFO Scheduler, EDF scheduler has advantage only in the conditions of small bursty source and large deadline range.