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

domain clustering for inter-domain path computation speed-up

NETWORKS 2018年第3期71卷 252-270页

作者： Maggi, Lorenzo Leguay, Jeremie Cohen, Johanne Medagliani, Paolo Huawei Technol Co Ltd Math & Algorithm Sci Lab France Res Ctr Shenzhen Peoples R China Univ Paris SUD Univ Paris Saclay Cent Supelec LRI CNRS Orsay France

We consider a multi-domain network scenario and we study the inter-domain path computation problem under the domain Uniqueness constraint (IDPC-DU), that is, a path cannot visit a domain twice. It is known that hierarchical path computation Element (h-PCE) architecture, that is commonly used to solve IDPC-DU, shows poor scalability with respect to the number of domains. For this reason, we devise a new domain clustering concept allowing one to artificially reduce the number of domains in an offline phase, in order to solve IDPC-DU with lower complexity at run-time. More specifically, we first prove the NP-completeness of the feasibility problem associated with IDPC-DU and the inapproximability of IDPC-DU itself. Yet, we show that the number of domains is the real computational bottleneck for the solution of IDPC-DU. Then we provide a necessary and sufficient condition for a domain clustering to be proper, that is, without loss of optimality. Such a condition can be verified offline on the inter-domain graph. We finally show via numerical experiments the impact of the inter-domain treewidth on the computational speed-up brought by proper clustering.

关键词： domain clustering domain re-entry domain uniqueness hierarchical PCE inter-domain path computation semi-hierarchical PCE

来源：评论

学校读者我要写书评

暂无评论

A multi-population multi-tasking variable neighborhood search algorithm with diversity enhancements for inter-domain path computation problem

引用

SWARM AND EVOLUTIONARY computation 2024年 86卷

作者： Anh, Do Tuan Binh, Huynh Thi Thanh Ha Bang, Ban Thai, Nguyen Duc Ha, Phung Bao Hanoi Univ Sci & Technol Sch Informat & Commun Technol Hanoi Vietnam

In recent years, as networks have become increasingly complex and expansive, network navigation faces new challenges in routing and resource utilization, particularly in the case of multi-domain networks. The interdomain path computation under Node-defined domain Uniqueness Constraint (IDPC-NDU) problem is one of many such scenarios. The problem requires finding the shortest path in a multi-domain network, but it cannot visit any domain twice. Since this is a proven NP-Hard problem, it is reasonable to approach IDPCNDU from a meta-heuristics perspective. By integrating the search prowess of Variable Neighborhood Search (VNS) with the meta-learning capabilities of Multi-population-based Multitasking (MM), this paper proposes a Multi-population multi-tasking VNS (MM-VNS) algorithm to solve the inter-domain path computation under domain Uniqueness constraint (IDPC-DU). In this combination, VNS is used to exploit solution space while meta-learning maintains diversity by transferring knowledge. Numerous experiments performed indicate the proposed approach finds better solutions in comparison with the state-of-the-art metaheuristics in many cases.

关键词： Multi-population multitasking inter-domain path computation Evolutionary algorithm Knowledge transfer

来源：评论

学校读者我要写书评

暂无评论

ADAPTIVE EVOLUTIONARY MULTITASKING TO SOLVE inter-domain path computation UNDER NODE-DEFINED domain UNIQUENESS CONSTRAINT: NEW SOLUTION ENCODING SCHEME

引用

COMPUTING AND INFORMATICS 2023年第1期42卷 98-125页

作者： Dinh, Thanh Pham Tay Bac Univ Fac Nat Sci & Technol Son La Vietnam

In multi-domain networks, the efficiency of path computation becomes more and more important. The inter-domain path computation under Node-defined domain Uniqueness Constraint (IDPC-NDU) is a recently investigated problem where its objective is to determine the effective routing path between two nodes that traverses every domain at most once. IDPC-NDU is NP-Hard, so the approximation approaches are suitable to deal with this problem for large instances. Multifactorial Evolutionary Algorithm (MFEA) is an emerging research topic in the field of evolutionary computation that can efficiently tackle multiple optimization problems at the same time. This study proposed an approach based on the combination of the Adaptive Multifactorial Evolutionary Algorithm (dMFEA-II) and Dijkstra algorithm for solving IDPC-NDU. The encoding and evaluating methods based on the permutation representation are also introduced, and the new individual representation is always to produce valid solutions. The proposed algorithm is evaluated on two types of instances. Simulation results demonstrate the superior performance of the proposed algorithm in comparison with the existing algorithms in terms of the quality of the solution.

