CA2533627A1 - A method for the statistical estimation of the traffic dispersion in telecommunication network - Google Patents
A method for the statistical estimation of the traffic dispersion in telecommunication network Download PDFInfo
- Publication number
- CA2533627A1 CA2533627A1 CA002533627A CA2533627A CA2533627A1 CA 2533627 A1 CA2533627 A1 CA 2533627A1 CA 002533627 A CA002533627 A CA 002533627A CA 2533627 A CA2533627 A CA 2533627A CA 2533627 A1 CA2533627 A1 CA 2533627A1
- Authority
- CA
- Canada
- Prior art keywords
- traffic
- exchange
- quantums
- link
- routing rules
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/22—Arrangements for supervision, monitoring or testing
- H04M3/36—Statistical metering, e.g. recording occasions when traffic exceeds capacity of trunks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/22—Arrangements for supervision, monitoring or testing
- H04M3/36—Statistical metering, e.g. recording occasions when traffic exceeds capacity of trunks
- H04M3/362—Traffic simulation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/0016—Arrangements providing connection between exchanges
- H04Q3/0062—Provisions for network management
- H04Q3/0083—Network planning or design; Modelling of planned or existing networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M7/00—Arrangements for interconnection between switching centres
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13335—Simulation, emulation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13349—Network management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
Abstract
A method for evaluating traffic dispersion at an exchange (Exk) in a communications network, the exchange being arranged for applying a set of routing rules (RLk) in allotting to a plurality of links (i.e. circuit groups) incoming traffic directed towards a given destination. The method includes the steps of: - incrementally (202, 214) generating (208) traffic quantums representative of said traffic, - producing a distribution (210) of the traffic quantums over the circuit groups according to the set of routing rules (RLk); the distribution thus obtained being statistically representative of the dispersion of said incoming traffic over said plurality of circuit groups at the exchange (EXk). The steps of incrementally (202, 214) generating (208) traffic quantums representative of the traffic and producing a distribution (210) of said traffic quantums are performed in the absence of interference with operation of the exchanges/nodes in the communications network.
Claims (22)
1. A method for evaluating traffic dispersion at at least one exchange (Ex k) in a communications network, the exchange (Ex k) being arranged for applying a set of routing rules (RL k) in selectively allotting to a plurality of links incoming traffic directed towards a given destination, characterised in that it includes the steps of:
- incrementally (202, 214) generating (208) traffic quantums representative of said traffic, and - producing a distribution (210) of said traffic quantums over said links in said plurality according to said set of routing rules (RL k), the distribution thus obtained being statistically representative of the dispersion of said incoming traffic over said plurality of links at said exchange (EX k).
- incrementally (202, 214) generating (208) traffic quantums representative of said traffic, and - producing a distribution (210) of said traffic quantums over said links in said plurality according to said set of routing rules (RL k), the distribution thus obtained being statistically representative of the dispersion of said incoming traffic over said plurality of links at said exchange (EX k).
2. The method of claim 1, characterised in that it includes the steps of:
- measuring (12; TM k) the volume of said incoming traffic directed towards said given destination, and - generating (208) said traffic quantums by subdividing said measured traffic volume by a given number of loop steps.
- measuring (12; TM k) the volume of said incoming traffic directed towards said given destination, and - generating (208) said traffic quantums by subdividing said measured traffic volume by a given number of loop steps.
3. The method of claim 1, characterised in that it includes the steps:
- determining, for each link in said plurality, a number of call attempts and a corresponding number of seizures, - if said number of call attempts equals said number of seizures, setting a load limit for applying said set of routing rules (RL k) for said link equal to the number of circuits available in the link, and - if said number of call attempts is greater than said respective number of seizures, setting said load limit equal to the outgoing traffic volume measured (TM k) by the exchange (Ex k) on said link.
- determining, for each link in said plurality, a number of call attempts and a corresponding number of seizures, - if said number of call attempts equals said number of seizures, setting a load limit for applying said set of routing rules (RL k) for said link equal to the number of circuits available in the link, and - if said number of call attempts is greater than said respective number of seizures, setting said load limit equal to the outgoing traffic volume measured (TM k) by the exchange (Ex k) on said link.
4. The method of claim 1, characterised in that it includes the steps of:
- accepting said traffic quantums to be assigned to a given link only if the sum of all the traffic portions assigned to said link is smaller than the said load limit set for said link, - otherwise selecting a next choice in said set of routing rules (RL k).
- accepting said traffic quantums to be assigned to a given link only if the sum of all the traffic portions assigned to said link is smaller than the said load limit set for said link, - otherwise selecting a next choice in said set of routing rules (RL k).
5. The method of claim 1, characterised in that it includes the steps of:
- selecting within said network at least a first exchange (EX k) receiving traffic from at least a second (EX m) and a third (EX n) exchange, and - obtaining, based on respective distributions of said quantums of traffic generated at said second (EX m) and third (EX n) exchanges, traffic dispersion data indicative of:
- the traffic (TV mxp) incoming into said first exchange (EX k) from said second exchange (EX m), - the traffic (TV nxr) incoming into said first exchange (EX k) from said third exchange (Ex n).
- selecting within said network at least a first exchange (EX k) receiving traffic from at least a second (EX m) and a third (EX n) exchange, and - obtaining, based on respective distributions of said quantums of traffic generated at said second (EX m) and third (EX n) exchanges, traffic dispersion data indicative of:
- the traffic (TV mxp) incoming into said first exchange (EX k) from said second exchange (EX m), - the traffic (TV nxr) incoming into said first exchange (EX k) from said third exchange (Ex n).
6. The method of claim 5, characterised in that it includes the step of obtaining, based on respective distributions of said quantums of traffic, distribution data representative of the traffic towards a given destination (x) generated at said first exchange (EX k) different from traffic (TV mxp, TV nxr) incoming from said second (EX m) and third (EX n) exchanges.
7. The method of claim 5, characterised in that it includes the steps of:
- partitioning the traffic outgoing from said first exchange (EX k) based on the respective routing rules (RL k) into - a first group (A), including traffic components coming from said second exchange (EX m) using a given subset of links in said set of routing rules, and - a second group (B), including traffic components coming from said third exchange (Ex n) exchange using the whole set of links in said set of routing rules.
- partitioning the traffic outgoing from said first exchange (EX k) based on the respective routing rules (RL k) into - a first group (A), including traffic components coming from said second exchange (EX m) using a given subset of links in said set of routing rules, and - a second group (B), including traffic components coming from said third exchange (Ex n) exchange using the whole set of links in said set of routing rules.
8. The method of claim 7, characterised in that it includes the steps of:
- analysing the traffic volume (TV kxy) directed toward a given destination (x) within said network and carried by a respective link (CG y) coming out of said first exchange (EX k), - determining a first component of said traffic volume (TV kxy) coming from said second exchange (EX m) as wherein .DELTA. is the subset of links used by a current routing rule in said first exchange (EX k).
- analysing the traffic volume (TV kxy) directed toward a given destination (x) within said network and carried by a respective link (CG y) coming out of said first exchange (EX k), - determining a first component of said traffic volume (TV kxy) coming from said second exchange (EX m) as wherein .DELTA. is the subset of links used by a current routing rule in said first exchange (EX k).
9. The method of claim 8, characterised in that it includes the steps of:
- analysing the traffic volume (TV kxy) directed toward a given destination (x) within said network and carried by a respective link (CG y) coming out of said first exchange (EX k), - determining a first component of said traffic volume (TV kxy) coming from said third exchange (EX n) as wherein is the sum of all the results obtained for said second exchange (EX m) for all the links used by said routing rule and .PHI. is the whole set of links used by a current routing rule in said first exchange (EX k).
- analysing the traffic volume (TV kxy) directed toward a given destination (x) within said network and carried by a respective link (CG y) coming out of said first exchange (EX k), - determining a first component of said traffic volume (TV kxy) coming from said third exchange (EX n) as wherein is the sum of all the results obtained for said second exchange (EX m) for all the links used by said routing rule and .PHI. is the whole set of links used by a current routing rule in said first exchange (EX k).
10. The method of claim 1, characterised in that said steps of incrementally (202, 214) generating (208) traffic quantums representative of said traffic and producing a distribution (210) of said traffic quantums are performed in the absence of interference with operation of said communications network.
11. A system for evaluating traffic dispersion at at least one exchange (Ex k) in a communications network, the exchange (Ex k) being arranged for applying a set of routing rules (RL k) in selectively allotting to a plurality of links incoming traffic directed towards a given destination, characterised in that it includes a evaluation module (16) configured for:
- incrementally (202, 214) generating (208) traffic quantums representative of said traffic, and - producing a distribution (210) of said traffic quantums over said links in said plurality according to said set of routing rules (RL k), the distribution thus obtained being statistically representative of the dispersion of said incoming traffic over said plurality of links at said exchange (EX k).
- incrementally (202, 214) generating (208) traffic quantums representative of said traffic, and - producing a distribution (210) of said traffic quantums over said links in said plurality according to said set of routing rules (RL k), the distribution thus obtained being statistically representative of the dispersion of said incoming traffic over said plurality of links at said exchange (EX k).
12. The system of claim 11, characterised in that it includes a measuring module (12) for measuring (TM k) the volume of said incoming traffic directed towards said given destination, and in that said evaluation module (16) is configured for generating (208) said traffic quantums by subdividing the traffic volume measured by said measuring module (12) by a given number of loop steps.
13. The system of claim 11, characterised in that it includes:
- a measuring module (12) configured for determining, for each link in said plurality, a number of call attempts and a corresponding number of seizures, - a routing rules generating module (14) for setting a load limit for applying said set of routing rules (RL k), said routing rules generating module (14) being configured for:
- if said number of call attempts equals said number of seizures, setting a load limit for applying said set of routing rules (RL k) for said link equal to the number of circuits available in the link, and - if said number of call attempts is greater than said respective number of seizures, setting said load limit equal to the outgoing traffic volume measured (TM k) by said measuring module (12) on said link.
- a measuring module (12) configured for determining, for each link in said plurality, a number of call attempts and a corresponding number of seizures, - a routing rules generating module (14) for setting a load limit for applying said set of routing rules (RL k), said routing rules generating module (14) being configured for:
- if said number of call attempts equals said number of seizures, setting a load limit for applying said set of routing rules (RL k) for said link equal to the number of circuits available in the link, and - if said number of call attempts is greater than said respective number of seizures, setting said load limit equal to the outgoing traffic volume measured (TM k) by said measuring module (12) on said link.
14. The system of claim 11, characterised in that it includes a routing rules generating module (14) configured for:
- accepting said traffic quantums to be assigned to a given link only if the sum of all the traffic portions assigned to said link is smaller than the said load limit set for said link, - otherwise selecting a next choice in said set of routing rules (RL k).
- accepting said traffic quantums to be assigned to a given link only if the sum of all the traffic portions assigned to said link is smaller than the said load limit set for said link, - otherwise selecting a next choice in said set of routing rules (RL k).
15. The system of claim 11, for use in a network (N) including at least a first exchange (Ex k) receiving traffic from at least a second (EX m) and a third (Ex n) exchange, characterised in that it includes at least one said evaluation module (16) configured for:
- obtaining, based on respective distributions of said quantums of traffic generated at said second (EX m) and third (Ex n) exchanges, traffic dispersion data indicative of:
- the traffic (TV mxp) incoming into said first exchange (EX k) from said second exchange (EX m), - the traffic (TV nxr) incoming into said first exchange (EX k) from said third exchange (Ex n).
- obtaining, based on respective distributions of said quantums of traffic generated at said second (EX m) and third (Ex n) exchanges, traffic dispersion data indicative of:
- the traffic (TV mxp) incoming into said first exchange (EX k) from said second exchange (EX m), - the traffic (TV nxr) incoming into said first exchange (EX k) from said third exchange (Ex n).
16. The system of claim 15, characterised in that said at least one evaluation module (16) is configured for obtaining, based on respective distributions of said quantums of traffic, distribution data representative of the traffic towards a given destination (x) generated at said first exchange (EX k) different from traffic (TV mxp, TV nxr) incoming from said second (EX m) and third (EX n) exchanges.
17. The system of claim 15, characterised in that said evaluation module (16) is configured for:
- partitioning the traffic outgoing from said first exchange (EX k) based on the respective routing rules (RL k) into :
- a first group (A), including traffic components coming from said second exchange (Ex m) using a given subset of links in said set of routing rules, and - a second group (B), including traffic components coming form said third exchange (Ex n) using the whole set of links in said set of routing rules.
- partitioning the traffic outgoing from said first exchange (EX k) based on the respective routing rules (RL k) into :
- a first group (A), including traffic components coming from said second exchange (Ex m) using a given subset of links in said set of routing rules, and - a second group (B), including traffic components coming form said third exchange (Ex n) using the whole set of links in said set of routing rules.
18. The system of claim 17, characterised in that said at least one valuation module (16) is configured for:
- analysing the traffic volume (TV kxy) directed toward a given destination (x) within said network and carried by a respective link (CG y) coming out of said first exchange (EX k) , - determining a first component of said traffic volume (Tv kxy) coming from said second exchange (EX m) as wherein .DELTA. is the subset of links used by a current routing rule in said first exchange (EX k).
- analysing the traffic volume (TV kxy) directed toward a given destination (x) within said network and carried by a respective link (CG y) coming out of said first exchange (EX k) , - determining a first component of said traffic volume (Tv kxy) coming from said second exchange (EX m) as wherein .DELTA. is the subset of links used by a current routing rule in said first exchange (EX k).
19. The system of claim 18, characterised in that said evaluation module (16) is configured for:
- analysing the traffic volume (TV kxy) directed toward a given destination (x) within said network and carried by a respective link (CG y) coming out of said first exchange (EX k) , - determining a first component of said traffic volume (TV kxy) coming from said third exchange (EX n) as wherein~ is the sum of all the results obtained for said second exchange (EX m) for all the links used by said routing rule and .PHI. is the whole set of links used by a current routing rule in said first exchange (EX k).
- analysing the traffic volume (TV kxy) directed toward a given destination (x) within said network and carried by a respective link (CG y) coming out of said first exchange (EX k) , - determining a first component of said traffic volume (TV kxy) coming from said third exchange (EX n) as wherein~ is the sum of all the results obtained for said second exchange (EX m) for all the links used by said routing rule and .PHI. is the whole set of links used by a current routing rule in said first exchange (EX k).
20. The system of claim 11, characterised in that said evaluation module (16) is configured for performing said steps of incrementally (202, 214) generating (208) traffic quantums representative of said traffic and producing a distribution (210) of said traffic quantums in the absence of interference with operation of said communications network.
21. A communication network including a plurality of exchanges (1, 2 , ....... . n) , characterised in that it includes a system according to any of claims 11 to 20.
22. A computer program product loadable in the memory of at least one computer (10 - 16) and including software code portions for performing the method of any of claims 1 to 10 when the product is run on a computer.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/EP2003/008766 WO2005015828A1 (en) | 2003-08-07 | 2003-08-07 | A method for the statistical estimation of the traffic dispersion in telecommunication network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2533627A1 true CA2533627A1 (en) | 2005-02-17 |
| CA2533627C CA2533627C (en) | 2010-10-12 |
Family
ID=34129898
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA2533627A Expired - Fee Related CA2533627C (en) | 2003-08-07 | 2003-08-07 | A method for the statistical estimation of the traffic dispersion in telecommunication network |
Country Status (10)
| Country | Link |
|---|---|
| US (1) | US7864749B2 (en) |
| EP (1) | EP1652339B1 (en) |
| CN (1) | CN100433634C (en) |
| AT (1) | ATE410856T1 (en) |
| AU (1) | AU2003260381A1 (en) |
| BR (2) | BRPI0318453B1 (en) |
| CA (1) | CA2533627C (en) |
| DE (1) | DE60324037D1 (en) |
| ES (1) | ES2316878T3 (en) |
| WO (1) | WO2005015828A1 (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100501684C (en) * | 2004-03-19 | 2009-06-17 | "英特尔A/O"股份公司 | Failover and load balancing |
| US7760626B2 (en) * | 2004-03-31 | 2010-07-20 | Intel Corporation | Load balancing and failover |
| CN101193411B (en) * | 2007-01-10 | 2010-12-08 | 中兴通讯股份有限公司 | Network optimization method |
Family Cites Families (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5359649A (en) * | 1991-10-02 | 1994-10-25 | Telefonaktiebolaget L M Ericsson | Congestion tuning of telecommunications networks |
| US6209033B1 (en) * | 1995-02-01 | 2001-03-27 | Cabletron Systems, Inc. | Apparatus and method for network capacity evaluation and planning |
| KR100267276B1 (en) * | 1998-06-16 | 2000-10-16 | 김영환 | Base station maximum traffic capacity output method using markov call in digital mobile communcation system |
| US6574669B1 (en) * | 1998-08-31 | 2003-06-03 | Nortel Networks Limited | Method and apparatus for routing traffic within a network utilizing linear optimization |
| US6873600B1 (en) * | 2000-02-04 | 2005-03-29 | At&T Corp. | Consistent sampling for network traffic measurement |
| US20010054097A1 (en) * | 2000-12-21 | 2001-12-20 | Steven Chafe | Monitoring and reporting of communications line traffic information |
| ITTO20010180A1 (en) | 2001-03-01 | 2002-09-01 | Cselt Centro Studi Lab Telecom | PROCEDURE AND SYSTEM FOR THE CONTROL OF THE CONFIGURATION OF THE NODES A TELECOMMUNICATION NETWORK. |
| US20040042398A1 (en) * | 2002-02-28 | 2004-03-04 | Seriqa Networks | Method and apparatus for reducing traffic congestion by preventing allocation of the occupied portion of the link capacity and for protecting a switch from congestion by preventing allocation on some of its links |
| US7483379B2 (en) * | 2002-05-17 | 2009-01-27 | Alcatel Lucent | Passive network monitoring system |
| US7373403B2 (en) * | 2002-08-22 | 2008-05-13 | Agilent Technologies, Inc. | Method and apparatus for displaying measurement data from heterogeneous measurement sources |
| ITTO20020742A1 (en) | 2002-08-23 | 2004-02-24 | Telecom Italia Lab Spa | PROCEDURE AND SYSTEM FOR THE CONTROL OF THE |
| US7266122B1 (en) * | 2002-11-27 | 2007-09-04 | Genband Inc. | System and method for allocating bandwidth in a communications environment |
| US6839328B2 (en) * | 2003-01-31 | 2005-01-04 | Telcordia Technologies, Inc. | Measurement of packet loss ratio in a network using end-point data |
| US7356584B2 (en) * | 2003-03-03 | 2008-04-08 | Microsoft Corporation | Optimization of service provider load balancing |
| US7680925B2 (en) * | 2006-01-24 | 2010-03-16 | Cisco Technology, Inc. | Method and system for testing provisioned services in a network |
-
2003
- 2003-08-07 CA CA2533627A patent/CA2533627C/en not_active Expired - Fee Related
- 2003-08-07 DE DE60324037T patent/DE60324037D1/en not_active Expired - Lifetime
- 2003-08-07 AT AT03817943T patent/ATE410856T1/en not_active IP Right Cessation
- 2003-08-07 EP EP03817943A patent/EP1652339B1/en not_active Expired - Lifetime
- 2003-08-07 US US10/566,993 patent/US7864749B2/en not_active Expired - Fee Related
- 2003-08-07 BR BRPI0318453-6A patent/BRPI0318453B1/en unknown
- 2003-08-07 AU AU2003260381A patent/AU2003260381A1/en not_active Abandoned
- 2003-08-07 BR BRPI0318453-6A patent/BR0318453A/en not_active IP Right Cessation
- 2003-08-07 WO PCT/EP2003/008766 patent/WO2005015828A1/en active Application Filing
- 2003-08-07 ES ES03817943T patent/ES2316878T3/en not_active Expired - Lifetime
- 2003-08-07 CN CNB038268876A patent/CN100433634C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| EP1652339A1 (en) | 2006-05-03 |
| WO2005015828A1 (en) | 2005-02-17 |
| ES2316878T3 (en) | 2009-04-16 |
| ATE410856T1 (en) | 2008-10-15 |
| CN100433634C (en) | 2008-11-12 |
| BRPI0318453B1 (en) | 2017-09-12 |
| AU2003260381A1 (en) | 2005-02-25 |
| DE60324037D1 (en) | 2008-11-20 |
| US20060193331A1 (en) | 2006-08-31 |
| CN1820459A (en) | 2006-08-16 |
| CA2533627C (en) | 2010-10-12 |
| BR0318453A (en) | 2006-09-12 |
| EP1652339B1 (en) | 2008-10-08 |
| US7864749B2 (en) | 2011-01-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Iversen | Evaluation of multi-service CDMA networks with soft blocking | |
| JP4788930B2 (en) | Radio access network configuration management method, configuration management system, and radio access network management apparatus | |
| Moscholios et al. | QoS guarantee in a batched poisson multirate loss model supporting elastic and adaptive traffic | |
| CN101013955A (en) | Fast simulated annealing for traffic matrix estimation | |
| CA2533627A1 (en) | A method for the statistical estimation of the traffic dispersion in telecommunication network | |
| Merchant et al. | Multiway graph partitioning with applications to PCS networks | |
| CN102461069A (en) | Modelling apparatus and method | |
| CN102461068A (en) | Modelling apparatus and method | |
| Glabowski et al. | A full-availability group model with multi-service sources and threshold mechanisms | |
| CN102804706A (en) | Modelling apparatus and method | |
| Vassilakis et al. | Call-level analysis of W-CDMA networks supporting elastic services of finite population | |
| CN113014663B (en) | Task and resource matching method supporting cross-node computing task survivability and succession | |
| KR100271525B1 (en) | End-to-end traffic estimation device for telephone network and the method thereof | |
| Xiao et al. | Cross-layer power control for uplink NOMA in IoT applications with statistical delay constraints | |
| Kulshreshtha et al. | Maximum packing channel assignment in cellular networks | |
| Tan et al. | Determination of minimum number of wavelengths required for all-optical WDM networks using graph colouring | |
| Lazov | Risk assessment of a stochastic service system | |
| Sobieraj et al. | Blocking probability in switching networks with multi-service sources and multicast traffic | |
| García et al. | Automatic UMTS system resource dimensioning based on service traffic analysis | |
| Ozugur | Multiobjective hierarchical location and routing area optimization in GPRS and UMTS networks | |
| Głąbowski et al. | A modified method for point-to-group blocking probability calculation in switching networks with call admission control mechanisms | |
| Głąbowski et al. | Chair of Computer and Communication Networks, Poznań University of Technology, ul. Polanha 3, 60-965 Poznan, Poland; e-mail: mglabows@ et. put. poznan. pl | |
| Chousainov et al. | Call Blocking Probabilities in Multi-Cluster C-RAN Supporting Poisson Traffic | |
| Kaliszan | Simulation studies of characteristics of Full Availability Group with generalized traffic classes | |
| Andrew | Wavelength continuous WDM networks with nonuniform service rates |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed |
Effective date: 20190807 |