-
公开(公告)号：JPH10313324A
公开(公告)日：1998-11-24
申请号：JP2757398
申请日：1998-02-09
Applicant: LUCENT TECHNOLOGIES INC
Inventor： DUFFIELD NICHOLAS G , TEI V RAKUSHIMAN , STILIADIS DIMITRIOS
Abstract: PROBLEM TO BE SOLVED: To provide an impartial queue system. SOLUTION: This packet delivery system is made up of a plurality of queues 20 (20a-20i) for each connection string packets temporarily, a weighting impartial queue scheduling means 40 that serves the packets at a prescribed rate, a means that detects the presence of packets in the queue, and a state-dependent scheduling means 200 that redistributes an excess band width generated resulting from the absence of the packet. The state-dependent scheduling means 200 serves the queues 20 according to a state variable, in response to the performance characteristics of the queues.
-
公开(公告)号：DE69835781T2
公开(公告)日：2007-09-13
申请号：DE69835781
申请日：1998-02-03
Applicant: LUCENT TECHNOLOGIES INC , AT & T CORP
Abstract: Apparatus for routing packets in a communication network comprises a plurality (100) of per-connection queues (20a--20i), each queue established for receiving packets from a respective source and temporarily storing received packets before routing to a particular destination; a weighted fair-queuing scheduler (40) for servicing packets from each of the plurality of per-connection queues at guaranteed pre-allocated rates; a sensing device for sensing a presence or absence of packets in queues, the absence of packets in queues indicating availability of excess bandwidth; and, a state dependent scheduler (200) for redistributing excess bandwidth upon sensing of queues absent packets, the state dependent scheduler (200) servicing those queues in accordance with a state variable corresponding to a performance property of the queues, wherein delay and isolation properties for routing packets of respective queues in weighted fair-queuing is preserved.
-
公开(公告)号：DE69835781D1
公开(公告)日：2006-10-19
申请号：DE69835781
申请日：1998-02-03
Applicant: LUCENT TECHNOLOGIES INC , AT & T CORP
Abstract: Apparatus for routing packets in a communication network comprises a plurality (100) of per-connection queues (20a--20i), each queue established for receiving packets from a respective source and temporarily storing received packets before routing to a particular destination; a weighted fair-queuing scheduler (40) for servicing packets from each of the plurality of per-connection queues at guaranteed pre-allocated rates; a sensing device for sensing a presence or absence of packets in queues, the absence of packets in queues indicating availability of excess bandwidth; and, a state dependent scheduler (200) for redistributing excess bandwidth upon sensing of queues absent packets, the state dependent scheduler (200) servicing those queues in accordance with a state variable corresponding to a performance property of the queues, wherein delay and isolation properties for routing packets of respective queues in weighted fair-queuing is preserved.
-
-
Search Results
3
records
(took 0.045 seconds)
