By Topic

A fair statistical multiplexer for an integrated services packet network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Stavrakakis, I. ; EE/CS Dept., Vermont Univ., Burlington, VT, USA

A statistical multiplexer with N input lines is analyzed under a general packet arrival model. The model is suitable for the unified description of the packet processes generated by different sources of information in an integrated services packet network (ISPN). To introduce a kind of fairness in the service procedure, it is assumed that the first packet of a message (or one of the packets arriving at the same slot) is given priority by entering a preemptive priority queue while the rest of the packets enter a second (low-priority) queue. This service policy favors single packets or, in general, short messages over long ones. In an integrated services network, where different kinds of messages are accommodated, it may be necessary to adopt such a service policy to avoid long delays of single packets (or short messages). The mean delay of the two categories of packets is calculated together with the mean buffer occupancy in each of the two queues

Published in:

Southeastcon '90. Proceedings., IEEE

Date of Conference:

1-4 Apr 1990