关键词： Adaptive multifactorial evolutionary algorithm inter-domain path computation transfer optimization evolutionary multitasking

来源：评论

学校读者我要写书评

暂无评论

Node-depth based Genetic Algorithm to solve inter-domain path computation problem

引用

KNOWLEDGE-BASED SYSTEMS 2024年 284卷

作者： Anh, Do Tuan Binh, Huynh Thi Thanh Kien, Do Luong Long, Nguyen Hoang Dao, Tran Cong Ban, Ha-Bang Hanoi Univ Sci & Technol Sch Informat & Commun Technol Hanoi Vietnam FPT Software AI Ctr Hanoi Vietnam

inter-domain path computation problem under Node-defined domain Uniqueness Constraint (IDPC-NDU) is an NP-Hard problem that applies to packet routing in multi-domain networks, particularly Hierarchical path computation Element (h-PCE) architecture. Its objective is to determine the shortest route between two specified nodes that visit each domain no more than once. In recent years, many proposals have been made to tackle this problem and improve existing algorithms. However, most of these strategies retain a potential weakness that lies in the complex encoding and decoding methods, which consume a lot of computer resources and computation time, especially for large-scale problems. For this reason, this paper introduces an effective Node-depth based Genetic Algorithm (NDEGA) for IDPC-NDU. We propose a novel solution encoding for the problem by using tree representation that helps to satisfy the domain constraint and makes the corresponding solution construction more practical. Instead of conventional encoding techniques, NDEGA is equipped with an improved Node-depth encoding, which is famous for its low time complexity and efficiency for tree problems. Besides, a corresponding decoding method, as well as node-depth search operators, are also well-developed for the problem. To examine the efficiency of NDEGA, we carefully conduct extensive experiments and compare our approach to many competitive baselines on a wide range of synthetic datasets. The empirical results demonstrate that our proposed algorithm significantly outperforms all compared algorithms regarding solution quality, convergence trend, and computation time and obtains the state-of-the-art performance for IDPC-NDU. Notably, our NDEGA achieves 65.17-85.66% solution quality improvement on average compared to the previous approaches while running faster, approximately 50 - 70 times.

关键词： Node-depth encoding Genetic algorithm Evolutionary algorithm inter-domain path computation Multi-domain network

来源：评论

学校读者我要写书评

暂无评论

Enhanced crankback signaling for multi-domain IP/MPLS networks

引用

COMPUTER COMMUNICATIONS 2010年第18期33卷 2215-2223页

作者： Esmaeili, M. Xu, F. Peng, M. Ghani, N. Gumaste, A. Finochietto, J. Univ New Mexico ECE Dept Albuquerque NM 87131 USA Wuhan Univ Sch Comp Wuhan 430072 Hubei Peoples R China Indian Inst Technol CSE Dept Bombay 400076 Maharashtra India Univ Nacl Cordoba Dept Elect RA-5000 Cordoba Argentina

Multi-domain traffic engineering is a very challenging problem area and crankback signaling offers a very promising solutions framework herein. Although some initial crankback studies have been done, there is still significant latitude for improving multi-domain crankback performance. Along these lines, this paper studies realistic IP/MPLS multi-domain networks and proposes a novel solution for joint intra/interdomain signaling crankback. Namely, dynamic intra-domain link-state routing information is coupled with available inter-domain path/distance vector routing state to improve the overall search process. Mechanisms are also introduced to limit crankback overheads and delays. The performance of the proposed solution is then analyzed using simulation and compared against hierarchical inter-domain routing strategies as well as another crankback scheme. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Crankback signaling Multi-domain networks inter-domain path computation

来源：评论

学校读者我要写书评

暂无评论

Reputation for inter-domain QoS Routing 14

Reputation for Inter-Domain QoS Routing

引用

IEEE 14th international Symposium on Network Computing and Applications NCA

作者： Anceaume, Emmanuelle Busnel, Yann Lajoie-Mazenc, Paul Texier, Geraldine IRISA CNRS Rennes France Inria Crest Ensai Rennes France Univ Rennes 1 IRISA Rennes France Telecom Bretagne IRISA Rennes France

ISBN: (纸本)9781509018499

