检索结果-内蒙古大学图书馆

A State-Dependent Time Evolving multi-constraint routing Algorithm

ACM TRANSACTIONS ON AUTONOMOUS AND ADAPTIVE SYSTEMS 2013年第1期8卷 1-21页

作者： Mellouk, Abdelhamid Hoceini, Said Zeadally, Sherali Univ Paris Est Creteil Val Marne IUT CV Network & Telecommun Dept F-94400 Vitry Sur Seine France Univ Dist Columbia Comp Sci & Informat Technol Dept Washington DC USA

This article proposes a state-dependent routing algorithm based on a global optimization cost function whose parameters are learned from the real-time state of the network with no a priori model. The proposed approach samples, estimates, and builds the model of pertinent and important aspects of the network environment such as type of traffic, QoS policies, resources, etc. It is based on the trial/error paradigm combined with swarm-adaptive approaches. The global system uses a model that combines both a stochastic planned prenavigation for the exploration phase with a deterministic approach for the backward phase. We conducted a performance analysis of the proposed algorithm using OPNET based on several topologies such as the Nippon telephone and telegraph network. The simulation results obtained demonstrate substantial performance improvements over traditional routing approaches as well as the benefits of learning approaches for networks with dynamically changing traffic.

关键词： Algorithms routing protocols multi-constraint routing reinforcement learning performance networking

来源：评论

学校读者我要写书评

暂无评论

multi-constraint QoS routing using a new single mixed metrics

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2008年第4期31卷 656-676页

作者： Khadivi, P. Samavi, S. Todd, T. D. Isfahan Univ Technol Dept Elect & Comp Engn Esfahan Iran McMaster Univ Dept Elect & Comp Engn Hamilton ON L8S 4K1 Canada

multi-constraint quality-of-service (QoS) routing has become increasingly important as the Internet evolves to support real-time services. It is well known, however, that optimum multi- constraint QoS routing is computationally complex, and for this reason various heuristics have been proposed for routing in practical situations. Among these methods, those that use a single mixed metric are the most popular. Although mixed metric routing discards potentially useful information, this is compensated for by significant complexity reduction. Exploiting this tradeoff is becoming increasingly important where low complexity designs are desired, such as in battery operated wireless applications. In this paper, novel single mixed metrics for multi-constraint routing arc introduced. The proposed techniques have similar complexity compared with existing low complexity methods. Simulation and analytical results are presented which show that it can obtain better performance than comparable techniques in terms of generating feasible routes. (C) 2007 Elsevier Ltd. All rights reserved.

关键词： QoS routings multi-constraint routing Quality of service computer networks

来源：评论

学校读者我要写书评

暂无评论

multi-constraint multipath QoS routing using Swarm Intelligence 6

Multi-constraint Multipath QoS Routing using Swarm Intellige...

引用

6th International Conference on Computational Intelligence and Communication Networks

作者： Kulhari, Ankur Gandhi, Charu Jaiswal, Anil JIIT Dept CS IT Noida India IIITM Gwalior India

ISBN: (纸本)9781479969296

It is essential for a network to support guaranteed quality-of-service (QoS) for some applications on Internet. Robustness of the network plays an important role to achieve the basic QoS requirements to support real-time applications. Though it has been achieved through various single path routing mechanisms but to provide the robustness and availability to the network, multiple paths have to be selected. A route is selected based on various metrics. Using soft computing techniques capability of deriving multiple paths through a single run can be enabled. In this paper an implementation of particle swarm optimization (PSO), based routing algorithm to get multiple paths satisfying various constraints of QoS parameters is shown. The results are compared with other soft computing techniques like genetic algorithm and ant colony optimization (ACO).

关键词： Genetic algorithm QOS routing multipath multi-constraint routing particle swarm optimization ant colony optimization MURUGA

来源：评论

学校读者我要写书评

暂无评论

About One of the Methods for Solving Problems in QoS routing

About One of the Methods for Solving Problems in QoS Routing

引用

International Siberian Conference on Control and Communications (SIBCON)

作者： Abramkina, Olga A. Shuvalov, Vyacheslav P. SibSUTIS Novosibirsk Russia

ISBN: (纸本)9781467383837

A fundamental problem in QoS (quality-of-service) routing is the multi-constrained path (MCP) problem. The MCP problem used the shortest path with respect to a single edge weighting function as an approximate solution to MCP. For solving MCP problem was offered a lot of methods. One of these methods is based on Lagrangian Relaxation. These algorithms allow finding the shortest paths from the source to the receiving based on metrics with the minimum cost among all possible paths. This new algorithm is a complex mathematical realization, but has the most accurate calculations.

