20-10-2000 дата публикации
Номер: JP2000295288A
Принадлежит:
PROBLEM TO BE SOLVED: To enhance scheduling in an input queuing switch with a high throughput. SOLUTION: In the queuing system where M-sets of groups each consisting of N-sets of input queues (each requesting one service) are provided, each group is expressed as one apex in 1st apex set of bipartite graphs, each service is expressed as one apex in a 2nd apex set, and each queue that is not idle is expressed as a side between the corresponding apex in the 1st apex set and the apex in the 2nd apex set corresponding to a requested service (23.3). With respect to an apex (v) not yet matched in the 1st apex set, shake-up matching is applied to an apex (y) without weight and when the (y) is not part of a preceding matching, a new matching (x, y) is added (23.9). When the (y) is part of other matching already, the shake-up matching is executed by replacing (z, y) with matching (x, y) (23.11). Shake-up matching without weight is attained by taking the apex and the length of (y) into account. COPYRIGHT ...
Подробнее