CA2364707A1 - Method for determining a communication path in a communication network between two neighboring network nodes - Google Patents
Method for determining a communication path in a communication network between two neighboring network nodes Download PDFInfo
- Publication number
- CA2364707A1 CA2364707A1 CA002364707A CA2364707A CA2364707A1 CA 2364707 A1 CA2364707 A1 CA 2364707A1 CA 002364707 A CA002364707 A CA 002364707A CA 2364707 A CA2364707 A CA 2364707A CA 2364707 A1 CA2364707 A1 CA 2364707A1
- Authority
- CA
- Canada
- Prior art keywords
- connection
- bit rate
- trunk
- trunks
- transmission capacity
- 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.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/64—Distributing or queueing
- H04Q3/66—Traffic distributors
-
- 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
- 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/5619—Network Node Interface, e.g. tandem connections, transit switching
- H04L2012/562—Routing
-
- 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
-
- 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/5651—Priority, marking, classes
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
In order to authorize a connection between two neighboring network nodes (N1 , N4) in a connecting line bundle (TG) consisting of several connecting lines, a search algorithm determines on which of the connecting lines (T1,..., Tn) ca n the connection still be established. To this end, said new connection is initially classified. In accordance with said classification, different sear ch cycles are executed to detect a connection line with sufficient free residua l transmission capacity. The connection is rejected in case of an unsuccessful search.
Description
~
< GR 99 P 1266 Description Method for determining a connection path in a communications network between two adjacent network nodes.
The invention relates to a method according to the preamble to claim 1.
Current communications networks have a plurality of network nodes which are intermeshed via connection paths. These are formed from a plurality of trunks which are combined to form trunk groups.
In current communications networks, different traffic combinations are routed via the connection paths arranged between two or more network nodes. Thus, for example, information can be transmitted by means of a synchronous (STM) or an asynchronous (ATM) transfer mode. The information may have different bandwidths..
Thus, information which is transmitted in the form of narrowband signals is normally distinguished from information which is transmitted in the form of wideband or broadband signals. Special significance is therefore attached to the connection set-up between two.
adjacent nodes, i.e. network nodes interconnected via a trunk group.
Two decisions generally need to be made when a connection is set up in order to determine a connection path between two adjacent network nodes. On the one hand, it must be decided which of the trunks of the trunk group which connects the network node in question still has adequate free capacity in order to set up a connection.
' CA 02364707 2001-08-21 - la -On the other hand, one of the connection paths which is conceivable in terms of available capacity must be selected in such a way that °
' - 2 -optimum grade of service is achieved. This is necessary insofar as the selected connection path is intended to ensure minimal blocking probability and associated low connection loss probability for subsequent connections.
A method with which these two tasks (search and selection) can be performed is referred to as a hunting strategy.
A hunting strategy of this type is known from the document entitled "Probability of Loss of Data Traffics with different Bit Rates Hunting One Common PCM
Channel, Proceedings of the 8th International Teletraffic Congress (ITC 8), 1976, pp. 525.1 -525.8, Lothar Katzschner, and Reinhard Scheller".
According to this document, a sequential search of all relevant trunks is carried out. An attempt is made here to determine the "smallest gap", which can still accommodate the new connection. The search process is started with the first trunk in the trunk group and is continued step-by-step until all trunks are checked. On the one hand, the transmission capacity which is still freely available on the trunk in relation to the peak bit rate of the connection which is to be accommodated is used as the selection criterion. An investigation is carried out to ascertain whether the transmission capacity which is still freely available is equal to or greater than the peak bit rate of this connection. In practice, a plurality of trunks may satisfy this criterion. On the other hand, the trunk on which the least residual transmission capacity remains on acceptance of the new connection is then determined.
The new connection is accepted on this trunk. If no adequate free transmission capacity is found, the connection concerned is rejected.
' CA 02364707 2001-08-21 ' - 3 -This known method was developed in particular for a homogeneous traffic characteristic, where each connection set-up began with the same capacity requirement of 64 kbit/s per connection. However, this traffic homogeneity on connection set-up is often no longer available in current communications networks.
Along with conventional 64 kbit/s narrowband connections, n x 64 kbit/s wideband connections, for example, occur (in the case of STM-based, connection-oriented, multiple-rate services), or even broadband connections with any given bit rate granularity in the case of ATM traffic.
However, this creates completely new requirements for the connection set-up. Thus, the traffic performance capability must equally be as high and robust as possible with minimal reciprocal interference for all traffic types. In the case of ATM traffic, this results in the requirement for load distribution which is as even as possible over all trunks of a trunk group.
Otherwise, connections on trunks with high utilization would suffer a greater delay period in the associated queues than on trunks with lower utilization.
The disadvantage of the known hunting strategy method is that, with high utilization of the trunk group, in the event of a connection request for a high bit rate connection, it may no longer be possible in some cases to accept this connection, since, although many gaps are available, none of them is large enough.
Furthermore, in particular in the case of low utilization of the trunk group, uneven load distribution ("unbalanced load") results.
The object of the invention is to indicate a way in which connection paths can be determined in a - 3a -communications network, even with non-homogeneous traffic.
The object is achieved on the basis of the features indicated in the preamble to claim 1 by means of the features indicated in the characterizing part.
A particularly advantageous feature of the invention is the provision of a new hunting strategy. The search to identify the largest gaps for high bit rate connections produces excellent results in terms of blocking probability and load distribution. The search to find the smallest suitable gap used in the state of the art is thus clearly surpassed.
Advantageous further developments of the invention are indicated in subclaim 2.
The invention is explained in detail below with reference to an embodiment shown in the drawing, in which:
Fig 1 shows the configuration on which the method according to the invention is carried out;
Fig 2 shows the search algorithm according to the invention.
Fig 1 shows a communications network. For the sake of simplicity, only 4 network nodes N1..N4 are indicated.
Two network nodes, for example network nodes N1, N4 are interconnected via a trunk group TG. A plurality of trunks T1...Tn are disposed in the trunk group TG. Each of the trunks T1...Tn has a specified transmission capacity C9 as the physical transmission parameter. The residual transmission capacity Cr (Ti) (i=l...n) which is freely available for further connections is derived from the physical transmission capacity Ca minus the sum _ 5 _ of the peak bit rates Rp~ of the m connections (j=1, 2..., m) instantaneously carried thereover .
It is assumed below that a connection V is to be set up from the network node N1 to the network node N4. The corresponding relationships are illustrated in fig. 2.
Accordingly, a classification of the connections into highest bit rates and non-highest bit rate connections HBR, N-HBR is initially carried out. The criterion determining which connections are to be regarded as having the highest bit rate, is, for example, prescribed by the corresponding service. The trunks T1...Tn are then subsequently examined to ascertain whether the new connection V can be accommodated. A
different hunting strategy is adopted according to the association of the connection V with the classes HBR, N-HBR.
The hunting strategy is generally started with the first trunk T1 of the trunk group TG and always. ends with the last trunk Tn, for highest bit rate connections after one search cycle, and for non-highest bit rate connections after one or two search cycles.
A highest bit rate connection V associated with class HBR is accepted on one of the trunks Tl...Tn if the free residual transmission capacity of the latter most exceeds the peak bit rate of the connection. The new connection V is thus sorted into the "largest gap" . As shown in fig ~2, two criteria are thus required for sorting. On the one hand, the freely available residual transmission capacity of the trunk T;, currently being examined must be equal to or greater than the peak bit rate of the new connection V. On the other hand, the - 5a -free residual transmission capacity must most exceed the peak bit rate of the new connection V. To do this, a variable Cr Letzt Optimum is introduced, in which the greatest currently determined value is always recorded.
For the highest bit rate connections of the class HBR, the search always ends accordingly after one search cycle.
If the new connection V is a non-highest bit rate connection which is allocated to the class N-HBR, it, is accepted on one of the trunks T1...Tn if the free residual transmission capacity of the latter, following subtraction of a largest possible multiple of the peak bit rate Rp(HBR) of highest bit rate connections ("ensuring the largest gaps for high bit rate connections"), least exceeds the peak bit rate of the connection V. The new connection V is thus sorted into the "smallest gap following subtraction of the largest possible reservation budget for connections of the class HBR". As shown in fig. 2, two criteria are thus required for sorting. On the one hand; the remainder from modulo-division of the freely available residual transmission capacity of the currently examined trunk Ti by the peak bit rate of highest bit rate connections must be equal to or greater than the peak bit rate of the new connect ion V . On the other hand, the remainder from modulo-division of the free residual transmission capacity by the peak bit rate of highest bit rate connections must least exceed the peak bit rate of the new connection V. To do this, a variable Cr Letzt Optimum is introduced here also, in which the lowest currently determined value is always recorded.
If the search according to the aforementioned criteria is successful, the search ends after one search cycle for non-highest bit rate' connections of the class N-HBR.
If the new connection V cannot be sorted on any of the trunks, a second search cycle is started. The connection V is then - without taking into account a reservation budget for connections of the class HBR -- 6a -accepted on one of the trunks Tl...Tn if the free residual transmission capacity of the latter least exceeds the peak bit rate of the connection. The new connection V
is thus sorted into the "smallest gap". As shown in Fig. 2, two criteria are required for sorting. On the one hand, the freely available residual transmission capacity of the currently examined trunk Ti must be equal to or greater than the peak bit rate of the new connection V. On the other hand, the free residual transmission capacity must least exceed the peak bit rate of the new connection V. To do this, the lowest currently determined value is always recorded in the variable Cr Letzt Optimum. For non-highest bit rate connections of the class N-HBR, the search ends accordingly after this second search cycle at the latest.
The current embodiment has referred to connections in general. This may involve connections of any given type: Thus, connections which transmit information according to a synchronous transfer method (STM) can be set up using the method according to the invention as well as connections which transmit information according to an asynchronous transfer mode (ATM).
< GR 99 P 1266 Description Method for determining a connection path in a communications network between two adjacent network nodes.
The invention relates to a method according to the preamble to claim 1.
Current communications networks have a plurality of network nodes which are intermeshed via connection paths. These are formed from a plurality of trunks which are combined to form trunk groups.
In current communications networks, different traffic combinations are routed via the connection paths arranged between two or more network nodes. Thus, for example, information can be transmitted by means of a synchronous (STM) or an asynchronous (ATM) transfer mode. The information may have different bandwidths..
Thus, information which is transmitted in the form of narrowband signals is normally distinguished from information which is transmitted in the form of wideband or broadband signals. Special significance is therefore attached to the connection set-up between two.
adjacent nodes, i.e. network nodes interconnected via a trunk group.
Two decisions generally need to be made when a connection is set up in order to determine a connection path between two adjacent network nodes. On the one hand, it must be decided which of the trunks of the trunk group which connects the network node in question still has adequate free capacity in order to set up a connection.
' CA 02364707 2001-08-21 - la -On the other hand, one of the connection paths which is conceivable in terms of available capacity must be selected in such a way that °
' - 2 -optimum grade of service is achieved. This is necessary insofar as the selected connection path is intended to ensure minimal blocking probability and associated low connection loss probability for subsequent connections.
A method with which these two tasks (search and selection) can be performed is referred to as a hunting strategy.
A hunting strategy of this type is known from the document entitled "Probability of Loss of Data Traffics with different Bit Rates Hunting One Common PCM
Channel, Proceedings of the 8th International Teletraffic Congress (ITC 8), 1976, pp. 525.1 -525.8, Lothar Katzschner, and Reinhard Scheller".
According to this document, a sequential search of all relevant trunks is carried out. An attempt is made here to determine the "smallest gap", which can still accommodate the new connection. The search process is started with the first trunk in the trunk group and is continued step-by-step until all trunks are checked. On the one hand, the transmission capacity which is still freely available on the trunk in relation to the peak bit rate of the connection which is to be accommodated is used as the selection criterion. An investigation is carried out to ascertain whether the transmission capacity which is still freely available is equal to or greater than the peak bit rate of this connection. In practice, a plurality of trunks may satisfy this criterion. On the other hand, the trunk on which the least residual transmission capacity remains on acceptance of the new connection is then determined.
The new connection is accepted on this trunk. If no adequate free transmission capacity is found, the connection concerned is rejected.
' CA 02364707 2001-08-21 ' - 3 -This known method was developed in particular for a homogeneous traffic characteristic, where each connection set-up began with the same capacity requirement of 64 kbit/s per connection. However, this traffic homogeneity on connection set-up is often no longer available in current communications networks.
Along with conventional 64 kbit/s narrowband connections, n x 64 kbit/s wideband connections, for example, occur (in the case of STM-based, connection-oriented, multiple-rate services), or even broadband connections with any given bit rate granularity in the case of ATM traffic.
However, this creates completely new requirements for the connection set-up. Thus, the traffic performance capability must equally be as high and robust as possible with minimal reciprocal interference for all traffic types. In the case of ATM traffic, this results in the requirement for load distribution which is as even as possible over all trunks of a trunk group.
Otherwise, connections on trunks with high utilization would suffer a greater delay period in the associated queues than on trunks with lower utilization.
The disadvantage of the known hunting strategy method is that, with high utilization of the trunk group, in the event of a connection request for a high bit rate connection, it may no longer be possible in some cases to accept this connection, since, although many gaps are available, none of them is large enough.
Furthermore, in particular in the case of low utilization of the trunk group, uneven load distribution ("unbalanced load") results.
The object of the invention is to indicate a way in which connection paths can be determined in a - 3a -communications network, even with non-homogeneous traffic.
The object is achieved on the basis of the features indicated in the preamble to claim 1 by means of the features indicated in the characterizing part.
A particularly advantageous feature of the invention is the provision of a new hunting strategy. The search to identify the largest gaps for high bit rate connections produces excellent results in terms of blocking probability and load distribution. The search to find the smallest suitable gap used in the state of the art is thus clearly surpassed.
Advantageous further developments of the invention are indicated in subclaim 2.
The invention is explained in detail below with reference to an embodiment shown in the drawing, in which:
Fig 1 shows the configuration on which the method according to the invention is carried out;
Fig 2 shows the search algorithm according to the invention.
Fig 1 shows a communications network. For the sake of simplicity, only 4 network nodes N1..N4 are indicated.
Two network nodes, for example network nodes N1, N4 are interconnected via a trunk group TG. A plurality of trunks T1...Tn are disposed in the trunk group TG. Each of the trunks T1...Tn has a specified transmission capacity C9 as the physical transmission parameter. The residual transmission capacity Cr (Ti) (i=l...n) which is freely available for further connections is derived from the physical transmission capacity Ca minus the sum _ 5 _ of the peak bit rates Rp~ of the m connections (j=1, 2..., m) instantaneously carried thereover .
It is assumed below that a connection V is to be set up from the network node N1 to the network node N4. The corresponding relationships are illustrated in fig. 2.
Accordingly, a classification of the connections into highest bit rates and non-highest bit rate connections HBR, N-HBR is initially carried out. The criterion determining which connections are to be regarded as having the highest bit rate, is, for example, prescribed by the corresponding service. The trunks T1...Tn are then subsequently examined to ascertain whether the new connection V can be accommodated. A
different hunting strategy is adopted according to the association of the connection V with the classes HBR, N-HBR.
The hunting strategy is generally started with the first trunk T1 of the trunk group TG and always. ends with the last trunk Tn, for highest bit rate connections after one search cycle, and for non-highest bit rate connections after one or two search cycles.
A highest bit rate connection V associated with class HBR is accepted on one of the trunks Tl...Tn if the free residual transmission capacity of the latter most exceeds the peak bit rate of the connection. The new connection V is thus sorted into the "largest gap" . As shown in fig ~2, two criteria are thus required for sorting. On the one hand, the freely available residual transmission capacity of the trunk T;, currently being examined must be equal to or greater than the peak bit rate of the new connection V. On the other hand, the - 5a -free residual transmission capacity must most exceed the peak bit rate of the new connection V. To do this, a variable Cr Letzt Optimum is introduced, in which the greatest currently determined value is always recorded.
For the highest bit rate connections of the class HBR, the search always ends accordingly after one search cycle.
If the new connection V is a non-highest bit rate connection which is allocated to the class N-HBR, it, is accepted on one of the trunks T1...Tn if the free residual transmission capacity of the latter, following subtraction of a largest possible multiple of the peak bit rate Rp(HBR) of highest bit rate connections ("ensuring the largest gaps for high bit rate connections"), least exceeds the peak bit rate of the connection V. The new connection V is thus sorted into the "smallest gap following subtraction of the largest possible reservation budget for connections of the class HBR". As shown in fig. 2, two criteria are thus required for sorting. On the one hand; the remainder from modulo-division of the freely available residual transmission capacity of the currently examined trunk Ti by the peak bit rate of highest bit rate connections must be equal to or greater than the peak bit rate of the new connect ion V . On the other hand, the remainder from modulo-division of the free residual transmission capacity by the peak bit rate of highest bit rate connections must least exceed the peak bit rate of the new connection V. To do this, a variable Cr Letzt Optimum is introduced here also, in which the lowest currently determined value is always recorded.
If the search according to the aforementioned criteria is successful, the search ends after one search cycle for non-highest bit rate' connections of the class N-HBR.
If the new connection V cannot be sorted on any of the trunks, a second search cycle is started. The connection V is then - without taking into account a reservation budget for connections of the class HBR -- 6a -accepted on one of the trunks Tl...Tn if the free residual transmission capacity of the latter least exceeds the peak bit rate of the connection. The new connection V
is thus sorted into the "smallest gap". As shown in Fig. 2, two criteria are required for sorting. On the one hand, the freely available residual transmission capacity of the currently examined trunk Ti must be equal to or greater than the peak bit rate of the new connection V. On the other hand, the free residual transmission capacity must least exceed the peak bit rate of the new connection V. To do this, the lowest currently determined value is always recorded in the variable Cr Letzt Optimum. For non-highest bit rate connections of the class N-HBR, the search ends accordingly after this second search cycle at the latest.
The current embodiment has referred to connections in general. This may involve connections of any given type: Thus, connections which transmit information according to a synchronous transfer method (STM) can be set up using the method according to the invention as well as connections which transmit information according to an asynchronous transfer mode (ATM).
Claims (2)
1. A method for determining a connection path in a communications network, with a plurality of connections which are in each case routed via a further plurality of trunks (T1...Tn) between two adjacent network nodes (N1..N4), and which reserve transmission capacities (R pj) on these trunks (T1...Tn), and with at least one further connection (V), which is also to be accommodated on one of these trunks (T1...Tn) in that a search algorithm determines the trunk (T1...Tn) on which, on the basis of an acceptance criterion, this connection (V) can still be accommodated, characterized in that a classification of the (at least one) further connection (V) into two classes (HHR, N-HBR) is carried out, a check is carried out in the event of association with one class (HBR) to ascertain whether the freely available residual transmission capacity C r(T i) of the currently investigated trunk (T i) is equal to or greater than the peak bit rate of the (at least one) further connection (V) and, in this case, the trunk whose free residual transmission capacity most exceeds the peak bit rate of this connection (V) is selected from the trunks determined in this way, and in the event of association with the remaining class (N-HBR), a check is carried out to ascertain whether the remainder from modulo-division of the freely available residual transmission capacity C r(T i) of the currently investigated trunk (T i) by the peak bit rate (R p(HBR)) of highest bit rate connections is equal to or greater than the peak bit rate of the (at least one) further connection (V) and, in this case, the trunk whose remainder from modulo-division of the free -8a-residual transmission capacity by the peak bit rate of highest bit rate connections least exceeds the peak bit rate of this connection (V) is selected from the trunks determined in this way, or otherwise a further search cycle is started to check whether the freely available residual transmission capacity (C r(T i)) of the currently investigated trunk (T i) is equal to or greater than the peak bit rate of the (at least one) further connection (V) and, in this case, the trunk whose free residual transmission capacity least exceeds the peak bit rate of this connection (V) is selected from the trunks determined in this way.
2. The method according to claim 1, characterized in that a search cycle of the hunting strategy is started with the first trunks (T l) of the trunk group (TG), is applied to all trunks (T l...T n) and ends with the last trunk (T n).
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| DE19907923.4 | 1999-02-24 | ||
| DE1999107923 DE19907923C2 (en) | 1999-02-24 | 1999-02-24 | Method for determining a connection path in a communication network between two neighboring network nodes |
| PCT/DE2000/000315 WO2000051396A1 (en) | 1999-02-24 | 2000-02-02 | Method for determining a communication path in a communication network between two neighboring network nodes |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2364707A1 true CA2364707A1 (en) | 2000-08-31 |
Family
ID=7898674
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002364707A Abandoned CA2364707A1 (en) | 1999-02-24 | 2000-02-02 | Method for determining a communication path in a communication network between two neighboring network nodes |
Country Status (4)
| Country | Link |
|---|---|
| EP (1) | EP1157586A1 (en) |
| CA (1) | CA2364707A1 (en) |
| DE (1) | DE19907923C2 (en) |
| WO (1) | WO2000051396A1 (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1541394B1 (en) | 2003-12-10 | 2009-03-04 | Delphi Technologies, Inc. | Coupling system for a stabilizer bar of a motor vehicle |
| DE602004011472T2 (en) | 2004-04-07 | 2009-01-15 | Delphi Technologies, Inc., Troy | Ball rotary drive for a stabilizer of a wheeled vehicle |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| ATE127988T1 (en) * | 1990-03-23 | 1995-09-15 | Siemens Ag | METHOD FOR SETTING UP VIRTUAL CONNECTIONS IN EXCHANGE FACILITIES WORKING IN AN ASYNCHRONOUS TRANSFER MODE. |
| DE59107658D1 (en) * | 1991-07-19 | 1996-05-09 | Siemens Ag | Method and circuit arrangement for setting up virtual connections via an ATM trunk group |
| US5781624A (en) * | 1996-02-16 | 1998-07-14 | Lucent Technologies Inc. | Method for sharing network resources by virtual partitioning |
-
1999
- 1999-02-24 DE DE1999107923 patent/DE19907923C2/en not_active Expired - Fee Related
-
2000
- 2000-02-02 WO PCT/DE2000/000315 patent/WO2000051396A1/en not_active Application Discontinuation
- 2000-02-02 CA CA002364707A patent/CA2364707A1/en not_active Abandoned
- 2000-02-02 EP EP00912338A patent/EP1157586A1/en not_active Withdrawn
Also Published As
| Publication number | Publication date |
|---|---|
| WO2000051396A1 (en) | 2000-08-31 |
| DE19907923C2 (en) | 2001-03-22 |
| EP1157586A1 (en) | 2001-11-28 |
| DE19907923A1 (en) | 2000-11-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5600638A (en) | Method and system for improving the processing time of the path selection in a high speed packet switching network | |
| EP0777362B1 (en) | A method of admission control and routing of virtual circuits | |
| US6690671B1 (en) | Load balanced UBR routing in ATM networks | |
| CA2299111A1 (en) | Adaptive routing system and method for qos packet networks | |
| Hwang et al. | MDP routing in ATM networks using virtual path concept | |
| EP0897232B1 (en) | Traffic management in packet communication networks having service priorities and employing effective bandwidths | |
| EP0814583A2 (en) | Method and system for minimizing the connection set up time in high speed packet switching networks | |
| US6356530B1 (en) | Next hop selection in ATM networks | |
| CA2364707A1 (en) | Method for determining a communication path in a communication network between two neighboring network nodes | |
| Meempat et al. | Optimal channel allocation policies for access control of circuit-switched traffic in ISDN environments | |
| Arulambalam et al. | An intelligent explicit rate control algorithm for ABR service in ATM networks | |
| JPH02260956A (en) | Real time net route assignment | |
| CA2371930A1 (en) | Method for determining a communication path in a communication network between two neighboring network nodes | |
| KR100271524B1 (en) | Multi-stage congestion control method | |
| Xiong et al. | On state-independent and state-dependent path restoration in self-healing networks | |
| Widjaja | Random access for ATM LANs and WANs | |
| Chu et al. | Dynamic routing algorithms in VP-based ATM networks | |
| JP2844746B2 (en) | Call admission control method | |
| Larsson et al. | A comparison between different approaches for VPC bandwidth management | |
| Dziong et al. | On Adaptive Call Routing Strategies in Circuit Switched Network.-Maximum Revenue Approach | |
| JP3062236B2 (en) | Call acceptance judgment method | |
| KR20010046980A (en) | Method for link resource management in ATM networks | |
| Arvidsson et al. | Cost-effective deployment of bandwidth partitioning in broadband networks | |
| Choudhury et al. | A new reliability measure for computer networks | |
| JPH04150438A (en) | Band assigning system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| FZDE | Discontinued |