Network Topology Discovery Research Articles

A Framework for Analyzing Anonymous Network Topology

Nowadays, Internet privacy becomes more and more important and sensitive, and has been one of the latest buzz words to hit the Internet world. In response to protect the privacy of Internet users, a variety of privacy enhancing technologies (PETs) have emerged. As one of privacy enhancing technologies, anonymous communication has been extensively studied from various aspects by researchers. Node churn is frequent in anonymous network, which make it difficult to maintain a stable network topology, therefore it is necessary to get more insight into the overall anonymous network topology. In this work, in order to better grasp the present situation of research, we investigate existing organizations and universities which study anonymous communication from the perspective of network topology, and related projects. Then we survey related papers to anonymous communication published in recent years, which focus on the analysis of node selection (especially in the Tor). In addition, we present a framework of anonymous communication network topology, and a visual illustration of this analysis that shows the progression of the research of network topology and node discovery in anonymous communication. Finally, some related problems and follow-up study are presented to be studied deeply in future.

Efficient random walk sampling in distributed networks

Performing random walks in networks is a fundamental primitive that has found numerous applications in communication networks such as token management, load balancing, network topology discovery and construction, search, and peer-to-peer membership management. While several such algorithms are ubiquitous, and use numerous random walk samples, the walks themselves have always been performed naively.In this paper, we focus on the problem of performing random walk sampling efficiently in a distributed network. Given bandwidth constraints, the goal is to minimize the number of rounds and messages required to obtain several random walk samples in a continuous online fashion. We present the first round and message optimal distributed algorithms that present a significant improvement on all previous approaches. The theoretical analysis and comprehensive simulations of our algorithms show that they perform very well in different types of networks of differing topologies.In particular, our results show how several random walks can be performed continuously (when source nodes are provided only at runtime, i.e., online), such that each walk of length ℓ can be performed exactly in just Õ(ℓD) rounds11Throughout this paper, Õ hides polylogarithmic factors in the number of nodes in the network. (where D is the diameter of the network), and O(ℓ) messages. This significantly improves upon both, the naive technique that requires O(ℓ) rounds and O(ℓ) messages, and the sophisticated algorithm of Das Sarma et al. (2013) that has the same round complexity as this paper but requires Ω(mℓ) messages (where m is the number of edges in the network). Our theoretical results are corroborated through extensive simulations on various topological data sets. Our algorithms are fully decentralized, lightweight, and easily implementable, and can serve as building blocks in the design of topologically-aware networks.

Network Topology Discovery Algorithm Based on MIB

Network topology is the core of configuration management and the infrastructure of resource management.And it is based on the detection of a network failure and the analysis of network performance.This requires the network topology complete, accurate and friendly interface with visualization.This article describes the classification of the physical network topology discovery.Based on Bridge-MIB and MIB-II of SNMP devices, designed topology discovery algorithm in data link layer and network layer.Test results show that the algorithm can accurately find the device and connection on the network layer and the data link layer.

Research on Energy-Aware Topology Strategy Based on Wireless Sensor in Internet of Things

AbstractSince the finitude of hardware and network dynamic limit the bandwidth based on wireless sensor in the wireless internet of things (IOT), it is difficult to obtain the network topology information accurately and timely. In this paper, we present an algorithm called Mobile Agent Fuzzy Energy Spanning Tree (MAFEST) for topology discovery and topology control. In the construction of IOT wireless sensor based network topology, the strategy considers the energy consumption of communication between wireless sensors, the uncertainty of agent knowledge and the sensor residual energy. This algorithm can access to the network topology information accurately and timely, and improve the efficiency of network topology discovery.

Methodologies for Network Topology Discovery and Detection of MAC and IP Spoofing Attacks

The sustained growth and innovation of information technologies, combined with the resulting complexity in communication infrastructures, has pushed the network into an increasingly critical role within organizations of all sizes. In order to assure that operations are aligned with the business needs, monitoring and management practices are gaining importance across all network domains. As a result, network managers need the best possible tools for managing the network infrastructure and assuring that it will play its essential part in supporting the organization in a reliable, predictable, efficient and cost-effective manner. This paper proposes several algorithms that will be used on an integrated network monitoring open-source tool: an algorithm for network topology discovery and two algorithms for the detection and blocking of MAC and IP spoofing network attacks. The proposed approaches are based on the SNMP protocol, which is currently supported by most network devices, and the performance tests that were made show that they are effective, reliable and very easy to deploy in real operating scenarios.

Design and Implementation of Network Topology Discovery System Based on OSPF

This paper presents an algorithm of network topology discovery based on OSPF protocol and introduces the implementation. It is different than the traditional topology discovery algorithms which are mostly based on SNMP and ICMP protocols. The test results show that it has made an efficient and useful solution to network topology discovery.

Design and Implementation of Automatic Network Topology Discovery System for International Multi-Domain Future Internet Testbed

