GB2311689A - Bidding for bandwidth in a telecommunications system - Google Patents

Bidding for bandwidth in a telecommunications system Download PDF

Info

Publication number
GB2311689A
GB2311689A GB9706224A GB9706224A GB2311689A GB 2311689 A GB2311689 A GB 2311689A GB 9706224 A GB9706224 A GB 9706224A GB 9706224 A GB9706224 A GB 9706224A GB 2311689 A GB2311689 A GB 2311689A
Authority
GB
United Kingdom
Prior art keywords
bandwidth
link
traffic type
manager
bids
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
GB9706224A
Other versions
GB9706224D0 (en
GB2311689B (en
Inventor
Ian Gerard Maffett
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.)
GPT Ltd
Plessey Telecommunications Ltd
Original Assignee
GPT Ltd
Plessey Telecommunications Ltd
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 GPT Ltd, Plessey Telecommunications Ltd filed Critical GPT Ltd
Publication of GB9706224D0 publication Critical patent/GB9706224D0/en
Publication of GB2311689A publication Critical patent/GB2311689A/en
Application granted granted Critical
Publication of GB2311689B publication Critical patent/GB2311689B/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/30Peripheral units, e.g. input or output ports
    • H04L49/3081ATM peripheral units, e.g. policing, insertion or extraction
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q11/00Selecting arrangements for multiplex systems
    • H04Q11/04Selecting arrangements for multiplex systems for time-division multiplexing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q3/00Selecting arrangements
    • H04Q3/0016Arrangements providing connection between exchanges
    • H04Q3/0062Provisions for network management
    • H04Q3/0066Bandwidth allocation or management
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5625Operations, administration and maintenance [OAM]
    • H04L2012/5626Network management, e.g. Intelligent nets
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5629Admission control
    • H04L2012/5631Resource management and allocation
    • H04L2012/5632Bandwidth allocation
    • H04L2012/5634In-call negotiation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13138Least cost routing, LCR
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13141Hunting for free outlet, circuit or channel
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13148Maximum profit routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13174Data transmission, file transfer
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13196Connection circuit/link/trunk/junction, bridge, router, gateway
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13332Broadband, CATV, dynamic bandwidth allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13349Network management
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13384Inter-PBX traffic, PBX networks, e.g. corporate networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13395Permanent channel, leased line
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13514Indexing scheme relating to selecting arrangements in general and for multiplex systems quality of service - inc. grade of service
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13523Indexing scheme relating to selecting arrangements in general and for multiplex systems bandwidth management, e.g. capacity management
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13567Indexing scheme relating to selecting arrangements in general and for multiplex systems negotiation, management policy, goals

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Telephonic Communication Services (AREA)

Description

1 2311689 BANDWIDTH BIDDING A digital link between two switching nodes in
a network has a given amount of bandwidth. This bandwidth can be used by calls of different traffic types, e.g. voice, data, video. The type of traffic that can use a particular piece of bandwidth at a given point in time can be controlled in the switching nodes. In a narrowband network the bandwidth of the link is split into fixed size trunks (e.g. 64 or 56 kbit/s per trunk). The allocation of these trunks (or bandwidth in the general case) to traffic types is called bandwidth management.
The present invention covers a method for allocation of bandwidth to traffic types. The method takes into account a number of different criteria for each traffic type that wants to use a particular link, and also looks at the network as a whole to resolve network wide interactions. The method takes into account a number of different criteria for each traffic type that wants to use a particular link, and also looks at the network as a whole to resolve network wide interactions. The method is executed in a central is management system and the resulting bandwidth allocation is down- loaded to the switching nodes of the network. The nodes are responsible for containing calls of the different traffic types in their allocated bandwidth.
A Bandwidth Manager is intended to control the provision of network bandwidth (principally in a private network). It can be considered as an arbitrator between the network users (the traffic) and the network facilities (switches, leased lines, public 2 P/60727 network access). It is responsible for accepting requests (which are generally calls) and matching them to appropriate resources.
The most limited network resource is generally the bandwidth linking the sites.
This includes both leased lines (which are limited by availability) and public networks (use of which is limited by cost). Clearly, the availability of leased lines is ultimately limited by cost, but from the perspective of a single call they appear to be fixed size resources. Bandwidth management is also closely tied to routing since call routing determines which portions of bandwidths are used for calls. So management of routing is an essential component of bandwidth management.
According to the present invention there is provided in a telecommunications network having a bandwidth manager and a plurality of switching nodes and links there between, each link having defined bandwidth, the telecommunications network being is arranged to transmit one or more different traffic types between a pair of switching nodes and each link having a link manager and each traffic type having a traffic type manager there being a method of allocating bandwidth to different traffic wherein:
each traffic type manager produces bids for bandwidth for its traffic type 20according to a common algorithm for the network; each link manager reconciles the bids for its link and informs the traffic type managers of the allocated bandwidths; 3 P/60727 each traffic type manager can change its bids if the allocated bandwidth does not fit with the requirements of its calls; whereupon the bids are resubmitted and the link managers again reconcile the bids; this process continues until no further changes are made by the traffic manager; the link managers inform the switching nodes of the new bandwidth allocated to each traffic type on each link; the traffic type managers allocate their bandwidth to their individual calls (if required) and inform the calling terminals of their new bandwidth.
is The present invention wW now be described by way of example, with reference to the accompanying drawings, in which:
Figure 1 illustrates diagrammatically negotiation between traffic type managers and link managers; Figure 2 illustrates diagrammatically the process of bandwidth bidding; Figure 3 illustrates an example of the bid calculation function; and Figure 4 shows a system diagram.
4 P/60727 To see how bandwidth can be managed consider a single call. The system (i. e.
the bandwidth managed network) can accept the call request or reject it. If the request is accepted then a route must be found for it which has available bandwidth throughout its length. This continuous chain of bandwidth connects the source and the destination.
So the Bandwidth Manager's control can be expressed by accepting and rejecting calls and by selecting routes for calls which are accepted. In this way, the use of network bandwidth can be controlled.
Three reasons why the Bandwidth Manager might have to reject a call request are: the necessary bandwidth is not there, the call would be too expensive, or the call would block a more important impending call. So the bandwidth management system must deal with the amount of bandwidth available, the cost of calls and the reservation of bandwidth.
is At some level, control must be exercised over every call. However, requiring a management evaluation of each call would create a prohibitive load on the management system and increase call set-up times significantly and in most cases unacceptably so.
In addition, there is often very limited information available about each call, but all calls cannot be treated identically. For example, some calls may demand a high quality service (e.g. the Managing Director's calls) while some may not. One solution is to group calls together, according to their characteristics and requirements, into a small number of disjoint groups known as traffic types. So all of the normal voice calls might be grouped together as the traffic type "normal voice", all of these calls would receive P/60727 the same level of service. Important calls might be grouped together as--- highpriority voice", and given the best available service (with unrestricted public network access).
Other traffic types n-dght be created for FAX and modem traffic, LAN interconnection, video conferencing and voice mail. Each traffic type will have its own service profile, and traffic types can be added as new services are created.
In the context of traffic types the role of bandwidth management is clearer. For each traffic type the Bandwidth Manager should control the amount of bandwidth available and should control access to links and public networks (thereby controlling costs). Bandwidth reservation can also be handled for each traffic type by preventing calls from other traffic types using reserved bandwidth.
The different aspects of bandwidth management mentioned above (leased lines and public networks; bandwidth limiting and access control) can be combined in a system that manages bandwidth availability on every link. Bandwidth management on public network access allows public network utilisation to be controlled in the same way as leased line usage. Access control corresponds to a zero or non- zero bandwidth limit on a link.
Note that while a great deal of bandwidth management can be carried out on individual links, some aspects of bandwidth management must span the network. For example, every call that uses more than a single link creates an interdependence between the links it uses.
6 P/6071-7 Having considered the scope of bandwidth management as it affects a call, the network resources are considered to show how bandwidth management can be implemented. The implementation most suited to current switching technology is to divide the bandwidth on a link between the various traffic types. Each trunk may be allocated to a particular traffic type (or group of traffic types) so that each call is only allowed to use trunks allocated to its traffic type. In this description 'trunks' will be used as the basic unit of bandwidth, but in general any unit could be used e.g. 1 bitls, 1 Okbits/, 64 kbitIs.
Cost will be the main factor in limiting the allocated bandwidth when bandwidth is expensive and when the available bandwidth exceeds the likely usage. Much of the available bandwidth may remain unallocated and so unusable because of cost limitations.
Naturally, cost is more of a factor on public network access links than it is on leased lines where cost is unaffected by usage.
is The enforcing of bandwidth allocations depends on the network switches and protocols. In particular, the sharing of bandwidth between different traffic types (i.e.
allocating trunks to a set of traffic types) requires that every call's traffic type be explicitly identified in the call set-up information, and that the switch must be able to act on this information.
The problem of deciding bandwidth allocations can be divided along two dimensions - the links and the traffic types. Each link is attempting to reconcile 7 P/60727 potentially conflicting demands for bandwidth from each of the traffic types, while each traffic type has to co-ordinate bandwidth across the whole network in response to varying requirements. In practice this division is reflected in the implementation - each link is managed by a link-manager managed object, while each traffic type is handled by a traffip-type-manager managed object. Potentially, each traffic type could require bandwidth on every link, and so each link could be handling requests from every traffic type.
Decisions that involve mapping a set of alternatives to a single item are most naturally made from the perspective of the single item, by choosing from or combining the set of alternatives. In a link manager - traffic type manager system this means that the link manager decides bandwidth allocations. For each trunk the link manager chooses a traffic type (or set of traffic types) from those that are requesting bandwidth.
Conversely, the traffic type managers handle routing, which involves choosing a link (or set of links) to carry a call.
The traffic type managers must provide sufficient information for the link managers to choose between traffic types for each trunk. The final bandwidth allocations can then be returned to the traffic type managers. In addition, the link managers must provide predictions or guarantees of future bandwidth allocations to allow the traffic type managers to choose between links when routing calls.
As is illustrated in Figure 1, in the resulting system, each traffic type manager 8 P/60727 negotiates with each link manager to obtain bandwidth. The link managers decide the bandwidth allocations and notify the traffic type managers if the allocations change.
Negotiation for future bandwidth enables the traffic type managers to perform routing.
The traffic type managers calculate their requirements for bandwidth on each link according to a common algorithm which has been established for the network. This requirement is related to the calls of that traffic type which are using the link. The requirement is converted into a set of bids using the bid calculation function (see later) and submitted to the link manager. The reply from the link manager is the actual bandwidth for the traffic ". The traffic type manager must then allocate the given bandwidth to its calls.
A traffic type could consist of unmanaged calls such as voice telephone calls.
In this case, the traffic type manager cannot allocate the bandwidth to individual calls as it has no control over the calls. The bandwidth will be used by these calls on a first come, first served basis, and when the bandwidth is all used, calls will fail and have to use an alternative route. The bandwidth requirement may take into account the actual use of the bandwidth by calls by monitoring the statistics from the switching nodes of the actual usage of a link.
A traffic type could consist of managed calls. These are calls which are directly controlled by the management system, i.e. they can be set-up, cleared or their bandwidth can be increased or decreased. In this case, the traffic type manager must allocate the 9 P/60727 bandwidth for a particular link to the calls using that link. This may mean that the bandwidth of each call may be adjusted or it may mean that a call is cleared down if not enough bandwidth is available. This may change the bandwidth requirements on other links in the network that these calls use. The traffic type manager may then submit new bids. These new bids must comply with the stability requirements discussed later.
These decisions about bandwidth allocations and routing must be consistent with the management policy for the network. The management policy will generally include such things as minimum gide of service for each traffic type, cost constraints and normal handling of congestion and faults. The current management policy should be set explicitly in the link and traffic type managers. The messages exchanged between the link managers and the traffic type managers (i.e. the negotiation protocol) must include enough information to make policy-based decisions. This information will depend on (and determine) the range of policies that can be handled by the system. The form of this information will depend on the method chosen for deciding allocations.
The link managers determine the bandwidth allocations by "auctioning" bandwidth to the traffic type managers. Each traffic manager calculates a set of "bids" for the trunks on each link. These bids are determined using a standard bid-calculation function which is a component of the current management policy. The information passed from a traffic type manager to each link manager is the bids calculated for that link. The link managers allocate bandwidth to the highest bids (see figure 2). This allocation may be subject to other policy-defined constraints (although many constraints P/60727 can be incorporated into the bid calculation function).
This method of bidding for bandwidth is flexible, and could be used to implement a wide range of policies. The current policy can be changed simply by changing the bid-calculation function or its parameters. Consequently the link managers and the negotiation protocol are unaffected by policy changes or extensions to the policy model.
The actual values of bids must reflect the management policy. For example, bids will depend on whether this will improve the quality of service, whether it will be expensive, whether the call is pre-booked, the importance of the traffic, and other factors as well. In terms of the whole system, a bid is an estimate of the overall benefit (in accordance with current policy) of allocating a trunk on a particular link to a particular traffic type.
is A useful simple bid calculation is:
Bid = Bn = C/n i.e. each bid is inversely proportional to the current number of trunks, n. If a number of traffic types compete for bandwidth using this bid calculation function then the number of trunks allocated to each will be proportional to a value C. According to the policy used, C may be related to, for example, each traffic type's relative importance and the number of trunks it requires. These bids can be modified to implement a number 1 P/60727 of other policies, some examples are given below.
Advance booking can be integrated into the bidding system by modifying the bids for pre-booked calls according to another policy defined function. For example, the bids could be scaled by a fixed factor, where the scaling factor represents the importance given to booking calls (large values for greater importance, unity when advance booking is completely ignored).
As shown in Figure 3, a minimum allocation for each traffic type can be achieved by increasing the bids for the minimum number of trunks according to another policy defined function.
One approach to limiting call costs is to set a "reserve price" on each link, related to the expense of using bandwidth on that link. Bandwidth is then allocated only to bids is higher than the reserve price and only bandwidth diat is sufficiently "useful" is allocated.
This approach would be suitable for high bandwidth networks, such as ATMbased networks.
It must be noted diat a negotiation based system can be unstable since there is an element of feedback (i.e. it can oscillate). This potential for instability can he tackled in one of two ways: the negotiation can be constrained to prevent oscillation, or the feedback can be delayed to limit the possible range of oscillations (and prevent demanding high frequency oscillations).
12 P/60727 Where the bidding process is constrained to prevent oscillation, negotiation may be restricted in various ways. Firstly, bids for successive trunks on a link cannot increase, i.e.
Bn+l ≤Bn 5 for every set of bids. This prevents dependence on the previous state of the system, avoiding abrupt lurches between alternative stable states. Also, having smaller bids for higher allocations provides natural damping in the bidding process.
Other constraints affect the way in which traffic type managers can adjust their bids in response to changes in bandwidth. If a traffic type's allocation is increased then the traffic type manager may increase its bids (on any links), but it may not decrease them, i.e.
B', ≥B, is where S, is the bid after an increase in aflocation. And if a traffic type's allocation is decreased then the traffic type manager may decrease its bids (on any links), but it may not increase them, i.e.
W, ≤Bn where 11% is the bid after a decrease in allocation. These two rules would ensure that there is no feedback between changing allocations and changing bids, which could cause oscillations.
The system can work in two ways:
13 P/60727 1. the traffic type manager can submit a set of bids to the link manager, which replies with the actual bandwidth. The traffic type manager can change and resubmit its bids. The system iterates until there are no changes. The link manager then informs the switching nodes of the new bandwidth allocated to each traffic type on the link and the traffic type manager allocates the given bandwidth to the calls.
2. the traffic type manager submits a set of what-if bids to the link manager, which replies with the actual bandwidth that would be available for that traffic type with that set of bids. The system iterates as above until no changes are made. However the link manager does not inform the switching nodes of this bandwidth allocation and the traffic type manager does not allocate this bandwidth. The traffic type manager uses this method to query what would happen. This can be useful for a user who is might be interested to know how much bandwidth could be obtained for a particular call.
To actually allocate the bandwidth, the traffic type manager would have to resubmit the bids as in 1 above and would get the same reply if nothing else had changed in the network.
Figure 4 shows how the bandwidth bidding system fits into a system. Call requests are examined to determine which traffic type they belong to and are forwarded 14 P/60727 to that traffic type manager. The traffic type manager consults the network router to find paths through the network from the source to the destination of the call. These paths are lists of link through which the call could be set-up. The traffic type manager then bids for appropriate bandwidth on the links concerned by sending bids to the link managers. The link managers will resolve the bids and return the bandwidth allocated to each traffic type. The traffic type managers may iterate with new bids. Once the system is stable, the link managers will inform the network switches of the bandwidth allocated to each traffic type on each link, and the traffic type managers will allocate bandwidth between its calls and inform the call request of its success or failure.
P/60727

Claims (4)

1. A telecommunications network having a bandwidth manager and a plurality of switching nodes and links there-between, each link having defined bandwidth, the telecommunications network being arranged to transmit one or more different traffic types between a pair of switching nodes and each link having a link manager and each traffic type having a traffic type manager there being a method of allocating bandwidth to different traffic wherein:
each traffic type manager produces bids for bandwidth for its traffic type according to a common algorithm for the network; each link manager reconciles the bids for its link and informs the traffic type managers of the allocated bandwidths; each traffic type manager can change its bids if the allocated bandwidth does not fit with the requirements of its calls; whereupon the bids are resubmitted and the link managers again reconcile the bids; this process continues until no further changes are made by the traffic manager; 16 P/60721 7 the link managers inform the switching nodes of the new bandwidth allocated to each traffic type on each link; the traffic type managers allocate their bandwidth to their individual calls (if required) and inform the calling terminals of their new bandwidth.
2. A method as claimed in Claim 1 including provision for submitting "what if 'bids which provide an indication of the bandwidth allocation which would result, without allocating the bandwidths. 10
3. A method as claimed in Claim 1 or 2 including means for changing the common algorithm.
4. A method as claimed in Claim 1 and substantially as hereinbefore described. 15
GB9706224A 1996-03-29 1997-03-26 Bandwidth bidding Expired - Fee Related GB2311689B (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
GBGB9606708.7A GB9606708D0 (en) 1996-03-29 1996-03-29 Bandwidth bidding

Publications (3)

Publication Number Publication Date
GB9706224D0 GB9706224D0 (en) 1997-05-14
GB2311689A true GB2311689A (en) 1997-10-01
GB2311689B GB2311689B (en) 2000-03-08

Family

ID=10791312

Family Applications (2)

Application Number Title Priority Date Filing Date
GBGB9606708.7A Pending GB9606708D0 (en) 1996-03-29 1996-03-29 Bandwidth bidding
GB9706224A Expired - Fee Related GB2311689B (en) 1996-03-29 1997-03-26 Bandwidth bidding

Family Applications Before (1)

Application Number Title Priority Date Filing Date
GBGB9606708.7A Pending GB9606708D0 (en) 1996-03-29 1996-03-29 Bandwidth bidding

Country Status (4)

Country Link
EP (1) EP0798898B1 (en)
DE (1) DE69736371T2 (en)
ES (1) ES2267120T3 (en)
GB (2) GB9606708D0 (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2322514A (en) * 1997-02-21 1998-08-26 Northern Telecom Ltd Telecommunications system
GB2338144A (en) * 1998-04-22 1999-12-08 Northern Telecom Ltd Predictive capacity management
GB2343583A (en) * 1998-11-09 2000-05-10 Mitel Corp Multi-agent system
GB2353915A (en) * 1999-07-09 2001-03-07 Mitel Corp Allocating services amongst bidding entitites

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1010334B1 (en) * 1997-08-28 2005-09-21 Siemens Aktiengesellschaft Method for negotiating service quality parameters in an intelligent network
DE102007001519B4 (en) * 2007-01-10 2015-08-20 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Concept for allocating data rates to information signal providers in a network
US8090835B1 (en) 2011-08-31 2012-01-03 magnify360, Inc. Optimizing website traffic among content sources

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5029164A (en) * 1990-04-13 1991-07-02 Digital Equipment Corporation Congestion avoidance in high-speed network carrying bursty traffic
EP0596624A2 (en) * 1992-10-29 1994-05-11 AT&T Corp. Bandwidth allocation, transmission scheduling, and congestion avoidance in broadband asynchronous transfer mode networks
GB2272820A (en) * 1992-11-14 1994-05-25 Roke Manor Research Improvements in or relating to asynchronous transfer mode communication systems
EP0648062A2 (en) * 1993-09-08 1995-04-12 AT&T Corp. Method for adaptive control of windows and rates in networks
US5533009A (en) * 1995-02-03 1996-07-02 Bell Communications Research, Inc. Bandwidth management and access control for an ATM network

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2038646C (en) * 1990-03-20 1995-02-07 Katsumi Oomuro Atm communication system with optimal traffic control by changing the allocated bandwidth
SE9402059D0 (en) * 1994-06-13 1994-06-13 Ellemtel Utvecklings Ab Methods and apparatus for telecommunications

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5029164A (en) * 1990-04-13 1991-07-02 Digital Equipment Corporation Congestion avoidance in high-speed network carrying bursty traffic
EP0596624A2 (en) * 1992-10-29 1994-05-11 AT&T Corp. Bandwidth allocation, transmission scheduling, and congestion avoidance in broadband asynchronous transfer mode networks
GB2272820A (en) * 1992-11-14 1994-05-25 Roke Manor Research Improvements in or relating to asynchronous transfer mode communication systems
EP0648062A2 (en) * 1993-09-08 1995-04-12 AT&T Corp. Method for adaptive control of windows and rates in networks
US5533009A (en) * 1995-02-03 1996-07-02 Bell Communications Research, Inc. Bandwidth management and access control for an ATM network

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2322514A (en) * 1997-02-21 1998-08-26 Northern Telecom Ltd Telecommunications system
GB2338144A (en) * 1998-04-22 1999-12-08 Northern Telecom Ltd Predictive capacity management
GB2343583A (en) * 1998-11-09 2000-05-10 Mitel Corp Multi-agent system
US6687682B1 (en) 1998-11-09 2004-02-03 Mitel Corporation System for discounting in a bidding process based on quality of service
GB2343583B (en) * 1998-11-09 2004-05-05 Mitel Corp System for discounting in a bidding process based on quality of service
GB2353915A (en) * 1999-07-09 2001-03-07 Mitel Corp Allocating services amongst bidding entitites
GB2353915B (en) * 1999-07-09 2001-12-12 Mitel Corp Mechanism for the sharing of guaranteed resouces
US7330832B1 (en) 1999-07-09 2008-02-12 Mitel Networks Corporation Mechanism for sharing of guaranteed resources

Also Published As

Publication number Publication date
DE69736371T2 (en) 2007-08-09
DE69736371D1 (en) 2006-09-07
GB9606708D0 (en) 1996-06-05
EP0798898A2 (en) 1997-10-01
EP0798898B1 (en) 2006-07-26
ES2267120T3 (en) 2007-03-01
GB9706224D0 (en) 1997-05-14
GB2311689B (en) 2000-03-08
EP0798898A3 (en) 1999-02-17

Similar Documents

Publication Publication Date Title
CA2139111C (en) System and method for call-by-call source routing with rule-based fallbacks
US6262974B1 (en) Method and system for non disruptively assigning link bandwidth to a user in a high speed digital network
US6011804A (en) Dynamic bandwidth reservation for control traffic in high speed packet switching networks
Murphy et al. Distributed pricing for embedded ATM networks
AU692810B2 (en) Communications network management
US5940372A (en) Method and system for selecting path according to reserved and not reserved connections in a high speed packet switching network
US6842463B1 (en) Automated and adaptive management of bandwidth capacity in telecommunications networks
CA2314944C (en) Multicommodity flow method for designing traffic distribution on a multiple-service packetized network
EP0714192A1 (en) Method for preempting connections in high speed packet switching networks
JPH10504426A (en) Method and apparatus for allocating physical network resources
EP0798898B1 (en) Bandwidth bidding
EP1455488B1 (en) System and method for providing differentiated services
EP0904647B1 (en) Atm network management
EP0901656A1 (en) Apparatus and method for preventing network server overload
EP1008274B1 (en) Method of management in a circuit-switched communication network and device which can be used as a node in a circuit-switched communication network
Lai Traffic engineering for MPLS
JP3432385B2 (en) A method for sharing network resources by virtual partitioning
CA2403781A1 (en) Method and arrangement for checking the permissibility of a use of a service
EP1351452A1 (en) Network capacity management system
KR100372590B1 (en) Method for allocating link capacity in virtual private networks
Kihl et al. Load balancing strategies for TINA networks
Deng Flexible access control in broadband communication networks
Aalto et al. Architectural issues of ATM based connectionless overlay network
Kim et al. QoS guaranteed routing in wide area networks
Ghinea et al. QoS management of a cost-effective ATM protocol for distributed multimedia

Legal Events

Date Code Title Description
732E Amendments to the register in respect of changes of name or changes affecting rights (sect. 32/1977)
732E Amendments to the register in respect of changes of name or changes affecting rights (sect. 32/1977)
PCNP Patent ceased through non-payment of renewal fee

Effective date: 20100326