WO2001078277A1 - Bandwidth control system - Google Patents
Bandwidth control system Download PDFInfo
- Publication number
- WO2001078277A1 WO2001078277A1 PCT/US2001/011109 US0111109W WO0178277A1 WO 2001078277 A1 WO2001078277 A1 WO 2001078277A1 US 0111109 W US0111109 W US 0111109W WO 0178277 A1 WO0178277 A1 WO 0178277A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- network
- traffic
- packet
- interface
- topology representation
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/16—Time-division multiplex systems in which the time allocation to individual channels within a transmission cycle is variable, e.g. to accommodate varying complexity of signals, to vary number of channels transmitted
- H04J3/1682—Allocation of channels according to the instantaneous demands of the users, e.g. concentrated multiplexers, statistical multiplexers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/22—Traffic shaping
Definitions
- the present invention relates generally to a bandwidth control system for networks, and more particularly to a system in which network traffic that flows through the system is prioritized and shaped to match a set of rate conditions unique to each of a hierarchy of arbitrary physical and logical aggregation points (nodes) that form a logical representation of a network and its underlying physical elements.
- QoS Quality of service
- CBQ class-based queuing
- CBQ In CBQ, traffic flows are classified with multiple attributes, each class is assigned an average data rate and bandwidth is distributed in real-time as it becomes available. Algorithms such as CBQ, however, are disadvantageous in that they are predictive in nature. Bandwidth is assigned by scheduling packets based on the system's estimate of the current load and the current rate of usage of the nodes throughout the network. Such estimates are inaccurate due to the burstiness and unpredictability of network traffic, leading to inefficient packet scheduling and the possibility of network congestion.
- bandwidth control system that can dynamically manage bandwidth consumption without the need of predictive packet scheduling.
- bandwidth control system that scale with increases in network users or network complexity without increased computational complexity or loss of performance.
- the present invention provides a bandwidth control system for a network, the network having a host computer that includes a first network interface and a second network interface.
- the bandwidth control system comprising a packet driver and a traffic shaper.
- the packet driver is adapted to be executed on the host computer and is logically connected to the first network interface and the second network interface.
- the packet driver captures packets received from the network on the first network interface.
- the traffic shaper is adapted to be executed on the host computer and maintains a topology representation of the network, the topology representation including one or more nodes.
- the traffic shaper performs priority and packet rate metering functions on the captured packets to match a set of rate conditions unique to each node in the topology representation of the network.
- the packet shaper returns the captured packets to the packet driver for transmission to the network on the second network interface.
- the present invention provides a method of managing bandwidth in a network, the network having a host computer that includes a first network interface and a second network interface.
- a topology representation of the network is constructed, the topology representation including one or more nodes.
- Packets are received from the network on the first network interface.
- the received packets are prioritized and shaped to match a set of rate conditions unique to each node in the topology representation of the network.
- the prioritized and shaped packets are transmitted to the network on the second network interface.
- Fig. 1 is a block diagram of a bandwidth control system according to the present invention
- FIG. 2 is a block diagram of typical hierarchical topology created by a bandwidth control system according to the present invention
- FIG. 3 is a block diagram of typical hierarchical topology created by a bandwidth control system according to the present invention
- Fig. 4 is a block diagram showing a flow of packets through a bandwidth control system according to the present invention
- Fig. 5 is a block diagram showing a flow of packets through a bandwidth control system according to the present invention
- Fig. 6 is a block diagram of a packet driver for a bandwidth control system according to the present invention
- Fig. 7 is a block diagram of the internal structure of a packet driver for a bandwidth control system according to the present invention
- Fig. 8 is a block diagram of the contents of a topology representation for a bandwidth control system according to the present invention
- Fig. 9 is a block diagram of the configuration information that describes a topology object in a bandwidth control system according to the present invention
- Fig. 10 is a block diagram of the statistical information contained within a topology object in a bandwidth control system according to the present invention.
- FIG. 11 is a flowchart of the main processing loop for a bandwidth control system according to the present invention.
- Fig. 12 is a flowchart of the initial processing of packets received from an interface in a bandwidth control system according to the present invention.
- Fig. 13 is a block diagram of the insert and remove priority lists for a bandwidth control system according to the present invention
- Fig. 14 is a flowchart of the process by which all object queues are taken from the remove priority list and acted upon in a bandwidth control system according to the present invention
- Fig. 15 is a flowchart of a single queue taken through the transfer request process in a bandwidth control system according to the present invention
- Fig. 16 is a flowchart of the transfer request process for an individual packet in a bandwidth control system according to the present invention
- Fig. 17 is a flowchart of the shaping information update process for a branch of a topology representation in a bandwidth control system according to the present invention.
- Fig. 18 is a flowchart of the shaping information update process for a single object in a topology representation in a bandwidth control system according to the present invention
- Fig. 19 is a flowchart of a topology representation being recursively traversed during a transfer request process in a bandwidth control system according to the present invention
- Fig. 20 is a flowchart of how statistical information is periodically processed for objects in the topology representation in a bandwidth control system according to the present invention
- Fig.21 is a flowchart of the address/protocol mapping process performed on each incoming packet in a bandwidth control system according to the present invention
- Fig. 22 is a flowchart of the automated discovery process that adds new objects to a topology representation with defaulted configuration information in a bandwidth control system according to the present invention
- Fig. 23 is a block diagram of additional configuration information that describes a topology object in a bandwidth control system according to the present invention
- Fig. 24 is a block diagram of a network with shared topology that can be managed by a bandwidth control system according to the present invention
- Fig. 25 is a block diagram of the network topology of Fig. 24 as seen by a first user of a bandwidth control system according to the present invention
- Fig. 26 is a block diagram of the network topology of Fig. 24 as seen by a second user of a bandwidth control system according to the present invention
- Fig. 27 is a block diagram of the network topology of Fig. 24 as seen by a third user of a bandwidth control system according to the present invention.
- a preferred embodiment of the bandwidth control system includes a host operating system and network device drivers 100 connecting to physical network adapters 101, 102, 103, 104, a network protocol stack 105 and Unix style sockets layer 106, all of which are generally provided within a host operating system such as Unix, Linux, Sun Solaris, or Microsoft NT.
- the preferred embodiment of the present invention adds a traffic shaper 107, a packet driver 108, and a configuration interface 109 to the host operating system resources 100 through 106 described above.
- the packet driver 108 is logically connected to two or more network interfaces 101, 102, 103 that are operating in a promiscuous mode, while network interface 104 is generally operating in a non-promiscuous mode. There should be no additional routes between the networks to which the network interfaces 101, 102, and 103 attach, other than through the network interfaces 101, 102, or 103. For example, the only network route from a host on network 101 to reach a host on network 103 is via the traffic shaper 107.
- Packets received on the network interfaces 101, 102, and 103 are captured by the packet driver 108 and presented to the traffic shaper 107.
- the traffic shaper 107 examines the source and destination addresses of the packet, pairs the packet with shaping objects within a topology representation within the shaper, performs priority and packet rate metering functions, and then returns the packet to the packet driver for transmission through an interface other than the one on which it was received.
- the configuration interface 109 via the sockets interface 106, the protocol stack 105, and the network interface 104, is used to specify the operating parameters and network topology descriptions to the shaper 107 and provide interactive information containing both operational and statistical information concerning the shaper 107 and its various topology objects.
- each physical interface system 400 for which traffic shaping is desired has discrete topology representations for both directions of traffic flow: inbound traffic 402 and outbound traffic 403.
- the topology representation for each direction of traffic flow in this description is identical, but they contain independent objects for each direction of flow: inbound (towards a host) and outbound (from a host) through the topology representation.
- topology representations may be created for each direction of traffic flow through an interface by simply specifying a different organization of objects for each direction on an interface, allowing support for asymmetrical networking environments such as CATV hybrid fiber coax, Telco-return type cable modems, wireless systems, or other networking topologies.
- asymmetrical networking environments such as CATV hybrid fiber coax, Telco-return type cable modems, wireless systems, or other networking topologies.
- all client systems may use a single shared downstream- only trunk but be divided into multiple shared low-speed return paths.
- This form of asymmetrical topology is easily rendered by the present invention.
- the bandwidth control system of the present invention facilitates independent directional controls to shape the traffic flow for each point in the topology representation.
- the shaper 107 is provided with a topology representation consisting of a collection of objects organized in a hierarchical tree which represent logical or physical points of network traffic aggregation.
- a topology representation consisting of a collection of objects organized in a hierarchical tree which represent logical or physical points of network traffic aggregation.
- objects of the following types a single mandatory interface object 200, zero or more subnet objects 201 through 205, zero or more group objects 206, 207, zero or more IP objects 208 through 217, and zero or more application objects 218, 219.
- Additional abstract object types that represent unique logical or physical network elements such as routers or gateways may be optionally included.
- the logical interface 200 is the root point of the physical traffic aggregation for a topology representation.
- Subnets such as 201, 202, 203, 204, and 205 represent collections of contiguous portions of the network address space; in TCP/IP these would be CIDR (classless inter-domain routing) subnets.
- Groups such as 206 and 207 are arbitrary collections of other object types that may include any type other than an interface.
- IP objects such as 208 through 217 are objects that represent exact network IP addresses.
- Application objects such as 218 and 219 represent host applications such as HTTP 218 and FTP 219 being utilized by a host at IP 210.
- the preferred embodiment of the bandwidth control system maintains settings or policies 220, which may be assigned to various points in the topology representation 221 through 224 which are inherited by descendants of the object to which the policies are attached.
- An inheritance policy such as 222 may contain default policies for multiple objects of any type and may be optionally organized as a hierarchical tree modeling a branch of the topology representation.
- FIG. 4 an example of traffic flow through the preferred embodiment of the bandwidth control system is provided.
- a host reachable through the network connected to physical interface #1 401 with IP address 10.1.3.250 has transmitted a packet to a host on interface #3 404 with IP address 17.3.5.12.
- the packet from source 10.1.3.250 is received by the physical network adapter 600, controlled by driver software 601, and relayed to the operating system protocol interface layer 602.
- the physical network adapter 600 and the driver software 601 are normally provided by a hardware manufacturer, and the operating system protocol interface layer 602 is normally an integral part of an off-the-shelf network operating system.
- the packet driver 603 is notified by the operating system protocol interface layer 602 of incoming packets.
- the packet driver inspects the packet provided to it by the operating system protocol interface layer 602, determining the source and destination physical addresses (MAC, ISO layer 2).
- the MAC address table 701 contains a learned list of MAC addresses and interface numbers that uniquely identifies each MAC address as existing on a single interface. If the source MAC address is found to exist on an interface other than the one on which it is received, or the destination MAC address is found to exist on the same interface on which it is received, the packet provided by the operating system protocol interface layer 602 is silently ignored, and no further processing is performed on the packet. Otherwise, the source MAC address is added to MAC address table 701 as belonging to the interface on which it was received, and a new packet is obtained from a free packet queue 702. The packet provided by the operating system protocol interface layer 602 is copied into the new packet, which is then placed into a received packet queue 703 for later retrieval by the traffic shaper 107.
- Table 405 contains two lists: (1) a list of each interface and subnet address range sorted by increasing address range size (number of addresses) and (2) a separate list of exact IP addresses which are preferably indexed via hashing with separate chaining, sub-sorted by application type (if used).
- Each list is constructed from the topology information as shown in Figs. 2 and 3 as pointers to individual topology representation objects, which are discussed below. Furthermore, each list indicates the direction, inbound or outbound, which the object represents.
- topology representations which are symmetrical
- two topology objects will be registered in table 405 for each point, one for inbound and a second for outbound.
- the object that is selected from the table depends on the direction of packet flow.
- the search of table 405 will yield pointers to two topology representation objects.
- the source IP address yields an outbound IP object from 402 (shown in Fig. 2 as IP 213).
- the destination IP address yields an inbound subnet object from 407 (shown in Fig. 3 as subnet 301).
- a wrapper 406 is created for the packet that contains pointers to the source and destination representation objects and preferably, for performance reasons, a pointer to the packet rather than the actual packet contents.
- the source and destination object types and priorities are compared to determine whether the packet wrapper 406 should be queued on the source or destination object through a decision process described below in detail.
- the source object 213 is a more specific type (IP address) than the destination object (subnet). Consequently, the source object 213 is chosen as the object on which wrapper 406 is to be queued.
- a pointer to object 213 is placed into a priority insert list 408.
- the priority insert list 408 contains a list of pointers, sorted by priority, of each object which currently has one or more packets queued.
- this list is examined and utilized to control the order in which the packet wrappers (like that of 406) are granted approval to transmit.
- the approach is to calculate/update the objects within the topology representations to ensure that packet transmission through the destination object interface will not exceed the transfer limits associated with any of the pertinent objects in the topology representations.
- the packet is forwarded to the packet driver 603 destined for interface #3 605, where it is placed into a send packet queue 704 for transmission at the operating system's earliest convenience.
- the send procedure 705 will relay the packet through the operating system's protocol interface layer 602, physical driver 604 to physical interface 605, where it is transmitted. Once transmitted, the packet buffer is marked as free and returned to the free packet queue 702 for reuse. Note that if the interfaces are operating in a promiscuous mode, the packet upon transmission will also be received by the same interface #3. This is anticipated and handled by the receive procedure 700 and MAC table 701, which will find that the source MAC address of the packet echoed on interface #3 exists on interface #1 and will therefore ignore it. [0055] Referring to Figs.
- packets returned from the IP host at 17.3.5.12 and directed to 10.1.3.250 are received by interface #3 and checked against the source/destination address table 502, which determines (1) the source IP address to map to outbound object 301 from 503 and (2) the destination address to map to inbound object 213 from 504.
- a packet wrapper 505 is created which contains the source and destination object pointers and preferably a pointer to the packet contents.
- the source and destination object priorities are evaluated to determine whether the packet wrapper 505 should be queued on the source or destination object. In this case, given equal source and destination object priorities, the destination object 213 is a more specific type (IP address) than the source object 301 (subnet).
- the wrapper 505 will be placed into the queue of object 213, and a pointer to object 213 will be placed into priority list 506.
- this list is examined and utilized to control the order in which the packet wrappers (like that of 505) are granted approval to transmit.
- the approach is to calculate/update the objects within the topology representations to ensure that packet transmission through the destination object interface will not exceed the transfer limits associated with any of the pertinent objects in the topology representations.
- the packet is forwarded to the packet driver 603 destined for interface #1 600, where it is placed into a send packet queue 704 for transmission at the operating system's earliest convenience.
- the send procedure 705 will relay the packet through the operating system's protocol interface layer 602, physical driver 601 to physical interface 600, where it is transmitted. Once transmitted, the packet buffer is marked as free and returned to the free packet queue 702 for reuse. Note that if the interfaces are operating in a promiscuous mode the packet upon transmission will also be received by the same interface #1. This is anticipated and handled by the receive procedure 700 and MAC table 701 , which will find that the source MAC address of the packet echoed on interface #1 exists on interface #3 and will therefore ignore it.
- a topology representation for each direction of traffic flow 800 for an interface consists of a collection of objects which are linked together in a hierarchical manner to produce a representation of logical and/or physical network topology.
- the topology contains an interface connection 801 that may be either an abstract connection identifier or preferably a section of memory shared between the traffic shaper 107 and the packet driver 108 through which packet data may be passed.
- the topology representation maintains a table of one or more objects, like 802, which represent particular point(s) within a logical or physical network.
- Each object 802 consists of a set of linkage information 803, configuration information 804, statistical information 805, state information 806, and packet wrapper queue 807. [0059] Referring to Fig. 9, the configuration information for each object 802 consists of general information 900, linkage object identifiers or OIDs 901, network address information 902, and shaping information 903.
- the general information 900 contains the type of object (e.g., Logical Interface, Subnet, Group, IP, IP/Application, etc.), a unique object identifier (OID) which specifies a specific object throughout all of topology representations within the traffic shaper 107, the OID of the policy from which the objects configuration information was derived or inherited, a flag indicating if the object should inherit its configuration settings from the nearest ancestor with a policy which matches this object type, a flag which indicates if statistics for this object are of long term interest, a conflict flag which indicates if some facet, typically the IP address, conflicts with another object, the access rights granted to the object and an alphanumeric name for display purposes.
- OID unique object identifier
- the linkage OIDs 901 contains the OIDs of other related objects. Examples of these are the object's ancestor or parent, the first or next object in a list of policies related to the object, a source route OID which specifies a specific object in a topology representation of another interface to which all traffic should be forwarded regardless of CIDR routing rules.
- the address information 902 contains the network address or network number (ISO layer 3 - e.g., IP) which the object represents, the sub-network mask or type (e.g., CIDR variable subnet or A/B/C fixed classes), the application protocol type (ISO layer 4 - e.g., HTTP, FTP, etc.), the physical address (ISO layer 1 MAC), the address discovery mode (e.g., by ISO 3, by ISO 2, by DHCP lease, etc., or none), a use DHCP flag which indicates that the system should track DHCP leases for this object, and a name resolution method (e.g., DNS name from IP, LDAP name from MAC, LDAP name from IP, DNS IP from name, LDAP IP from name, LDAP MAC from name, etc., or none).
- a name resolution method e.g., DNS name from IP, LDAP name from MAC, LDAP name from IP, DNS IP from name, LDAP IP from name, LDAP
- the object state information 806 contains (1) the current priority value of the object, (2) an index specifying the current shape set index, (3) a flag indicating if the object is congested (i.e., has been requested to pass more traffic than is permitted), (4) a sequential periodic interval number which indicates the last periodic interval on which the object state information was updated, (5) an interval pool which indicates the maximum number of bytes which are permitted to pass through the point the object represents with a periodic update interval, (6) a priority step amount which indicates by how many priority levels an object priority should increase for each periodic interval in which transmission of a packet has been denied by any of the object ancestors, and (7) a consumed pool which maintains a running count of the number of bytes permitted to pass though the point the object represents.
- the shaping information 903 contains a maximum queue depth value 904 which specifies a maximum number of packet wrappers which may be queued on the object concurrently and a number specifying a quantity of shaping sets 905.
- Each shaping set 906 has a starting range 907, an ending range 908 expressed in bytes that are compared against the consumed pool of 806. If the consumed pool reaches the value of 908, then the shape set index of 806 is incremented but limited to the value of shaping set 905. At a periodic update interval the consumed pool is reduced by a recovery rate contained with the shaping information, and upon falling below the start range 907 of the current shape set as indexed by the shape set index of 806, the shape set index decrements if non-zero.
- the shape set index of 806 is used as an index into the array of rate and priority sets 906.
- Each shaping set 906 also has a normal rate and priority set 909 and a congested rate set 910 which control the behavior of the object in normal versus congested conditions. If none of the object's ancestors are currently in a congested state, the normal rate set 909 is utilized; otherwise the congested rate set 910 is utilized.
- Each rate and priority set 909 or 910 contains a recovery rate 911 that controls the rate at which the consumed pool in 806 is reduced over time. This amount is subtracted from the consumed pool at the periodic update interval to provide a moving window effect for shaping set changes.
- the rate and priority sets may be configured to provide for a decreasing rate as the consumption pool increases, by setting the maximum rate value 912 for sequential higher rate and priority sets to progressively lower amounts.
- Each rate and priority set also has a minimum priority 913, maximum priority 914, and maximum latency value 915.
- the minimum priority 913 and maximum priority 914 control the range of priorities at which the object may be placed into the priority list 408.
- the maximum latency value 915 is expressed in milliseconds and is used to derive a priority step value for 806 by dividing the product of the number of millisecond per periodic update interval and the difference between the maximum and minimum priority levels by the maximum latency 915:
- Priority Step (ms per interval* (Max Priority - Min Priority))/Max Latency in ms) [0066] It should be apparent that by using multiple shaping sets 906, a nearly infinite number of combinations of rate, priority, and latency may be created which react automatically to changing consumption, congestion, and load patterns, as reflected in the object, its ancestors, and descendents.
- each topology object maintains a collection of statistical information 1000 which records pertinent values which indicate not only the traffic flow through the point the object represents, but metrics reflecting the extent to which the point was affected by congestion occurring in its ancestors.
- Each statistical entry such as 1001, contains summary statistics for a specific period, typically 1 second, 1 minute, or 1 hour.
- Statistical entries such as 1001 are gathered into a series of cascading ring buffers, each of which represents a time span relative to the current time. Entry 1009 is a single entry representing the values for the previous second. Ring 1010 is sixty entries representing the previous sixty seconds. Ring 1011 is sixty entries representing the previous sixty minutes. Ring 1012 is twenty-four entries representing the previous twenty-four hours. Each ring 1010, 1011, and 1012 contains a totalizing entry 1013, 1014, 1015 and list head pointer 1016, 1017, 1018, respectively. The fields within the totalizing entry contain the sum of the corresponding fields with the individual entries in the ring. Each list head pointer points to the oldest entry in the ring. [0069] Continuing with Fig.
- totalizing entry 1013 always reflects the sum of the entries contained with the ring.
- the main processing loop is performed for each periodic update interval, preferably nominally every 10 milliseconds, providing the core process for traffic shaping.
- a current interface index 1100 is set to point to the first interface system 400.
- the physical interface 401 is checked via the connection handle 801 within object 402 for new packets which have arrived at the interface and been queued on the shaper packet driver 603. If a new packet is found, it is removed at 1102 from the received packet queue 703 and undergoes the received packet initial processing at 1103, as shown in detail in Fig. 12. The processing then continues at 1101 until no more packets are found at 1104. If the current interface index is not pointing to the last interface system, the current interface index increments at 1105, and the process continues at 1101.
- the process priority list process (shown in detail in Fig. 14) is performed, which attempts to gain approval to transmit packets which have been queued on the topology objects, in order of decreasing object priority.
- the process statistics process (shown in detail in Fig. 20) is called, but only for a subset of all the topology objects in the system (the number of objects equaling the total number of topology objects in the system divided by the number of periodic update intervals in each second), such that all of the topology objects in the system are processed within one second of time. The entire process then goes idle until the next update interval is due.
- each newly arriving packet is processed at 1200 by source and destination address mapping (shown in detail in Fig. 21), which identifies an appropriate source and destination topology object.
- a packet wrapper 808 is created which contains a pointer to the source object, a pointer to the destination object, and a pointer to or the contents of the packet.
- the packet length field is set to the total packet length, and all other fields are zeroed.
- the types of the source and destination objects are checked at 1201 to find if both are of the same type. If so, the current priority values contained in the state information 806 of the source and destination objects are compared at 1202.
- the packet wrapper 808 is queued on the source object at 1203; otherwise it is queued onto the destination object at 1205.
- the packet wrapper 808 is queued on the destination object at 1205; otherwise the object is queued on the source object at 1203.
- the traffic shaper 107 maintains a global priority table 1300, containing two priority tables, 1301 and 1302, which identify all topology objects that have one or more packets queued.
- Two pointers 1303 and 1304 point to the priority tables 1301 and 1302 in a mutually exclusive manner.
- the table 1301, 1302 pointed to by 1303 is always used.
- the table 1301, 1302 is organized as a collection of priority level lists 1305, each of which represents a discrete priority level, although it will be understood by those of skill in the art that other mechanisms may be readily utilized without departing from the spirit and scope of the invention, provided the objects may be retrieved in descending order of priority.
- the process is completed. Otherwise, the first packet wrapper 808 in the queue is examined at 1501 and undergoes the request transfer process as shown in Fig. 16. If the transfer request is granted, the packet wrapper 808 is removed from the queue, the packet contained or referenced is relayed via the connection handle 801 of the destination object topology representation to the packet driver for transmission at 1504, and processing resumes at 1500. If the transfer request was not granted at 1502, then a pointer to the object is inserted in the global priority table insert list as pointed to by 1303 at the current priority value indicated in the state information 806, and processing of the object concludes. [0075] Referring to Fig.
- the source reserved fragment and packet length as described in the packet wrapper 808 are compared, and if the source reserved fragment is not less than the packet length, then the topology representation which contains the source object has collectively granted permission for the traffic to pass, and processing resumes at 1601. Otherwise, at 1602, a request structure containing the following fields is created: (1) the source object, (2) a true/false granted flag with an initial state of true, (3) a packets queued count, initialized to the number of packets currently in the source object queue, and (4) a requested bytes field, initialized to the difference between the packet length and source request fragment value. Next, at 1603, the update shape tree process (as shown in detail in Fig. 17) is called for the source object specified in the wrapper 808.
- the recursive request transfer process (as shown in detail in Fig. 19) is called, passing the request structure.
- the request structure's requested bytes value is added to the packet wrapper's 808 source reserved fragment value, and processing continues at 1601.
- the destination reserved fragment and packet length as described in the packet wrapper 808 are compared. If the destination reserved fragment is not less than the packet length, then the topology representation which contains the destination object has collectively granted permission for the traffic to pass, and processing resumes at 1606. Otherwise, at 1607, a request structure containing the following fields is created: (1) the destination object, (2) a true/false granted flag with an initial state of true, (3) a packets queued count, initialized to the number of packets currently in the destination object queue, and (4) a requested bytes field, initialized to the difference between the packet length and destination request fragment value.
- the update shape tree process (as shown in Fig.
- the current shape set value 1008 of the sub-second statistical entry 1001 is set to the current shape set index from the state information 806 of the object.
- the object carry-over percent is set to 0% at 1802
- the congested shape set as indexed by the shape set index of the state information 806 is selected at 1803 as the current shape set for the object.
- the object carry- over percent is increased by 2 points, up to a maximum total of 50%, and the normal shape set as indexed by the shape set index of the state information 806 is selected at 1805 as the current shape set for the object.
- the object interval pool value of the state information 806 is set to the sum of the object pool value multiplied by the carry-over percent, and the current shape set maximum rate (bytes) per periodic update interval.
- the difference between the current interval number and the object interval number from the state information 806 is multiplied by the recovery rate of the state information 806 in bytes per update interval and added to the object pool size.
- the object pool size is limited to the end range value 908 of the last of the object shaping sets, and the object interval number in the state information 806 is set to the current interval number.
- Fig. 18 if the object priority increase flag in the state information 806 is true, then the priority increase flag is cleared at 1810, and the priority step value from the state information 806 is added to the object's current priority, within the limits of the maximum priority value for the current shape set.
- the request granted flag is set to false, and the object is marked as congested in the state information 806. If, at 1902, the object has an ancestor, then at 1903 the object ancestor undergoes the process shown in Fig. 19, using the modified request structure.
- the ancestor is in the congested state, the current object state is set to congested at 1905, and the congested periods count 1006 of the object is incremented.
- the packet count field 1004 of the sub-second statistical entry is incremented, the requested bytes value from the request is added to the sub-second byte count field 1002, the requested bytes value is subtracted from the object interval pool, and the object's current priority is set to the minimum priority value of the object's currently selected shape set. If the request is flagged as denied, the requested bytes value is subtracted from the object's interval pool at 1908.
- the number of packets queued field in the request is added to the congestion delays value 1007 in the sub-second statistical entry at 1910, and the object's priority increase flag is set in the state information 806.
- the object's current priority value is added to the request priority value.
- the request priority value limited by the maximum priority value of the object's current shape set, is assigned to the inherited priority value in the state information 806.
- the oldest element of the minute statistics ring as pointed to by the list head pointer 1010 is subtracted from the totalizing entry 1013.
- the sub-second statistical entry 1001 is added to the totalizing entry 1013.
- the sub-second statistical entry 1001 overwrites the minute statistics ring entry pointed to by the list head pointer 1010.
- the minute ring statistical entries are searched at 2004 for the highest bytes transferred value.
- the oldest element of the hour statistics ring as pointed to by the list head pointer 1011 is subtracted from the totalizing entry 1014.
- the minute ring totalizing entry 1013 is added to the totalizing entry 1014.
- the minute totalizing entry 1013 with its peak bytes field set to the value from 2004, overwrites the hour ring entry pointed to by the list head pointer 1011.
- the oldest element of the day statistics ring as pointed to by the list head pointer 1012 is subtracted from the totalizing entry 1015.
- the hour ring totalizing entry 1014 is added to the totalizing entry 1015.
- the hour totalizing entry 1014 with its peak bytes field set to the value from 2009, overwrites the ring entry pointed to by the list head pointer 1012.
- the first network in the set of networks ordered in ascending size which can contain the layer 3 address is sought, and, if found, the object pointed to by the entry is initially established as the source address for the packet, and the process shown in Fig. 22 is performed to attempt to add a newly created object which matches the source address which, if added, will be used in place of the object located at 2105, and processing continues at 2102. Otherwise, a default object is selected as the source address object at 2107.
- the default object may be the logical interface object or an object that represents traffic from an unknown source. Alternatively, the packet may be abandoned if desired.
- the first network recalling that networks are sorted within the table in ascending size, which can contain the layer 3 address is sought and if found the object pointed to by the entry is established as the destination address for the packet at 2113, and processing continues at 2109. Otherwise, a default object is selected as the destination address object at 2114.
- the default object may be the logical interface object or an object that represents traffic from an unknown source. Alternatively, the packet may be abandoned if desired.
- the network object passed has linkage information 901 that indicates that discovery of objects is not permitted, then no object will be returned at 2201. Otherwise, at 2202, the network object is made the current ancestor. If, at 2203, the current ancestor has a policy which matches the address/protocol type of the provided packet, then, at 2204, the policy is used as a template to create a descendent object of the network object with the source address/protocol of the trigging source packet from 2106, which is selected for return at 2205. If, at 2206, the current ancestor has no address/protocol policy which matches, and no ancestor, then no object will be returned at 2201.
- the configuration information of 900 may also contain a set of rights 2300 that may be assigned to restrict the ability of a configuration user to view, modify, extend, or eliminate parts of a topology description. Such facilities are valuable when multiple parties (users) share the configuration and monitoring responsibility of a portion of the network topology.
- a high-speed access system provided over cable television lines to consumers or small businesses.
- the cable operator provides high-speed last mile connectivity, and three separate Internet service providers (ISPs) provide connectivity from the cable head-end to both ISP specific and Internet content.
- ISPs Internet service providers
- the cable operator is likely to own the system traffic shaper of the present invention and the CATV distribution equipment and to have responsibility for ensuring connectivity between the customer and cable system head-end, but the connection from the head-end to the Internet backbone is provided through one of the three competing ISPs.
- Each of the ISPs is likely to enter into an agreement with the cable operator for a carriage fee based on the number of subscribers and/or the amount of the shared resources consumed.
- the names, addresses, and traffic shaping settings of each ISP and its customers may be considered a trade secret which needs to be protected from the view of the other ISPs and the cable operator.
- each object in the topology representation has two sets of rights, one for the user that creates the object and another that the creator optionally grants to a second user.
- rights are (1) to view the name of the object, (2) to view the network addresses of the object, (3) to view the shaping setting of the object, (4) permitting descendents of the object to be viewed, (5) changing the name of the object, (6) changing the network addresses of the object, (7) changing the shaping settings, (8) moving the object to a different location in the topology, (9) adding descendents of the object, and (10) deleting descendents of the object.
- owner right #4 the right to view descendents
- the following table indicates the users and rights assigned to each topology object in the example:
- the cable operator will have a limited view of the all of the objects in the system. In this example, none of the objects owned by any of the ISPs are visible to the cable operator.
- ISP 1 sees only those objects owned by the ISP 2605, 2606, 2607, 2608, co-owned by the ISP 2604; and those owned by the cable operator by permitted view access the ISP as ANYONE 2600, 2601, 2602, 2603.
- ISP 2 sees only those objects owned by the ISP 2705, co- owned by the ISP 2704; and those owned by the cable operator by permitted view access the ISP as ANYONE 2700, 2701, 2702, 2703.
- the present invention may be implemented with any combination of hardware and software.
- the present invention can be included in an article of manufacture (e.g., one or more computer program products) having, for instance, computer useable media.
- the media has embodied therein, for instance, computer readable program code means for providing and facilitating the mechanisms of the present invention.
- the article of manufacture can be included as part of a computer system or sold separately.
Abstract
Description
Claims
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
AU2001249887A AU2001249887A1 (en) | 2000-04-05 | 2001-04-05 | Bandwidth control system |
CA2405263A CA2405263C (en) | 2000-04-05 | 2001-04-05 | Bandwidth control system |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US19500000P | 2000-04-05 | 2000-04-05 | |
US60/195,000 | 2000-04-05 |
Publications (2)
Publication Number | Publication Date |
---|---|
WO2001078277A1 true WO2001078277A1 (en) | 2001-10-18 |
WO2001078277A8 WO2001078277A8 (en) | 2002-01-03 |
Family
ID=22719670
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US2001/011109 WO2001078277A1 (en) | 2000-04-05 | 2001-04-05 | Bandwidth control system |
Country Status (4)
Country | Link |
---|---|
US (1) | US6954429B2 (en) |
AU (1) | AU2001249887A1 (en) |
CA (1) | CA2405263C (en) |
WO (1) | WO2001078277A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2959692A1 (en) * | 2013-02-21 | 2015-12-30 | Altiostar Networks, Inc. | Systems and methods for scheduling of data packets based on application detection in a base station |
Families Citing this family (71)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7126916B1 (en) * | 2000-08-24 | 2006-10-24 | Efficient Networks, Inc. | System and method for packet bypass in a communication system |
US8250357B2 (en) | 2000-09-13 | 2012-08-21 | Fortinet, Inc. | Tunnel interface for securing traffic over a network |
US7487232B1 (en) | 2000-09-13 | 2009-02-03 | Fortinet, Inc. | Switch management system and method |
US7574495B1 (en) | 2000-09-13 | 2009-08-11 | Fortinet, Inc. | System and method for managing interworking communications protocols |
US7111072B1 (en) | 2000-09-13 | 2006-09-19 | Cosine Communications, Inc. | Packet routing system and method |
US7272643B1 (en) | 2000-09-13 | 2007-09-18 | Fortinet, Inc. | System and method for managing and provisioning virtual routers |
US7181547B1 (en) * | 2001-06-28 | 2007-02-20 | Fortinet, Inc. | Identifying nodes in a ring network |
EP1313265A1 (en) * | 2001-11-19 | 2003-05-21 | Thomson Licensing S.A. | Method and device for address allocation for transmitting packets over a transparent bridge |
ES2317348T3 (en) * | 2002-04-05 | 2009-04-16 | Telefonaktiebolaget Lm Ericsson (Publ) | OBJECT TRANSFER PRIORITIES IN A COMMUNICATIONS NETWORK. |
US7093030B1 (en) * | 2002-05-02 | 2006-08-15 | At & T Corp. | Internetworking driver with active control |
US7203192B2 (en) | 2002-06-04 | 2007-04-10 | Fortinet, Inc. | Network packet steering |
US7340535B1 (en) | 2002-06-04 | 2008-03-04 | Fortinet, Inc. | System and method for controlling routing in a virtual router system |
US7177311B1 (en) | 2002-06-04 | 2007-02-13 | Fortinet, Inc. | System and method for routing traffic through a virtual router-based network switch |
US7376125B1 (en) | 2002-06-04 | 2008-05-20 | Fortinet, Inc. | Service processing switch |
US7161904B2 (en) | 2002-06-04 | 2007-01-09 | Fortinet, Inc. | System and method for hierarchical metering in a virtual router based network switch |
US7774483B1 (en) * | 2002-07-08 | 2010-08-10 | Cisco Technology, Inc. | Supporting a community of subscribers in an environment using a service selection gateway (SSG) |
US7272149B2 (en) | 2002-08-19 | 2007-09-18 | World Wide Packets, Inc. | Bandwidth allocation systems and methods |
US7272150B2 (en) * | 2002-08-19 | 2007-09-18 | World Wide Packets, Inc. | System and method for shaping traffic from a plurality of data streams using hierarchical queuing |
US7096383B2 (en) | 2002-08-29 | 2006-08-22 | Cosine Communications, Inc. | System and method for virtual router failover in a network routing system |
US7277389B2 (en) | 2002-08-29 | 2007-10-02 | World Wide Packets, Inc. | Systems and methods for grouping of bandwidth allocations |
US7269180B2 (en) * | 2002-11-04 | 2007-09-11 | World Wide Packets, Inc. | System and method for prioritizing and queuing traffic |
US7266120B2 (en) | 2002-11-18 | 2007-09-04 | Fortinet, Inc. | System and method for hardware accelerated packet multicast in a virtual routing system |
US7720095B2 (en) | 2003-08-27 | 2010-05-18 | Fortinet, Inc. | Heterogeneous media packet bridging |
KR100575734B1 (en) * | 2003-08-30 | 2006-05-03 | 엘지전자 주식회사 | Packet data receive method for mobile communication device |
US7499419B2 (en) | 2004-09-24 | 2009-03-03 | Fortinet, Inc. | Scalable IP-services enabled multicast forwarding with efficient resource utilization |
US8353003B2 (en) | 2004-10-01 | 2013-01-08 | Exelis Inc. | System and method for controlling a flow of data a network interface controller to a host processor |
US7986639B1 (en) * | 2004-10-26 | 2011-07-26 | Sprint Communications Company L.P. | Topology management of a communications network |
US7808904B2 (en) | 2004-11-18 | 2010-10-05 | Fortinet, Inc. | Method and apparatus for managing subscriber profiles |
US7769858B2 (en) * | 2005-02-23 | 2010-08-03 | International Business Machines Corporation | Method for efficiently hashing packet keys into a firewall connection table |
US7669181B2 (en) * | 2005-04-29 | 2010-02-23 | Sap (Ag) | Client interfaces for packages |
US7587705B2 (en) * | 2005-04-29 | 2009-09-08 | Sap (Ag) | Calls and return calls using client interfaces |
US7634771B2 (en) * | 2005-04-29 | 2009-12-15 | Sap (Ag) | Object generation in packages |
JP2007013449A (en) * | 2005-06-29 | 2007-01-18 | Nec Commun Syst Ltd | Shaper control method, data communication system, network interface device and network repeating device |
TWI291622B (en) * | 2005-08-11 | 2007-12-21 | Ic Plus Corp | Controller and method for per-flow rate |
GB2431067B (en) | 2005-10-07 | 2008-05-07 | Cramer Systems Ltd | Telecommunications service management |
GB2432992B (en) | 2005-11-18 | 2008-09-10 | Cramer Systems Ltd | Network planning |
GB2433675B (en) | 2005-12-22 | 2008-05-07 | Cramer Systems Ltd | Communications circuit design |
GB2435362B (en) | 2006-02-20 | 2008-11-26 | Cramer Systems Ltd | Method of configuring devices in a telecommunications network |
US20090122707A1 (en) * | 2007-11-13 | 2009-05-14 | At&T Services, Inc. | Multi-layer cascading network bandwidth control |
US9736065B2 (en) | 2011-06-24 | 2017-08-15 | Cisco Technology, Inc. | Level of hierarchy in MST for traffic localization and load balancing |
US8908698B2 (en) | 2012-01-13 | 2014-12-09 | Cisco Technology, Inc. | System and method for managing site-to-site VPNs of a cloud managed network |
US9306861B2 (en) * | 2013-09-26 | 2016-04-05 | Red Hat Israel, Ltd. | Automatic promiscuous forwarding for a bridge |
EP3077907B1 (en) * | 2013-12-06 | 2019-08-14 | Nokia Solutions and Networks Oy | Management of network entity selection |
US10122605B2 (en) | 2014-07-09 | 2018-11-06 | Cisco Technology, Inc | Annotation of network activity through different phases of execution |
US10476982B2 (en) | 2015-05-15 | 2019-11-12 | Cisco Technology, Inc. | Multi-datacenter message queue |
US10205677B2 (en) | 2015-11-24 | 2019-02-12 | Cisco Technology, Inc. | Cloud resource placement optimization and migration execution in federated clouds |
US10084703B2 (en) | 2015-12-04 | 2018-09-25 | Cisco Technology, Inc. | Infrastructure-exclusive service forwarding |
US10367914B2 (en) | 2016-01-12 | 2019-07-30 | Cisco Technology, Inc. | Attaching service level agreements to application containers and enabling service assurance |
US10432532B2 (en) | 2016-07-12 | 2019-10-01 | Cisco Technology, Inc. | Dynamically pinning micro-service to uplink port |
US10382597B2 (en) | 2016-07-20 | 2019-08-13 | Cisco Technology, Inc. | System and method for transport-layer level identification and isolation of container traffic |
US10567344B2 (en) | 2016-08-23 | 2020-02-18 | Cisco Technology, Inc. | Automatic firewall configuration based on aggregated cloud managed information |
US10320683B2 (en) | 2017-01-30 | 2019-06-11 | Cisco Technology, Inc. | Reliable load-balancer using segment routing and real-time application monitoring |
US10671571B2 (en) | 2017-01-31 | 2020-06-02 | Cisco Technology, Inc. | Fast network performance in containerized environments for network function virtualization |
US11005731B2 (en) | 2017-04-05 | 2021-05-11 | Cisco Technology, Inc. | Estimating model parameters for automatic deployment of scalable micro services |
US10439877B2 (en) | 2017-06-26 | 2019-10-08 | Cisco Technology, Inc. | Systems and methods for enabling wide area multicast domain name system |
US10382274B2 (en) | 2017-06-26 | 2019-08-13 | Cisco Technology, Inc. | System and method for wide area zero-configuration network auto configuration |
US10425288B2 (en) | 2017-07-21 | 2019-09-24 | Cisco Technology, Inc. | Container telemetry in data center environments with blade servers and switches |
US10601693B2 (en) | 2017-07-24 | 2020-03-24 | Cisco Technology, Inc. | System and method for providing scalable flow monitoring in a data center fabric |
US10541866B2 (en) | 2017-07-25 | 2020-01-21 | Cisco Technology, Inc. | Detecting and resolving multicast traffic performance issues |
US10579293B2 (en) * | 2017-09-27 | 2020-03-03 | Aci Worldwide Corp. | System and computer-implemented method for improving data storage and analysis |
US10705882B2 (en) | 2017-12-21 | 2020-07-07 | Cisco Technology, Inc. | System and method for resource placement across clouds for data intensive workloads |
US11595474B2 (en) | 2017-12-28 | 2023-02-28 | Cisco Technology, Inc. | Accelerating data replication using multicast and non-volatile memory enabled nodes |
US10585659B2 (en) * | 2018-03-29 | 2020-03-10 | Microsoft Technology Licensing, Llc | Enabling tenant administrators to initiate request driven peak-hour builds to override off-peak patching schedules |
US10289403B1 (en) | 2018-03-29 | 2019-05-14 | Microsoft Technology Licensing, Llc | Enhanced server farm patching system for enabling developers to override off-peak patching schedules |
US10728361B2 (en) | 2018-05-29 | 2020-07-28 | Cisco Technology, Inc. | System for association of customer information across subscribers |
US10904322B2 (en) | 2018-06-15 | 2021-01-26 | Cisco Technology, Inc. | Systems and methods for scaling down cloud-based servers handling secure connections |
US10764266B2 (en) | 2018-06-19 | 2020-09-01 | Cisco Technology, Inc. | Distributed authentication and authorization for rapid scaling of containerized services |
US11019083B2 (en) | 2018-06-20 | 2021-05-25 | Cisco Technology, Inc. | System for coordinating distributed website analysis |
US10819571B2 (en) | 2018-06-29 | 2020-10-27 | Cisco Technology, Inc. | Network traffic optimization using in-situ notification system |
US10904342B2 (en) | 2018-07-30 | 2021-01-26 | Cisco Technology, Inc. | Container networking using communication tunnels |
US11153215B1 (en) * | 2018-11-19 | 2021-10-19 | Cvs Pharmacy, Inc. | Asynchronous high throughput inbound messages with throttled outbound messages to safeguard enterprise backend systems |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5949758A (en) * | 1996-06-27 | 1999-09-07 | International Business Machines Corporation | Bandwidth reservation for multiple file transfer in a high speed communication network |
US6032193A (en) * | 1997-03-20 | 2000-02-29 | Niobrara Research And Development Corporation | Computer system having virtual circuit address altered by local computer to switch to different physical data link to increase data transmission bandwidth |
Family Cites Families (54)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4769191A (en) | 1984-04-26 | 1988-09-06 | Silvio Diana | Monolithic surface ornamentation of pre-cast reinforced concrete wall |
US4769811A (en) | 1986-12-31 | 1988-09-06 | American Telephone And Telegraph Company, At&T Bell Laboratories | Packet switching system arranged for congestion control |
JP2540930B2 (en) | 1988-02-19 | 1996-10-09 | 日本電気株式会社 | Congestion control device |
US5377327A (en) | 1988-04-22 | 1994-12-27 | Digital Equipment Corporation | Congestion avoidance scheme for computer networks |
SE462360B (en) | 1988-10-28 | 1990-06-11 | Ellemtel Utvecklings Ab | PROCEDURE AND DEVICE TO PREVENT IT TO BE SENDED ON A COMMON TRANSFER LINK HIGH-INTENSITY DATA PACKAGE WITH A PREDICTED VALUE DETERMINED AT A PREDICTED VALUE |
CA2008352C (en) | 1989-01-24 | 1993-12-14 | Yoshiro Osaki | Call restricting method in packet switching network and network controller having call restricting function |
NL8901171A (en) | 1989-05-10 | 1990-12-03 | At & T & Philips Telecomm | METHOD FOR MERGING TWO DATA CELL FLOWS TO ONE DATA CELL FLOW, AND ATD MULTIPLEXER FOR APPLICATION OF THIS METHOD |
FR2655223B1 (en) | 1989-11-27 | 1992-02-07 | Cit Alcatel | METHOD OF MANAGING FLOWS IN A BROADBAND BROADBAND DIGITAL TELECOMMUNICATION NETWORK, AND NETWORK FOR CARRYING OUT SAID METHOD. |
CA2038458C (en) * | 1990-03-19 | 1999-01-26 | Susumu Tominaga | Route regulating apparatus |
CA2038646C (en) | 1990-03-20 | 1995-02-07 | Katsumi Oomuro | Atm communication system with optimal traffic control by changing the allocated bandwidth |
US5029164A (en) | 1990-04-13 | 1991-07-02 | Digital Equipment Corporation | Congestion avoidance in high-speed network carrying bursty traffic |
JP2834293B2 (en) | 1990-08-17 | 1998-12-09 | 株式会社日立製作所 | How to change the virtual path capacity |
JPH04100342A (en) | 1990-08-20 | 1992-04-02 | Toshiba Corp | Traffic control system |
DE69130853T2 (en) | 1990-11-21 | 1999-07-22 | At & T Corp | Bandwidth management and congestion protection for access to broadband ISDN networks |
DE69116673T2 (en) | 1991-02-13 | 1996-08-08 | Bell Telephone Mfg | Allocation of bandwidth for permanent virtual connections |
JP2782973B2 (en) | 1991-04-10 | 1998-08-06 | 株式会社日立製作所 | Flow rate monitoring method and system in packet network |
US5319638A (en) | 1991-09-12 | 1994-06-07 | Bell Communications Research, Inc. | Link-by-link congestion control for packet transmission systems |
US5394408A (en) | 1992-02-10 | 1995-02-28 | Nec Corporation | Policing control apparatus |
US5243596A (en) | 1992-03-18 | 1993-09-07 | Fischer & Porter Company | Network architecture suitable for multicasting and resource locking |
US5313454A (en) | 1992-04-01 | 1994-05-17 | Stratacom, Inc. | Congestion control for cell networks |
EP0576122B1 (en) | 1992-04-27 | 2001-08-29 | Nippon Telegraph And Telephone Corporation | Packet network and method for congestion avoidance in packet networks |
US5335224A (en) | 1992-06-30 | 1994-08-02 | At&T Bell Laboratories | Service guarantees/congestion control in high speed networks |
JPH0646082A (en) | 1992-07-22 | 1994-02-18 | Toshiba Corp | Information transfer control system |
US5289462A (en) * | 1992-08-19 | 1994-02-22 | International Business Machines Corp. | Traffic management in packet communications networks |
DE69330371T2 (en) | 1993-04-19 | 2002-05-02 | Ibm | System for network-wide bandwidth allocation |
US5347511A (en) * | 1993-06-07 | 1994-09-13 | International Business Machines Corp. | Traffic management in packet communications networks |
KR100293920B1 (en) | 1993-06-12 | 2001-09-17 | 윤종용 | Apparatus and method for controlling traffic of atm user network interface |
US5359593A (en) | 1993-08-26 | 1994-10-25 | International Business Machines Corporation | Dynamic bandwidth estimation and adaptation for packet communications networks |
US5457687A (en) | 1993-09-02 | 1995-10-10 | Network Equipment Technologies, Inc. | Method and apparatus for backward explicit congestion notification (BECN) in an ATM network |
JP3187230B2 (en) | 1993-09-06 | 2001-07-11 | 株式会社東芝 | Congestion control method and congestion control device |
US5446726A (en) | 1993-10-20 | 1995-08-29 | Lsi Logic Corporation | Error detection and correction apparatus for an asynchronous transfer mode (ATM) network device |
FI94815C (en) | 1993-11-30 | 1995-10-25 | Nokia Telecommunciations Oy | Method and apparatus for handling congestion situations in a frame switching network |
US5784358A (en) | 1994-03-09 | 1998-07-21 | Oxford Brookes University | Broadband switching network with automatic bandwidth allocation in response to data cell detection |
JPH07264191A (en) | 1994-03-17 | 1995-10-13 | Fujitsu Ltd | Zone management system between connectionless servers |
JP2793769B2 (en) | 1994-04-01 | 1998-09-03 | 沖電気工業株式会社 | Window type cell flow monitor |
US5432824A (en) | 1994-07-06 | 1995-07-11 | Mitsubishi Electric Research Laboratories, Inc. | Credit/rate-based system for controlling traffic in a digital communication network |
US5734825A (en) | 1994-07-18 | 1998-03-31 | Digital Equipment Corporation | Traffic control system having distributed rate calculation and link by link flow control |
JP2922119B2 (en) | 1994-09-01 | 1999-07-19 | 沖電気工業株式会社 | Bandwidth regulation device and packet communication device |
US5592470A (en) | 1994-12-21 | 1997-01-07 | At&T | Broadband wireless system and network architecture providing broadband/narrowband service with optimal static and dynamic bandwidth/channel allocation |
US5996019A (en) | 1995-07-19 | 1999-11-30 | Fujitsu Network Communications, Inc. | Network link access scheduling using a plurality of prioritized lists containing queue identifiers |
CA2181206C (en) | 1995-07-24 | 2001-03-13 | Anwar Elwalid | A method for admission control and routing by allocating network resources in network nodes |
EP0781068A1 (en) * | 1995-12-20 | 1997-06-25 | International Business Machines Corporation | Method and system for adaptive bandwidth allocation in a high speed data network |
US5881140A (en) | 1996-01-16 | 1999-03-09 | Dsc Telecom L.P. | Apparatus and method of determining switch utilization within a telecommunications network |
US5838681A (en) | 1996-01-24 | 1998-11-17 | Bonomi; Flavio | Dynamic allocation of port bandwidth in high speed packet-switched digital switching systems |
US5983261A (en) | 1996-07-01 | 1999-11-09 | Apple Computer, Inc. | Method and apparatus for allocating bandwidth in teleconferencing applications using bandwidth control |
US5956338A (en) | 1996-07-09 | 1999-09-21 | Ericsson, Inc. | Protocol for broadband data communication over a shared medium |
US5901147A (en) | 1996-08-30 | 1999-05-04 | Mmc Networks, Inc. | Apparatus and methods to change thresholds to control congestion in ATM switches |
JP2897730B2 (en) | 1996-09-06 | 1999-05-31 | 日本電気株式会社 | Dynamic shaping device |
US5805599A (en) | 1996-12-04 | 1998-09-08 | At&T Corp. | Adaptive channel allocation system for communication network |
US5946324A (en) | 1997-04-04 | 1999-08-31 | At&T Corp. | Method for fair allocation of bandwidth |
US5978356A (en) | 1997-04-09 | 1999-11-02 | Lucent Technologies Inc. | Traffic shaper for network nodes and method thereof |
US6137777A (en) * | 1997-05-27 | 2000-10-24 | Ukiah Software, Inc. | Control tool for bandwidth management |
US6647008B1 (en) * | 1997-12-19 | 2003-11-11 | Ibm Corporation | Method and system for sharing reserved bandwidth between several dependent connections in high speed packet switching networks |
US6941380B2 (en) * | 2000-12-28 | 2005-09-06 | Nortel Networks Limited | Bandwidth allocation in ethernet networks |
-
2001
- 2001-04-04 US US09/826,235 patent/US6954429B2/en not_active Expired - Lifetime
- 2001-04-05 AU AU2001249887A patent/AU2001249887A1/en not_active Abandoned
- 2001-04-05 CA CA2405263A patent/CA2405263C/en not_active Expired - Lifetime
- 2001-04-05 WO PCT/US2001/011109 patent/WO2001078277A1/en active Application Filing
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5949758A (en) * | 1996-06-27 | 1999-09-07 | International Business Machines Corporation | Bandwidth reservation for multiple file transfer in a high speed communication network |
US6032193A (en) * | 1997-03-20 | 2000-02-29 | Niobrara Research And Development Corporation | Computer system having virtual circuit address altered by local computer to switch to different physical data link to increase data transmission bandwidth |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2959692A1 (en) * | 2013-02-21 | 2015-12-30 | Altiostar Networks, Inc. | Systems and methods for scheduling of data packets based on application detection in a base station |
Also Published As
Publication number | Publication date |
---|---|
CA2405263A1 (en) | 2001-10-18 |
CA2405263C (en) | 2013-03-12 |
US6954429B2 (en) | 2005-10-11 |
AU2001249887A1 (en) | 2001-10-23 |
WO2001078277A8 (en) | 2002-01-03 |
US20010055303A1 (en) | 2001-12-27 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CA2405263C (en) | Bandwidth control system | |
US7519727B2 (en) | Bandwidth management algorithm | |
KR20040000336A (en) | Packet transmitting apparatus, packet transmitting method, traffic conditioner, priority controlling mechanism, and packet shaper | |
US7260518B2 (en) | Network flow switching and flow data report | |
US7729347B2 (en) | Method and apparatus for fair flow control and congestion avoidance supporting multiple QoS class requirements | |
US6826147B1 (en) | Method and apparatus for aggregate flow control in a differentiated services network | |
US7272155B2 (en) | Central policy manager | |
US6459682B1 (en) | Architecture for supporting service level agreements in an IP network | |
US6977895B1 (en) | Apparatus and method for rate-based polling of input interface queues in networking devices | |
US20110096689A1 (en) | Systems and methods for determining the bandwidth used by a queue | |
US20110019572A1 (en) | Method and apparatus for shared shaping | |
AU8016000A (en) | Customer resources policy control for ip traffic delivery | |
WO2002001798A2 (en) | Differentiated service network and method of operating a differentiated service network | |
US20050122957A1 (en) | Router, traffic volume control method therefor, communication system, and traffic control program recorded computer-readable recording medium | |
JP4101631B2 (en) | Switching device | |
Cisco | Configuring Quality of Service | |
Cisco | Configuring Quality of Service | |
Li et al. | Design and implementation of a new queue scheduling scheme in DiffServ networks | |
KR100453825B1 (en) | Method for managing resources in guaranteeing QoS in IP network | |
KR100475783B1 (en) | Hierarchical prioritized round robin(hprr) scheduling | |
KR100563663B1 (en) | POLICY DECISION METHOD OF BANDWIDTHBROKER FOR INTERNET QoS | |
Follows et al. | Application-Driven Networking: Class of Service in IP, Ethernet and ATM Networks | |
Lemponen | Implementation of Differentiated Services Policy Information Base on Linux | |
Paul | QoS in data networks: Protocols and standards | |
JP2004032602A (en) | Packet transmitting apparatus and its method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
AK | Designated states |
Kind code of ref document: C1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: C1 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
CFP | Corrected version of a pamphlet front page |
Free format text: REVISED ABSTRACT RECEIVED BY THE INTERNATIONAL BUREAU AFTER COMPLETION OF THE TECHNICAL PREPARATIONS FOR INTERNATIONAL PUBLICATION |
|
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
REG | Reference to national code |
Ref country code: DE Ref legal event code: 8642 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2405263 Country of ref document: CA |
|
32PN | Ep: public notification in the ep bulletin as address of the adressee cannot be established |
Free format text: NOTIFICATION OF LOSS OF RIGHTS PURSUSNT TO RULE 69(1) EPC |
|
122 | Ep: pct application non-entry in european phase | ||
NENP | Non-entry into the national phase |
Ref country code: JP |