Búsqueda Imágenes Maps Play YouTube Noticias Gmail Drive Más »
Iniciar sesión
Usuarios de lectores de pantalla: deben hacer clic en este enlace para utilizar el modo de accesibilidad. Este modo tiene las mismas funciones esenciales pero funciona mejor con el lector.

Patentes

  1. Búsqueda avanzada de patentes
Número de publicaciónUS6603772 B1
Tipo de publicaciónConcesión
Número de solicitudUS 09/282,539
Fecha de publicación5 Ago 2003
Fecha de presentación31 Mar 1999
Fecha de prioridad31 Mar 1999
TarifaPagadas
Número de publicación09282539, 282539, US 6603772 B1, US 6603772B1, US-B1-6603772, US6603772 B1, US6603772B1
InventoresFarshid Moussavi, Dhaval N. Shah
Cesionario originalCisco Technology, Inc.
Exportar citaBiBTeX, EndNote, RefMan
Enlaces externos: USPTO, Cesión de USPTO, Espacenet
Multicast routing with multicast virtual output queues and shortest queue first allocation
US 6603772 B1
Resumen
The invention includes a method and apparatus for routing multicast traffic with better performance and reduced Head of Line blocking. This is achieved by means of the use of multiple virtual output queues for each input interface that handles multicast traffic, called “multicast virtual output queues” (MVOQs). Schemes for allocation of queues including random allocation, round robin, and Shortest Queue First (SQF) allocation can further improve performance. In an alternative embodiment, global MVOQs that can be used as queues by multiple input interfaces, can be used instead of MVOQs associated with a specific input interface.
Imágenes(6)
Previous page
Next page
Reclamaciones(45)
What is claimed is:
1. A method of operating a switching device, said switching device receiving messages belonging to a plurality of multicast flows, comprising the steps of:
receiving, for each multicast flow of said plurality of multicast flows, a sequence of multicast messages;
associating each one message in each said sequence to a selected one of a set of multicast virtual output queues, said set of multicast virtual output queues having more than one and less than 2N individual multicast virtual output queues for each one of a plurality of N output interfaces, and N is 2 or greater; and
sending a head element of one of said set of multicast virtual output queues to said output interfaces.
2. A method as in claim 1, wherein said step of associating includes steps of
selecting a shortest one of said set of multicast virtual output queues at a time of performance of said steps for receiving; and
performing said steps of associating in response to a result of said steps of selecting.
3. A method as in claim 1, wherein said steps of associating include steps of
selecting a shortest one of said set of multicast virtual output queues at a time of performance of said steps for receiving a first said message; and
wherein said steps for associating operate to associate said first message with said shortest queue.
4. A method as in claim 1, wherein said steps of receiving include receiving a first said message;
said steps of associating include steps of (a) incrementing a counter for said selected queue; and (b) appending said first message to said selected queue; and
said steps of sending include steps of (a) selecting one of said queues; (b) sending a head element from said selected queue to a set of output interfaces; and (c) decrementing said counter for said selected queue.
5. A method as in claim 1, wherein said steps of associating include steps of:
selecting a random one of said set of multicast virtual output queues at a time of performance of said steps of receiving; and
performing said steps of associating in response to a result of said steps of selecting.
6. A method as in claim 1, wherein said steps of associating include steps of
selecting one of said set of multicast virtual output queues at a time of performance of said steps of receiving wherein the step of selection uses a round robin technique; and
performing said steps of associating in response to a result of said steps of selecting.
7. A method as in claim 1, wherein said steps of associating include steps of
selecting a random one of said set of multicast virtual output queues at a time of performance of said steps of receiving a first said message; and
wherein said steps of associating operate to associate said first message with said randomly selected queue.
8. A method as in claim 1, wherein said steps of associating include steps of
selecting a round-robin one of said set of multicast virtual output queues at a time of performance of said steps of receiving a first said message; and
wherein said steps of associating operate to associate said first message with said round robin queue.
9. A method of operating a switching device, said switching device receiving messages belonging to a plurality of multicast flows, comprising the steps of:
receiving, for each multicast flow of said plurality of multicast flows, a sequence of multicast messages;
associating each one message in each said sequence to a selected one of a set of multicast virtual output queues, said set of multicast virtual output queues having more than one and less than 2N individual multicast virtual output queues for each one of a plurality of N output interfaces, and N is 2 or greater; and
sending a head element of one of said set of multicast virtual output queues to said output interfaces in accordance with a policy to reduce head-of-line blocking.
10. A method of operating a switching device, said switching device receiving messages belonging to a plurality of multicast flows, comprising the steps of:
receiving a multicast message of a flow;
determining if said flow is assigned to a multicast virtual output queue (MVOQ) and in the event it is not assigned to a MVOQ, selecting a multicast virtual output queue (MVOQ) for said flow, said MVOQ selected from a plurality of available MVOQs (the selected MVOQ), said selecting based upon a policy, where said policy is chosen to distribute multicast flows over said plurality of MVOQs to reduce head-of-line blocking;
receiving a second multicast message of said flow; and
assigning said second multicast message to said selected MVOQ.
11. The method of claim 10 further comprising:
implementing a number of said MVOQs where said number is greater than or equal to 1 and less than 2N, where N is a number of output ports of said switching device, and N is 2 or greater.
12. The method of claim 10, wherein said policy is a Shortest Queue First policy where said selected MVOQ is selected as an MVOQ with a count that is the smallest of all the MVOQs in the plurality of MVOQs.
13. The method of claim 12 wherein said count is a number of cells in the MVOQ.
14. The method of claim 12 wherein said count is a total count for the MVOQ.
15. The method of claim 12 wherein said count is a total number of bytes in the MVOQ.
16. The method of claim 10 wherein said policy is a random assignment policy where said selected MVOQ is selected by random assignment of said flow to an MVOQ from said plurality of MVOQs.
17. The method of claim 10 wherein said policy is a round robin policy where said selected MVOQ is selected in a sequential cyclical order from said plurality of MVOQs.
18. The method of claim 10 wherein said policy is a combination of allocation policies.
19. The method of claim 10 further comprising the step of:
creating an entry in a flow table, said entry associated with said flow wherein said flow table is used to assign multicast messages associated with said flow to said selected MVOQ.
20. A computer readable medium containing computer executable instructions for performing the method recited in claim 1, claim 5 or claim 10.
21. An electromagnetic signal propagating on a computer network, the electromagnetic signal carrying information for executing on a computer the method of claim 1, claim 5 or claim 10.
22. An apparatus for operating a switching device, said switching device receiving messages belonging to a plurality of multicast flows, comprising:
a circuit adapted to receive a multicast message of a flow;
a circuit adapted to implement a plurality of multicast virtual output queues (MVOQs);
a circuit adapted to determine if said flow is assigned to a multicast virtual output queue (MVOQ) and in the event that it is not assigned to a MVOQ select a multicast virtual output queue (MVOQ) from said plurality of MVOQs based upon a policy where said policy is chosen to distribute multicast flows over said plurality of MVOQs to reduce head-of-line blocking;
a circuit adapted to receive a second multicast message of said flow; and
a circuit adapted to assign said second multicast message to said selected MVOQ.
23. The apparatus of claim 22 further comprising:
a circuit adapted to implement a number of said MVOQs where said number is greater than or equal to 1 and less than 2N, where N is a number of output ports of said switching device, and N is 2 or greater.
24. The apparatus of claim 22, wherein said policy is a Shortest Queue First policy where said selected MVOQ is selected as an MVOQ with a count that is the smallest of all the MVOQs in the plurality of MVOQs.
25. The apparatus of claim 24 wherein said count is a number of cells in the MVOQ.
26. The apparatus of claim 24 wherein said count is a total count for the MVOQ.
27. The apparatus of claim 24 wherein said count is a total number of bytes in the MVOQ.
28. The apparatus of claim 22 wherein said policy is a random assignment policy where said selected MVOQ is selected by random assignment of said flow to an MVOQ from said plurality of MVOQs.
29. The apparatus of claim 22 wherein said policy is around robin policy where said selected MVOQ is selected in a sequential cyclical order from said plurality of MVOQs.
30. The apparatus of claim 22 wherein said policy is a combination of allocation policies.
31. The apparatus of claim 22 further comprising:
a circuit adapted to create an entry in a flow table wherein said entry is associated with said flow and said flow table is used to assign multicast messages associated with said flow to said selected MVOQ.
32. The apparatus of claim 31 wherein said flow table is implemented in a content addressable memory (CAM).
33. The apparatus of claim 22 wherein said circuit adapted to determine if said flow is assigned to a multicast virtual output queue is a processor operating under program control.
34. An apparatus for operating a switching device, said switching device receiving messages belonging to a plurality of multicast flows, comprising:
a circuit adapted to receive a multicast message of a flow;
means for determining if said flow is assigned to a multicast virtual output queue (MVOQ) and in the event that it is not assigned to an MVOQ, selecting a multicast virtual output queue (MVOQ) for said flow, said MVOQ selected from a plurality of available MVOQs (the selected MVOQ), said selecting based upon a policy, where said policy is chosen to distribute multicast flows over said plurality of MVOQs to reduce head-of-line blocking;
a circuit adapted to receive a second multicast message of said new multicast flow; and
a circuit adapted to assign said second multicast message to said selected MVOQ.
35. The apparatus of claim 34 further comprising:
a circuit adapted to implement a number of said MVOQs where said number is greater than or equal to 1 and less than 2N, where N is a number of output ports of said switching device, and N is 2 or greater.
36. The apparatus of claim 34, wherein said policy is a Shortest Queue First policy where said selected MVOQ is selected as the MVOQ with a count that is the smallest of all the queues in the plurality of MVOQs.
37. The apparatus of claim 36 wherein said count is a number of cells in the MVOQ.
38. The apparatus of claim 36 wherein said count is a total count for the MVOQ.
39. The apparatus of claim 36 wherein said count is a total number of bytes in the MVOQ.
40. The apparatus of claim 34 wherein said policy is a random assignment policy where said selected MVOQ is selected at random from said plurality of MVOQs.
41. The apparatus of claim 34 wherein said policy is a round robin policy where said selected MVOQ is selected in a round robin fashion from said plurality of MVOQs.
42. The apparatus of claim 34 wherein said policy is a combination of allocation policies.
43. The apparatus of claim 34 further comprising:
a circuit adapted to create an entry in a flow table wherein said entry is associated with said flow and said flow table is used to assign multicast messages associated with said flow to said selected MVOQ.
44. The apparatus of claim 43 wherein said flow table is implemented in a content addressable memory (CAM).
45. The apparatus of claim 34 wherein said circuit adapted to determine if said flow is assigned to a multicast virtual output queue is a processor operating under program control.
Descripción
RELATED APPLICATIONS