Video traffic, which represents an increasing fraction of the internet traffic, requires end-to-end quality of service (QoS) guarantees for inter-domain routing. However, providing such guarantees remains a challenge essentially because it requires a strong and fair cooperation among the different network operators or Autonomous Systems (ASes), crossed by the traffic. Having a single AS on the path that does not meet its QoS engagement is sufficient to violate the end-to-end QoS guarantees. Unfortunately, the client is not capable of distinguishing unfair ASes from honest ones at the time it selects its path. Reputation mechanisms turn out to be very efficient tools to estimate how trustworthy and reliable entities can be without requiring the help of any central authority. They are effective to foster cooperation by remedying selfishness. In this position paper, we identify the main properties a reputation mechanism should meet to improve inter-domain QoS routing, and we provide a coarsed-grain vision of the design of such a mechanism.

关键词： inter-domain path computation Quality of Service Routing Reputation Mechanism Distributed Systems

来源：评论

学校读者我要写书评

暂无评论

Performance comparison of path computation schemes in multi-domain photonic networks

Performance comparison of path computation schemes in multi-...

引用

16th international Conference on Photonics in Switching

作者： Ogino, N. Nakamura, H. KDDI R&D Labs Inc Fujimino Saitama 3568502 Japan

This paper compares performances in two types of inter-domain path computation schemes, i.e. end-to-end and per-domain schemes. The latter is advantageous under normal traffic loads, while the former is advantageous u... 详细信息

ISBN: (纸本)9781424442287

关键词： inter-domain path computation performance comparison

来源：评论

学校读者我要写书评

暂无评论

Link-Vertex Topology Aggregation for Multi-domain path computation with Hierarchical PCE Architecture

引用

China Communications 2012年第1期9卷 86-91页

作者： Peng Yunfeng Chen Zhen Zhao Changming Wang Zongwei Long Keping University of Science and Technology of Beijing Beijing 100083 P. R. China University of Electronic Science and Technology of China Chengdu 611731 P. R. China

inter-domain path computing is one big issue in multi-domain networks. The Hierarchical path Computing Element (H-PCE) is a semi-central architecture for computing inter-domain path. To facilitate H-PCE in inter-domain path computing, this paper proposed a topology aggregation scheme to abstract the edge nodes and their connected inter-domain link as one vertex to achieve more optimal paths and confidentiality guarantee. The effectiveness of the scheme has been demonstrated on solving wavelength routing in multi-domain Wavelength Division Multiplexing (WDM) network via simulation. Simulation results show that this scheme reduces at least 10% inter-domain blocking probability, compared with the traditional domain-to-the-Node (DtN) scheme.

关键词： routing PCE link-vertex aggregation inter-domain path computation multi-domain network topology aggregation

来源：评论

学校读者我要写书评

暂无评论

SDN-enabled distributed open exchange: Dynamic QoS-path optimization in multi-operator services

引用

COMPUTER NETWORKS 2019年 162卷 106845-000页

作者： Bagci, K. Tolga Tekalp, A. Murat Koc Univ Coll Engn TR-34450 Istanbul Turkey

We propose an SDN-enabled distributed open exchange framework for dynamic optimization of end-to-end (E2E) quality of service (QoS) paths over multi-operator networks, which enables individual network service providers (NSP) to offer inter-operator services with E2E QoS guarantees while allowing each NSP to manage their own network resources. Different from the state of the art, there are no physical internet exchange points in the proposed framework and NSPs are assumed to have direct inter-connections. In the proposed SDN-enabled "virtual" open exchange, the SON controllers of all NSPs directly communicate with each other to advertise a set of QoS-enabled paths across their own network with ask prices, and each NSPs dynamically selects the best E2E price-performance path for its customers by bidding on a subset of these advertised paths, and form E2E paths by concatenating them. The main contributions of this paper are a distributed open exchange framework and a distributed procedure for E2E path computation by collaboration between SDN controllers of multiple NSPs, which is coordinated by the SDN controller of the NSP in which the managed service request originates. The proposed procedure has been verified over a multi-operator SDN environment, emulated by using the Mininet, which includes a controller-to-controller messaging protocol for provisioning multi-operator video services with E2E QoS. (C) 2019 Published by Elsevier B.V.

关键词： Software defined networks (SDN) Multiple service levels End-to-end quality of service Multi-operator SLA negotiation inter-domain path computation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：