An improved approximation algorithm for computing disjoint QoS paths

Peng Chao, Shen Hong

研究成果: Conference contribution同行評審

7 引文 斯高帕斯(Scopus)

摘要

The survivability of a network has assumed great importance in against of losing huge volumes of data due to a link cut or node failure. Recently some scholars have proposed some path restoration schemes which used two disjoint paths with multiple constraints to satisfy both the survivability and the QoS requirements. In this paper we will study the issue of how to identify two paths that satisfy the multiple QoS constraints imposed by network applications. More specifically, we will focus on finding two link-disjoint paths that satisfy the delay constraints at a reasonable total cost. We present two efficient approximation algorithms with provable performance guarantees for this problem.

原文English
主出版物標題Proceedings of the International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies, ICN/ICONS/MCL'06
DOIs
出版狀態Published - 2006
對外發佈
事件International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies, ICN/ICONS/MCL'06 - Morne, Mauritius
持續時間: 23 4月 200629 4月 2006

出版系列

名字Proceedings of the International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies,ICN/ICONS/MCL'06
2006

Conference

ConferenceInternational Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies, ICN/ICONS/MCL'06
國家/地區Mauritius
城市Morne
期間23/04/0629/04/06

指紋

深入研究「An improved approximation algorithm for computing disjoint QoS paths」主題。共同形成了獨特的指紋。

引用此