This invention relates to U.S. Patent Application: application Ser. No 09/283,109, Express Mail Mailing No. EJ667757725US, filed this same day, in the name of Farshid Moussavi and Dhaval N. Shah, titled “Multicast Routing With Nearest Queue First Allocation and Dynamic and Static Vector Quantization,” assigned to the same assignee, The application is hereby incorporated by reference as if fully set forth herein.

It is respectfully suggested that it may be appropriate for the same examiner to examine both applications.

BACKGROUND OF THE INVENTION

1. Field of the Invention

This invention relates to multicast routing.

2. Related Art

Communication on a computer network is accomplished by sending messages. Messages can include one or more data packets. Packets can be of fixed or variable lengths. Cells are packets having a fixed length.

Messages have a source and at least one destination address. A computer network includes devices that direct traffic towards the destination address. A switch is one such device.

Switches have multiple input interfaces and multiple output interfaces, which may be connected in a variety of ways. A cross bar switch is designed so that every input interface can be connected to every output interface.

There are two types of network traffic. In the first type a message has only one final destination address. This is known as unicast traffic. One use of unicast traffic is point to point communication between two computers. In the second type of traffic, called multicast, a message is sent to multiple destinations. One use of multicast transmissions is when a computer user wishes to send a message over the Internet to many individuals wishing to receive the message. A switch can have both unicast input interfaces as well as multicast input interfaces; often an interface handles both unicast as well as multicast traffic.

Memory Bandwidth Limitations

There are two main types of schemes for storing messages in the known art, which are input queuing and output queuing. (Combinations are also possible). In input queuing, a packet is queued before it enters the crossbar switch, and waits in line to arrive at the head of the input queue and be sent onward to its destination across the crossbar fabric. In output queuing, packets are forwarded onto the crossbar fabric from the input interface immediately, and queued up as they arrive at their destination output.

Output queuing hits limitations in memory speed faster than does input queuing because output queuing requires a memory at the output which is capable of momentarily receiving traffic from multiple inputs (in the worst case, all inputs), and sending out traffic at the output line rate. This means the memory in an output queued scheme must be faster than the memory in an input queued scheme by a factor equal to the number of interfaces.

In order to improve efficiency and thus the general performance in the case of high performance systems, it is preferable to use input queuing to accomodate the limited memory speeds available. The following description of the Head of Line Blocking problem assumes an input queued system.

Head of Line Blocking Problem

A unicast message, having only one destination, only needs to be routed to one output interface of a switch. Messages may be simply queued in the order received until they can be transmitted through the selected output interface. A problem in the known art occurs when the message at the head of a first queue is to be sent to an output interface that is not available due to a message from another queue using the output interface. The first queue is blocked until the particular output interface is available; no messages from this queue can be sent until the first element in the queue, or “head element”, is cleared by being sent across the switch to the output interface. (The queue may be implemented with each element being a single packet or cell, or may be implemented with each element including all the packets or cells that make up a single message). If the output interface is busy for an extended period, several queues may become blocked. This is known as the Head-of-Line blocking (“HOL blocking”) problem.

A known technique for approaching the HOL blocking problem for unicast traffic is the use of virtual output queues (“VOQs”). VOQs are virtual (logical) queues maintained in software or hardware; each VOQ is associated with a physical interface. There is a one-to-one correspondence between the VOQs and possible input/output combinations. The number of VOQs needed scales arithmetically as M×N, where M and N are the number of output interfaces and input interfaces, respectively. For a crossbar switch with 16 unicast input interfaces and 16 output interfaces, commonly called a “16×16” switch, 256 VOQs are need. If a particular output interface is tied up, a virtual queue associated with some other output interface can still send messages to that other output interface.

