Link‐disjoint paths for reliable QoS routing | Zendy

Guo Yuchun | Zendy; Kuipers Fernando | Zendy; Van Mieghem Piet | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Link‐disjoint paths for reliable QoS routing

Author(s) -

Guo Yuchun,

Kuipers Fernando,

Van Mieghem Piet

Publication year - 2003

Publication title -

international journal of communication systems

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.344

H-Index - 49

eISSN - 1099-1131

pISSN - 1074-5351

DOI - 10.1002/dac.612

Subject(s) - computer science , disjoint sets , link (geometry) , routing (electronic design automation) , computer network , quality of service , node (physics) , heuristic , context (archaeology) , distributed computing , mathematics , artificial intelligence , paleontology , structural engineering , engineering , biology , combinatorics

The problem of finding link/node‐disjoint paths between a pair of nodes in a network has received much attention in the past. This problem is fairly well understood when the links in a network are only specified by a single link weight. However, in the context of quality of service routing, links are specified by multiple link weights and restricted by multiple constraints. Unfortunately, the problem of finding link/node disjoint paths in multiple dimensions faces different conceptual problems. This paper presents a first step to understanding these conceptual problems in link‐disjoint quality of service routing and proposes a heuristic link‐disjoint QoS algorithm that circumvents these problems. Copyright © 2003 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research