In part because of the limitations of the TCP/IP protocols used by the current Internet, the Future Internet has become an attractive network research topic. Recently, several projects focused on the Future Internet have been launched around the globe based on the OpenFlow platform, such as those that are part of the GENI project in the U.S., the OFELIA project of FP7 in the E.U., and the FIRST project in Korea. Because OpenFlow allows researchers to design and develop innovative protocols, it could be applied in different situations for constructing desired network environments. OpenFlow is not limited to single controller environment within a single network domain. It allows network engineers to construct a multi-controller environment across various network domains. In this paper, we design and implement an automatic network topology discovery mechanism based on a multi-controller OpenFlow network. The result has been applied to a large-scale OpenFlow testbed implemented across research institutes at different sites for path-finding and management.

A case for centrally controlled wireless sensor networks

In this article we present the Intelligent, Manageable, Power-Efficient and Reliable Internetworking Architecture (IMPERIA), a centrally managed architecture for large-scale wireless sensor networks (WSNs). We discuss the advantages of a centralized management over distributed approaches and derive our design by rigorously minimizing the amount of state information on individual sensor nodes and all sources of message collision during network operations. The result is a clustered multi-hop TDMA protocol that globally synchronizes the network and collects data at ultra-low power consumption.We present the end-to-end architecture and detail the algorithms we developed for (a) efficient network topology discovery and link quality estimation, (b) combined routing and clustering for pre-defined basestations, and (c) the scheduling of the medium access for multi-cluster and multi-channel data collection.IMPERIA has been implemented on TinyOS and IBM’s Mote Runner and successfully deployed in applications for vibration sensing as well as datacenter energy management. This article summarizes the performance results from simulations, laboratory experiments, and deployment measurements that support our design decisions.

Optimizing Routes using Genetic Algorithms based on Throughput or Delay Sensitivity of Applications using SNMP for Automatic Discovery of Network Topology

Network Applications can be broadly classified as Throughput sensitive or Delay sensitive. Such applications require efficient routing mechanisms in order to work effectively. Genetic Algorithms can be used for defining the Best or Optimal Route based on its sensitivity and Various Constraints that the application imposes usually referred to as Constraint Satisfaction Problems (CSP). The use of Genetic Algorithms for selecting an optimal route based on CSP requires a mechanism for automatic discovery of network topology and also mechanisms for learning the capacity of the network infrastructure. SNMP along with MIB provides the required data for Topology discovery and also to learn the information about the current network capacity along with various bottlenecks present in the topology. Since the shortest path is not always the best path, our genetic algorithm will provide the optimal route based on CSP and application sensitivity.

Geometric algorithms for sensor networks

This paper surveys the use of geometric methods for wireless sensor networks. The close relationship of sensor nodes with their embedded physical space imposes a unique geometric character on such systems. The physical locations of the sensor nodes greatly impact on system design in all aspects, from low-level networking and organization to high-level information processing and applications. This paper reviews work in the past 10 years on topics such as network localization, geometric routing, information discovery, data-centric routing and topology discovery.

ICMP, SNMP: Collaborative Approach to Network Discovery and Monitoring

The algorithm and realization technique of network topology discovery is a very important technical indicator for a network management system’s quality. Based on the knowledge of the network topology discovery theory, the research on ICMP and SNMP programming for Windows, this paper proposes a method of developing the common network topology discovery software which is a conglomerate of ICMP and SNMP protocols so as to monitor a given network and successfully manage it while taking into full advantage of above mentioned protocols.

Road Nail: Experimental Solar Powered Intelligent Road Marking System

Driving in low visibility conditions (night time, fog or heavy precipitation) is particularly challenging task with an increased probability of traffic accidents and possible injuries. Road Nail is a solar powered intelligent road marking system of wirelessly networked signaling devices that improve driver safety in low visibility conditions along hazardous roadways. Nails or signaling devices are autonomous nodes with capability to accumulate energy, exchange wireless messages, detect approaching vehicles and emit signalization light. We have built an experimental test-bed that consists of 20 nodes and a cellular gateway. Implementation details of the above system, including extensive measurements and performance evaluations in realistic field deployments are presented. A novel distributed network topology discovery scheme is proposed which integrates both sensor and wireless communication aspects, where nodes act autonomously. Finally, integration of the Road Nail system with the cellular network and the Internet is described.

A Novel Cluster-Based Protocol for Topology Discovery in Vehicular Ad Hoc Network

This paper presents a novel cluster-based network topology discovery approach for VANET by taking into account both vehicle connectivity and vehicle mobility. It is a fast convergent approach with load balancing to significantly improve the scalability of VANET. The numerical results obtained from both theoretical analysis and simulations have shown that the cost of topology discovery using the proposed approach is only two percent of a typical link state protocol under the same condition. Especially for a large network, the proposed approach is not only able to suppress the increase rate of the total cost when the number of vehicles in the network increases, but it reduces the passive effect of vehicle mobility on control overhead

Discuss the Design Method of Topology Discovery System Based on SNMP

Since the network was born, the network management has been the material effect factor which the computer network develops. Taking the reasonable network topology technology has already become the entire network management foundation,and for the isomerism, diverse and changeable network, the importance of network topology survey discovery is also enhancing. studying the highly effective network topology discovery method has the quite vital significance and the value to guarantee the network effective and safe operation.