It should be noted that although the term used is “virtual output queue”, the method is actually an input queued method, as the queues are maintained for each input interface.

The VOQ method has the drawback that it only applies to unicast routing. VOQs cannot be applied to multicast routing because for multicast the number of VOQs needed to accommodate all possible input/output combinations is prohibitively large, growing exponentially as 2M×N, where M is the number of output interfaces and N is the number of multicast input interfaces. For a switch with 2 input interfaces and 16 output interfaces, a total of 2×216 (approximately 130,000) virtual queues would be required to implement VOQs. Very large numbers of VOQs use valuable resources such as memory and chip real estate, and likely cannot fit on a single chip using current technology.

Multicast transmissions are increasingly common and HOL blocking is an ongoing and unaddressed problem for multicast routing. Accordingly, it would be advantageous to be able to route multicast messages with reduced HOL blocking, in a manner such that there is overall improved performance of the network.

This advantage is achieved in an embodiment of the invention in which multiple virtual output queues, for convenience in this application called “multicast virtual output queues” (“MVOQs”), are maintained for a multicast interface, the number of queues being an intermediate number between 1 and 2M, such as 8 for a switch having 16 output interfaces (M=16). These MVOQs are an input queued system. Implementation of an allocation policy in conjunction with queues can also increase performance.

SUMMARY OF THE INVENTION

The invention includes a method and apparatus for routing multicast traffic with better performance and reduced Head of Line blocking. This is achieved by means of the use of multiple virtual output queues for each input interface that handles multicast traffic, called “multicast virtual output queues” (MVOQs). Schemes for allocation of queues including random allocation, round robin, and Shortest Queue First (SQF) allocation can further improve performance. In an alternative embodiment, global MVOQs that can be used as queues by multiple input interfaces, can be used instead of MVOQs associated with a specific input interface.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram of a crossbar switch with 2 input interfaces and 4 output interfaces, with messages in a queue for each input interface.

FIG. 2 is a diagram of a flow table.

FIG. 3 is a process flow diagram of queuing a cell using MVOQs.

FIG. 4 is a process flow diagram for selecting the shortest queue.

FIG. 5 is a process flow diagram for sending a cell.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

In the following description, a preferred embodiment of the invention is described with regard to preferred process steps and data structures. Embodiments of the invention can be implemented using general purpose processors or special purpose processors operating under program control, or other circuits, adapted to particular process steps and data structures described herein. Implementation of the process steps and data structures described herein would not require undue experimentation or further invention.

Related Applications

Inventions described herein can be used in combination or conjunction with inventions described in the following patent application:

application Ser. No. 09/283,109, Express Mail Mailing No. EJ667757725US, filed this same day, in the name of Farshid Moussavi and Dhaval N. Shah, titled “Multicast Routing With Nearest Queue First Allocation And Dynamic and Static Vector Quantization,” assigned to the same assignee, attorney docket number CIS-062. The application is hereby incorporated by reference as if fully set forth herein.

Cell-based Network with Crossbar Switch and SQF

For clarity, the invention is described as used in a crossbar switch having one multicast input interface and 16 output interfaces, in a network using cell-based messages. It is to be understood that the invention may be applied to sizes other than 16-output interface crossbar and to switches other than cross bar switches. It is further to be understood that the invention may be applied to data transmissions other than cell-based transmission.

It is further to be understood that the invention may be applied to switches having both unicast as well as multicast input interfaces, or having input interfaces that handle both unicast as well as multicast traffic. The invention may be practiced in combination with VOQs, or unicast cells may simply be treated as multicast cells with a single bit set in the destination vector.

The preferred embodiment is described using 8 multicast virtual output queues. Other numbers of MVOQs can be used; however, for the preferred embodiment as described above and below, between 2 and 16 MVOQs provide the best performance advantages. Depending on the situation, such as the number of input and output interfaces, types of traffic, costs associating with implementing queues, other numbers of MVOQs may be preferred.

Cell-based means the data packets sent along the network have a fixed length.

Terminology

A multicast message is directed to multiple destinations. The “multicast destination vector” or “destination vector” stores the output interfaces for a given message. M is the number of output interfaces in the switch and the vector can be implemented as an M-bit bitmask. Each destination address combination can be represented by an M-bit vector; setting a bit to 1 indicates the message is to be sent to the corresponding output interface. For instance, a switch having 4 output interfaces has 16 possible destination address combinations; a destination vector of [0,1,1,0] means that the message should be sent to output interfaces 1 and 2, but not to output interfaces 0 or 3, in a switch where the four output interfaces are numbered 0, 1, 2, and 3.

A broadcast message is a case of multicast message. The broadcast message may have a special destination address, or an address where all bits in the destination vector are set. A broadcast message is treated as though all bits in the destination vector are set.

A “multicast flow” is a stream of packets, with the same multicast destination vector. A flow is defined as a “new flow” if no packets with that flow's destination vector exist in any of the multicast virtual output queues at the time of its arrival.

Two flows are “non overlapping flows” if their destination vectors do not both have a bit set in any location of their destination bitmask. That is, the flows do not share any common output interface.

Relation of Message to Flows

A message includes one or more data packets, which are preferably cells (fixed-length packets). A message can be one flow. If the transmission of a message is interrupted for a length of time, a message can give rise to multiple multicast flows, as defined above. However, at the time of handling by the switch, a flow that comprises a complete message is handled the same as a flow that is one of several flows comprising a message.

Overview of the Invention

Packets, which are cells in the preferred embodiment, arrive at an input interface of a switch. The switch routes network traffic to the appropriate destination(s). FIG. 1 is a diagram 100 of a cross bar switch having two input interfaces 111, 112 and four output interfaces 151-154. Input queues 120, 130 contain messages for respective input interfaces 111, 112. For convenience, in FIG. 1 each message is depicted as a single entry in the queue although each cell in a message is processed and queued separately, as discussed below, and the cells of different messages may arrive at the input interleaved. The messages in input queues 120, 130 are destined for various combinations of output interfaces. Each message may include one or more packets. The destination output interfaces for each message in the input queues 120, 130 are indicated by the sets of numbers shown in the schematic depiction of the entries in the queues 121-123, 131-134.

Each arriving cell is processed separately. If the cell is part of an existing flow, the MVOQ already allocated to the existing flow is selected as the MVOQ for this cell. If the cell is not part of an existing flow, the MVOQ for this cell is selected according to Shortest Queue First in the preferred embodiment.

The cell is queued in the selected MVOQ. Items in the MVOQs are scheduled and sent across the switch by a scheduler as in known in the art of switches. Once the cell has been sent to all destinations that are requested in its destination vector, the cell is dequeued from the MVOQ.

Number of MVOQs

For a switch with 16 outputs, there are preferably eight MVOQs. Greatest relative improvement is seen for approximately 2-16 MVOQs for such a switch. Diminishing returns on better performance occur when going to more than about 16 MVOQs for a 16 output switch.

Allocation of Queues for Existing Flows

The cells in a multicast flow are preferably assigned to the same output queue. If an incoming cell is part of an existing flow, the cell is assigned to the same MVOQ as the other cells in the existing flow. The detailed steps and data structures are discussed in the section on queuing a flow.

