CA2371930A1 - 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
- CA2371930A1 CA2371930A1 CA002371930A CA2371930A CA2371930A1 CA 2371930 A1 CA2371930 A1 CA 2371930A1 CA 002371930 A CA002371930 A CA 002371930A CA 2371930 A CA2371930 A CA 2371930A CA 2371930 A1 CA2371930 A1 CA 2371930A1
- Authority
- CA
- Canada
- Prior art keywords
- trunk
- connection
- bit rate
- trunks
- reference point
- 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
- 238000000034 method Methods 0.000 title claims description 30
- 238000004891 communication Methods 0.000 title claims description 17
- 230000005540 biological transmission Effects 0.000 claims abstract description 18
- 125000004122 cyclic group Chemical group 0.000 claims description 3
- 238000010845 search algorithm Methods 0.000 abstract 3
- 238000009826 distribution Methods 0.000 description 4
- 238000012546 transfer Methods 0.000 description 3
- 230000001360 synchronised effect Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000000903 blocking effect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 150000002500 ions Chemical class 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000009827 uniform distribution Methods 0.000 description 1
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
- H04J—MULTIPLEX COMMUNICATION
- H04J2203/00—Aspects of optical multiplex systems other than those covered by H04J14/05 and H04J14/07
- H04J2203/0001—Provisions for broadband connections in integrated services digital network using frames of the Optical Transport Network [OTN] or using synchronous transfer mode [STM], e.g. SONET, SDH
- H04J2203/0051—Network Node Interface, e.g. tandem connections, transit switching
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J2203/00—Aspects of optical multiplex systems other than those covered by H04J14/05 and H04J14/07
- H04J2203/0001—Provisions for broadband connections in integrated services digital network using frames of the Optical Transport Network [OTN] or using synchronous transfer mode [STM], e.g. SONET, SDH
- H04J2203/0064—Admission Control
- H04J2203/0067—Resource management and allocation
- H04J2203/0069—Channel 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/5619—Network Node Interface, e.g. tandem connections, transit switching
-
- 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
Abstract
In order to authorize a connection between two neighboring network nodes in a connecting line bundle consisting of several connecting lines, a search algorithm determines in which of the connecting lines can the peak bit rate of said connection be achieved. To this end, it is initially decided on the bas is of a bit rate threshold value whether the search algorithm is started either from a fixed or a variable reference point. The search algorithm is then use d progressively on said connecting lines until a connecting line with sufficie nt free residual transmission capacity is found or the connection is rejected.< /SDOAB>
Description
Description Method for determining a communication path in a communication network between two neighboring network nodes.
The invention relates to a method according to the preamble of patent claim 1.
Contemporary communication networks have a plurality of network nodes which are intermeshed via communication paths. These are formed from a number of trunks which are combined to form trunk groups.
In contemporary communication networks, different traffic mixtures are conducted via the communication paths arranged between two or more network nodes. Thus, for example, information can be transmitted by means of a synchronous transfer mode (STM) or asynchronous mode (ATM). In this context, the information can have different bandwidths. Thus, as a rule, a distinction is made between information which is transmitted as narrowband signals and that which is transmitted as wideband or broadband signals. Thus, special significance is attached to setting up a connection between two neighboring network nodes, i.e.
those connected to one another via one trunk group.
When setting up a connection, two decisions must be made, in general, for determining a communication path between two neighboring network nodes . On the one hand, it must be decided on which of the trunks of the trunk group connecting the network nodes in question sufficient capacity is still free in order to be able to establish a connection.
On the other hand, one of the communication paths which are conceivable with regard to the available capacity, must be selected in such a manner that _ 2 _ an optimum grade of service is obtained. This is necessary in as much as a selected communication path should ensure the lowest possible blocking probability and an associated low connection loss probability for subsequent connections.
A method by means of which both of these tasks (search and selection) can be performed is called a hunting strategy method or hunting strategy.
Hunting strategy methods are known from the printed document "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.
Accordingly, a first hunting strategy method is described by means of which a sequential hunt is performed from a fixed zero position. In this process, the hunting always begins with the first trunk in the trunk group. Which one of the trunks is to be considered as the first one can be freely defined. The hunt is terminated as soon as a trunk has been found which meets the acceptance criteria. The acceptance criterion used here is the transmission capacity still available on the trunk in relation to the peak bit rate of the connection to be accommodated. The new connection to be accommodated will thus be accepted if a trunk is found the free available transmission capacity of which is greater than or equal to the peak bit rate of this connection. If this is so, the hunt is terminated. The next hunt is again started at the first trunk. If no free transmission capacity is found by the last trunk, the hunt is also terminated and the connection is question is rejected.
The disadvantageous factor of such a procedure is that~it results in a nonuniform load distribution on the trunk group. The reason for this is that the hunt is always started from the same position and is terminated when a suitable trunk has been found. On average, therefore, the trunks which have been hunted first are used to high capacity whereas the remaining trunks are used to low capacity ("unbalanced load").
According to this prior art, a second hunting strategy method is described by means of which a sequential hunt is performed from a variable zero position. In this process, the hunting begins with a specially marked trunk in the trunk group. The marking has been performed by the immediately preceding hunt.
This defines the position at which the next hunt is to be started. The new connection to be accepted is accepted if a trunk is found, the freely available transmission capacity of which is greater than or equal to the peak bit rate of this connection. If this is so, the hunt is terminated. At the same time as this, the trunk immediately following is marked. The next hunt thus begins at this trunk. If no free transmission capacity is found by the last trunk, the connection in . question will be rejected. The last trunk is defined as the trunk which immediately precedes the marked trunk after a cyclic rotation.
Although this prevents the disadvantage of the first hunting strategy method (nonuniform load distribution) because of the variable _ 4 _ position which, on average, provides a more or less uniform distribution on the trunk. The disadvantage of such a procedure is, however, that, because of the uniform load distribution, high-bit-rate connections can no longer be accommodated it with greater probability because of the lack of trunks with low capacity utilization and a corresponding request for connection setup must then be rejected.
These known methods were developed, in particular, for a homogeneous traffic characteristic in which each connection setup was associated with the same capacity requirement of 64 kbit/s per connection.
However, this homogeneity of the traffic in connection setup is often no longer given in contemporary communication networks. Apart from the conventional narrowband connections with 64 kbit/s,. for example, wideband connections with. nx64 kbit/s occur (in the case of STM-based connection-oriented multiple-rate services) or even broadband connections with any bit rate granularity in the case of ATM traffic.
However, this results in completely new requirements for the connection setup. For example, the traffic handling capacity for all types of traffic must be, at the same time, as high and as rugged as possible with the least possible interaction. In the case of ATM
traffic, this results in the requirement for the most even load distribution possible over all trunks of a trunk group. Otherwise, connections on trunks with high capacity utilization would be subject to greater delay in the associated queues than on trunks with low capacity utilization.
The invention is based on the object of demonstrating an approach of how communication paths in a communication network can also be determined with inhomogeneous traffic.
_ -_ __ _._... ............_._.. _r . _ 5 _ The object is achieved by the features specified in the characterizing clause on the basis of the features specified in the preamble of patent claim 1.
The advantageous factor of the invention is, in particular, the provision of a bit rate threshold value. According to this threshold value, a decision is made as to which hunting strategy method is applied to the trunks.
Advantageous further developments of the invention are specified in the subclaims.
In the text which follows, the invention will be explained in greater detail with reference to an exemplary embodiment shown in the figures, in which:
Figure 1 shows the configuration in which the method according to the invention is run, Figure 2 shows the algorithm according to the invention.
Figure 1 shows a communication network. In this arrangement, only four network nodes N1 ... N4 are shown for the sake of simplicity. Two network nodes, for example network nodes N1, N4 are connected to one another via a trunk TG. In the trunk group TG, a plurality of trunks Tl ... Tn are arranged. Each of the trunks Tl ... Tn has a specified transmission capacity Ca as physical transmission parameter. The residual transmission capacity Cr(T;,) (i=l...n) freely available for further connections is obtained from the physical connection capacity C$ minus the sum of the peak bit rates Rp~ of the m connect ions ( j =1, 2..., m) current ly conducted via this capacity.
In the text which follows, it is assumed that a connection V is to be set up from network node N1 to network node N4. According to the invention, a sequential hunt is now started from a bit-rate-dependent starting position if a connection setup request is present. The corresponding conditions are shown in Figure 2.
For this purpose, the two known hunting algorithms, called hunting strategy methods in the text which follows, are combined. Firstly, a criterion is established for when which one of the known hunting strategy methods will be run. The criterion provided is a bit rate threshold value which can be arbitrarily predetermined but should usually be of the order of magnitude 1/10 C8...1/5 C8. Firstly, it is decided in a first step whether the peak bit rate Rp of the connection newly to be accepted is greater than or less than this bit rate threshold value.
If the peak bit rate RpV (j=V) of the connection V newly to be accepted is greater than the bit rate threshold value, the hunting strategy method of the sequential hunt from the fixed zero position is used.
It must be assumed, therefore, that this connection is a high-bit-rate connection.
The hunting process is thus started with the first trunk in the trunk group. Which one of the trunks is the first one can be freely defined. The new connection V to be accommodated is accepted if a trunk Ti is found, the freely available residual transmission capacity Cr(Ti) of which is greater than or equal to the peak bit rate Rp~ of this connection. In this process, the trunks in the trunk group are checked successively step by step. Once a suitable trunk has been found, this trunk is taken and the hunting is terminated. If no free transmission capacity is found by the last trunk, the connection . _ in question is rejected. If a further connection V' is provided for acceptance at a later time, another hunt is started. This will only be started again at the first trunk if the peak bit rate Rp~. of the connection to be newly accepted is greater than the bit rate threshold value.
If the peak bit rate Rp~ of the connection V to be newly accepted is less than or equal to the bit rate threshold value, the hunting strategy method of the sequential hunt from a variable zero position is used.
It must thus be assumed that this connection is a low-bit-rate connection.
The hunting is thus started with a marked trunk in the trunk group. The marking has been performed by the immediately preceding hunt. The new connection to be accommodated is accepted if a trunk Ti is found, the freely available residual transmission capacity Cr(Ti) of which is greater than or equal to the peak bit rate of this connection. If this is so, the hunt is terminated. At the same time as this, the trunk immediately following this is marked. The next hunt is started at this trunk. If no free transmission capacity is found by the last trunk the connection in question is rejected. In this context, the trunk which is arranged immediately preceding the marked trunk after a cyclic rotation is defined as the last trunk.
The present exemplary embodiment generally discussed connections. These can be connections of any type. Thus connections which transmit information in accordance with a synchronous transfer method (STM) can be set up in accordance with the method according to the invention . . _ as can connections which transmit information in accordance with asynchronous transfer method (ATM).
The invention relates to a method according to the preamble of patent claim 1.
Contemporary communication networks have a plurality of network nodes which are intermeshed via communication paths. These are formed from a number of trunks which are combined to form trunk groups.
In contemporary communication networks, different traffic mixtures are conducted via the communication paths arranged between two or more network nodes. Thus, for example, information can be transmitted by means of a synchronous transfer mode (STM) or asynchronous mode (ATM). In this context, the information can have different bandwidths. Thus, as a rule, a distinction is made between information which is transmitted as narrowband signals and that which is transmitted as wideband or broadband signals. Thus, special significance is attached to setting up a connection between two neighboring network nodes, i.e.
those connected to one another via one trunk group.
When setting up a connection, two decisions must be made, in general, for determining a communication path between two neighboring network nodes . On the one hand, it must be decided on which of the trunks of the trunk group connecting the network nodes in question sufficient capacity is still free in order to be able to establish a connection.
On the other hand, one of the communication paths which are conceivable with regard to the available capacity, must be selected in such a manner that _ 2 _ an optimum grade of service is obtained. This is necessary in as much as a selected communication path should ensure the lowest possible blocking probability and an associated low connection loss probability for subsequent connections.
A method by means of which both of these tasks (search and selection) can be performed is called a hunting strategy method or hunting strategy.
Hunting strategy methods are known from the printed document "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.
Accordingly, a first hunting strategy method is described by means of which a sequential hunt is performed from a fixed zero position. In this process, the hunting always begins with the first trunk in the trunk group. Which one of the trunks is to be considered as the first one can be freely defined. The hunt is terminated as soon as a trunk has been found which meets the acceptance criteria. The acceptance criterion used here is the transmission capacity still available on the trunk in relation to the peak bit rate of the connection to be accommodated. The new connection to be accommodated will thus be accepted if a trunk is found the free available transmission capacity of which is greater than or equal to the peak bit rate of this connection. If this is so, the hunt is terminated. The next hunt is again started at the first trunk. If no free transmission capacity is found by the last trunk, the hunt is also terminated and the connection is question is rejected.
The disadvantageous factor of such a procedure is that~it results in a nonuniform load distribution on the trunk group. The reason for this is that the hunt is always started from the same position and is terminated when a suitable trunk has been found. On average, therefore, the trunks which have been hunted first are used to high capacity whereas the remaining trunks are used to low capacity ("unbalanced load").
According to this prior art, a second hunting strategy method is described by means of which a sequential hunt is performed from a variable zero position. In this process, the hunting begins with a specially marked trunk in the trunk group. The marking has been performed by the immediately preceding hunt.
This defines the position at which the next hunt is to be started. The new connection to be accepted is accepted if a trunk is found, the freely available transmission capacity of which is greater than or equal to the peak bit rate of this connection. If this is so, the hunt is terminated. At the same time as this, the trunk immediately following is marked. The next hunt thus begins at this trunk. If no free transmission capacity is found by the last trunk, the connection in . question will be rejected. The last trunk is defined as the trunk which immediately precedes the marked trunk after a cyclic rotation.
Although this prevents the disadvantage of the first hunting strategy method (nonuniform load distribution) because of the variable _ 4 _ position which, on average, provides a more or less uniform distribution on the trunk. The disadvantage of such a procedure is, however, that, because of the uniform load distribution, high-bit-rate connections can no longer be accommodated it with greater probability because of the lack of trunks with low capacity utilization and a corresponding request for connection setup must then be rejected.
These known methods were developed, in particular, for a homogeneous traffic characteristic in which each connection setup was associated with the same capacity requirement of 64 kbit/s per connection.
However, this homogeneity of the traffic in connection setup is often no longer given in contemporary communication networks. Apart from the conventional narrowband connections with 64 kbit/s,. for example, wideband connections with. nx64 kbit/s occur (in the case of STM-based connection-oriented multiple-rate services) or even broadband connections with any bit rate granularity in the case of ATM traffic.
However, this results in completely new requirements for the connection setup. For example, the traffic handling capacity for all types of traffic must be, at the same time, as high and as rugged as possible with the least possible interaction. In the case of ATM
traffic, this results in the requirement for the most even load distribution possible over all trunks of a trunk group. Otherwise, connections on trunks with high capacity utilization would be subject to greater delay in the associated queues than on trunks with low capacity utilization.
The invention is based on the object of demonstrating an approach of how communication paths in a communication network can also be determined with inhomogeneous traffic.
_ -_ __ _._... ............_._.. _r . _ 5 _ The object is achieved by the features specified in the characterizing clause on the basis of the features specified in the preamble of patent claim 1.
The advantageous factor of the invention is, in particular, the provision of a bit rate threshold value. According to this threshold value, a decision is made as to which hunting strategy method is applied to the trunks.
Advantageous further developments of the invention are specified in the subclaims.
In the text which follows, the invention will be explained in greater detail with reference to an exemplary embodiment shown in the figures, in which:
Figure 1 shows the configuration in which the method according to the invention is run, Figure 2 shows the algorithm according to the invention.
Figure 1 shows a communication network. In this arrangement, only four network nodes N1 ... N4 are shown for the sake of simplicity. Two network nodes, for example network nodes N1, N4 are connected to one another via a trunk TG. In the trunk group TG, a plurality of trunks Tl ... Tn are arranged. Each of the trunks Tl ... Tn has a specified transmission capacity Ca as physical transmission parameter. The residual transmission capacity Cr(T;,) (i=l...n) freely available for further connections is obtained from the physical connection capacity C$ minus the sum of the peak bit rates Rp~ of the m connect ions ( j =1, 2..., m) current ly conducted via this capacity.
In the text which follows, it is assumed that a connection V is to be set up from network node N1 to network node N4. According to the invention, a sequential hunt is now started from a bit-rate-dependent starting position if a connection setup request is present. The corresponding conditions are shown in Figure 2.
For this purpose, the two known hunting algorithms, called hunting strategy methods in the text which follows, are combined. Firstly, a criterion is established for when which one of the known hunting strategy methods will be run. The criterion provided is a bit rate threshold value which can be arbitrarily predetermined but should usually be of the order of magnitude 1/10 C8...1/5 C8. Firstly, it is decided in a first step whether the peak bit rate Rp of the connection newly to be accepted is greater than or less than this bit rate threshold value.
If the peak bit rate RpV (j=V) of the connection V newly to be accepted is greater than the bit rate threshold value, the hunting strategy method of the sequential hunt from the fixed zero position is used.
It must be assumed, therefore, that this connection is a high-bit-rate connection.
The hunting process is thus started with the first trunk in the trunk group. Which one of the trunks is the first one can be freely defined. The new connection V to be accommodated is accepted if a trunk Ti is found, the freely available residual transmission capacity Cr(Ti) of which is greater than or equal to the peak bit rate Rp~ of this connection. In this process, the trunks in the trunk group are checked successively step by step. Once a suitable trunk has been found, this trunk is taken and the hunting is terminated. If no free transmission capacity is found by the last trunk, the connection . _ in question is rejected. If a further connection V' is provided for acceptance at a later time, another hunt is started. This will only be started again at the first trunk if the peak bit rate Rp~. of the connection to be newly accepted is greater than the bit rate threshold value.
If the peak bit rate Rp~ of the connection V to be newly accepted is less than or equal to the bit rate threshold value, the hunting strategy method of the sequential hunt from a variable zero position is used.
It must thus be assumed that this connection is a low-bit-rate connection.
The hunting is thus started with a marked trunk in the trunk group. The marking has been performed by the immediately preceding hunt. The new connection to be accommodated is accepted if a trunk Ti is found, the freely available residual transmission capacity Cr(Ti) of which is greater than or equal to the peak bit rate of this connection. If this is so, the hunt is terminated. At the same time as this, the trunk immediately following this is marked. The next hunt is started at this trunk. If no free transmission capacity is found by the last trunk the connection in question is rejected. In this context, the trunk which is arranged immediately preceding the marked trunk after a cyclic rotation is defined as the last trunk.
The present exemplary embodiment generally discussed connections. These can be connections of any type. Thus connections which transmit information in accordance with a synchronous transfer method (STM) can be set up in accordance with the method according to the invention . . _ as can connections which transmit information in accordance with asynchronous transfer method (ATM).
Claims (5)
1. A method for determining a communication path in a communication network, comprising a plurality of connections which are in each case conducted via a further plurality of trunks (T1...Tn) between two neighboring network nodes (N1..N4) and which reserve transmission capacities on these trunks (T1...Tn), and comprising at least one further connection (V) which is to be additionally accommodated on one of the trunks (T1...Tn) in that a hunting algorithm determines the trunk (T1...Tn) on which this connection (V) can still be accommodate in accordance with an acceptance criterion, characterized in that according to a bit rate threshold value, the hunting algorithm is started from a fixed reference point when the peak bit rate (Rpv) of the connection to be newly accepted is greater than the bit rate threshold value, or is started from a variable reference point when the peak bit rate (Rpv) of the connection to be newly accepted is less than the bit rate threshold value or equal to the bit rate threshold value, and thereafter the hunting algorithm is applied step by step to the further plurality of trunks (T1...Tn) until a trunk (T1...Tn) having sufficient free transmission capacity is found and the connection is accepted or all trunks (T1...Ta) have been checked and the connection must be rejected.
claims
claims
2. The method as claimed in claim 1, characterized in that the fixed reference point is the first trunk (T1) in the trunk group (TG).
3. The method as claimed in claim 1, characterized in that the variable reference point is the trunk (T1) in the trunk group (TG) which, in cyclic rotation, is arranged immediately following the trunk at which the hunting algorithm started from a variable reference point has been terminated the last time previously.
4. The method as claimed in claim 1 to 3, characterized in that the free residual transmission capacity (C r (T i)) of a trunk (T1...T n) is obtained from the physical transmission capacity (C s) of this trunk, and this amount is reduced by the sum of the peak bit rates (R pj) of the currently active m connections (j=1...m) of this trunk.
5. The method as claimed in one of the preceding claims, characterized in that the acceptance criterion is designed in such a manner that a check is made whether the freely available residual transmission capacity C r(T i) is greater than or equal to the peak bit rate (R pv) of this connection (V).
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| DE1999107924 DE19907924C2 (en) | 1999-02-24 | 1999-02-24 | Method for determining a connection path in a communication network between two neighboring network nodes |
| DE19907924.2 | 1999-02-24 | ||
| PCT/DE2000/000316 WO2000051397A1 (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 |
|---|---|
| CA2371930A1 true CA2371930A1 (en) | 2000-08-31 |
Family
ID=7898675
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002371930A Abandoned CA2371930A1 (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) | EP1155595A1 (en) |
| CA (1) | CA2371930A1 (en) |
| DE (1) | DE19907924C2 (en) |
| WO (1) | WO2000051397A1 (en) |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2837182B2 (en) * | 1989-08-04 | 1998-12-14 | 富士通株式会社 | Cell data transmission method, transmission request processing method, and switch |
| DE59107658D1 (en) * | 1991-07-19 | 1996-05-09 | Siemens Ag | Method and circuit arrangement for setting up virtual connections via an ATM trunk group |
| SE501272C2 (en) * | 1993-05-03 | 1994-12-19 | Ellemtel Utvecklings Ab | Method and apparatus for selecting a free link for a calling connection |
-
1999
- 1999-02-24 DE DE1999107924 patent/DE19907924C2/en not_active Expired - Fee Related
-
2000
- 2000-02-02 CA CA002371930A patent/CA2371930A1/en not_active Abandoned
- 2000-02-02 EP EP00912339A patent/EP1155595A1/en not_active Withdrawn
- 2000-02-02 WO PCT/DE2000/000316 patent/WO2000051397A1/en not_active Application Discontinuation
Also Published As
| Publication number | Publication date |
|---|---|
| DE19907924C2 (en) | 2001-07-05 |
| DE19907924A1 (en) | 2000-11-02 |
| EP1155595A1 (en) | 2001-11-21 |
| WO2000051397A1 (en) | 2000-08-31 |
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 | |
| EP0755599B1 (en) | A communication network control method and apparatus | |
| US6690671B1 (en) | Load balanced UBR routing in ATM networks | |
| US6400681B1 (en) | Method and system for minimizing the connection set up time in high speed packet switching networks | |
| US6470029B1 (en) | Bandwidth control method in a network system | |
| EP0753979A1 (en) | Routing method and system for a high speed packet switching network | |
| EP0777362A1 (en) | A method of admission control and routing of virtual circuits | |
| US6628668B1 (en) | Crosspoint switch bandwidth allocation management | |
| US6963927B1 (en) | Method and apparatus for computing the shortest path between nodes based on the bandwidth utilization link level | |
| JPH03235550A (en) | Cell abort rate estimate method and call reception controller using the same | |
| JPH1070574A (en) | Method for adjusting access to packet exchange network | |
| EP0897232B1 (en) | Traffic management in packet communication networks having service priorities and employing effective bandwidths | |
| CA2282929A1 (en) | Method and apparatus for reduction of call setup rate in an atm network | |
| EP0734625B1 (en) | Method and apparatus for controlling a communications network | |
| EP0814583A2 (en) | Method and system for minimizing the connection set up time in high speed packet switching networks | |
| JP2002519961A (en) | Method and system for burst congestion control in ATM networks | |
| US5502714A (en) | Method for selecting a free link and an arrangement herefor | |
| US6356530B1 (en) | Next hop selection in ATM networks | |
| EP0904647B1 (en) | Atm network management | |
| CA2371930A1 (en) | Method for determining a communication path in a communication network between two neighboring network nodes | |
| Burgin | Management of capacity and control in broadband ISDN | |
| US6072775A (en) | Source traffic control method in ATM network to prevent serious local congestion | |
| Bartal et al. | Fast, fair and frugal bandwidth allocation in atm networks | |
| Arulambalam et al. | An intelligent explicit rate control algorithm for ABR service in ATM networks | |
| CA2364707A1 (en) | Method for determining a communication path in a communication network between two neighboring network nodes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| FZDE | Discontinued |