University of California Santa Cruz Constrained Path Computation for Qos Routing
نویسنده
چکیده
Constrained Path Computation For QoS Routing In Computer Networks
منابع مشابه
Finding multi-constrained feasible paths by using depth-first search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in Quality-of-Service (QoS) routing, which is NPComplete when the number of independent routing constraints is more than one. EDFS solves the general kconstrained MCP problem with pseudo-polynomial time complexity O(m2 · E N + N 2), where m is the maximum number of non-dominated paths m...
متن کاملA Distributed Approach For Multi-Constrained Path Selection And Routing Optimization1
Multi-constrained path (MCP) selection, in which the key objective is to search for feasible paths satisfying multiple routing constraints simultaneously, is known to be an NP-Complete problem. Multi-constrained path optimization (MCPO) is different from MCP mainly in that, the feasible paths selected should also be optimal with regard to an optimization metric, which makes path computation in ...
متن کاملAdvanced operations research techniques for multi-constraint QoS routing in internet
Internet Traffic has grown exponentially over last few years due to provision of multiple class services through Internet backbone. With the explosive use of Internet, contemporary Internet routers are susceptible to overloads and their services deteriorate drastically and often cause denial of services. In this paper, an analysis is made how forecasting technique, routing algorithm and Genetic...
متن کاملOn the effectiveness of path pre-computation in reducing the processing cost of on-demand QoS path computation
Quality of Service (QoS) routing algorithms have become the focus of recent research due to their potential for increasing the utilization of an Integrated Services Packet Network (ISPN) that handles requests with QoS requirements. While heuristics for determining paths for such requests have been formulated for a variety of QoS models, little attention has been given to the overall processing ...
متن کاملAn Efficient and Optimized Multi Constrained Path Computation for Real Time Interactive Applications in Packet Switched Networks
between source and destination satisfying the QoS requirements which efficiently using the network resources and underlying routing algorithm and to find low-cost paths that satisfy given QoS constraints. One of the key issues in providing end-to-end QoS guarantees in packet networks is determining feasible path that satisfies a number of QoS constraints. We present a Optimized Multi-Constraine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006