Assigning the cells in one multicast flow to different output queues would increase the chance that the head elements of two queues will be the same, resulting in HOL blocking, and is therefore undesirable in most circumstances. In addition, assigning a flow to one queue assures that the cells in the flow retain their ordering; that is, the cells will not arrive at the destination out of order, as might happen if flows were split between different queues.

Allocation of Queues for New Flows

The decision to which of the queues (8 MVOQs in the preferred embodiment) to allocate a flow can improve performance of the network. In the preferred embodiment, assignment of new flows is done by shortest queue first (SQF) allocation. However, allocation can also by done by random assignment, round robin, or other policies. These policies are subsequently described. The detailed steps and data structures are discussed in the section on queuing a flow.

Random Assignment

One allocation policy is allocation of queues by random assignment of flows to queues. This is a simple and computationally fast method. On average, random assignment results in good performance.

Round Robin

Another allocation policy is allocation of queues by round-robin assignment of flows to queues. That is, the output queues are picked in sequential, cyclical order. If there are M output queues, flow 1 is assigned to queue 1 and flow 2 is assigned to queue 2, and so on. Flow M+1 is assigned to queue 1, and flow M+2 is assigned to queue 2, and so on. Performance of the system using the round robin allocation policy will vary depending on the general character of the incoming traffic, and depending on the specific traffic that comes in.

Shortest Queue First

The preferred allocation policy is to allocate queues by assigning flows to the shortest queue first. We call this the “SQF” allocation policy. A queue may become very long because a flow assigned to it was very long, or it may become very long due to head of line blocking. SQF has the advantage of providing automatic feedback to the system, because flows are automatically directed away from long queues: by choosing the shortest queue, queues where there is HOL blocking are on average avoided. The detailed steps for selecting the shortest queue are discussed in the section on queuing a flow.

Other Allocation Policies

Other allocation policies, including combinations of allocation policies also may be used. A combination of random allocation with SQF, for instance by allocating every other flow by SQF, combines the random allocation policy feature of small computation time with the SQF feature of automatic feedback. Another example combination would be a weighted average of SQF allocation and Nearest Queue First (“NQF”) allocation which is disclosed in the above referenced, co-pending, application, “Multicast Routing With Nearest Queue First Allocation and Dynamic and Static Vector Quantization.” It is to be noted that even without a particular allocation policy, the use of multicast virtual output queues increases throughput of a switch.

Queuing a Cell

In the preferred embodiment, for each destination vector for which there is a cell in any queue, an entry showing the output queue to which the destination vector is assigned is kept, and a count of the number of cells having this destination vector is maintained. This information can be kept in a flow table. A diagram of an example flow table is shown in FIG. 2. In the preferred embodiment, the table is implemented in a Content Addressable Memory (CAM).

FIG. 3 is a process flow diagram 300 for queuing a cell. Each cell is handled separately. Upon receipt of a cell 310, an MVOQ is selected for the cell. To select an MVOQ, it is determined whether the cell is part of an existing multicast flow 320. This is done by checking the destination vector against the entries in the flow table.

If a matching entry is found, the cell is assigned to the same MVOQ as the entry and the counter in the flow table for that destination vector is incremented 322. Placing a cell in the same queue as earlier encountered cells with the same destination vector ensures that the ordering of cells on arrival at the destinations will be maintained.

If a matching entry for that destination vector is not found in the flow table, the cell is the first cell in a new flow as defined above. The MVOQ is selected by the allocation policy 320, preferably by the Shortest Queue First (SQF) policy 324. A process flow diagram 400 for determining the shortest queue is shown in FIG. 4. A pointer is initialized to point at the first entry in the table 410, and counters for counting output queue length for each output queue are set to be zero 410. The shortest queue is determined in the preferred embodiment by, for each entry in the flow table 420, 440, reading the output queue value and number of cells 420, incrementing the count for the output queue value read by the number of cells for this entry 430, and after all entries in the flow table have been read, choosing the MVOQ with the smallest count 450. A new entry in the flow table is created for this destination vector and this queue with the cell count for the entry equal to unity 326. However, other means for determining the shortest queue can be used, such as separately maintaining a total count for each output queue.

It is to be noted that for alternative embodiments where the communication is not cell-based, a measure of shortest queue other than number of cells can be used. One such measure is the total number of bytes in the queue.

Once the MVOQ is selected, in a preferred embodiment the cell is queued 330 by causing the tail element of the queue to point to the cell. The cell is set to have a null pointer in the node that is reserved to point to the next element. MVOQs are preferably maintained as linked lists with a node pointing to the next cell in the queue, with the last cell in the queue having a null pointer. There is a pointer to the head of each queue. A pointer to the tail of the queue is also maintained. In a preferred embodiment, these queues are implemented in hardware.

Sending a Cell

FIG. 5 is a process flow diagram 500 for sending a cell. To send a cell, first an MVOQ is selected 510.

Next, the head element of the queue is sent to the output interface and the pointer to the head of the queue is set to point to the next cell in the queue 520. This can be done by fanout splitting method or without fanout splitting. Both methods are known in the art of switches. In non-fanout splitting, the cell is simultaneously sent to all outputs, and can only be sent if all output interfaces are available. If done by fanout splitting, where the cell is sent to a subset of its destination output interfaces available at the moment, the cell may be retained to later be sent to those output interfaces to which it has not yet been sent; this is known in the art of switches.

Whether fanout or non-fanout splitting is preferable depends on the situations, as is known in the art of switches. When switch fabric capacity is constrained relative to output queue resources, non-fanout splitting is preferable. When output queue capacity is more valuable than switch resources, fanout splitting is preferred.

In the preferred embodiment, non-fanout splitting is used. However, after reading this application, those of ordinary skill in the art will recognize that the invention can be implemented for fanout splitting without undue experimentation or new invention. One way is to maintain a separate list containing the “current” destination vector of the head element for each MVOQ, with the “current” destination vector being the destination to which the cell has yet to be sent.

When the cell has been successfully sent to all appropriate output interfaces, the counter for the destination vector is decremented 530. If the count for this destination vector becomes zero, the entry for this destination vector is removed from the flow table.

Global MVOQs

In the preferred embodiment, a set of MVOQs is associated with a single physical input interface. In an alternative embodiment of the invention, the use of MVOQs can be extended across all the input interfaces. The effect of such a scheme would be that any MVOQ for the switch is accessible to any incoming flow. If there are 2 physical input interfaces and each has 8 MVOQs, there is a total of 16 MVOQs available to any incoming flow. As a practical implementation matter, the MVOQs would still be associated with a physical input interface: if the shortest queue is an MVOQ associated with a first input interface, then an incoming message at a second input interface would be transferred to the first input interface for queuing in the MVOQ.

Alternative Embodiments

Although preferred embodiments are disclosed herein, many variations are possible which remain within the concept, scope, and spirit of the invention, and these variations would become clear to those skilled in the art after perusal of this application.

