A New QoS Routing Framework for Solving MCP
スポンサーリンク
概要
- 論文の詳細を見る
Our purpose of Quality-of-Service (QoS) routing is to develop polynomial-time heuristic algorithms to tackle the MCP (multi-constrained-path) problem, which is NP-complete. In this paper, we introduce a new QoS routing heuristic framework, which focuses on how to increase the success ratio for finding a feasible path subject to multiple additive constraints. The key issue of this framework is to transform the single source single destination QoS routing problem to a single source multi-destination problem by expanding the destination vertex to its neighboring vertices. After that, the modified problem can be solved by existing source routing heuristic algorithms. The analysis and simulation results demonstrate that the framework can achieve a higher success ratio of finding a feasible path without increasing the computational complexity by setting the expansion operation properly.
- 社団法人電子情報通信学会の論文
- 2003-02-01
著者
-
Ansari Nirwan
Advanced Networking Laboratory, ECE Department,NJIT
-
Cheng Gang
Advanced Networking Laboratory Department Of Electrical And Computer Engineering Njit
-
Ansari Nirwan
Advanced Networking Laboratory Department Of Electrical And Computer Engineering New Jersey Institut
-
Ansari Nirwan
Advanced Networking Laboratory Department Of Electrical And Computer Engineering Njit
-
Tian Ye
Advanced Networking Laboratory Department Of Electrical And Computer Engineering Njit
関連論文
- アドホックネットワークにおける信頼性を考慮したトポロジ構築に関する検討(アドホックNW)
- 利用可能帯域を考慮したALMツリー構築法の提案(セキュリティ,一般,オーバーレイネットワーク,VPN,DDoS,ネットワークセキュリティ,P2P通信,ネットワークソフトウェア,一般)
- 招待講演 On Tracing and Mitigating Distributed Denial of Service Attacks
- 招待講演 On Tracing and Mitigating Distributed Denial of Service Attacks
- 招待講演 On Tracing and Mitigating Distributed Denial of Service Attacks
- A New QoS Routing Framework for Solving MCP
- Credit-Based Scheduling Algorithms for Input Queued Switch