Precomputation schemes for QoS routing
نویسندگان
چکیده
منابع مشابه
QoS Routing: The Precomputation Perspective
A major algorithmic challenge posed by QoS routing is the need to promptly identify a suitable path upon a connection request, while at the same time ensure that the selected path is satisfactory, both in terms of the connection’s QoS requirements, as well as in terms of the global utilization of network resources. In many practical cases, a precomputation scheme offers a suitable solution to t...
متن کاملQos Routing: the Precomputation Perspective Ý
A major algorithmic challenge posed by QoS routing is the need to promptly identify a suitable path upon a connection request, while at the same time ensure that the selected path is satisfactory, both in terms of the connection’s QoS requirements, as well as in terms of the global utilization of network resources. In many practical cases, a precomputation scheme offers a suitable solution to t...
متن کامل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...
متن کامل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...
متن کاملNovel Precomputation Schemes for Elliptic Curve Cryptosystems
We present an innovative technique to add elliptic curve points with the form P Q ± , and discuss its application to the generation of precomputed tables for the scalar multiplication. Our analysis shows that the proposed schemes offer, to the best of our knowledge, the lowest costs for precomputing points on both single and multiple scalar multiplication and for various elliptic curve forms, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2003
ISSN: 1063-6692
DOI: 10.1109/tnet.2003.815299