By Topic

A processor scheduling design for gateways in heterogeneous data networks

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
$33 $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)
O. -C. Yue ; AT&T Bell Labs., Holmdel, NJ, USA

The performance of the limited-k policy for processor scheduling in gateways is analyzed. For bilateral gateways handling inbound and outbound traffic between a subnetwork and the backbone, this policy limits the number of messages served by the processor in one direction before switching to the other direction. The limited-k policy provides two tunable parameters for controlling the message delay, even under overload conditions in one direction. The applicable bounds on delays are discussed, and a throughput analysis is given. Simulation results are presented which provide guidance on how the parameters should be chosen based on relative traffic intensities. Also included are performance bounds for fixed parameter settings but arbitrary traffic intensities including overload in one direction

Published in:

Digital Communications, 1990. Electronic Circuits and Systems for Communications. Proceedings, 1990 International Zurich Seminar on

Date of Conference:

5-8 Mar 1990