Research on the Bottleneck Area of Optimal BGP Route Selection
Explore this paper's citation graph
Summary
A bottleneck area predicting algorithm on traffic demand in polynomial time is proposed, which deals with interdomain peering links and intradomian links simultaneously and a conclusion is drawn from the simulation that the topology is a very important factor in determining the bottleneck area.
- Type
- article
- Published
- 2005-01-01
- Cited by
- 3
- References
- 0
- OpenAlex
- https://openalex.org/W3145924829
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:62590353
Keywords
Bottleneck, Selection (genetic algorithm), Computer science, Computer network, Artificial intelligence
References
No references recorded for this paper.
Cited by
- Hits and Holds: Two Algorithms for Identifying the Elephant Flows: Hits and Holds: Two Algorithms for Identifying the Elephant Flows
- Algorithm Based on Entropy for Finding Critical Traffic Matrices: Algorithm Based on Entropy for Finding Critical Traffic Matrices
- Hits and Holds: Two Algorithms for Identifying the Elephant Flows
Related papers
- DETERMINING QUALITY REQUIREMENTS AT THE UNIVERSITIES TO IMPROVE THE QUALITY OF EDUCATION
- Comparison of bottleneck detection methods for AGV systems
- Simulation test bed for manufacturing analysis: comparison of bottleneck detection methods for AGV systems
- Data-driven approach for diagnostic analysis of dynamic bottlenecks in serial manufacturing systems
- Identification and characteristics analysis of bottlenecks on urban expressways based on floating car data
- Reliable Shop Floor Bottleneck Detection for Flow Lines through Process and Inventory Observations