A scheme which multiplexes long messages and single packets using a time-varying frame is presented. Long messages, generated from a fixed number of terminals, immediately access a main trunk, sharing a dynamically dedicated subchannel in a roundrobin fashion. Fixed size packets arrive with Poisson statistics in a FIFO queue and are served through the same trunk, using the remaining capacity. The two traffic categories share an integrated variable length frame. The frame length is determined by the volume of the increasing traffic at the beginning of the frame and cannot exceed a maximum value. Analysis of the performance of the system is carried out using finite population round-robin processor sharing and M/G/N queueing techniques. Simplifying modeling assumptions are checked with simulation. A comparison with fixed frame schemes demonstrates the superiority of the variable frame, in terms of more efficient bandwidth utilization.
[1]
Mark Kac,et al.
An Elementary Queueing Problem
,
1962
.
[2]
G. David Forney,et al.
The codex 6000 series of intelligent network processors
,
1976,
CCRV.
[3]
M. Fischer,et al.
A Model for Evaluating the Performance of an Integrated Circuit- and Packet-Switched Multiplex Structure
,
1976,
IEEE Trans. Commun..
[4]
M.J. Ross,et al.
Design approaches and performance criteria for integrated voice/data switching
,
1977,
Proceedings of the IEEE.
[5]
D. R. Doll,et al.
Multiplexing and concentration
,
1972
.
[6]
C. Weinstein,et al.
Data Traffic Performance of an Integrated Circuit- and Packet-Switched Multiplex Structure
,
1980,
IEEE Trans. Commun..