关键词： QoS-routing MCP-problem method of Lagrange Quality of service multi-constraint routing

来源：评论

学校读者我要写书评

暂无评论

Coordinated node and link mapping VNE using a new paths algebra strategy

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2016年 69卷 14-26页

作者： Hesselbach, Xavier Amazonas, Jose Roberto Villanueva, Santi Felipe Botero, Juan Univ Politecn Cataluna Jordi Girona St 31 Barcelona Spain Univ Sao Paulo Escola Politecn BR-05508 Sao Paulo SP Brazil Univ Antioquia St 67 53-10 Medellin Colombia

The main resource allocation research challenge in network virtualization is the Virtual Network Embedding (VNE) Problem. It consists of two stages, usually performed separately: node mapping and link mapping. A new mathematical multi-constraint routing framework for linear and non-linear metrics called "paths algebra" has already been proposed to solve the second stage, providing good results thanks to its flexibility. Unlike existing approaches, paths algebra is able to include any kind of network parameters (linear and non-linear) to solve VNE in reasonable runtime. While paths algebra had only been used to solve one stage (link mapping) of the VNE, this paper suggests an improvement to solve VNE using the paths algebra-based strategy by coordinating, in a single stage, the mapping of nodes and links based on a ranking made of the bi-directional pair of nodes of the substrate network, ordered by their available resources. Simulation results show that the New Paths Algebra-based strategy shows significant performance improvements when compared against the uncoordinated paths Algebra-based link mapping approach. (C) 2016 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY license .

关键词： Network virtualization Virtual network embedding multi-constraint routing Paths algebra

来源：评论

学校读者我要写书评

暂无评论

On achieveing bandwidth-aware LSP/λSP multiplexing/separation in multi-layer networks

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2007年第5期25卷 987-1000页

作者： Bagula, Antoine B. Royal Inst Technol Dept Elect Comp & Software Syst TSLAB Stockholm Sweden Univ Stellenbosch Sch Math Sci Div Comp Sci ZA-7600 Stellenbosch South Africa

We present a new Traffic engineering (TE) model which is based on QoS rerouting and uses hybrid resilience to improve the recovery performance of multi-layer networks where an MPLS network is layered above an MP lambda S network. We formulate the rerouting of the LSPs/lambda SPs as a multi-constrained problem and use its polynomial reduction to find a heuristic solution that can be implemented by standardized constraint-based routing algorithms. This heuristic solution uses a cost-based routing optimization to achieve different network configurations which multiplex/separate bandwidth-aware LSPs/lambda SPs on the network links. We formulate the resilience upon failure as a multi-objective problem consisting of finding a resilience strategy that minimizes recovery operation time and maximizes the LSP/lambda SP restorability. A solution to this problem is proposed where a hybrid resilience framework is used to achieve restoration in the MPLS layer to complement path switching in the MP lambda S layer. We evaluate the performance of the TE model when rerouting the tunnels carrying the traffic offered to a 23- and 31-node networks. Simulation reveals that the hybrid resilience model performs better than classical recovery mechanisms in terms of restorability, quality of rerouting paths and rerouting;stability.

关键词： multi-layer resilience traffic engineering generalized multi-protocol label switching tunnel multiplexing/separation multi-constraint routing multi-objective routing

来源：评论

学校读者我要写书评

暂无评论

A novel paths algebra-based strategy to flexibly solve the link mapping stage of VNE problems

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2013年第6期36卷 1735-1752页

作者： Felipe Botero, Juan Molina, Miguel Hesselbach-Serra, Xavier Roberto Amazonas, Jose Univ Politecn Cataluna Barcelona Spain Univ Sao Paulo Escola Politecn BR-05508 Sao Paulo Brazil

One of the main challenges of network virtualization is the virtual network embedding problem (VNE) that consists of mapping virtual network demands in physical network resources. VNE can be decomposed into two stages: virtual node and virtual link mapping. In the first stage, each virtual node is mapped to a suitable node in the physical network whereas the second stage is in charge of mapping the links connecting virtual nodes to paths in the physical network that suit the virtual network demands. In this paper we propose the utilization of a mathematical multi-constraint routing framework called "paths algebra" to solve the virtual link mapping stage. Paths algebra provides the flexibility to introduce an unlimited number of linear and non-linear constraints and metrics to the problem while finding all the eligible paths in the physical network to perform the virtual link mapping resulting in better and more flexible embeddings. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Network virtualization Virtual network embedding Virtual link mapping multi-constraint routing Paths algebra

