Multi-constrained QoS AODV Routing Cross-layer Design
نویسندگان
چکیده
منابع مشابه
Exact Algorithms for Multi-Constrained QoS Routing
The modern network service of finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. gives rise to the multi-path constrained (MCP) or multi-constrained optimal-path (MCOP) QoS routing problems, which are NP-complete. In this paper, these problems are solved through exact algorithms. Even though exact algorithms...
متن کاملMulti-Constrained QoS Routing Issues in High- Speed Multimedia Networks
HighSpeed Multimedia Networks (HSMN) have diverse Quality of Service (QoS) requirements. Designing QoS routing protocols that optimizes multiple QoS requirements is one of the major issues in these networks. Traditional routing algorithms are not adequate to handle QoS requirements of real-time multimedia applications. QoS Routing is defined as finding paths satisfying multiple QoS constraints....
متن کاملPrecomputation for Multi-Constrained QoS Routing in GMPLS Networks
Multi-Constrained QoS routing in GMPLS (generalized multiprotocol label switching) network is to find an optimal path satisfying several constraints, such as bandwidth, cost and delay. The problem has been considered as a NP-Complete problem. Based on SRLG heuristic information, the paper provides a MPAS algorithm (Multi-constrained Precomputation Algorithm with SRLG), which includes the precom...
متن کاملPrecomputation for Multi-constrained QoS Routing in High-speed Networks
As one of the most challenging problems of the next-generation high-speed networks, quality-ofservice routing (QoSR) with multiple (k) constraints is an NP-complete problem. In this paper, we propose a multi-constrained energy functionbased precomputation algorithm, MEFPA. It cares each QoS weight to b degrees, and computes a number (B= 1 2 − − + k k b C ) of coefficient vectors uniformly distr...
متن کاملOptimized Delay Constrained QoS Routing
QoS Routing aims to find paths between senders and receivers satisfying the QoS requirements of the application which efficiently using the network resources and underlying routing algorithm to be able to find low-cost paths that satisfy given QoS constraints. The problem of finding least-cost routing is known to be NP-hard or complete and some algorithms have been proposed to find a near optim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energy Procedia
سال: 2011
ISSN: 1876-6102
DOI: 10.1016/j.egypro.2011.11.050