The present invention relates to communication systems generally and, more particularly, to a method and apparatus for providing quality of service (QoS) in a local or wide area network or across networks.
The Internet has traditionally provided support for “best effort” traffic only. That is, traffic will be propagated along a path from a source to a destination depending on the congestion or lack thereof existing at each “hop” (typically a router) along the way. If there is little congestion, the traffic will be propagated quickly. If the path is heavily congested, traffic will be buffered (usually first-in-first-out) at congested locations until propagation is possible, which may substantially delay the traffic. Moreover, there is no way for a sender to know ahead of time whether the desired transmission will succeed or fail. This is because Internet traffic follows a “thread-the-needle” approach, wherein each hop or router knows only about the next hop downstream. If traffic at the next hop is extremely congested, the router will nevertheless attempt to forward traffic thereto without searching for an alternate route around it. If the traffic can't be forwarded within a timeout period, the transmission will fail.
The existing Internet “best effort” design is suitable for low priority traffic where transmission latency is acceptable. However, with the proliferation of new technologies using real time applications such as video conferencing, Internet telephony, and other audio/video (A/V) services, guaranteed quality of service (QoS) with minimal and predetermined transmission latency has become increasingly desired. Such service is not possible with the traditional “best effort” design. Ethernet QoS mechansims to assure AV service packets generated on the Ethernet or Internet are delivered in a timely manner are desired. For native Ethernet/IP traffic, priority based schemes are often used, partially due to their simplicity.
Recently, protocol-based QoS solutions have been attempted. One such solution is Resource Reservation Protocol (RSVP), which is an application layer protocol. RSVP is described in R. Braden et al., “Resource ReSerVation Protocol (RSVP)—Version 1 Functional Specification,” RFC 2205, September 1997. Presently, RSVP must be implemented in advanced routers at each hop along the path between sender and receiver. RSVP is designed for reserving resources along paths stretching across multiple networks. Since it is an application layer protocol, it can not be understood or implemented in layer 2 devices such as switches within a local network that often separate a sender or receiver from their gateways to other networks.
A device and mechanism capable of implementing QoS and reserving bandwidth for establishing a path from a source device to a destination device within a network and for transmitting both reserved, and prioritized packet data from output queues within the device, is desired.
An apparatus for providing reserved connections between end stations, in a network capable of providing prioritized communications, comprises a switch in packet communication with the end stations. The switch is adapted to detect and forward packets that contain prioritized data for priority processing, and packets that include requests for reserved connections according to a given reservation protocol. The switch includes a plurality of output queues associated with egress ports of the switch that correspond to different priorities associated with received priority packets, and at least one additional output queue associated with reserved connection data packets. The switch is operable for, in response to a reserved connection request, determining whether there is sufficient bandwidth available to establish a reserved path within the network, and if so, allocating the bandwidth for the requested reserved connection. The switch is further operable for, in response to each packet received at the input of the switch, determining whether the packet is associated with the reserved connection and forwarding those packets to the additional output queue on the egress port associated with the reserved connection path for transport to the intended destination.
Referring now to
In one configuration, the one or more switches 10 comprises a first switch 101 and a second switch 102 operable to communicate with one another via network protocols, and with corresponding end stations over a local area network (LAN) or wide area network (WAN). In the exemplary embodiment of
According to an aspect of the present invention, each switch 10 is an 802.1 p/q compliant switch adapted for detecting and forwarding packets that contain prioritized data for priority processing, as well as packets that include requests for reserved connections between end stations according to a given reservation protocol. Typically, the application layer portion of such application level messages as reservation request messages are transparent to conventional switches. However, in accordance with an aspect of the present invention, each switch is operative to determine both reservation protocol bandwidth request messages and initiate a reserved connection, as well as determine packet stream data associated with a reserved connection packet message, and forward the packet to the corresponding highest priority output queue on the appropriate switch output port.
Switch 10 is configured with functionality in accordance with IEEE 802.1D section 7 requirements for switch devices. In addition, switch 10 of the present invention comprises one or more additional output queues for each egress port for accommodating reserved connection packet data. The switch is also operative to maintain/reserve a certain percentage of bandwidth (e.g. 50%) for 802.1 p/q traffic and best effort traffic. In an exemplary embodiment, such reservation protocol may be RSVP or a variant thereof. Each switch 10 is a layer 2 or layer 3 device that operates to receive IP packets and parse the appropriate information to determine whether the particular packet contains a bandwidth reservation request. In one configuration, switch 10 is configured to index past the ethernet, IP and TCP header information and to examine protocol header information to determine if the message is a bandwidth reservation request message. If it is not, the switch operates to forward the packet onto one of its corresponding output queues associated with a corresponding one of its output ports according to the priority of the packet. If the message is a bandwidth reservation message, switch 10 performs a series of functions for establishing a connection path between the initiating end station and the destination end station for packet communication.
As shown in
It should be understood that the system of the present invention provides for flexibility in determining the type of addressing and processing required based on the particular network domain to establish a reserved connection path and determine each of the end devices. For example, the system of the present invention, when implemented on a homogeneous Ethernet LAN, can utilize MAC addresses to determine each of the end stations associated with the originating and destination devices. In this case, when the ultimate end device is on an IEEE1394 cluster, the adapters shown in
If the packet is a bandwidth request message for establishing a reserved path, allocation software module 15 responsive to the detection of a request for a reserved connection, determines whether there is sufficient available bandwidth for the requested connection and, if so, allocates the required bandwidth for establishing the reserved connection at the switch, and forwards the allocation request message to the next downstream device. Internal mapping table 18 includes a connection pairs list memory 18a and switch table memory 18b. The switch processor and detector, in addition to detecting and processing sessions using existing and emerging reservation protocols such as RSVP as described above, performs conventional functions of forwarding packets between ports of the switch in accordance with addresses in the packet headers and the contents of its standard switch table 18b. Switch 10 further compares the addresses in the packet headers with the addresses contained in connection pairs list memory 18a. If the source and destination addresses of an incoming packet match both addresses of one of the address pairs stored in its connection pairs list, the packet is placed on the reserved connection output queue associated with a particular egress port for forwarding to the port associated with the destination address.
Each switch 10 in the cascade of switches configured in the local area network detects packets and determines whether the packet comprises a reservation bandwidth request to cause the switch to initiate the reservation process. When no reservation request message is input, the switch next determines based on the packet information whether the packet contains reserved connection data. If so, the packet is forwarded to the highest priority output queue for delivery to a corresponding output port. Otherwise, the switch processes the data according to 802.1 user priority levels and provides the packet on the corresponding output queue, as best shown in
Each time a packet belonging to a reserved connection is forwarded by switch 10, it resets a flag associated with that connection in connection pairs list 18a. Accordingly, switch 10 can also include functionality to periodically review the list of reserved connections for inactive sessions. For inactive sessions, a message can be sent to both upstream and downstream devices identifying the reserved connection and indicating bandwidth release for all switches in the path for that reservation. For example, bandwidth allocation/reservation interface module 15 receives bandwidth reservation release requests from devices (e.g. downstream devices) that contain the MAC addresses of the hosts/devices involved in the reserved circuit connection that is to be released. Upon receipt of such a request, the switch allocation module deletes the information in connection pairs list 18a corresponding to the released connection and sends a corresponding message identifying the bandwidth release and session termination to its corresponding attached upstream device on the network. Switch 10 may also include clock module 17 for determining whether a response has been received from a downstream device within a predetermined time interval required for establishing or maintaining a reserved connection. In the event that such response is not received, a control signal from module 17 may be sent to the allocation module 15 to take appropriate action (e.g. send another request, terminate connection and free bandwidth, etc.)
In the embodiment shown in
Thus, a sender or originating end station device (e.g. 301) connected to 1394 AV cluster 401 desiring to establish a connection having a specified bandwidth or latency with a remote device on 1394 AV cluster 402 coupled to end station device 302 issues a BW request message 60. The message must be processed at each switch 101, 102, etc, or adapter e.g. 302) in the path between the sender and the respective receiver. Each switch determines its availability, including the port on which the path is to be established, and updates its own internal tables (e.g. state tables) for the connection. Each switch determines which egress port is the proper one for a reserved connection packet based on an internal mapping table that it maintains. The switch learns which port devices are on by examining source addresses over time. These internal mapping tables or switch tables are used to determine the direction in which to forward the BW request message. In one configuration, if the destination address is already known or associated with a given one of the egress ports, the switch sends the BW message only on that port. If, however, the destination address is not known, then the switch is operable for broadcasting the BW request message on all egress ports. While this approach may cause the system to handle a greater than desired number of request messages, such reservation requests are typically small and should be accommodated without system degradation. Moreover, the number of intermediate switch devices on a home network, for example, is also small (e.g. 1-3), thus minimizing any concern of “flooding” the system with BW request broadcast messages.
As previously mentioned, in response to a BW request message and determination of availability, each switch responds with a granted Bandwidth allocation/reservation message BA 70 of its own acknowledging the required service. The BA message is threaded back upstream along the identical path by which the BW message was sent. If a switch does not have the required resources, it returns an error message 80 (shown in dashed lines) indicating bandwidth is unavailable back upstream toward the appropriate sending device. This enables the upstream switches to free any pending BW and/or enable another cascading switch configuration to be established within the network for accommodating the path request. In one configuration, each switch includes software for implementing a bandwidth reservation protocol, such as RSVP.
As shown in
In another configuration, client endpoints may be required to periodically refresh a bandwidth request in order to maintain bandwidth reservation. The switch may include a clock 17 (
The present invention is embodied in machine executable software instructions within the switch device, and the present invention is carried out in a processing system by a processor executing the instructions. In other embodiments, hardwired circuitry may be used in place of or in combination with software instructions to implement the present invention. The computer instructions embodying the present invention may be loaded into memory from a persistent store such as a mass storage device and/or from one or more other computer systems over a network. For example, execution in some embodiments that downloaded instructions may be directly supported by the microprocessor and directly executed by the processor. Alternatively, the instructions may be executed by causing the microprocessor to execute an interpreter that interprets the instructions by causing the microprocessor to execute instructions which convert the instructions into a format that can be directly executed by the microprocessor. Thus, the present invention is not limited to any specific combination of hardware circuitry and software, nor to any particular source for the instructions executed by the switch device.
Although the invention has been described in terms of exemplary embodiments, it is not limited thereto. The appended claims should be construed broadly to include other variants and embodiments of the invention which may be made by those skilled in the art without departing from the scope and range of equivalents of the invention.
This application claims the benefit, under 35 U.S.C. §365 of International Application PCT/US03/27392, filed Sep. 3, 2003, which was published in accordance with PCT Article 21(2) on Mar. 18, 2004 in English and which claims the benefit of U.S. provisional patent application Ser. No. 60/407,819, filed Sep. 3, 2002.
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/US03/27392 | 9/3/2003 | WO | 00 | 3/2/2005 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2004/023323 | 3/18/2004 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
5930259 | Katsube et al. | Jul 1999 | A |
5946311 | Alexander, Jr. et al. | Aug 1999 | A |
6021263 | Kujoory et al. | Feb 2000 | A |
6038233 | Hamamoto et al. | Mar 2000 | A |
6058113 | Chang | May 2000 | A |
6094431 | Yamato et al. | Jul 2000 | A |
6101549 | Baugher et al. | Aug 2000 | A |
6104700 | Haddock et al. | Aug 2000 | A |
6125397 | Yoshimura et al. | Sep 2000 | A |
6147970 | Troxel | Nov 2000 | A |
6181947 | Du et al. | Jan 2001 | B1 |
6286052 | McCloghrie et al. | Sep 2001 | B1 |
6314098 | Masuda et al. | Nov 2001 | B1 |
6314464 | Murata et al. | Nov 2001 | B1 |
6330236 | Ofek et al. | Dec 2001 | B1 |
6336129 | Ise et al. | Jan 2002 | B1 |
6356565 | Bouyer et al. | Mar 2002 | B1 |
6434624 | Gai et al. | Aug 2002 | B1 |
6493317 | Ma | Dec 2002 | B1 |
6496479 | Shionozaki | Dec 2002 | B1 |
6563793 | Golden et al. | May 2003 | B1 |
6570873 | Isoyama et al. | May 2003 | B1 |
6657999 | Brewer | Dec 2003 | B1 |
6678248 | Haddock et al. | Jan 2004 | B1 |
6745246 | Erimli et al. | Jun 2004 | B1 |
6765914 | Jain et al. | Jul 2004 | B1 |
6771661 | Chawla et al. | Aug 2004 | B1 |
6968374 | Lemieux et al. | Nov 2005 | B2 |
7016676 | Walke et al. | Mar 2006 | B2 |
7167648 | Heinz et al. | Jan 2007 | B2 |
7171121 | Skarica et al. | Jan 2007 | B1 |
7352726 | Fujisawa | Apr 2008 | B2 |
20020016837 | Naudus | Feb 2002 | A1 |
20020031142 | Metin et al. | Mar 2002 | A1 |
20030223442 | Huang et al. | Dec 2003 | A1 |
20040081197 | Liu | Apr 2004 | A1 |
20040213206 | McCormack et al. | Oct 2004 | A1 |
Number | Date | Country |
---|---|---|
11-122288 | Apr 1999 | JP |
WO 0174096 | Oct 2001 | WO |
Number | Date | Country | |
---|---|---|---|
20060168337 A1 | Jul 2006 | US |
Number | Date | Country | |
---|---|---|---|
60407819 | Sep 2002 | US |