来源：评论

学校读者我要写书评

暂无评论

An enhanced algorithm based on paths algebra strategy to solve the VNE problem 34

An enhanced algorithm based on paths algebra strategy to sol...

引用

34th IEEE International Performance, Computing, and Communications Conference (lPCCC)

作者： Wang, Canhui Zhu, Fangjin Zhang, Qijia Shandong Univ Sch Comp Sci & Software Engineer Jinan 250100 Peoples R China

ISBN: (纸本)9781467385909

Network virtualization is widely considered to be one of the main paradigms to solve the Internet ossification problem. One of the most challenging works in this paradigm will be the efficient use of the substrate resources, which is known as virtual network embedding (VNE) problem. The VNE problem is known to be an NP-hard problem which needs some heuristic and approximate algorithms to be solved. In this paper, the VNE is decomposed into two stages: virtual node and virtual link mapping. In the node mapping stage, the breadth first search algorithm is employed to construct loop-free tree for each substrate node, then we explored different hops sufficient capacity of each SN node via the loop-free tree, and analyze the best value of hops that contributes to gain better performance for the algorithm. And the link mapping stage, it can be seen as multi-constraint routing, which is known to be an NP-hard problem. The paths algebra framework was adopted to address this problem, for its convergence for multi-constraint routing problem and a large solution space that the algorithm can gain an enhanced optimization performance.

关键词： network virtualization virtual network embedding sufficient capacity multi-constraint routing paths algebra framework

来源：评论

学校读者我要写书评

暂无评论

About One of the Methods for Solving Problems in QoS routing

About One of the Methods for Solving Problems in QoS Routing

引用

International Siberian Conference on Control and Communications

作者： Olga A. Abramkina Vyacheslav P. Shuvalov SibSUTIS aspirant Novosibirsk Russia SibSUTIS professor Novosibirsk Russia

ISBN: (纸本)9781467383844

A fundamental problem in QoS (quality-of-service) routing is the multi-constrained path (MCP) problem The MCP problem used the shortest path with respect to a single edge weighting function as an approximate solution to MCP. For solving MCP problem was offered a lot of methods. One of these methods is based on Lagrangian Relaxation. These algorithms allow finding the shortest paths from the source to the receiving based on metrics with the minimum cost among all possible paths. This new algorithm is a complex mathematical realization, but has the most accurate calculations.

关键词： QoS-routing MCP-problem method of Lagrange Quality of service multi-constraint routing

来源：评论

学校读者我要写书评

暂无评论

Firefly inspired robust cooperative and secure QoS provisioning framework for vehicular networks in multi-service environment

引用

VEHICULAR COMMUNICATIONS 2022年 34卷

作者： Rajput, Nitin Singh Birla Inst Technol & Sci Dept Comp Sci & Informat Syst Pilani 333031 Rajasthan India Vellore Inst Technol Sch Comp Sci & Engn Vellore 632014 Tamil Nadu India

In this research paper, a framework has been proposed to guarantee Quality-of-Service for vehicular networks, considering an environment where many types of services are simultaneously offered to the users. This proposed framework needs to be robust, cooperative and secure in nature. For having such characteristics in a solution, three modules have been proposed and amalgamated. First module takes care of Quality-of-Services assurance using a multi-constraint Quality-of-Service aware routing algorithm. This routing algorithm involves an innovative use of link-robustness parameter in an improved Firefly algorithm. Second module stimulates cooperation among vehicles using an incentive scheme evolved with the help of game-theoretic concepts like Core and Grand Coalition. It encourages vehicles to participate in network related activities and to obey network protocols. Third and the last module ensures the security of the presented framework by applying an authentication model. Integrated together as a framework, these modules orchestrate a unique and unified solution, probably first of its kind, that guarantees Quality-of-Service and at the same time, stimulates cooperation among vehicles and strengthens the robustness of a relatively secure vehicular network. Results suggest that the Quality-of-Service could be reasonably assured by the proposed framework for different traffic types such as multimedia, voice and background data.& nbsp;(c) 2021 Elsevier Inc. All rights reserved.

关键词： Quality-of-service Firefly algorithm Cooperation in vehicular networks Robust communications multi-constraint routing Security mechanism

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：