Packet switch apparatus and multicasting method
First Claim
1. A packet switch apparatus sending a packet stored in a common memory to a plurality of paths having different bit rates, comprising:
- storing means for storing a packet to be sent to at least one path in a free space of the common memory;
enqueuing means for enqueuing a pointer indicating said packet stored in the shared memory to queues corresponding to paths to which said packet is scheduled to be sent;
sending means for dequeuing the pointer enqueued by said enqueuing means for each of the queues corresponding to the paths and sending the packet indicated by the pointer dequeued to the paths corresponding to the queues at the respective transmission bit rate thereof;
discarding means for discarding, on a queue basis, pointers from a head thereof in which it is determined that the number of pointers enqueued by said enqueuing means exceeds a predetermined threshold value; and
free-address management means for setting the free space of the common memory that is occupied by the packet to a busy state and changing the free space that is now in the busy state to a free state when the pointer indicating said packet is dequeued or discarded from all of the queues to which said packet is scheduled to be sent.
1 Assignment
0 Petitions
Accused Products
Abstract
A packet switch apparatus is disclosed which can send a packet to paths at the respective, different output bit rates thereof without degrading the efficiency of used of a common memory. A storing part stores a packet in a free space of the common memory. An enqueuing part enqueues a pointer indicating the stored packet to queues corresponding to paths to which the packet is scheduled to be sent. A sending part dequeues the enqueued pointer for each of the queues corresponding to the paths and sends the packet indicated by the dequeued pointer to the paths corresponding to the queues at the respective transmission bit rate thereof. A discarding part discards, on a queue basis, pointers from a head thereof in which it is determined that the number of pointers enqueued exceeds a predetermined threshold value. An free-address management part sets the free space of the common memory occupied by the packet to a busy state, and changes the free space that is now in the busy state to a free space when the pointer indicating the packet is dequeued or discarded from all of the queues to which the packet is scheduled to be sent.
-
Citations
14 Claims
-
1. A packet switch apparatus sending a packet stored in a common memory to a plurality of paths having different bit rates, comprising:
-
storing means for storing a packet to be sent to at least one path in a free space of the common memory;
enqueuing means for enqueuing a pointer indicating said packet stored in the shared memory to queues corresponding to paths to which said packet is scheduled to be sent;
sending means for dequeuing the pointer enqueued by said enqueuing means for each of the queues corresponding to the paths and sending the packet indicated by the pointer dequeued to the paths corresponding to the queues at the respective transmission bit rate thereof;
discarding means for discarding, on a queue basis, pointers from a head thereof in which it is determined that the number of pointers enqueued by said enqueuing means exceeds a predetermined threshold value; and
free-address management means for setting the free space of the common memory that is occupied by the packet to a busy state and changing the free space that is now in the busy state to a free state when the pointer indicating said packet is dequeued or discarded from all of the queues to which said packet is scheduled to be sent. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A multicasting method of sending a packet stored in a common memory to a plurality of paths having different bit rates, comprising the steps of:
-
storing a packet to be sent to at least one path in a free space of the common memory;
enqueuing a pointer indicating said packet stored in the shared memory to queues corresponding to paths to which said packet is scheduled to be sent;
dequeuing the pointer enqueued for each of the queues corresponding to the paths and sending the packet indicated by the pointer dequeued to the paths corresponding to the queues at the respective transmission bit rate thereof;
discarding, on a queue basis, pointers from a head thereof in which it is determined that the number of pointers enqueued exceeds a predetermined threshold value; and
setting the free space of the common memory that is occupied by the packet to a busy state and changing the free space that is now in the busy state to a free space when the pointer indicating said packet is dequeued or discarded from all of the queues to which said packet is scheduled to be sent. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
Specification