Citas de patentes
Patente citada Fecha de presentación Fecha de publicación Solicitante Título
US413176722 Feb 197826 Dic 1978Bell Telephone Laboratories, IncorporatedEcho cancellation in two-wire, two-way data transmission systems
US41617194 Oct 197717 Jul 1979Ncr CorporationSystem for controlling synchronization in a digital communication system
US431628411 Sep 198016 Feb 1982Bell Telephone Laboratories, IncorporatedFrame resynchronization circuit for digital receiver
US439702013 Oct 19812 Ago 1983Bell Telephone Laboratories, IncorporatedError monitoring in digital transmission systems
US441972822 Jun 19816 Dic 1983Bell Telephone Laboratories, IncorporatedChannel interface circuit providing virtual channel number translation and direct memory access
US442456522 Jun 19813 Ene 1984Bell Telephone Laboratories, IncorporatedChannel interface circuit with high speed data message header field translation and direct memory access
US443708727 Ene 198213 Mar 1984Bell Telephone Laboratories, IncorporatedAdaptive differential PCM coding
US443851110 Nov 198020 Mar 1984Telebit CorporationPacketized ensemble modem
US44397633 Sep 198127 Mar 1984Bell Telephone Laboratories, IncorporatedCollision avoiding system and protocol for a multiple access digital communications system
US444521322 Ene 198224 Abr 1984Bell Telephone Laboratories, IncorporatedCommunication line interface for controlling data information having differing transmission characteristics
US444655522 Feb 19821 May 1984Michel DevaultTime division multiplex switching network for multiservice digital networks
US445695728 Sep 198126 Jun 1984Ncr CorporationApparatus using a decision table for routing data among terminals and a host system
US44646585 Mar 19827 Ago 1984At&T LaboratoriesMultipoint data communication system with collision detection
US449957613 Ago 198212 Feb 1985At&T Bell LaboratoriesMultiplexed first-in, first-out queues
US450635825 Jun 198219 Mar 1985At&T Bell LaboratoriesTime stamping for a packet switching system
US450776013 Ago 198226 Mar 1985At&T Bell LaboratoriesFirst-in, first-out (FIFO) memory configuration for queue storage
US453262619 Jul 198230 Jul 1985At&T Bell LaboratoriesCollision avoiding system and protocol for a two path multiple access digital communications system
US464453210 Jun 198517 Feb 1987International Business Machines CorporationAutomatic update of topology in a hybrid network
US46462877 Dic 198424 Feb 1987At&T Bell LaboratoriesIdle period signalling in a packet switching system
US46774236 Ene 198630 Jun 1987American Telephone & Telegraph, At&T Bell LaboratoriesADPCM coder-decoder including partial band energy transition detection
US467918927 Nov 19857 Jul 1987American Telephone And Telegraph CompanyAlternate routing arrangement
US467922720 May 19857 Jul 1987Telebit CorporationEnsemble modem structure for imperfect transmission media
US472326717 Jun 19852 Feb 1988Octocom Systems, Inc.Telephone line interface and dialer circuitry for telecommunications equipment
US473181612 Ene 198715 Mar 1988Telebit CorporationEnsemble modem structure for imperfect transmission media
US475013610 Ene 19867 Jun 1988American Telephone And Telegraph, At&T Information Systems Inc.Communication system having automatic circuit board initialization capability
US47574955 Mar 198612 Jul 1988Telebit CorporationSpeech and data multiplexor optimized for use over impaired and bandwidth restricted analog channels
US476319117 Mar 19869 Ago 1988American Telephone And Telegraph Company, At&T Bell LaboratoriesDial-up telephone network equipment for requesting an identified selection
US476981031 Dic 19866 Sep 1988American Telephone And Telegraph Company, At&T Bell LaboratoriesPacket switching system arranged for congestion control through bandwidth management
US476981131 Dic 19866 Sep 1988American Telephone And Telegraph Company, At&T Bell LaboratoriesPacket switching system arranged for congestion control
US477142529 Oct 198413 Sep 1988Stratacom, Inc.Synchoronous packet voice/data communication system
US481922815 Oct 19874 Abr 1989Stratacom Inc.Synchronous packet voice/data communication system
US482741115 Jun 19872 May 1989International Business Machines CorporationMethod of maintaining a topology database
US48337065 Ene 198823 May 1989Telebit CorporationEnsemble modem structure for imperfect transmission media
US483573721 Jul 198630 May 1989American Telephone And Telegraph Company, At&T Bell LaboratoriesMethod and apparatus for controlled removal and insertion of circuit modules
US487955126 Abr 19857 Nov 1989International Business Machines CorporationSwitching array with concurrent marking capability
US489330610 Nov 19879 Ene 1990Bell Communications Research, Inc.Method and apparatus for multiplexing circuit and packet traffic
US49032619 Mar 198820 Feb 1990Stratacom, Inc.Synchronous packet voice/data communication system
US492248631 Mar 19881 May 1990American Telephone And Telegraph CompanyUser to network interface protocol for packet communications networks
US493393723 Nov 198712 Jun 1990Kabushiki Kaisha ToshibaNetwork adapter for connecting local area network to backbone network
US49603104 Ago 19892 Oct 1990Optical Corporation Of AmericaBroad band nonreflective neutral density filter
US496249721 Sep 19899 Oct 1990At&T Bell LaboratoriesBuilding-block architecture of a multi-node circuit-and packet-switching system
US496253222 Dic 19889 Oct 1990Ibm CorporationMethod for providing notification of classified electronic message delivery restriction
US496577215 Jun 198723 Oct 1990International Business Machines CorporationMethod and apparatus for communication network alert message construction
US497067828 Jun 198813 Nov 1990International Business Machines CorporationSystem for providing context-sensitive on-line documentation in a data processor
US497911810 Mar 198918 Dic 1990Gte Laboratories IncorporatedPredictive access-control and routing system for integrated services telecommunication networks
US498089712 Ago 198825 Dic 1990Telebit CorporationMulti-channel trellis encoder/decoder
US49911692 Ago 19885 Feb 1991International Business Machines CorporationReal-time digital signal processing relative to multiple digital communication channels
US500359529 Ago 198926 Mar 1991At&T Bell LaboratoriesSecure dial access to computer systems
US501426530 Nov 19897 May 1991At&T Bell LaboratoriesMethod and apparatus for congestion control in a data network
US502005823 Ene 198928 May 1991Stratacom, Inc.Packet voice/data communication system having protocol independent repetitive packet suppression
US503307631 Ene 199016 Jul 1991At&T Bell LaboratoriesEnhanced privacy feature for telephone systems
US505403415 Jun 19891 Oct 1991Telebit CorporationEnsemble modem structure for imperfect transmission media
US505992528 Sep 199022 Oct 1991Stratacom, Inc.Method and apparatus for transparently switching clock sources
US507244915 Feb 199010 Dic 1991Stratacom, Inc.Packet framing using cyclic redundancy checking
US508803229 Ene 198811 Feb 1992Cisco Systems, Inc.Method and apparatus for routing communications among computer networks
US509548016 Jun 198910 Mar 1992Fenner Peter RMessage routing system for shared communication media networks
US511543128 Sep 199019 May 1992Stratacom, Inc.Method and apparatus for packet communications signaling
US512894531 Oct 19917 Jul 1992Stratacom, Inc.Packet framing using cyclic redundancy checking
US513658016 May 19904 Ago 1992Microcom Systems, Inc.Apparatus and method for learning and filtering destination and source addresses in a local area network system
US516693017 Dic 199024 Nov 1992At&T Bell LaboratoriesData channel scheduling discipline arrangement and method
US519904927 Abr 199030 Mar 1993At&T Bell LaboratoriesCircuit and method of digital carrier detection for burst mode communication systems
US520688616 Abr 199027 Abr 1993Telebit CorporationMethod and apparatus for correcting for clock and carrier frequency offset, and phase jitter in mulicarrier modems
US52088111 Nov 19904 May 1993Hitachi, Ltd.Interconnection system and method for heterogeneous networks
US521268629 Sep 198918 May 1993Plessey Overseas LimitedAsynchronous time division switching arrangement and a method of operating same
US522409917 May 199129 Jun 1993Stratacom, Inc.Circuitry and method for fair queuing and servicing cell traffic using hopcounts and traffic classes
US522612021 May 19906 Jul 1993Synoptics Communications, Inc.Apparatus and method of monitoring the status of a local area network
US522806227 May 199213 Jul 1993Telebit CorporationMethod and apparatus for correcting for clock and carrier frequency offset, and phase jitter in multicarrier modems
US522999427 Sep 199120 Jul 1993Alcatel CitBridge for connecting an ieee 802.3 local area network to an asynchronous time-division multiplex telecommunication network
US52375645 Abr 199117 Ago 1993France TelecomFrame switching relay for asynchronous digital network
US524168218 Abr 199131 Ago 1993International Business Machines CorporationBorder node having routing and functional capability in a first network and only local address capability in a second network
US524334222 Jul 19927 Sep 1993Stratacom, Inc.Integrated PCM level control and conversion using a lookup table
US524359618 Mar 19927 Sep 1993Fischer & Porter CompanyNetwork architecture suitable for multicasting and resource locking
US524751628 Mar 199121 Sep 1993Sprint International Communications Corp.Configurable composite data frame
US524917826 Jul 199128 Sep 1993Nec CorporationRouting system capable of effectively processing routing information
US52532518 Ene 199212 Oct 1993Nec CorporationSwitching system with time-stamped packet distribution input stage and packet sequencing output stage
US525529114 Nov 198819 Oct 1993Stratacom, Inc.Microprocessor based packet isochronous clocking transmission system and method
US526093315 May 19929 Nov 1993International Business Machines CorporationAcknowledgement protocol for serial data network with out-of-order delivery
US526097830 Oct 19929 Nov 1993Bell Communications Research, Inc.Synchronous residual time stamp for timing recovery in a broadband network
US526859226 Feb 19917 Dic 1993International Business Machines CorporationSequential connector
US52689005 Jul 19917 Dic 1993Codex CorporationDevice and method for implementing queueing disciplines at high speeds
US527100427 Ago 199114 Dic 1993Gpt LimitedAsynchronous transfer mode switching arrangement providing broadcast transmission
US527463111 Mar 199128 Dic 1993Kalpana, Inc.Computer network switching system
US527463518 Nov 199228 Dic 1993Stratacom, Inc.Method and apparatus for aligning a digital communication data stream across a cell network
US527464311 Dic 199228 Dic 1993Stratacom, Inc.Method for optimizing a network having virtual circuit routing over virtual paths
US52804703 Feb 199318 Ene 1994At&T Bell LaboratoriesBandwidth and congestion management in accessing broadband ISDN networks
US528048021 Feb 199118 Ene 1994International Business Machines CorporationSource routing transparent bridge
US528050010 Oct 199118 Ene 1994Crescendo Communications, Inc.Method and apparatus for multilevel encoding for a local area network
US528378328 Ene 19931 Feb 1994Synoptics Communications, Inc.Apparatus and method of token ring beacon station removal for a communication network
US528710330 Dic 199115 Feb 1994At&T Bell LaboratoriesMethod and apparatus for providing local area network clients with internetwork identification data
US528745318 Sep 199015 Feb 1994Bull Hn Information Systems, Inc.Fast remote file access facility for distributing file access requests in a closely coupled computer system
US529148224 Jul 19921 Mar 1994At&T Bell LaboratoriesHigh bandwidth packet switch
US530531120 May 199219 Abr 1994Xerox CorporationCopy network providing multicast capabilities in a broadband ISDN fast packet switch suitable for use in a local area network
US530734327 Nov 199026 Abr 1994Italtel Societa Italiana Telecommunicazioni S.P.A.Basic element for the connection network of a fast packet switching node
US530943729 Jun 19903 May 1994Digital Equipment CorporationBridge-like internet protocol router
US53115096 Feb 199210 May 1994International Business Machines CorporationConfigurable gigabits switch adapter
US53134541 Abr 199217 May 1994Stratacom, Inc.Congestion control for cell networks
US531358230 Abr 199117 May 1994Standard Microsystems CorporationMethod and apparatus for buffering data within stations of a communication network
US53175627 May 199331 May 1994Stratacom, Inc.Method and apparatus for routing cell messages using delay
US531964421 Ago 19927 Jun 1994Synoptics Communications, Inc.Method and apparatus for identifying port/station relationships in a network
US53274216 Nov 19925 Jul 1994At&T Bell LaboratoriesApparatus for interfacing between telecommunications call signals and broadband signals
US533163730 Jul 199319 Jul 1994Bell Communications Research, Inc.Multicast routing using core based trees
US53454456 Nov 19926 Sep 1994At&T Bell LaboratoriesEstablishing telecommunications calls in a broadband network
US53454466 Nov 19926 Sep 1994At&T Bell LaboratoriesEstablishing telecommunications call paths in broadband communication networks
US535959225 Jun 199325 Oct 1994Stratacom, Inc.Bandwidth and congestion control for queue channels in a cell switching communication controller
US53612503 Nov 19931 Nov 1994Synoptics Communications, Inc.Apparatus and method of token ring beacon station removal for a communication network
US536125627 May 19931 Nov 1994International Business Machines CorporationInter-domain multicast routing
US536125919 Feb 19931 Nov 1994American Telephone And Telegraph CompanyWide area network (WAN)-arrangement
US53655246 Nov 199215 Nov 1994At&T Bell LaboratoriesEstablishing telecommunications call paths between clustered switching entities
US536751716 Dic 199222 Nov 1994International Business Machines CorporationMethod and system of requesting resources in a packet-switched network with minimal latency
US537185214 Oct 19926 Dic 1994International Business Machines CorporationMethod and apparatus for making a cluster of computers appear as a single host on a network
US538656714 Oct 199231 Ene 1995International Business Machines Corp.Hot removable and insertion of attachments on fully initialized computer systems
US539017029 Jun 199314 Feb 1995Synoptics Communications, Inc.Method and apparatus providing for bootstrapping of switches in an ATM network or the like
US539017520 Dic 199314 Feb 1995At&T CorpInter-cell switching unit for narrow band ATM networks
US539439424 Jun 199328 Feb 1995Bolt Beranek And Newman Inc.Message header classifier
US539440210 Jun 199428 Feb 1995Ascom Timeplex Trading AgHub for segmented virtual local area network with shared media access
US540032529 Jun 199321 Mar 1995Synoptics Communications, Inc.Method and apparatus providing for hunt groups in an ATM network of the like
US540846922 Jul 199318 Abr 1995Synoptics Communications, Inc.Routing device utilizing an ATM switch as a multi-channel backplane in a communication network
US541684210 Jun 199416 May 1995Sun Microsystems, Inc.Method and apparatus for key-management scheme for use with internet protocols at site firewalls
US54228805 Abr 19936 Jun 1995Stratacom, Inc.Broadband switching fabric in a communication controller
US542288220 Dic 19936 Jun 1995At&T Corp.ATM networks for narrow band communications
US542300228 Feb 19946 Jun 19953Com CorporationSystem for extending network resources to remote networks
US542663620 Dic 199320 Jun 1995At&T Corp.ATM distribution networks for narrow band communications
US542860720 Dic 199327 Jun 1995At&T Corp.Intra-switch communications in narrow band ATM networks
US543071515 Sep 19934 Jul 1995Stratacom, Inc.Flexible destination address mapping mechanism in a cell switching communication controller
US54307294 Abr 19944 Jul 1995Motorola, Inc.Method and apparatus for adaptive directed route randomization and distribution in a richly connected communication network
US544245711 Ene 199315 Ago 1995Najafi; HamidMulti-line pooling facsimile apparatus
US544263025 May 199115 Ago 1995Gagliardi; Ugo O.ISDN interfacing of local area networks
US545229720 Dic 199319 Sep 1995At&T Corp.Access switches for large ATM networks
US547359922 Abr 19945 Dic 1995Cisco Systems, IncorporatedStandby router protocol
US54736079 Ago 19935 Dic 1995Grand Junction Networks, Inc.Packet filtering for data networks
US547754113 Dic 199319 Dic 1995White; Richard E.Addressing technique for storing and referencing packet data
US548545528 Ene 199416 Ene 1996Cabletron Systems, Inc.Network having secure fast packet switching and guaranteed quality of service
US549014030 Sep 19946 Feb 1996International Business Machines CorporationSystem and method for providing ATM support for frame relay DTEs with a terminal adapter
US549025829 Sep 19926 Feb 1996Fenner; Peter R.Associative memory for very large key spaces
US549168728 Sep 199413 Feb 1996International Business Machines CorporationMethod and system in a local area network switch for dynamically changing operating modes
US54918044 Ene 199113 Feb 1996International Business Machines Corp.Method and apparatus for automatic initialization of pluggable option cards
US549736815 Ago 19945 Mar 1996Koninklijke Ptt Nederland N.V.Routing method for a hierarchical communications network, and a hierarchical communications network having improved routing
US55047473 Mar 19932 Abr 1996Apple Computer, Inc.Economical payload stream routing in a multiple-ring network
US550900618 Abr 199416 Abr 1996Cisco Systems IncorporatedApparatus and method for switching packets using tree memory
US551970421 Abr 199421 May 1996Cisco Systems, Inc.Reliable transport protocol for internetwork routing
US551985810 Ene 199221 May 1996Digital Equipment CorporationAddress recognition engine with look-up database for storing network information
US552648919 Mar 199311 Jun 19963Com CorporationSystem for reverse address resolution for remote network device independent of its physical address
US553096316 Dic 199325 Jun 1996International Business Machines CorporationMethod and system for maintaining routing between mobile workstations and selected network workstation using routing table within each router device in the network
US55351956 May 19949 Jul 1996Motorola, Inc.Method for efficient aggregation of link metrics
US553973421 Jul 199423 Jul 1996Newbridge Networks CorporationMethod of maintaining PVC status packetized communication system
US554191112 Oct 199430 Jul 19963Com CorporationRemote smart filtering communication management system
US554637029 Jul 199413 Ago 1996Olympus Optical Co., Ltd.Compact apparatus having bidirectional motion for loading/unloading an information recording medium
US555524430 Jun 199410 Sep 1996Integrated Network CorporationScalable multimedia network
US556166926 Oct 19941 Oct 1996Cisco Systems, Inc.Computer network switching system with expandable number of ports
US558386228 Mar 199510 Dic 1996Bay Networks, Inc.Method and apparatus for routing for virtual networks
US559247021 Dic 19947 Ene 1997At&TBroadband wireless system and network architecture providing broadband/narrowband service with optimal static and dynamic bandwidth/channel allocation
US55985816 Ago 199328 Ene 1997Cisco Sytems, Inc.Variable latency cut through bridge for forwarding packets in response to user's manual adjustment of variable latency threshold point while the bridge is operating
US560079826 Oct 19934 Feb 1997International Business Machines CorporationSystem and method for controlling LAN data flow control through a frame relay network by end point station transmitting notification to LAN stations based on congestion notification from the frame relay network
US560486825 Jun 199118 Feb 1997Fujitsu LimitedCommunication system using establishing network route
US56174177 Sep 19941 Abr 1997Stratacom, Inc.Asynchronous transfer mode communication in inverse multiplexing over multiple communication links
US561742117 Jun 19941 Abr 1997Cisco Systems, Inc.Extended domain computer network using standard links
US563012523 May 199413 May 1997Zellweger; PaulMethod and apparatus for information management using an open hierarchical data structure
US563190828 Mar 199520 May 1997Digital Equipment CorporationMethod and apparatus for generating and implementing smooth schedules for forwarding data flows across cell-based switches
US563202125 Oct 199520 May 1997Cisco Systems Inc.Computer system with cascaded peripheral component interconnect (PCI) buses
US563401021 Oct 199427 May 1997Modulus Technologies, Inc.Managing and distributing data objects of different types between computers connected to a network
US563835914 Dic 199310 Jun 1997Nokia Telecommunications OyMethod for congestion management in a frame relay network and a node in a frame relay network
US564471810 Nov 19941 Jul 1997At&T CorporationApparatus using circuit manager to associate a single circuit with each host application where the circuit is shared by a plurality of client applications
US56596843 Feb 199519 Ago 1997Isdn Systems CorporationMethods and apparatus for interconnecting personal computers (PCs) and local area networks (LANs) using packet protocols transmitted over a digital data service (DDS)
US566635321 Mar 19959 Sep 1997Cisco Systems, Inc.Frame based traffic policing for a digital switch
US567326529 Abr 199630 Sep 1997Integrated Network CorporationScalable multimedia network
US568011622 Dic 199421 Oct 1997Nec CorporationStatic routing system
US56873248 Nov 199511 Nov 1997Advanced Micro Devices, Inc.Method of and system for pre-fetching input cells in ATM switch
US57243517 Ago 19953 Mar 1998Chao; Hung-Hsiang JonathanScaleable multicast ATM switch
US575454726 Abr 199619 May 1998Nec CorporationRouting method and system using an internet protocol
US580205415 Ago 19961 Sep 19983Com CorporationAtomic network switch with integrated circuit switch nodes
US58357105 Sep 199710 Nov 1998Kabushiki Kaisha ToshibaNetwork interconnection apparatus, network node apparatus, and packet transfer method for high speed, large capacity inter-network communication
US58549037 Nov 199529 Dic 1998Lucent Technologies Inc.Optimization method for routing and logical network design in multi-service networks
US585698115 May 19975 Ene 1999Lucent Technologies Inc.Reliable connection oriented networks
US589292431 Ene 19966 Abr 1999Ipsilon Networks, Inc.Method and apparatus for dynamically shifting between routing and switching packets in a transmission network
US589868613 Dic 199627 Abr 1999Cabletron Systems, Inc.Network bridge with multicast forwarding table
US590355920 Dic 199611 May 1999Nec Usa, Inc.Method for internet protocol switching over fast ATM cell transport
US5974501 *19 Dic 199626 Oct 1999Compaq Computer CorporationMethod and apparatus for detecting memory device types
US6049546 *15 Oct 199611 Abr 2000At&T CorporationSystem and method for performing switching in multipoint-to-multipoint multicasting
US6115462 *9 Ene 19985 Sep 2000Gte Laboratories IncorporatedMethod and apparatus for efficient call routing
US6216167 *29 Jun 199810 Abr 2001Nortel Networks LimitedEfficient path based forwarding and multicast forwarding
US6295285 *17 Abr 199725 Sep 2001Lucent Technologies Inc.Global packet dynamic resource allocation for wireless networks
US6335939 *28 Ago 19971 Ene 2002Advanced Micro Devices, Inc.Apparatus and method for selectively supplying data packets between media domains in a network repeater
US20010050916 *10 Feb 199813 Dic 2001Pattabhiraman KrishnaMethod and apparatus for providing work-conserving properties in a non-blocking switch with limited speedup independent of switch size
USRE3390031 Jul 198928 Abr 1992At&T Bell LaboratoriesError monitoring in digital transmission systems
EP0384758A222 Feb 199029 Ago 1990Kabushiki Kaisha ToshibaCall admission control method and cell flow monitoring method in the same method
EP0431751B12 Nov 19901 Feb 19953Com IrelandRepeaters for secure local area networks
EP0567217B112 Mar 199324 Oct 20013Com CorporationSystem of extending network resources to remote networks
Otras citas
Referencia
1Allen, M., "Novell IPX Over Various WAN Media (IPXW AN)," Network Working Group, RFC 1551, Dec. 1993, pp. 1-22.
2Becker, D., "3c589.c: A 3c589 EtherLink3 ethernet driver for linux," becker@CESDIS.gsfc.nasa.gov, May 3, 1994, pp. 1-13.
3Chowdhury, et al., "Alternative Bandwidth Allocation Algorithms for Packet Video in ATM Networks," INFOCOM 1992, pp. 1061-1068.
4Doeringer, W., "Routing on Longest-Matching Prefixes," IEEE/ACM Transactions in Networking, vol. 4, No. 1, Feb. 1996, pp. 86-97.
5Esaki, et al., "Datagram Delivery in an ATM-Internet," 2334b IEICE Transactions on Communications, Mar. 1994, No. 3, Tokyo, Japan.
6IBM Corporation, Method and Apparatus for the Statistical Multiplexing of Voice, Data and Image Signals, IBM Technical Disclosure Bulletin, No. 6, Nov. 1992, pp. 409-411.
7Pei, et al., "Putting Routing Tables in Silicon," IEEE Network Magazine, Jan. 1992, pp. 42-50.
8Perkins, D., "Requirements for an Internet Standard Point-to-Point Protocol," Network Working Group, RFC 1547, Dec. 1993, pp. 1-19.
9Simpson, W., "The Point-to-Point Protocol (PPP)," Network Working Group, RFC 1548, Dec. 1993, pp. 1-53.
10Tsuchiya, P.F., "A Search Algorithm for Table Entries with Non-Contiguous Wildcarding," Abstract, Bellcore.
11Zhang, et al., "Rate-Controlled Static-Priority Queueing," INFOCOM 1993, pp. 227-236.
Citada por
Patente citante Fecha de presentación Fecha de publicación Solicitante Título
US6760331 *31 Mar 19996 Jul 2004Cisco Technology, Inc.Multicast routing with nearest queue first allocation and dynamic and static vector quantization
US698328510 May 20023 Ene 2006Sun Microsystems, Inc.Apparatus and method for dynamically verifying information in a distributed system
US7061909 *10 Sep 200113 Jun 2006International Business Machines CorporationSystem and method for controlling the multicast traffic of a data packet switch
US708926310 May 20028 Ago 2006Sun Microsystems, Inc.Apparatus and method for dynamically verifying information in a distributed system
US7489683 *29 Sep 200410 Feb 2009Intel CorporationIntegrated circuit capable of routing multicast data packets using device vectors
US766088719 Mar 20039 Feb 2010Sun Microsystems, Inc.Systems and methods for providing dynamic quality of service for a distributed system
US768439030 Dic 200423 Mar 2010Intel CorporationIntegrated circuit capable of transmitting probe packets across a stack of switches
US773474725 Sep 20038 Jun 2010Oracle America, Inc.Dynamic lookup service in a distributed system
US775696930 Ene 200413 Jul 2010Oracle America, Inc.Dynamic provisioning of identification services in a distributed system
US77928747 Jun 20057 Sep 2010Oracle America, Inc.Dynamic provisioning for filtering and consolidating events
US819976425 Ago 200312 Jun 2012Cisco Technology, Inc.Scalable approach to large scale queuing through dynamic resource allocation
US854784320 Ene 20061 Oct 2013Saisei Networks Pte LtdSystem, method, and computer program product for controlling output port utilization
US881780827 Jun 201226 Ago 2014Apple Inc.MIMO based network coding network
US895832920 Nov 201217 Feb 2015Cisco Technology, Inc.Fabric load balancing
US905991531 Ago 201216 Jun 2015Cisco Technology, Inc.Multicast replication skip
US20020075871 *10 Sep 200120 Jun 2002International Business Machines CorporationSystem and method for controlling the multicast traffic of a data packet switch
US20050047338 *25 Ago 20033 Mar 2005Andiamo Systems, Inc., A Delaware CorporationScalable approach to large scale queuing through dynamic resource allocation
US20050102353 *25 Sep 200312 May 2005Sun Microsystems, Inc.Dynamic lookup service in a distributed system
US20050190779 *1 Mar 20041 Sep 2005Cisco Technology, Inc., A California CorporationScalable approach to large scale queuing through dynamic resource allocation
US20060010234 *30 Ago 200512 Ene 2006Sun Microsystems Inc.Dynamic provisioning of service components in a distributed system
US20100054268 *4 Mar 2010Integrated Device Technology, Inc.Method of Tracking Arrival Order of Packets into Plural Queues
EP2858318A1 *9 Sep 20148 Abr 2015ICAP Services North America LLCMethod and apparatus for order entry in an electronic trading system
Clasificaciones
Clasificación de EE.UU.370/432, 370/413
Clasificación internacionalH04L12/18, H04L12/56
Clasificación cooperativaH04L12/5693, H04L45/16, H04L47/6225, H04L45/00, H04L49/3045, H04L49/203, H04L49/3027, H04L49/201
Clasificación europeaH04L12/56K, H04L47/62D1, H04L45/16, H04L49/30C, H04L49/30E, H04L49/20A, H04L45/00, H04L49/20A1
Eventos legales
FechaCódigoEventoDescripción
21 May 1999ASAssignment
Owner name: CISCO TECHNOLOGY, INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SHAH, DHAVAL N.;MOUSSAVI, FARSHID;REEL/FRAME:009963/0513
Effective date: 19990330
18 Dic 2006FPAYFee payment
Year of fee payment: 4
7 Feb 2011FPAYFee payment
Year of fee payment: 8
5 Feb 2015FPAYFee payment
Year of fee payment: 12