Abstract. In this paper, we present an ef®cient and effective method to derive the worst case end-to-end delay for ATM network.Traf®c and service description plays an important part in the end-to-end delay analysis.By utilizing the inverse of these arrival and service functions, we can effectively compute the worst case delay of an ATM switch.We analyze and compare the performance of an ATM switch with priority driven and FIFO scheduling policies using different workload sets and under different utilization.We also compare the performance using our proposed ``integrated' ' method with the traditional ``independent' ' method.From our simulation experiments, we found out that our method always produced a better estimation ...
We present a method for providing hard real-time guarantees for traffic through an Asynchronous Tran...
Abst ract-- In this paper, we propose a versatile scheduling discipline, called Precedence with Part...
AbstractIn this paper, we propose a versatile scheduling discipline, called Precedence with Partial ...
: For admitting a hard real-time connection to an ATM network, it is required that the end-to-end de...
In this paper we address the issue of guaranteeing the end-to-end deadlines of hard real-time connec...
We usually measure cell delays in ATM switches by using time stamps. Alternatively, we here propose ...
The ability to guarantee timely delivery of messages is crucial in the design and validation of dist...
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bou...
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bou...
Real-time traffic requires strict delay constraints in terms of maximum cell transfer delay(CTD) and...
We present a technique to enable the efficient simulation of large scale ATM networks, while preserv...
Mathematical cell delay modelling and performance comparison of four iterative scheduling algorithms...
ATM networks being a connection-oriented technology are providing service for real-time communicatio...
One of the main features of ATM networks is to allow the establishment of connections with different...
Switched Ethernet is increasingly used in real-time communication due to its intrinsic features such...
We present a method for providing hard real-time guarantees for traffic through an Asynchronous Tran...
Abst ract-- In this paper, we propose a versatile scheduling discipline, called Precedence with Part...
AbstractIn this paper, we propose a versatile scheduling discipline, called Precedence with Partial ...
: For admitting a hard real-time connection to an ATM network, it is required that the end-to-end de...
In this paper we address the issue of guaranteeing the end-to-end deadlines of hard real-time connec...
We usually measure cell delays in ATM switches by using time stamps. Alternatively, we here propose ...
The ability to guarantee timely delivery of messages is crucial in the design and validation of dist...
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bou...
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bou...
Real-time traffic requires strict delay constraints in terms of maximum cell transfer delay(CTD) and...
We present a technique to enable the efficient simulation of large scale ATM networks, while preserv...
Mathematical cell delay modelling and performance comparison of four iterative scheduling algorithms...
ATM networks being a connection-oriented technology are providing service for real-time communicatio...
One of the main features of ATM networks is to allow the establishment of connections with different...
Switched Ethernet is increasingly used in real-time communication due to its intrinsic features such...
We present a method for providing hard real-time guarantees for traffic through an Asynchronous Tran...
Abst ract-- In this paper, we propose a versatile scheduling discipline, called Precedence with Part...
AbstractIn this paper, we propose a versatile scheduling discipline, called Precedence with Partial ...