A real-time channel is a simplex connection between two nodes characterized by parameters representing the performance requirements of the client. These parameters may include a bound on the minimum connection bandwidth, a bound on the maximum packet delay, and a bound on the maximum packet loss rate. Such a connection may be established in a packet-switching environment by means of the schemes described by some of the authors in previous papers. In this paper, we study the feasibility of bounding the delay jitter for real-time channels in a packet-switched store-and-forward wide-area network with general topology, extending the scheme proposed in the previous papers. We prove the correctness of our solution, and study its effectiveness by means of simulations. The results show that the scheme is capable of providing a significant reduction in delay jitter, that there is no accumulation of jitter along the path of a channel, and that jitter control reduces the buffer space required in the network significantly.
[1]
Chung Laung Liu,et al.
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
,
1989,
JACM.
[2]
Domenico Ferrari.
Client requirements for real-time communication services
,
1990
.
[3]
Dinesh C. Verma,et al.
A Packet-switching Network
,
1990
.
[4]
Herb Schwetman,et al.
CSIM† Reference Manual (Revision 16)
,
1992
.
[5]
Randy Brown,et al.
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
,
1988,
CACM.
[6]
Dinesh C. Verma,et al.
A Scheme for Real-Time Channel Establishment in Wide-Area Networks
,
1990,
IEEE J. Sel. Areas Commun..
[7]
Barry M. Leiner.
Critical issues in high bandwidth networking
,
1988,
RFC.