EP1069801A1 - Berichtigung der Verbindungsbandbreite auf der Basis der Beobachtung der Belegung der Ressourcen des Netzes - Google Patents

Berichtigung der Verbindungsbandbreite auf der Basis der Beobachtung der Belegung der Ressourcen des Netzes Download PDF

Info

Publication number
EP1069801A1
EP1069801A1 EP99480063A EP99480063A EP1069801A1 EP 1069801 A1 EP1069801 A1 EP 1069801A1 EP 99480063 A EP99480063 A EP 99480063A EP 99480063 A EP99480063 A EP 99480063A EP 1069801 A1 EP1069801 A1 EP 1069801A1
Authority
EP
European Patent Office
Prior art keywords
link
connection
network
buffer
bandwidth
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
EP99480063A
Other languages
English (en)
French (fr)
Other versions
EP1069801B1 (de
Inventor
Aline Fichou
Jean-François Le Pennec
Claude Galand
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by International Business Machines Corp filed Critical International Business Machines Corp
Priority to EP99480063A priority Critical patent/EP1069801B1/de
Priority to DE69920893T priority patent/DE69920893T2/de
Priority to US09/607,176 priority patent/US6765873B1/en
Publication of EP1069801A1 publication Critical patent/EP1069801A1/de
Application granted granted Critical
Publication of EP1069801B1 publication Critical patent/EP1069801B1/de
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478—Provisions for broadband connections
    • 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/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5003—Managing SLA; Interaction between SLA and QoS
    • H04L41/5009—Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/091—Measuring contribution of individual network components to actual service level
    • 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/11—Identifying congestion
    • 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/15—Flow control; Congestion control in relation to multipoint traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/74—Admission control; Resource allocation measures in reaction to resource unavailability
    • H04L47/745—Reaction in network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/76—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
    • H04L47/762—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions triggered by the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/822—Collecting or measuring resource availability data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/826—Involving periods of time
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5629—Admission control
    • H04L2012/5631—Resource management and allocation
    • H04L2012/5632—Bandwidth allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5629—Admission control
    • H04L2012/5631—Resource management and allocation
    • H04L2012/5636—Monitoring or policing, e.g. compliance with allocated rate, corrective actions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5638—Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5647—Cell loss
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5681—Buffer or queue management
    • H04L2012/5682—Threshold; Watermark
    • 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/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5003—Managing SLA; Interaction between SLA and QoS

Definitions

  • the invention relates to high-speed packet switched networks. More particularly, the invention relates to a connection bandwidth management process and system which rely on an efficient monitoring of the network resources occupancy to re-compute the bandwidth allocated to connections boarded on a given link so that the overall bandwidth capacity of the link is not exceeded.
  • QoS quality of service requirements
  • the communication circuits which may be shared in such network include transmission lines, program controlled processors, nodes or links, and data or packets buffers.
  • Traffic QoS requirements are taken into account during the path selection process, and can be defined as a set of measurable quantities or parameters that describe the user's perception of the service offered by the network.
  • Such parameters include the connection setup delay, the connection blocking probability, the loss probability, the error probability, the end-to-end transit delay and the end-to-end delay variation also referred to as jitter.
  • SLAs service level agreements
  • An SLA is a (possibly contractual) agreement by the network provider to supply a guaranteed level of connectivity for a given price. The agreement is reciprocal, the user also commits not to go beyond a certain level of network usage.
  • the level of connectivity can be expressed in many ways, including the following: the Bandwidth (number of bits per second), the Latency (end-to-end delay), the Availability (degree of uninterrupted service), the Loss Probability, the Security (guarantee that only the intended parties can participate in a communication).
  • Another important objective of the networks providers is to optimize the network resources utilization. Indeed, communication networks have at their disposal limited resources to ensure an efficient packets transmission, and while transmission costs per byte continue to drop year after year, transmission costs are likely to continue to represent the major expense of operating future telecommunication networks as the demand for bandwidth increases. More specifically, considering the wide area networks (also referred to as backbone networks ), the cost of physical connectivity between sites is frequently estimated at 80% of the overall cost.
  • the connectivity can come in the form of a leased line, X.25 service, frame relay bearer service (FRBS), ATM bearer service (ATMBS), X.25 or a virtual private network ...
  • FRBS frame relay bearer service
  • ATMBS ATM bearer service
  • X.25 a virtual private network
  • Minimizing the cost per bit means squeezing the maximum possible utilization out of every link.
  • high speed networks In order to comply with both optimizing network resources utilization and guaranteeing satisfactory SLAs to the network customers, high speed networks generally include monitoring software systems to monitor the status of their nodes and links. These monitoring systems typically rely on counters implemented at switching node level. From a network resources monitoring point of view, the most important counters are those which reflect the behavior of the "bottleneck" resources of the network because they will also reflect the end to end behaviour or quality of the service delivered.
  • the switching nodes are generally oversized in terms of performances compared to the communication links. As a matter of fact, switching nodes are "one time cost" for a network owner while lines cost is recurrent for example in a month period basis in case of leased lines, and is also much higher as previously stated.
  • a statistics server associated to the network to compute an average link utilization which is the average of link utilization values U(I) T computed during a day, several days or weeks.
  • modern high speed packet switching networks can support hundreds of thousands of connections. Moreover, tens to hundreds of connections may be configured for each newly subscribed user to the network. Besides, it is very seldom that a customer knows the amount of bandwidth required for each of his connections. In addition, network customers usually take some margin in the bandwidth requested for their connections to anticipate an increase of their traffic needs. The foregoing results in that an important difference is observed between the bandwidth reserved (i.e. contracted) by the customers' connections and the actual bandwidth used.
  • the link oversubscription technique suffers from the shortcomings that if a certain number, higher than the initial assumptions, of the customers boarded on the oversubscribed link increase significantly their traffic (still within their agreed-upon reserved bandwidth) and/or a certain number, higher than the initial assumptions, of customers' connections are active at the same time, then an unpredictable link congestion may occur. Such a congestion would induce a random discarding of packets in excess over the link, as all connections' traffic is categorized non-excess (green) traffic as it stays within the reserved bandwidth. Such a random discarding of packets may affect one connection more than another, depending on the time at which the congestion arises, and this goes against the fairness principle which should be applied to the different customers. Besides, in such an oversubscription situation, there is no minimal bandwidth guaranteed per connection.
  • connection bandwidth management technique that would permit at least the same number of connections to be boarded on a given link than when using the typical oversubscription technique, while solving its shortcomings.
  • such technique should provide a better control of the network behaviour in case of congestion, and guarantee a minimum bandwidth available to each connection boarded on the link.
  • a main object of the invention is therefore to provide a connection bandwidth management process and system which rely on an efficient monitoring of the network resources occupancy to re-compute the bandwidth allocated to connections boarded on a given link so that the overall bandwidth capacity of the link is not exceeded, while solving the shortcomings of the classical oversubscription technique.
  • connection bandwidth management process and system for use in a high speed packet switching network.
  • the network comprises a plurality of switching nodes interconnected through a plurality of communication links.
  • Each of the switching nodes comprises means for switching packets from at least one input link to at least one output link.
  • Each of the output links are coupled to at least one buffer in the switching node for queuing packets before they are transmitted over the output link.
  • Each of the communication links supports the traffic of a plurality of user connections statistically multiplexed over the link.
  • Each user connection is allocated an initial agreed-upon bandwidth through the network, with each of the communication links being possibly oversubscribed.
  • the connection bandwidth management process comprises the steps of: Link monitoring data on the communication links are periodically received in a network monitoring center, and stored in a computer memory in the network monitoring center. Then, one monitored link is selected and the corresponding link monitoring data are retrieved from the computer memory. The link monitored data retrieved for the selected link is analyzed, and it is determined whether the selected link is oversubscribed or not. If it is determined that the selected link is oversubscribed and that the link monitoring data for the selected link satisfies at least one predetermined condition the bandwidth initially allocated to each of the connections boarded on the selected link is reallocated, such that, the sum of the reallocated bandwidth of the connections boarded on the selected link is less or equal to the total bandwidth capacity of the selected link. The process recycles until all the monitored links have been selected.
  • the link monitoring data received for each monitored link includes a time distribution of the occupancy of the buffer(s) associated to the link, which is measured during a predetermined monitoring time period. Details on how this time distribution of buffer occupancy is obtained can be found in dependent claim 3. Therefore, by relying on a close monitoring, at switching node level, of the occupancy state of buffers which accordingly reflects the character bursty or non-bursty of the traffic boarded over the network links, reallocation of the bandwidth of a link connections will be subject to some predetermined conditions on the character bursty or non-bursty of the traffic flowing over the link.
  • the high speed packet switching network is a Frame Relay network
  • a connection bandwidth is reallocated by re-computing the following connection bandwidth parameters: The committed information rate (CIR), the committed burst size (Bc), and the excess burst size (Be).
  • CIR committed information rate
  • Bc committed burst size
  • Be excess burst size
  • the new CIR allocated per connection is a guaranteed minimum bandwidth available for each connection user, as the sum of the new CIRs for all the connections of a given link is less or equal to the total bandwidth capacity of the link. This also induces fairness between connections in case of packets discarding due to a congestion.
  • packet refers to either a cell i.e., a small fixed-size packet such as in ATM (asynchronous transfer mode) networks, or a variable size packet such as in IP or Frame Relay networks.
  • Network 100 comprises four access switching nodes 101 to 104 , and two internal switching nodes 105, 106 .
  • Network nodes are interconnected by network links e.g. 107 , also referred to as trunks.
  • a router 110 transmits LAN (local area network) batch traffic in IP (Internet Protocol) format at a rate of 512 Kbps (thousands bits per second) over the network, via access node 101 .
  • a host computer 111 sends SNA (Systems Network Architecture) traffic at a rate of 64 Kbps to network access node 102 .
  • SNA Systems Network Architecture
  • Attached to access node 103 is a Frame Relay Access Device (FRAD) 112 for transmitting voice or video data over the network.
  • FRAD Frame Relay Access Device
  • FIG. 1 access node 104 outputs data over the same external 64 Kbps transmission line, from connections originating from router 110 (IP data), from Host computer 111 (SNA data), and FRAD 112 (voice data).
  • IP data connections originating from router 110
  • SNA data Host computer 111
  • FRAD 112 voice data
  • the difficulty for such network is to provide each connection with the pre-specified quality of service (QOS). Indeed, some connections are very delay-sensitive as voice or video; other are not sensitive to delays but require a very low packet/cell loss in order to behave correctly, with limited retries.
  • Switching node which can be either an access node or an internal node of the network. Communication to the node is accomplished by means of adapters components 220 which connect communication lines 250 .
  • Switching fabric 210 connects the various adapters at very high speed. Each adapter connects on one side to external lines via line interface couplers (LICs) 260 and on the other side to one port ( 270 ) of the cell/packet switch 210 . Packets are received over the external lines 250 , either a trunk i.e. an internal link or a port i.e. a network access link. Each of these packets is associated with one network connection which is either starting, transiting or terminating in this node.
  • LICs line interface couplers
  • adapters can be of two different types, that is, access adapters or transit adapters.
  • Access adapters establish data communication from outside to inside the network, i.e. from network attached data terminal equipment (DTE) to network access nodes.
  • Transit adapters in the other hand, ensure data transmission between nodes inside the network.
  • Each adapter being access or transit adapter includes two parts : a receive part 230 and a transmit part 240 .
  • Receive part 230 receives data flow entering the node while transmit part 240 outputs data flow from the node towards another node (the next node of the path) or to a destination DTE, via communications lines 250 .
  • Access adapters also support the task of Call Admission Control (CAC), that is, the process of analysing the parameters of a new connection in order to decide whether the connection should be accepted or not, in function of the availability of the network 's resources.
  • CAC Call Admission Control
  • This policing function comprises marking packets, as excess (red packets) or non-excess (green packets), and discarding.
  • transit adapters do not include such marking function, they may only apply a selective packet discarding, and manage entering traffic e.g. by performing routing functions.
  • Each network node further includes a series of queuing elements for queuing incoming and departing packets. Queuing is preferably implemented at adapter level rather than at switch level because the process speed of the switch itself (switch fabric 210 ) is generally much higher than the process speed of an adapter. Thus, these queuing elements are essentially located at adapter level, as described hereinafter in connection with FIG. 3.
  • FIG. 3 there is shown the main queuing points of an adapter in a switching node.
  • queues stands for what is typically meant under the terms buffers, buffer memories, or queue memories; and the expression “queuing points” stands for specific locations in an adapter where such queues/buffers are implemented.
  • four queuing points can be identified, two ( 330, 340 ) are located at the transmit part 240 of the adapter, and two others ( 310, 320 ) are located at the receive part 230 of the adapter.
  • a receive process 360 is performed on adapter receive part 230 .
  • Such a receive process 360 includes connection policing, routing, statistics updates, CRC (Cyclic Redundancy Checksum) checking.
  • the receive process is implemented by means of a specific hardware logic, or through a processor enabled software.
  • the software solution provides more flexibility, but it is generally less efficient in terms of performance (i.e., number of packets processed per time unit) than the specific hardware solution, and consequently a queue 310 may be implemented for queuing incoming packets arriving faster than being processed by receive process element 360 . Generally this queuing is limited to compensate for potential bursts of packets.
  • a second queue 320 of adapter receive part 230 may be implemented to compensate for potential congestion of switch 210 , but this queuing is negligible as switches are generally designed to operate faster than adapters.
  • a packet that passes from switch 210 to adapter transmit part 240 is firstly queued in switch output queue 330 before it is processed in transmit process element 350 .
  • Transmit process element 350 determines the destination output line ( 250 ) to transmit packets over.
  • Queue 330 is thus intended to compensate for a lower processing rate of transmit process 350 compared to the arrival rate of incoming switched packets, depending on the implementation type (software/hardware) of the adapter.
  • the adapter processor running the code is designed to sustain a predetermined transmit packet rate larger than the corresponding line speed, and queuing of packets in queue 330 is limited to compensate for potential bursts of packets.
  • packets are queued in adapter output queuing point 340 .
  • network links are generally designed to sustain the traffic characteristics offered and no more (for cost-effective reasons), when congestion occurs the first resources to be saturated are generally the links. Consequently, adapter output queues constitute the major queuing element in the switching node to compensate for congestion at link level.
  • the implementation of the present invention focuses on adapter output queuing point 340 that is, the switching node output transmission queues.
  • Output queuing point 340 comprises a plurality of queues (i.e. buffer memories) which may achieve per priority queuing, per connection queuing, fairness queuing etc. or a combination thereof.
  • queues i.e. buffer memories
  • FIG. 4 there is shown the location where packet/cell counters are typically implemented in a switching node according to FIG. 2.
  • a first set of counters receive counters 410 (CNT1)
  • receive counters 410 CNT2
  • accept/discard counters 420 CNT2
  • the policing process is the function which verifies the compliance of the traffic supported by a given connection to the contract subscribed (SLA). If the connection traffic is above the agreed-upon traffic then packets may be discarded or tagged.
  • counters 420 are responsible for counting packets that are tagged or discarded, as well as those that are accepted.
  • counters are also implemented: a third set of counters 430 (CNT3) is responsible for counting packets as soon as they have been received from switching fabric 210 , as well as packets discarded due to overflow of the corresponding buffers (queues 330 of FIG. 3).
  • CNT4 is implemented for counting packets when they leave queues 340 , just before they are boarded over transmission links 250 . All the four sets of counters are implemented globally per adapter, then per port, per class of service, and possibly per connection.
  • the principle is to measure the occupancy of each of the "bottleneck" queues, i.e., queues 340 each time a packet is admitted to one of these queues. While this technique will be described hereinafter with reference to one memory queue, it should be understood that each of the memory queues 340 is monitored in the same manner.
  • N is an integer
  • thresholds T(1) to T(N) expressed in terms number of packets or bytes stored in the queue.
  • Thresholds T(1)-T(N) are chosen so as to correspond to different percentages of occupancy of the queue, function of its total capacity.
  • a number N of queue states, ST(1)-ST(N) are defined with regard to the comparison of the queue size with the thresholds T(1)-T(N).
  • Queue states ST(1)-ST(N) are defined as follows:
  • a number N of counters, PT(1)-PT(N), are implemented.
  • Each counter PT(i) (with i comprised between 1 and N) is incremented when the queue state (Queue_State) is found to be at any of the states ST(i) to ST(N).
  • T(1), T(2), T(3), T(4) which correspond to 5%, 20%, 40% and 70% of the total queue capacity.
  • queue states ST(1) to ST(4) are thus defined as follows:
  • counter PT(1)- PT(4) are implemented. For example, as explained above, counter PT(2) would be incremented if queue state is determined to be any of the states ST(2), ST(3), ST(4).
  • this process is implemented in the form of a computer program within the transmit process 240 (FIG. 3) in the adapter transmit part 220.
  • the process of queue occupancy monitoring starts at start box 501 .
  • an INIT step is performed where all the N counters PT(i) with i comprised between 1 to N are initialized to zero.
  • a new monitoring time interval (period) T is started.
  • a new packet is received from the switching fabric, its size PS is extracted from its header. It should be noted that in case of ATM cells, the cell size is fixed and the queues sizes are expressed in number of cells.
  • decision box 507 is entered to check if the queue can accept this packet.
  • box 513 is entered to determine the state of the queue (Queue_State) with regard to the queue states ST(1)-ST(N) defined above.
  • ST(k) (with k being an integer comprised between 1 and N)
  • counters PT(1) to PT(k) are incremented.
  • final values PT(i) obtained express each the percentage of packets that have arrived during monitoring period T while the queue was in any of the states ST(i) to ST(N).
  • each value PT(1) to PT(N) indicates respectively the percentage of packets that have arrived during monitoring period T while the queue size (Qsize) was equal or greater than respectively threshold T(1) to T(N).
  • final values PT(1) to PT(N) are retrieved by the General Purpose Processor of the adapter, so that these values are available to be polled by the bulk statistics server.
  • the process recycles at init box 503 to initialize a new monitoring period.
  • period T should be chosen such as to avoid counters overflow. In the preferred embodiment of the invention, period T is chosen to be 15 minutes.
  • the queue size (Qsize) is accordingly decremented by the size of the packet.
  • T(1)-T(N) chosen during the monitoring period (T) considered.
  • This queue occupancy evaluation is available through a set of N values: PT(1) to PT(N).
  • PT(1) to PT(N) Each value PT(i) indicates the percentage of packets that have arrived during monitoring period T while the queue size (Qsize) was equal or greater than threshold T(i), with T(i) expressed in percentage of the total queue capacity.
  • FIG. 6 there is shown a schematic block diagram illustrating a general network management architecture in which counters values at node level are retrieved and used to build network statistics and do capacity planning.
  • a switching fabric 210 connects a plurality of adapters 220 .
  • a Control Point processor (CP) 611 provides the network control functions.
  • Adapters 220 include memory locations 609 where adapter counters values are stored.
  • Control Point processor 611 centralizes periodically the different counters values measured during the measurement periods.
  • Statistics server 603 sends periodically or on demand the statistics files containing data for all the network resources to a network monitoring center 605 , as shown by arrow 625 .
  • a network monitoring center 605 human operators use these files to monitor the network resources and take the appropriate network monitoring actions, e.g., capacity planning actions.
  • Network monitoring actions are performed through a network management console 607 typically a personal computer or workstation as illustrated by arrow 621 .
  • the network management console 607 transmits the network monitoring commands to the Control Point processor 611 of the network nodes concerned, as illustrated by arrow 623 .
  • the counters values stored in memory locations 609 of node adapters 220 may also be accessed directly in real time by a human operator through network management console 607 .
  • the right sizing of the bandwidth reserved for the connections is justified, as previously stated, by the observation that network customers usually take some margin in the bandwidth requested for their connections, e.g., to anticipate an increase of their traffic, or because they cannot evaluate accurately their current and future needs.
  • the foregoing results in that there is most of the time an important difference between the bandwidth reserved (CIR in Frame Relay) by the users for their connections and the actual bandwidth used.
  • These "right sizing" actions are taken responsive to the analysis of the resource monitoring information, i.e., the average link utilization and/or of the link buffer occupancy statistics, and are triggered in the network monitoring center 605 of FIG. 6.
  • the connections "right sizing" actions are transmitted through the network to the Control Point processors of the ingress access nodes (e.g. nodes 101,102 of FIG. 1) of the network where the concerned connections have been originally set out.
  • the CBRS process is illustrated by additional arrow 627 extending from network monitoring center 605 to Control Point 611 of node 601 which, in this case, represents a network ingress access node.
  • Arrow 627 corresponds to the modifications brought to the connection parameters in order to re-size its allocated bandwidth, at its origin node. This is performed by means of dedicated commands automatically sent through the network by the computer system in charge of the CBRS process, from the monitoring center (605) to the origin switching node (601).
  • CBRS Connections Bandwidth Right Sizing
  • the maximum number of bits per seconds which an end station can transmit into the network is bounded by the access rate of the user-network interface.
  • the access rate is limited by the line speed of the user-network connection and established by subscription.
  • the maximum committed amount of data which a user may offer to the network is defined as committed burst size (Bc).
  • Bc is a measure for the volume of data for which the network will guarantee message delivery under normal conditions. It is measured during the committed rate measurement interval (Tc). End stations are allowed to transmit data in excess of the committed burst size.
  • the excess burst size (Be ) has been defined as the allowed amount of data by which a user can exceed Bc during the committed measurement rate interval Tc. If spare capacity exists the network will forward the data to its destination. The network however is free to mark the data as discard eligible (DE).
  • the committed information rate has been defined as the allowed amount of data which the network is committed to transfer under normal conditions. The rate is averaged over an increment of time Tc. The CIR is also referred to as minimum acceptable throughput.
  • the Bc and Be are expressed in bits, Tc in seconds, the access rate and CIR in bits per second.
  • Bc, Be , Tc , CIR are defined per DLCI (Data link Connection Identifier), the access rate is valid for per user-network interface.
  • Bc incoming and outgoing
  • Be incoming and outgoing
  • CIR incoming and outgoing
  • each reserved bandwidth connection provides a set of traffic descriptors to the network in the form of an entry in a dedicated table, herein referred to as "Connection Table" stored in a database memory in all the network nodes.
  • the Connection Table basically contains an identifier of each connection (DLCI), its origin and destination ports, and its associated CIR, Bc, Be, Access Rate.
  • Link Table Another table, herein referred to as "Link Table", is associated to the network links.
  • the Link Table which is also stored in the database memory of the nodes, contains link descriptors containing information such as the total link capacity (bandwidth), the bandwidth reserved per class of service, the link availability, or the link propagation delay.
  • bandwidth bandwidth reserved per class of service
  • link availability the link availability
  • link propagation delay the link propagation delay
  • CAC Call Admission Control
  • the CAC task is basically the process of analyzing the parameters of a new connection (in the Connection Table), in order to decide whether the connection should be accepted or not in function of the availability of the network 's resources.
  • Traffic policing is a process of adjusting the incoming traffic to enforce conformance with the agreed-to mean and burst; these actions will only impair non-conforming connections.
  • CBRS Connection Bandwidth Right Sizing
  • Connection Table 700 is shown with various columns that correspond each to a particular type of connection parameter.
  • Fields in column 702 correspond to the connections' identifier (DLCI in Frame Relay).
  • DLCI connections' identifier
  • Fields in column 704 contain the original CIR (CIR) of the connections, that is, the CIR agreed-upon at subscription time.
  • CIR is expressed in kilobits per second (Kbps).
  • Fields in columns 706 and 708 contain respectively the committed burst size (Bc) and the excess burst size (Be) of the connections. Both Bc and Be are expressed in Kilobits (Kb) in table 700 . Fields in column 710 contain the access rate of the connections. The access rate is expressed in kilobits per second (Kbps) in table 700 .
  • the foregoing connection parameters (Connection ID, CIR, Bc, Be, and access rate) are typically found in the Connection Table. According to the invention, there are two additional parameters per connection recorded in the Connection Table. These additional parameters are referred to as "CRF” and "NCIR", and correspond to the fields which are contained respectively in columns 712 and 714 .
  • CRF parameter stands for “Connection Right Sizing Factor”
  • NCIR parameter stands for “New CIR”.
  • CRF and NCIR are respectively initialized to 1 (one) and to CIR value at connection setup.
  • CRF parameter is indicative as to whether the connection has been already “right sized” or not.
  • Link Table 720 is shown.
  • Link Table 720 is associated to the network links and provides information relative to all the network links, typically, such as: the total link capacity (bandwidth), the bandwidth reserved per class of service, the link availability, or the link propagation delay.
  • Bandwidth the total link capacity
  • the bandwidth reserved per class of service the bandwidth reserved per class of service
  • the link availability or the link propagation delay.
  • Link Table 720 is shown including only the parameters that are used by the CBRS process according to the invention.
  • Table 720 includes three columns: first one at 722 , contains fields that correspond to the links' identifier. In table 720 , for argument's sake, records for one link (L1) is shown.
  • Columns 724 and 726 corresponds to link additional parameters that are used in the Connection Bandwidth Right Sizing process of the invention.
  • First additional parameter "Link Right Sizing Factor” (LRF) corresponds to the fields which are contained in column 724 .
  • Second additional parameter “Link Oversubscription Factor” (OVF) corresponds to the fields contained in column 726 .
  • OVF parameter is expressed in percentage (%) and represents the ratio of oversubscription of the link.
  • OC3 link which has a service rate of 155 Mbps (megabits per second). If the ratio of oversubscription (OVF) of this OC3 link is 400 %, then it means that the sum of the CIRs of the connections boarded over the link is four times its service rate (actual maximum bandwidth available on that link), that is, 620 Mbps. If no oversubscription is applied on that link, then the sum of the CIRs of the connections boarded over the link is less or equal to the link capacity, that is, 155 Mbps. In the latter case OVF is equal to 100 %.
  • the LRF parameter associated to a given link indicates whether or not the CBRS process has been applied to that link. LRF is initialized to OVF/100.
  • the LRF parameter associated to the link in table 720 is set to 1. As shown in table 720 , link L1 in the table is oversubscribed with a ratio (OVF) of 400 %. However the CBRS process has not been run yet on this link since its LRF parameter is still equal to 4. Additional link parameters LRF and OVF will be used in conjunction with the connections additional parameters CRF and NCIR in the Connection Bandwidth Right Sizing (CBRS) process of the invention, as will be described hereinafter, in connection with FIG. 8.
  • CBRS Connection Bandwidth Right Sizing
  • FIG. 8 is a flow chart illustrating the Connection Bandwidth Right Sizing (CBRS) process of the invention.
  • CBRS process is implemented in the form of computer programs which run in a monitoring-dedicated computer in the network monitoring center (FIG. 6, 605).
  • CBRS process is automatically triggered in the network monitoring center (FIG. 6, 605), upon receiving of the network links monitoring reports which include the average link utilization and/or of the link buffer occupancy statistics.
  • the monitoring reports are received every night in the network monitoring center, and a typical frequency for running the CBRS process is from one to some days.
  • the CBRS process is a background type process. It should be noted that while, in the preferred embodiment of the invention, the CBRS process utilizes both the average link utilization statistics and the link buffer occupancy statistics for more efficiency, the CBRS principle could also be implemented with only the average link utilization statistics used.
  • the CBRS process of the invention is initiated, starting at start box 800 , whenever the network links monitoring reports are received. At that time, all links of a link list stored in memory will be processed sequentially starting with the first link of the list. Then, box 802 is entered to retrieve the statistics values corresponding to the selected link, from the links monitoring reports which are stored in a computer memory in the network monitoring center.
  • the link associated statistics values include:
  • decision box 804 is entered where it is determined whether the link packet loss is greater than the SLA (service level agreement) requirements associated with the connections boarded on the link. If the link packet loss (Packet_Loss) is larger than the SLA, it means that the link is already not capable of providing a good level of service with regard to the SLA because it is overloaded. In that case (YES), box 806 is entered to reroute some of the connections which are currently boarded on the link, until the selected link packet loss is less than the maximum packet loss allowed (SLA), as shown by re-entering box 804 .
  • SLA service level agreement
  • box 808 is entered to test whether the Link_Use is greater than a first predetermined value U1 which is equal to 80 % in the preferred embodiment of the invention. If not (NO), decision box 810 is entered to test buffer occupancy values PT(3) and PT(4).
  • PT(3) is greater or equal to a first predetermined buffer occupancy value P1, OR if PT(4) is greater or equal to a second predetermined buffer occupancy value P2, it means that: Either the percentage of packets PT(3) that have arrived during the monitoring time period while the queue occupancy (Qsize) was equal or greater than T(3) is greater or equal to P1 OR the percentage of packets PT(4) that have arrived during the monitoring time period while the queue occupancy (Qsize) was equal or greater than T(4) is greater or equal to P2.
  • box 818 is entered to perform the actual Connection Bandwidth Right Sizing (CBRS) step on the selected connection (Ci).
  • box 818A is entered first to perform the first sub-step of the CBRS step, that is, computing a new CIR for connection Ci (NCIR(Ci)), and updating accordingly the connection right sizing factor (CRF(Ci)).
  • the new CIR and the updated CRF are respectively recorded into the fields corresponding to connection Ci, in respectively column 714 and 712 of table 700 .
  • box 818B is entered to perform a second sub-step in which parameters Be and Bc associated to the selected connection are re-computed to reflect the new CIR (NCIR).
  • NIR new CIR
  • Newly computed Be and Bc of the connection (herein referred to as NBe(Ci) and NBc(Ci)) are recorded into the fields corresponding to connection Ci in respectively column 708 and 706 of Connection Table 700 . Details on how CRF, NCIR, NBe and NBc are calculated will be provided further in the description.
  • decision box 820 is entered where it is determined whether all connections which are presently boarded on the selected link have been processed or not.
  • box 812 is re-entered in order to select another connection to apply the CBRS step (818) on. Conversely, if all the connections boarded on the selected link have been processed (820, YES), then box 822 is entered to set the LRF parameter of the selected link to 1 (one) in Link Table 720 . Finally, terminal box 824 is entered to complete the CBRS process run on the selected link. Another link may now be selected and the CBRS process started on it.
  • each one of the connections established through the network is allocated a "re-sized" bandwidth (NCIR) which corresponds to the original bandwidth (CIR) that has been divided by the highest link oversubscription factor (OVF) of all the links along the path selected through the network for that connection.
  • NIR re-sized bandwidth
  • each connection Ci is defined through a set of parameters including the committed information rate (CIR), its committed burst size (Bc) and its excess burst size (Be).
  • CIR committed information rate
  • Bc committed burst size
  • Be excess burst size
  • each of its connections, Ci is "re-sized” if CRF(Ci) is less than LRF, that is, its CIR is recalculated and is recorded in table 700 in the NCIR (New_CIR) corresponding field. Accordingly, the CRF parameter of the connection is updated to indicate the ratio of re-sizing of the connection.
  • CRF (Ci) LRF
  • connection L1 in Connection Table 700 is one of the connections that are boarded over link L1.
  • connection C1 has an original CIR of 200 Kbps, while its re-sized CIR (NCIR) in column 714 is equal to 50 Kbps, that is: CIR C 1 LRF L 1
  • NCIR new CIR
  • NCIR new CIR
  • Bc committed burst size
  • Be excess burst size
EP99480063A 1999-07-13 1999-07-13 Berichtigung der Verbindungsbandbreite auf der Basis der Beobachtung der Belegung der Ressourcen des Netzes Expired - Lifetime EP1069801B1 (de)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP99480063A EP1069801B1 (de) 1999-07-13 1999-07-13 Berichtigung der Verbindungsbandbreite auf der Basis der Beobachtung der Belegung der Ressourcen des Netzes
DE69920893T DE69920893T2 (de) 1999-07-13 1999-07-13 Berichtigung der Verbindungsbandbreite auf der Basis der Beobachtung der Belegung der Ressourcen des Netzes
US09/607,176 US6765873B1 (en) 1999-07-13 2000-06-29 Connections bandwidth right sizing based on network resources occupancy monitoring

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP99480063A EP1069801B1 (de) 1999-07-13 1999-07-13 Berichtigung der Verbindungsbandbreite auf der Basis der Beobachtung der Belegung der Ressourcen des Netzes

Publications (2)

Publication Number Publication Date
EP1069801A1 true EP1069801A1 (de) 2001-01-17
EP1069801B1 EP1069801B1 (de) 2004-10-06

Family

ID=8242453

Family Applications (1)

Application Number Title Priority Date Filing Date
EP99480063A Expired - Lifetime EP1069801B1 (de) 1999-07-13 1999-07-13 Berichtigung der Verbindungsbandbreite auf der Basis der Beobachtung der Belegung der Ressourcen des Netzes

Country Status (3)

Country Link
US (1) US6765873B1 (de)
EP (1) EP1069801B1 (de)
DE (1) DE69920893T2 (de)

Cited By (27)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2375256A (en) * 2001-04-30 2002-11-06 Nokia Corp Determining service level identification to data transmitted between a device and a network
EP1300995A2 (de) * 2001-10-05 2003-04-09 Nortel Networks Limited Ressourcenverwaltung in heterogenen dienstqualitätsbasierten Paketnetzwerken
EP1303089A1 (de) * 2001-02-14 2003-04-16 Matsushita Electric Industrial Co., Ltd. Verteilungssystem für digitalen inhalt und seine vorrichtung
EP1374498A1 (de) * 2001-03-06 2004-01-02 Pluris, Inc. Verbessertes system zur koppelfeldpaketsteuerung
US6842783B1 (en) * 2000-02-18 2005-01-11 International Business Machines Corporation System and method for enforcing communications bandwidth based service level agreements to plurality of customers hosted on a clustered web server
WO2006089214A1 (en) 2005-02-19 2006-08-24 Cisco Technology, Inc. Techniques for oversubscribing edge nodes for virtual private networks
EP1697814A2 (de) * 2003-11-19 2006-09-06 McData Corporation Koppelfeld-staumanagement
WO2007030370A1 (en) * 2005-09-07 2007-03-15 Scientific-Atlanta, Inc. Optimizing data rate for video services
EP1805938A2 (de) * 2004-10-07 2007-07-11 Santera Systems Inc. Verfahren und systeme zur anrufszulassungssteuerung auf messungsbasis in einem media-gateway
US7934232B1 (en) 2000-05-04 2011-04-26 Jerding Dean F Navigation paradigm for access to television services
US7962370B2 (en) 2000-06-29 2011-06-14 Rodriguez Arturo A Methods in a media service system for transaction processing
US7975277B1 (en) 2000-04-03 2011-07-05 Jerding Dean F System for providing alternative services
US7992163B1 (en) 1999-06-11 2011-08-02 Jerding Dean F Video-on-demand navigational system
US8006262B2 (en) 2001-06-29 2011-08-23 Rodriguez Arturo A Graphic user interfaces for purchasable and recordable media (PRM) downloads
US8006273B2 (en) 2001-06-29 2011-08-23 Rodriguez Arturo A Updating download options for unavailable media content
US8020184B2 (en) 1999-06-11 2011-09-13 Jerding Dean F Channel control system for exiting from an interactive program guide
US8032914B2 (en) 2000-11-10 2011-10-04 Rodriguez Arturo A Systems and methods for dynamically allocating bandwidth in a digital broadband delivery system
US8037504B2 (en) 1999-06-11 2011-10-11 Jerding Dean F Video on demand system with selectable options of configurable random-access control
US8069259B2 (en) 2000-06-09 2011-11-29 Rodriguez Arturo A Managing removal of media titles from a list
US8161388B2 (en) 2004-01-21 2012-04-17 Rodriguez Arturo A Interactive discovery of display device characteristics
US8191093B2 (en) 2001-06-29 2012-05-29 Rodriguez Arturo A Providing information pertaining to audio-visual and personal bi-directional services
US8516525B1 (en) 2000-06-09 2013-08-20 Dean F. Jerding Integrated searching system for interactive media guide
US8640172B2 (en) 2001-06-29 2014-01-28 Cisco Technology, Inc. System and method for characterization of purchasable and recordable media (PRM)
US8707153B2 (en) 2000-06-09 2014-04-22 Cisco Technology, Inc. Displaying comment data corresponding to a video presentation
US8745656B2 (en) 2002-02-11 2014-06-03 Cisco Technology, Inc. Tracking of presented television advertisements
EP2802113A1 (de) * 2013-05-08 2014-11-12 Fujitsu Limited Vorrichtung zur Bestimmung von Blockierungen
WO2015106795A1 (en) * 2014-01-14 2015-07-23 Huawei Technologies Co., Ltd. Methods and systems for selecting resources for data routing

Families Citing this family (55)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7346677B1 (en) 1999-07-02 2008-03-18 Cisco Technology, Inc. Method and apparatus for creating policies for policy-based management of quality of service treatments of network data traffic flows
US6788647B1 (en) 1999-11-19 2004-09-07 Cisco Technology, Inc. Automatically applying bi-directional quality of service treatment to network data flows
US7111163B1 (en) 2000-07-10 2006-09-19 Alterwan, Inc. Wide area network using internet with quality of service
AU2001280535A1 (en) * 2000-07-13 2002-01-30 Aprisma Management Technologies, Inc. Method and apparatus for monitoring and maintaining user-perceived quality of service in a communications network
US7464164B2 (en) * 2000-08-01 2008-12-09 Qwest Communications International, Inc. Linking order entry process to realtime network inventories and capacities
US7058707B1 (en) 2000-08-01 2006-06-06 Qwest Communications International, Inc. Performance modeling in a VDSL network
US7099932B1 (en) 2000-08-16 2006-08-29 Cisco Technology, Inc. Method and apparatus for retrieving network quality of service policy information from a directory in a quality of service policy management system
US20020167967A1 (en) * 2000-09-06 2002-11-14 Schneider Electric Method for managing bandwidth on an ethernet network
US7096260B1 (en) * 2000-09-29 2006-08-22 Cisco Technology, Inc. Marking network data packets with differentiated services codepoints based on network load
US6907004B1 (en) * 2000-10-31 2005-06-14 Cisco Technology, Inc. Method and system for manual admission control with user options
US7050396B1 (en) 2000-11-30 2006-05-23 Cisco Technology, Inc. Method and apparatus for automatically establishing bi-directional differentiated services treatment of flows in a network
FR2817687B1 (fr) * 2000-12-01 2003-02-14 Thomson Csf Procede de dimensionnement d'un reseau de transmission a commutation par paquets de type deterministe
JP2002247092A (ja) * 2001-02-19 2002-08-30 Fujitsu Ltd 通信装置および帯域管理方式
US6954714B2 (en) * 2001-04-09 2005-10-11 Ntt Docomo, Inc. System and associated method for measuring communication data volume and type thereof
US20020163883A1 (en) * 2001-05-03 2002-11-07 Price Jeffrey M. Methods and systems for providing call admission control in packetized voice networks
US20020194332A1 (en) * 2001-06-13 2002-12-19 Connor Patrick L. Method and apparatus to manage resources for a multi-threaded device driver
GB2377117B (en) * 2001-06-27 2004-08-18 Cambridge Broadband Ltd Method and apparatus for providing communications bandwidth
WO2003027421A2 (en) * 2001-09-26 2003-04-03 Squier Randy L Lock assembly having secure engagement plate
US7114086B2 (en) * 2002-01-04 2006-09-26 Ati Technologies, Inc. System for reduced power consumption by monitoring instruction buffer and method thereof
US7840593B2 (en) * 2002-07-30 2010-11-23 Sony Corporation Program, information processing method and device, and data structure
US7505413B2 (en) * 2004-09-09 2009-03-17 Cariden Technologies, Inc. Methods and systems to perform traffic engineering in a metric-routed network
US7827284B2 (en) * 2002-12-20 2010-11-02 Netsocket, Inc. Method and arrangement in a communication system
US7457302B1 (en) * 2002-12-31 2008-11-25 Apple Inc. Enhancement to loop healing for malconfigured bus prevention
US7292542B2 (en) * 2003-03-05 2007-11-06 At&T Bls Intellectual Property, Inc. Method for traffic engineering of connectionless virtual private network services
US20040190541A1 (en) * 2003-03-26 2004-09-30 Interdigital Technology Corporation Determination of optimal switching points between the uplink and downlink
US7454496B2 (en) * 2003-12-10 2008-11-18 International Business Machines Corporation Method for monitoring data resources of a data processing network
JP4396859B2 (ja) * 2004-01-09 2010-01-13 日本電気株式会社 負荷分散方法、ノード及び制御プログラム
US7489656B2 (en) * 2004-03-23 2009-02-10 Microsoft Corporation Bandwidth allocation
US20060092851A1 (en) * 2004-10-29 2006-05-04 Jeffrey Forrest Edlund Method and apparatus for communicating predicted future network requirements of a data center to a number of adaptive network interfaces
US8848530B2 (en) * 2004-11-01 2014-09-30 At&T Intellectual Property Ii, L.P. System and method for providing differentiated quality of service
US7548964B2 (en) * 2005-10-11 2009-06-16 International Business Machines Corporation Performance counters for virtualized network interfaces of communications networks
US7599290B2 (en) * 2006-08-11 2009-10-06 Latitude Broadband, Inc. Methods and systems for providing quality of service in packet-based core transport networks
US20080089243A1 (en) * 2006-10-17 2008-04-17 Jameson David D Managing An Over-Subscribed Data Communication Network
US7630314B2 (en) * 2006-12-05 2009-12-08 Latitue Broadband, Inc. Methods and systems for dynamic bandwidth management for quality of service in IP Core and access networks
US7773519B2 (en) * 2008-01-10 2010-08-10 Nuova Systems, Inc. Method and system to manage network traffic congestion
US7983189B2 (en) * 2008-03-12 2011-07-19 Embarq Holdings Company, Llc System and method for tracking performance and service level agreement compliance for multipoint packet services
US20090238070A1 (en) * 2008-03-20 2009-09-24 Nuova Systems, Inc. Method and system to adjust cn control loop parameters at a congestion point
US8488661B2 (en) * 2008-06-13 2013-07-16 Verizon Patent And Licensing Inc. Systems and methods for data streaming
US7962621B2 (en) * 2009-01-13 2011-06-14 Microsoft Corporation—One Microsoft Way Policy service system architecture for sessions created using STUN
US8797864B2 (en) * 2010-01-21 2014-08-05 International Business Machines Corporation Adaptive traffic management via analytics based volume reduction
US8484371B2 (en) * 2010-03-04 2013-07-09 Tata Consultancy Services Limited System and method for network bandwidth sizing
US8307074B1 (en) * 2010-07-15 2012-11-06 Sprint Communications Company L.P. Self-selected message queue monitoring
US9083635B1 (en) * 2010-10-04 2015-07-14 Adtran, Inc. Enqueue policing systems and methods
US8630173B2 (en) * 2010-11-19 2014-01-14 Cisco Technology, Inc. Dynamic queuing and pinning to improve quality of service on uplinks in a virtualized environment
GB201111106D0 (en) * 2011-06-30 2011-08-10 Xelerated Ab Method, network device, computer program and computer program product for communication queue state
US20150095498A1 (en) * 2012-03-14 2015-04-02 Jean Tourrilhes Allocating Bandwidth in a Network
US9762634B2 (en) * 2012-04-06 2017-09-12 At&T Intellectual Property I, L.P. System and method to transmit digital broadcast grade video via a cellular data network
US20140078888A1 (en) * 2012-09-14 2014-03-20 Tellabs Operations Inc. Procedure, apparatus, system, and computer program for designing a virtual private network
US9647905B1 (en) * 2012-12-21 2017-05-09 EMC IP Holding Company LLC System and method for optimized management of statistics counters, supporting lock-free updates, and queries for any to-the-present time interval
US9473418B2 (en) 2013-12-12 2016-10-18 International Business Machines Corporation Resource over-subscription
US9141431B1 (en) * 2014-10-07 2015-09-22 AO Kaspersky Lab System and method for prioritizing on access scan and on demand scan tasks
US10326663B2 (en) * 2017-06-02 2019-06-18 Cisco Technology, Inc. Fabric-wide bandth management
US10852990B2 (en) 2017-08-02 2020-12-01 Samsung Electronics Co., Ltd. Hybrid framework of NVMe-based storage system in cloud computing environment
CN109041262B (zh) * 2018-08-23 2020-06-16 Oppo广东移动通信有限公司 数据传输方法及相关装置
CN112751771A (zh) * 2019-10-29 2021-05-04 深圳市中兴微电子技术有限公司 一种实现拥塞控制的方法和装置及计算机可读存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5313454A (en) * 1992-04-01 1994-05-17 Stratacom, Inc. Congestion control for cell networks
EP0781068A1 (de) * 1995-12-20 1997-06-25 International Business Machines Corporation Methode und System für adaptive Bandbreitenzuordnung in einem schnellen Datennetzwerk
WO1998049862A1 (en) * 1997-04-24 1998-11-05 Northern Telecom Limited Resource management of an atm connection

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3192039B2 (ja) * 1993-09-13 2001-07-23 株式会社日立製作所 トラヒック制御方式およびネットワーク制御システム
WO1996027966A1 (en) * 1995-03-08 1996-09-12 Oxford Brookes University Broadband switching system
US6034945A (en) * 1996-05-15 2000-03-07 Cisco Technology, Inc. Method and apparatus for per traffic flow buffer management
US6097722A (en) * 1996-12-13 2000-08-01 Nortel Networks Corporation Bandwidth management processes and systems for asynchronous transfer mode networks using variable virtual paths
US6459682B1 (en) * 1998-04-07 2002-10-01 International Business Machines Corporation Architecture for supporting service level agreements in an IP network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5313454A (en) * 1992-04-01 1994-05-17 Stratacom, Inc. Congestion control for cell networks
EP0781068A1 (de) * 1995-12-20 1997-06-25 International Business Machines Corporation Methode und System für adaptive Bandbreitenzuordnung in einem schnellen Datennetzwerk
WO1998049862A1 (en) * 1997-04-24 1998-11-05 Northern Telecom Limited Resource management of an atm connection

Cited By (41)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7992163B1 (en) 1999-06-11 2011-08-02 Jerding Dean F Video-on-demand navigational system
US8056106B2 (en) 1999-06-11 2011-11-08 Rodriguez Arturo A Video on demand system with dynamic enablement of random-access functionality
US8037504B2 (en) 1999-06-11 2011-10-11 Jerding Dean F Video on demand system with selectable options of configurable random-access control
US8020184B2 (en) 1999-06-11 2011-09-13 Jerding Dean F Channel control system for exiting from an interactive program guide
US6842783B1 (en) * 2000-02-18 2005-01-11 International Business Machines Corporation System and method for enforcing communications bandwidth based service level agreements to plurality of customers hosted on a clustered web server
US7992166B2 (en) 2000-04-03 2011-08-02 Jerding Dean F Providing alternative services based on receiver configuration and type of display device
US7975277B1 (en) 2000-04-03 2011-07-05 Jerding Dean F System for providing alternative services
US7934232B1 (en) 2000-05-04 2011-04-26 Jerding Dean F Navigation paradigm for access to television services
US9380347B2 (en) 2000-05-04 2016-06-28 Cisco Technology, Inc. Hypertext service guide menu display
US8739212B2 (en) 2000-05-04 2014-05-27 Cisco Technology, Inc. Configuration of presentations of selectable TV services according to usage
US8516525B1 (en) 2000-06-09 2013-08-20 Dean F. Jerding Integrated searching system for interactive media guide
US8707153B2 (en) 2000-06-09 2014-04-22 Cisco Technology, Inc. Displaying comment data corresponding to a video presentation
US8069259B2 (en) 2000-06-09 2011-11-29 Rodriguez Arturo A Managing removal of media titles from a list
US7962370B2 (en) 2000-06-29 2011-06-14 Rodriguez Arturo A Methods in a media service system for transaction processing
US8032914B2 (en) 2000-11-10 2011-10-04 Rodriguez Arturo A Systems and methods for dynamically allocating bandwidth in a digital broadband delivery system
EP1303089A1 (de) * 2001-02-14 2003-04-16 Matsushita Electric Industrial Co., Ltd. Verteilungssystem für digitalen inhalt und seine vorrichtung
EP1303089A4 (de) * 2001-02-14 2009-09-09 Panasonic Corp Verteilungssystem für digitalen inhalt und seine vorrichtung
EP1374498A1 (de) * 2001-03-06 2004-01-02 Pluris, Inc. Verbessertes system zur koppelfeldpaketsteuerung
EP1374498A4 (de) * 2001-03-06 2006-09-27 Pluris Inc Verbessertes system zur koppelfeldpaketsteuerung
GB2375256A (en) * 2001-04-30 2002-11-06 Nokia Corp Determining service level identification to data transmitted between a device and a network
US8006262B2 (en) 2001-06-29 2011-08-23 Rodriguez Arturo A Graphic user interfaces for purchasable and recordable media (PRM) downloads
US8006273B2 (en) 2001-06-29 2011-08-23 Rodriguez Arturo A Updating download options for unavailable media content
US8191093B2 (en) 2001-06-29 2012-05-29 Rodriguez Arturo A Providing information pertaining to audio-visual and personal bi-directional services
US8640172B2 (en) 2001-06-29 2014-01-28 Cisco Technology, Inc. System and method for characterization of purchasable and recordable media (PRM)
US7092356B2 (en) 2001-10-05 2006-08-15 Nortel Networks Limited Resource management in heterogenous QoS-based packet Networks
EP1300995A3 (de) * 2001-10-05 2004-01-07 Nortel Networks Limited Ressourcenverwaltung in heterogenen dienstqualitätsbasierten Paketnetzwerken
EP1300995A2 (de) * 2001-10-05 2003-04-09 Nortel Networks Limited Ressourcenverwaltung in heterogenen dienstqualitätsbasierten Paketnetzwerken
US8745656B2 (en) 2002-02-11 2014-06-03 Cisco Technology, Inc. Tracking of presented television advertisements
EP1697814A4 (de) * 2003-11-19 2009-08-05 Mcdata Corp Koppelfeld-staumanagement
EP1697814A2 (de) * 2003-11-19 2006-09-06 McData Corporation Koppelfeld-staumanagement
US8161388B2 (en) 2004-01-21 2012-04-17 Rodriguez Arturo A Interactive discovery of display device characteristics
US9615139B2 (en) 2004-01-21 2017-04-04 Tech 5 Determining device that performs processing of output pictures
EP1805938A4 (de) * 2004-10-07 2012-06-27 Genband Inc Verfahren und systeme zur anrufszulassungssteuerung auf messungsbasis in einem media-gateway
EP1805938A2 (de) * 2004-10-07 2007-07-11 Santera Systems Inc. Verfahren und systeme zur anrufszulassungssteuerung auf messungsbasis in einem media-gateway
EP1856861A4 (de) * 2005-02-19 2012-01-18 Cisco Tech Inc Verfahren zur überzeichnung von randknoten für virtuelle private netzwerke
EP1856861A1 (de) * 2005-02-19 2007-11-21 Cisco Technology, Inc. Verfahren zur überzeichnung von randknoten für virtuelle private netzwerke
WO2006089214A1 (en) 2005-02-19 2006-08-24 Cisco Technology, Inc. Techniques for oversubscribing edge nodes for virtual private networks
WO2007030370A1 (en) * 2005-09-07 2007-03-15 Scientific-Atlanta, Inc. Optimizing data rate for video services
EP2802113A1 (de) * 2013-05-08 2014-11-12 Fujitsu Limited Vorrichtung zur Bestimmung von Blockierungen
US9787533B2 (en) 2013-05-08 2017-10-10 Fujitsu Limited Obstruction determination device
WO2015106795A1 (en) * 2014-01-14 2015-07-23 Huawei Technologies Co., Ltd. Methods and systems for selecting resources for data routing

Also Published As

Publication number Publication date
DE69920893T2 (de) 2006-03-09
DE69920893D1 (de) 2004-11-11
US6765873B1 (en) 2004-07-20
EP1069801B1 (de) 2004-10-06

Similar Documents

Publication Publication Date Title
EP1069801B1 (de) Berichtigung der Verbindungsbandbreite auf der Basis der Beobachtung der Belegung der Ressourcen des Netzes
EP1069729B1 (de) Auf der Überwachung der Belegung von Puffern basierte Planung der Netzwerkkapazität
US6614790B1 (en) Architecture for integrated services packet-switched networks
US7130903B2 (en) Multi-layer class identifying communication apparatus with priority control
US6934250B1 (en) Method and apparatus for an output packet organizer
US7609634B2 (en) Communication traffic policing apparatus and methods
US6266322B1 (en) Dimensioning bandwidth and connection admission control for elastic traffic in high-speed communication networks
US20050050246A1 (en) Method of admission control
JP3338000B2 (ja) Ａｔｍスイッチングノードにおける実時間トラフィック監視及び制御方法
US7787469B2 (en) System and method for provisioning a quality of service within a switch fabric
Borgonovo et al. PCP: A bandwidth guaranteed transport service for IP networks
Jiang et al. Measurement-based admission control for a flow-aware network
Ferrari et al. Measurement based analysis of delay in priority queuing
Rhee et al. Two phase edge-to-edge distributed measurement based admission control mechanism in large IP networks
Dixit et al. Traffic descriptor mapping and traffic control for frame relay over ATM network
JP3989197B2 (ja) パケット廃棄装置
JP3813473B2 (ja) パケット廃棄装置
Tawfeeq Network Congestion and Quality of Service Analysis Using OPNET
Mai et al. Delay Performance and Management of VoIP System
JP3917830B2 (ja) レート制御装置
JP3989196B2 (ja) セル多重化装置
Gyires An extension of Integrated Services with active networking for providing quality of service in networks with long-range dependent traffic
Thuy et al. Bandwidth allocation based on declared UPC parameters in ATM networks
Müller Traffic Profiles and Performance Modelling of Heterogeneous Networks
Stevens Performance study of shared versus nonshared bandwidth on a packet-switched network

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): DE

AX Request for extension of the european patent

Free format text: AL;LT;LV;MK;RO;SI

17P Request for examination filed

Effective date: 20010113

17Q First examination report despatched

Effective date: 20010221

AKX Designation fees paid

Free format text: DE

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE

REF Corresponds to:

Ref document number: 69920893

Country of ref document: DE

Date of ref document: 20041111

Kind code of ref document: P

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20050707

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20170718

Year of fee payment: 19

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 69920893

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190201