A hierarchical topology discovery service for IPv6 networks

Astic, Isabelle; Festor, Olivier

doi:10.1109/noms.2002.1015604

Cited by 18 publications

(14 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reference [11] proposes an IPv6-in-IPv4 tunnels identifying method based on pat MTU (Maximum Transfer Unit) discovery mechanism.…”

Section: Tunnel Discovery Modulementioning

confidence: 99%

A new topology discovery solution for IPv4 & IPv6 coexisting networks

Chen¹,

Zhao²,

Ma³

et al. 2010

2010 International Conference on Advanced Intelligence and Awareness Internet (AIAI 2010)

View full text Add to dashboard Cite

An accurate network topology is important to network performance monitoring, configuration management, and fault locating. However, due to the rapid development of network technology, the traditional IPv4 topology discovery method can't satisfy the needs of network management any more. Moreover, many kinds of IPv4&IPv6 transition mechanism deployed in the network bring huge challenge to network topology discovery. Therefore, in this paper, the existing methods of network topology discovery are analyzed firstly, and then an object-oriented distributed model for topology discovery in large-scale and heterogeneous network is presented, which is useful to find out what transition mechanism is deployed in the IPv4&IPv6 coexisting network.

show abstract

“…Reference [11] proposes an IPv6-in-IPv4 tunnels identifying method based on pat MTU (Maximum Transfer Unit) discovery mechanism.…”

Section: Tunnel Discovery Modulementioning

confidence: 99%

A new topology discovery solution for IPv4 & IPv6 coexisting networks

Chen¹,

Zhao²,

Ma³

et al. 2010

2010 International Conference on Advanced Intelligence and Awareness Internet (AIAI 2010)

View full text Add to dashboard Cite

show abstract

“…IPv6 has a different scope-based addressing scheme and a large number of nodes, which means that many of topology discovery techniques used in IPv4 cannot be directly applied to IPv6 environment [1][2][3][4][5]. Astic I from French LORIA laboratory proposed an idea of topology discovery based on hierarchical structure [1]. Although this method has achieved good effect in local area network management, it needs to place one probing in each subnet respectively, which makes the system complex.…”

Section: Introductionmentioning

confidence: 99%

A novel algorithm of IPv6 network topology discovery for Campus Network

Dong

Zhang

et al. 2011

2011 International Conference on Computer Science and Service System (CSSS)

View full text Add to dashboard Cite

Aiming at the limitations of existing methods of IPv6 network topology discovery, this article proposes and implements a novel algorithm of an IPv6-based topology discovery system for the next generation Internet. With the combination of network topology information discovered by general protocols and by routing protocols, the system can discover the IPv6 network effectively not only in accuracy and integrality but also in avoiding alias problem. Besides, much subnet information can be discovered by the system. The system has been tested in the real network environment, which showed the effectiveness and feasibility of this solution.

show abstract

“…Topology affects to very important points such as communication costs, transmission speed, average time delay of the network, etc [1,2]. There are several research works about topology design, both in backbone and local networks [3][4][5]. Regarding local networks, these can be modeled as a backbone node (source node) and several trees that cover all end user nodes to satisfy the constraints of traffic volume [1,2].…”

Section: Introductionmentioning

confidence: 99%

A dandelion-encoded evolutionary algorithm for the delay-constrained capacitated minimum spanning tree problem

Pérez-Bellido

Salcedo‐Sanz

Ortiz-García

et al. 2009

Computer Communications

View full text Add to dashboard Cite

a b s t r a c tThis paper proposes an evolutionary algorithm with Dandelion-encoding to tackle the Delay-Constrained Capacitated Minimum Spanning Tree (DC-CMST) problem. This problem has been recently proposed, and consists of finding several broadcast trees from a source node, jointly considering traffic and delay constraints in trees. A version of the problem in which the source node is also included in the optimization process is considered as well in the paper. The Dandelion code used in the proposed evolutionary algorithm has been recently proposed as an effective way of encoding trees in evolutionary algorithms. Good properties of locality has been reported on this encoding, which makes it very effective to solve problems in which the solutions can be expressed in form of trees. In the paper we describe the main characteristics of the algorithm, the implementation of the Dandelion-encoding to tackled the DC-CMST problem and a modification needed to include the source node in the optimization. In the experimental section of this article we compare the results obtained by our evolutionary with that of a recently proposed heuristic for the DC-CMST, the Least Cost (LC) algorithm. We show that our Dandelion-encoded evolutionary algorithm is able to obtain better results that the LC in all the instances tackled.

show abstract

A hierarchical topology discovery service for IPv6 networks

Cited by 18 publications

References 11 publications

A new topology discovery solution for IPv4 & IPv6 coexisting networks

A new topology discovery solution for IPv4 & IPv6 coexisting networks

A novel algorithm of IPv6 network topology discovery for Campus Network

A dandelion-encoded evolutionary algorithm for the delay-constrained capacitated minimum spanning tree problem

Contact Info

Product

Resources

About