Distributed multichannel assignment with congestion control in wireless mesh networks

AbstractIn Multichannel Wireless Mesh Network architecture, topology discovery, traffic profiling, channel assignment and routing are essential. From the existing work done so far, we can observe that no work has been carried out on the combined solution of multichannel assignment with routing protocol and congestion control. In this paper, we propose to design a Distributed Multichannel Assignment with Congestion control (DMAC) routing protocol. In this protocol, a traffic‐aware metric provides the solution for multichannel assignment and congestion control. Hence, the proposed protocol can improve the throughput and channel utilization to a very high extent. The proposed algorithm avoids self‐interference by not assigning a channel to any link whose incident links have already been assigned channels. By our simulation results, we show that our proposed protocol attains high throughput and delivery ratio along with reduced delay. Copyright © 2011 John Wiley & Sons, Ltd.

OLSR-based Topology Discovery for Mobile Situational Awareness Systems

Abstract In this paper, we propose a non-intrusive approach for connectivity visualization of OLSR-based MANET topology based on local topology databases available in an OLSR node. Two different scenarios are considered: a central (full view) topology from a command and control location, or a nodal (partial) view from an ad-hoc node. A simulation based analysis is conducted to calculate total number of active links at a particular time in full and nodal topology views. Also the error rate of network topology discovery based on total undiscovered link both mobile and static scenario is considered and reported in this paper.

SNMP‐based enterprise IP network topology discovery

AbstractPrecise network topology information is required to perform management activities such as fault detection, root cause analysis, performance monitoring, and load balancing in enterprise networks. To accomplish these management tasks, both network discovery and connectivity information are essential. This paper examines various problems with the existing topology discovery mechanisms and proposes an SNMP‐based approach to discover physical as well as logical topology. We present algorithms for identifying network device types and discovering connectivity among them. The connectivity of end host and management information base (MIB)‐enabled devices with switches and routers is discussed and evaluated. We also present an algorithm for discovering logical topology, such as VLAN and subnet connectivity. Finally, we present a combination of graph and tree layouts, to visualize connectivity information. Copyright © 2010 John Wiley & Sons, Ltd.

Modeling the IPv6 internet AS-level topology

To measure the IPv6 internet AS-level topology, a network topology discovery system, called Dolphin, was developed. By comparing the measurement result of Dolphin with that of CAIDA’s Scamper, it was found that the IPv6 Internet at AS level, similar to other complex networks, is also scale-free but the exponent of its degree distribution is 1.2, which is much smaller than that of the IPv4 Internet and most other scale-free networks. In order to explain this feature of IPv6 Internet we argue that the degree exponent is a measure of uniformity of the degree distribution. Then, for the purpose of modeling the networks, we propose a new model based on the two major factors affecting the exponent of the EBA model. It breaks the lower bound of degree exponent which is 2 for most models. To verify the validity of this model, both theoretical and experimental analyses have been carried out. Finally, we demonstrate how this model can be successfully used to reproduce the topology of the IPv6 Internet.

ICMP-based method for logical network topology discovery and analysis

The faults of SNMP-based method for network topology discovery were analyzed.Then an ICMP-based method for logical network discovery and analysis was presented,which included the discovery and analysis of router topology and the analysis of subnet topology.Path probing and alias probing technologies were used in router topology discovery.The IP addresses of router aliases and the relationship of aliases not in identical subnet were used as basis in subnet topology analysis,and a solution was given to the problem of subnet overlapping.

Location privacy and anonymity preserving routing for wireless sensor networks

In a wireless sensor network (WSN), concealing the locations, and in some cases the identities of nodes, especially the controller (sometimes called sink or base station) is an important problem. In this paper, we explain that appropriate solutions for this problem depend on the nature of the traffic generated in the network as well as the capabilities of the adversary that must be resisted. When there is a sufficient amount of data flows (real or fake packets), our proposed DCARPS anonymous routing protocol can support location privacy against a global eavesdropper. Otherwise, it is only possible to stop packet tracing attacks by a local eavesdropper, which is what our probabilistic DCARPS protocol achieves. These protocols are based on label switching, which has not been used in this kind of network before. To enable DCARPS, we propose a new approach for network topology discovery that allows the sink to obtain a global view of the topology without revealing its own location, as opposed to what is common today in sensor networks. In order to resist traffic analysis attacks aiming at locating nodes, we have used layered cryptography to make a packet look randomly different on consecutive links. A stochastic security analysis of this protocol is provided. Another important issue in resource-constrained sensor networks is energy conservation. To this end, our protocols use only modest symmetric cryptography. Also, the sink is responsible for all routing calculations while the sensors only perform simple label swapping actions when forwarding packets. Another advantage of labels is preventing unnecessary cryptographic operations as will be seen in the manuscript. Furthermore, we have embedded a fairness scheme in the creation of the routing tree for the sensor network that distributes the burden of packet forwarding evenly.