Procedure and system for scheduling a shared recourse...

Details Procedure and system for scheduling a shared recourse... Procedure and system for scheduling a shared recourse...

2001-10-19

2008-03-25

Shah, Chirag G. (Department: 2616)

Multiplex communications

Data flow congestion prevention or control

C370S412000, C370S503000

Reexamination Certificate

active

07349331

ABSTRACT:
Each synchronous flow (h=1, 2, Ns) is associated to a respective synchronous capacity value (Hh) indicative of the maximum amount of time for which a synchronous flow can be served before relinquishing the token. Each asynchronous flow (I=1, 2, NA) is, on the other hand, associated to a respective indicative value of the delay to be recovered so that the respective queue has the right to be served and to another value indicating the instant in which the server visited the respective queue in the pervious cycle. Each queue associated to a synchronous flow (h) is therefore served for a maximum amount of time that is equal to the aforesaid synchronous capacity value, while each queue associated to an asynchronous flow (i) is only served if the server's visit takes place with anticipation with respect to the expected instant. This anticipation is determined as the difference between the expected rotation time, needed by the server (10) to complete a visit cycle (T) of the queues associated to the aforesaid flows (h, i), and the time that has passed since the server's previous visit (10) and the delay accumulated. This difference, if positive, defines the maximum service time for the asynchronous queue. If the queue is empty when the server visits it, the server (10) moves on to the next queue even before the relative maximum service time has passed.

REFERENCES:
patent: 5291491 (1994-03-01), Hutchison et al.
patent: RE35001 (1995-07-01), Grow
patent: 5602852 (1997-02-01), Shiobara
patent: 6240094 (2001-05-01), Schneider
patent: 6377548 (2002-04-01), Chuah
patent: 6917586 (2005-07-01), Mauger et al.
Delay Analysis of the FDDI Synchronous Data Class by Genter et al. (IEEE 1990).
Performance Comparison of FDDI Models by Sadiku et al. (IEEE 1997).
Garanteeing Synchronous Messages With Arbitary Deadline Constraints . . . Malcolm et al.(IEEE 1993).
Performance Analysis of Token Rings as High Speed Backbone Network by Weelzel (IEEE 1990).
“Delay Analysis of FDDI Synchronous Data Class” by Genter & Vastola.
“Performance Compaerisn of FDDI Models” by Sadiku & Dempo.
“On Non-Existence of Optimal Local Synchronous Bandwidth Allocation Schemes . . . ” by Han, Shin, & Hou.
“An Integrated Service Token Ring LAN Using Distributed Priority Change Method” by Yoneda & Matsushita.
“Optimal Synchronous Capacity Allocation for hard Real-Time Comuinications . . . ” by Chen, Agrawal & Zhao.

Affiliated with

Also associated with

Rating

Procedure and system for scheduling a shared recourse... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Procedure and system for scheduling a shared recourse..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Procedure and system for scheduling a shared recourse... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3978707