To see the other types of publications on this topic, follow the link: Network topology discovery.
Dissertations / Theses on the topic 'Network topology discovery'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 22 dissertations / theses for your research on the topic 'Network topology discovery.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Oliveira, Olga Margarida Fajarda. "Network topology discovery." Doctoral thesis, Universidade de Aveiro, 2017. http://hdl.handle.net/10773/18692.
Full textAbstract:
Doutoramento em MatemáticaA monitorização e avaliação do desempenho de uma rede são essenciais para detetar e resolver falhas no seu funcionamento. De modo a conseguir efetuar essa monitorização, e essencial conhecer a topologia da rede, que muitas vezes e desconhecida. Muitas das técnicas usadas para a descoberta da topologia requerem a cooperação de todos os dispositivos de rede, o que devido a questões e políticas de segurança e quase impossível de acontecer. Torna-se assim necessário utilizar técnicas que recolham, passivamente e sem a cooperação de dispositivos intermédios, informação que permita a inferência da topologia da rede. Isto pode ser feito recorrendo a técnicas de tomografia, que usam medições extremo-a-extremo, tais como o atraso sofrido pelos pacotes. Nesta tese usamos métodos de programação linear inteira para resolver o problema de inferir uma topologia de rede usando apenas medições extremo-a-extremo. Apresentamos duas formulações compactas de programação linear inteira mista (MILP) para resolver o problema. Resultados computacionais mostraram que a medida que o número de dispositivos terminais cresce, o tempo que as duas formulações MILP compactas necessitam para resolver o problema, também cresce rapidamente. Consequentemente, elaborámos duas heurísticas com base nos métodos Feasibility Pump e Local ranching. Uma vez que as medidas de atraso têm erros associados, desenvolvemos duas abordagens robustas, um para controlar o número máximo de desvios e outra para reduzir o risco de custo alto. Criámos ainda um sistema que mede os atrasos de pacotes entre computadores de uma rede e apresenta a topologia dessa rede.
Monitoring and evaluating the performance of a network is essential to detect and resolve network failures. In order to achieve this monitoring level, it is essential to know the topology of the network which is often unknown. Many of the techniques used to discover the topology require the cooperation of all network devices, which is almost impossible due to security and policy issues. It is therefore, necessary to use techniques that collect, passively and without the cooperation of intermediate devices, the necessary information to allow the inference of the network topology. This can be done using tomography techniques, which use end-to-end measurements, such as the packet delays. In this thesis, we used some integer linear programming theory and methods to solve the problem of inferring a network topology using only end-to-end measurements. We present two compact mixed integer linear programming (MILP) formulations to solve the problem. Computational results showed that as the number of end-devices grows, the time need by the two compact MILP formulations to solve the problem also grows rapidly. Therefore, we elaborate two heuristics based on the Feasibility Pump and Local Branching method. Since the packet delay measurements have some errors associated, we developed two robust approaches, one to control the maximum number of deviations and the other to reduce the risk of high cost. We also created a system that measures the packet delays between computers on a network and displays the topology of that network.
2
Sigholm, Johan. "Automated Network Node Discovery and Topology Analysis." Thesis, Linköping University, Department of Computer and Information Science, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-10593.
Full textAbstract:
This Master's Thesis describes the design and development of an architecture for automated network node discovery and topology analysis, implemented as an extension to the network management and provisioning system NETadmin. The architecture includes functionality for flexible network model assessment, using a method for versatile comparison between off-line database models and real-world models. These models are populated by current node data collected by network sensors.
The presented architecture supports (1) efficient creation and synchronization of network topology information (2) accurate recognition of new, replaced and upgraded nodes, including rogue nodes that may exhibit malicious behavior, and (3) provides an extension of an existing vendor-neutral enterprise network management and provisioning system.
An evaluation of the implementation shows evidence of accurate discovery and classification of unmatched hosts in a live customer production network with over 400 nodes, and presents data on performance and scalability levels.
The work was carried out at Netadmin System i Sverige AB, in Linköping, Sweden.
3
Spring, Neil Timothy. "Efficient discovery of network topology and routing policy in the Internet /." Thesis, Connect to this title online; UW restricted, 2004. http://hdl.handle.net/1773/6985.
Full text
4
Baltra, Guillermo P. "Efficient strategies for active interface-level network topology discovery." Thesis, Monterey, California: Naval Postgraduate School, 2013. http://hdl.handle.net/10945/37583.
Full textAbstract:
Approved for public release; distribution is unlimitedAs a piece of critical infrastructure, the Internet brings both benefits and security concerns. Recent cyber-security episodes such as route hijacks and Denial-of-Service attacks might have been mitigated and prevented with better knowledge of the network_s logical topology; i.e., router nodes and links. Current production public active mapping systems; e.g., Ark, Rocketfuel, and iPlane, produce valuable inferences of the Internet_s topology, as well as facilitating longitudinal analysis. We examine the extent to which the techniques utilized by these existing systems can be improved, in particular by attempting to reduce their high probing load. Our methodology divides the discovery process into three steps: destination selection, monitor assignment, and stop criterion. We implement and evaluate alternative designs for each step. The complete system runs in real-time on a production system to probe 500 randomly selected Internet subnetworks and gather real-world network maps. As compared to datasets from existing measurement platforms, we find that our method is able to generate 80% of the amount of data with 69% less load.
5
Barthel, Alexander. "Analysis, Implementation and Enhancement of Vendor dependent and independent Layer-2 Network Topology Discovery." Master's thesis, Universitätsbibliothek Chemnitz, 2005. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200500455.
Full textAbstract:
This work shows and implements possibilities of OSI Layer-2 Network Topology Discovery based on information from Cisco Discovery Protocol, Spanning Tree Protocol and Switches' Filtering DatabasesDiese Arbeit zeigt und implementiert Möglichkeiten zur OSI Layer-2 Netzwerk Topologie Erkennung basierend auf Informationen des Cisco Discovery Protocol, Spanning Tree Protocol und Switch Filter Datenbanken
6
Bodvill, Jonatan. "Enterprise network topology discovery based on end-to-end metrics : Logical site discovery in enterprise networks based on application level measurements in peer- to-peer systems." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-227803.
Full textAbstract:
In data intensive applications deployed in enterprise networks, especially applications utilizing peer-to-peer technology, locality is of high importance. Peers should aim to maximize data exchange with other peers where the connectivity is the best. In order to achieve this, locality information must be present which peers can base their decisions on. This information is not trivial to find as there is no readily available global knowledge of which nodes have good connectivity. Having each peer try other peers randomly until it finds good enough partners is costly and lowers the locality of the application until it converges. In this thesis a solution is presented which creates a logical topology of a peer-to-peer network, grouping peers into clusters based on their connectivity metrics. This can then be used to aid the peer-to-peer partner selection algorithm to allow for intelligent partner selection. A graph model of the system is created, where peers in the system are modelled as vertices and connections between peers are modelled as edges, with a weight in relation to the quality of the connection. The problem is then modelled as a weighted graph clustering problem which is a well-researched problem with a lot of published work tied to it. State-of-the-art graph community detection algorithms are researched, selected depending on factors such as performance and scalability, optimized for the current purpose and implemented. The results of running the algorithms on the streaming data are evaluated against known information. The results show that unsupervised graph community detection algorithm creates useful insights into networks connectivity structure and can be used in peer-to-peer contexts to find the best partners to exchange data with.I dataintensiva applikationer i företagsnätverk, speciellt applikationer som använder sig av peer-to-peer teknologi, är lokalitet viktigt. Klienter bör försöka maximera datautbyte med andra klienter där nätverkskopplingen är som bäst. För att klienterna ska kunna göra sådana val måste information om vilka klienter som befinner sig vara vara tillgänglig som klienterna kan basera sina val på. Denna information är inte trivial att framställa då det inte finns någon färdig global information om vilka klienter som har bra uppkoppling med andra klienter och att låta varje klient prova sig fram blint tills de hittar de bästa partnerna är kostsamt och sänker applikationens lokalitet innan den konvergerar. I denna rapport presenteras en lösning som skapar en logisk vy över ett peer-to-peer nätverk, vilken grupperar klienter i kluster baserat på deras uppkopplingskvalitet. Denna vy kan sedan användas för att förbättra lokaliteten i peerto-peer applikationen. En grafmodell av systemet skapas, där klienter modelleras som hörn och kopplingar mellan klienter modelleras som kanter med en vikt i relation till uppkopplingskvaliteten. Problemet formuleras sedan som ett riktat grafklusterproblem vilket är ett väldokumenterat forskningsområde med mycket arbete publicerat kring. De mest framstående grafklusteralgoritmerna är sedan studerade, utvalda baserat på kravspecifikationer, optimerade för det aktuella problemet och implementerade. Resultaten som produceras av att algoritmerna körs på strömdata är evaluerade mot känd information. Resultaten visar att oövervakade grafklusteralgoritmer skapar användbar information kring nätverkens uppkopplingsstruktur och kan användas i peer-to-peerapplikationssammanhang för att hitta de bästa partnerna att utbyta data med.
7
Jovanovic, Mihajlo A. "Modeling Large-scale Peer-to-Peer Networks and a Case Study of Gnutella." University of Cincinnati / OhioLINK, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin989967592.
Full text
8
Mallery, Christopher Jerry. "Location and topology discovery in wireless sensor networks." Pullman, Wash. : Washington State University, 2009. http://www.dissertations.wsu.edu/Dissertations/Spring2009/c_mallery_1050509.pdf.
Full textAbstract:
Thesis (Ph. D.)--Washington State University, May 2009.Title from PDF title page (viewed on June 15, 2009). "School of Electrical Engineering and Computer Science." Includes bibliographical references (p. 108-117).
9
Kandoi, Rajat. "Deploying Software-Defined Networks: a Telco Perspective." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-172354.
Full textAbstract:
Software-De_ned Networking (SDN) proposes a new network architecture inwhich the control plane and forwarding plane are decoupled. SDN can improvenetwork e_ciency and ease of management through the centralization of the controland policy decisions. However, SDN deployments are currently limited todata-center and experimental environments. This thesis surveys the deploymentof SDN from the perspective of a telecommunication network operator. We discussthe strategies which enable the operator to migrate to a network in whichboth SDN and legacy devices interoperate. As a synthesis of existing technologiesand protocols, we formulate an automated process for the bootstrapping of newlydeployed forwarding devices. Furthermore, we review solutions for programmingthe forwarding devices and for performing topology discovery. The functionalcorrectness of the proposed bootstrapping process is evaluated in an emulatedenvironment.
10
Gonzalez, Valenzuela Sergio. "A service-oriented approach to topology formation and resource discovery in wireless ad-hoc networks." Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/745.
Full textAbstract:
The past few years have witnessed a significant evolution in mobile computing and communications, in which new trends and applications have the traditional role of computer networks into that of distributed service providers. In this thesis we explore an alternative way to form wireless ad-hoc networks whose topologies can be customized as required by the users’ software applications. In particular, we investigate the applicability of mobile codes to networks created by devices equipped with Bluetooth technology. Computer simulations results suggest that our proposed approach can achieve this task effectively, while matching the level of efficiency seen in other salient proposals in this area.
This thesis also addresses the issue of service discovery in mobile ad-hoc networks. We propose the use of a directory whose network location varies in an attempt to reduce traffic overhead driven by users’ hosts looking for service information. We refer to this scheme as the Service Directory Placement Algorithm, or SDPA. We formulate the directory relocation problem as a Markov Decision Process that is solved by using Q-learning. Performance evaluations through computer simulations reveal bandwidth overhead reductions that range between 40% and 48% when compared with a basic broadcast flooding approach for networks comprising hosts moving at pedestrian speeds. We then extend our proposed approach and introduce a multi-directory service discovery system called the Service Directory Placement Protocol, or SDPP. Our findings reveal bandwidth overhead reductions typically ranging from 15% to 75% in networks comprising slow-moving hosts with restricted memory availability.
In the fourth and final part of this work, we present the design foundations and architecture of a middleware system that called WISEMAN – WIreless Sensors Employing Mobile Agents. We employ WISEMAN for dispatching and processing mobile programs in Wireless Sensor Networks (WSNs). Our proposed system enables the dynamic creation of semantic relationships between network nodes that cooperate to provide an aggregate service. We present discussions on the advantages of our proposed approach, and in particular, how WISEMAN facilitates the realization of service-oriented tasks in WSNs.
11
Ochoa, Aday Leonardo. "Contributions to topology discovery, self-healing and VNF placement in software-defined and virtualized networks." Doctoral thesis, Universitat Politècnica de Catalunya, 2019. http://hdl.handle.net/10803/665397.
Full textAbstract:
The evolution of information and communication technologies (e.g. cloud computing, the Internet of Things (IoT) and 5G, among others) has enabled a large market of applications and network services for a massive number of users connected to the Internet. Achieving high programmability while decreasing complexity and costs has become an essential aim of networking research due to the ever-increasing pressure generated by these applications and services. However, meeting these goals is an almost impossible task using traditional IP networks.
Software-Defined Networking (SDN) is an emerging network architecture that could address the needs of service providers and network operators. This new technology consists in decoupling the control plane from the data plane, enabling the centralization of control functions on a concentrated or distributed platform. It also creates an abstraction between the network infrastructure and network applications, which allows for designing more flexible and programmable networks. Recent trends of increased user demands, the explosion of Internet traffic and diverse service requirements have further driven the interest in the potential capabilities of SDN to enable the introduction of new protocols and traffic management models.
This doctoral research is focused on improving high-level policies and control strategies, which are becoming increasingly important given the limitations of current solutions for large-scale SDN environments. Specifically, the three largest challenges addressed in the development of this thesis are related to the processes of topology discovery, fault recovery and Virtual Network Function (VNF) placement in software-defined and virtualized networks. These challenges led to the design of a set of effective techniques, ranging from network protocols to optimal and heuristic algorithms, intended to solve existing problems and contribute to the deployment and adoption of such programmable networks.For the first challenge, this work presents a novel protocol that, unlike existing approaches, enables a distributed layer 2 discovery without the need for previous IP configurations or controller knowledge of the network. By using this mechanism, the SDN controller can discover the network view without incurring scalability issues, while taking advantage of the shortest control paths toward each switch. Moreover, this novel approach achieves noticeable improvement with respect to state-of-the-art techniques.
To address the resilience concern of SDN, we propose a self-healing mechanism that recovers the control plane connectivity in SDN-managed environments without overburdening the controller performance. The main idea underlying this proposal is to enable real-time recovery of control paths in the face of failures without the intervention of a controller. Obtained results show that the proposed approach recovers the control topology efficiently in terms of time and message load over a wide range of generated networks.
The third contribution made in this thesis combines topology knowledge with bin packing techniques in order to efficiently place the required VNF. An online heuristic algorithm with low-complexity was developed as a suitable solution for dynamic infrastructures. Extensive simulations, using network topologies representative of different scales, validate the good performance of the proposed approaches regarding the number of required instances and the delay among deployed functions. Additionally, the proposed heuristic algorithm improves the execution times by a fifth order of magnitude compared to the optimal formulation of this problem.
12
Costa, Fábio Rafael Azevedo. "Internet tomography : network topology discovery and network performance evaluation." Master's thesis, 2013. http://hdl.handle.net/1822/27830.
Full textAbstract:
Disertação de mestrado em Redes e Serviços de ComunicaçãoDue to the security threats and complexity of network services, such as video conferencing, internet telephony or online gaming, which require high QoS guarantees, the need for monitoring and evaluating network performance, in order to promptly detect and face security threats and malfunctions, is crucial to the correct operation of networks and network-based services. As the internet evolves in size and diversity, these tasks become difficult and demanding. Moreover, administrative limitations can restrict the position and the scope of the links to be monitored, while legislation imposes limitations on the information that can be collected and exported for monitoring purposes and almost all organization can't monitor or have knowledge or evaluate the performance of the entire network. They only can do this to part of the network, which corresponds to their own network. In this thesis, we propose the use of tomographic techniques for network topology discovery and performance evaluation. Network tomography studies the internal characteristics of the network using end-to-end probes, ie, it does not need the cooperation of the internal nodes of the network and can be successfully adopted in almost all scenarios. Thus, it is possible to have knowledge of the network characteristics out of the administrative borders. In this thesis we propose a new approach to Probe Packet Sandwich, where we use TTL-limited probes to infer the delay of a path hop-by-hop. We have shown that this approach is more effective than existing ones. This work was developed under the ERASMUS student mobility program, in the Telecommunication Networks Research Group, Dept. of Information Engineering, University of Pisa.
Devido às ameaças de segurança e complexidade dos serviços de rede, tais como videoconferência, telefonia via Internet ou jogos on-line, que exigem altas garantias de QoS, a necessidade de monotorização e avaliação de desempenho da rede, a fim de detectar prontamente e enfrentar as ameaças de segurança e mau funcionamento, é crucial para o correto funcionamento das redes e serviços baseados em rede. À medida que a Internet evolui em tamanho e diversidade, essas tarefas tornam-se difíceis e exigentes. Além disso, as limitações administrativas podem restringir a posição e o alcance dos links a serem monitorizados, enquanto a legislação impõe limitações sobre as informações que podem ser coletadas e exportadas para fins de monotorização e quase todas as organizações não podem controlar ou ter conhecimento ou avaliar o desempenho de toda a rede. Eles só podem fazer isso a parte da rede, o que corresponde à sua própria rede. Neste trabalho, nós propomos o uso de técnicas tomográficas para a descoberta da topologia da rede e avaliação de desempenho. A tomografia de rede estuda as características internas da rede usando medições fim-a-fim, ou seja, não necessita da ajuda dos nós internos da rede, podendo ser adoptadas com sucesso em quase todos os cenários. Desta maneira é possível obter conhecimento das características da rede para além dos limites administrativos. Neste tranalho propomos uma nova abordagem do Packet Sandwich Probe, onde utilizamos pacotes TTL-Limited para inferir o delay de um path hop-by-hop. Nós mostramos que esta abordagem é mais eficaz que outras já existentes. Este trabalho foi desenvolvido no âmbito do programa de mobilidade de estudantes ERASMUS, no Grupo de Investigação em Redes de Telecomunicações, Departamento de Engenharia de Informação da Universidade de Pisa.
13
Delport, Johannes Petrus. "Link layer topology discovery in an uncooperative ethernet environment." Diss., 2008. http://hdl.handle.net/2263/27589.
Full textAbstract:
Knowledge of a network’s entities and the physical connections between them, a network’s physical topology, can be useful in a variety of network scenarios and applications. Administrators can use topology information for fault- finding, inventorying and network planning. Topology information can also be used during protocol and routing algorithm development, for performance prediction and as a basis for accurate network simulations. Specifically, from a network security perspective, threat detection, network monitoring, network access control and forensic investigations can benefit from accurate network topology information. The dynamic nature of large networks has led to the development of various automatic topology discovery techniques, but these techniques have mainly focused on cooperative network environments where network elements can be queried for topology related information. The primary objective of this study is to develop techniques for discovering the physical topology of an Ethernet network without the assistance of the network’s elements. This dissertation describes the experiments performed and the techniques developed in order to identify network nodes and the connections between these nodes. The product of the investigation was the formulation of an algorithm and heuristic that, in combination with measurement techniques, can be used for inferring the physical topology of a target network.Dissertation (MSc)--University of Pretoria, 2008.
Computer Science
unrestricted
14
Du, Ming Bin, and 杜明斌. "A Study of the Network Management System: Network Topology Discovery." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/90951518664996726352.
Full textAbstract:
碩士中原大學
資訊工程研究所
82
From a network manager's point of view, to discover topology of Internet is the foundation for the network management. A network topology refers to the relationships between entities in a network. The optimization problem of Network Topology Discovery type I (NTD type I) is to minimize accessing operations to discover the network topology, where every agent maintains pure topology- information, and the manager can access one record per operation. The optimization problem of Network Topology Discovery type II (NTD type II) is to minimize the accessed agent, with minimal accessing operations simultaneously, where every agent maintains mixed topology- information, and the manager can access one or more records per operation. We prove that both the problems are NP-complete, and have to be solved on-line. The problems of NTD type I/II is mapped into an on-line graph problem called On-line Weighted Vertex Cover. The approximation algorithms we proposed guarantee a performance ratio of O(log D), and can be delivered in O(n^2) where n is the number of vertices, and D is the maximal degree of graph. Our experiment shows they outperform other reported off-line heuristics. We present the algorithms of NTD type I/II by SNMP and MIB-II, and can discover the topology of TCP/IP network in exterior-gateway and interior- gateway level.
15
Lai, Hsin-Liang, and 賴信良. "Automatic Link Layer Topology Discovery of IP Network." Thesis, 1999. http://ndltd.ncl.edu.tw/handle/97924561321417414869.
Full textAbstract:
碩士國立清華大學
資訊工程學系
87
Network topology information is useful for network administration and planning. Techniques for automatic generation of the network layer topology maps of IP networks can be found in [2,3,7]. The devices in a subnet can be found using a network layer topology discovery tool. However, the link layer topology of the subnet can not be obtained by a network layer topology discovery tool. An algorithm for automatic discovery of the link layer topology of an IP subnet is proposed in this paper. The algorithm uses the link layer topology configuration information obtained from various sources including the MIBs in routers, bridges, and switches, the Internet Control Message Protocol (ICMP), the Domain Name System (DNS), and etc. to produce the link layer topology map. The proposed link layer topology discovery algorithm has been implemented based on the Tcl/Tk [4,5,6] and Scotty [8] environment.
16
Gunes, Mehmet Hadi. "Complex network discovery : Router-Level internet topology mapping /." 2008. http://proquest.umi.com/pqdweb?did=1597608471&sid=2&Fmt=2&clientId=10361&RQT=309&VName=PQD.
Full text
17
Islam, Z. M. Faizul. "OLSR-based network discovery in situational awareness system for tactical MANETs." Thesis, 2012. http://hdl.handle.net/10155/211.
Full textAbstract:
In this thesis, we propose a high level design for connectivity visualization of OLSRbased
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. We
also come up with an analytical model to analyse the network bandwidth and overhead of
using TC, HELLO and custom NIM message to evaluate the performance of centralized
visualization to build full map of the network with respect to situational awareness
system. This thesis also presents a multi-node, 2-dimensional, distributed technique for
coarse (approximate) localization of the nodes in a tactical mobile ad hoc network. The
objective of this work is to provide coarse localization information based on layer-3
connectivity information and a few anchor nodes or landmarks, and without using
traditional methods such as signal strength, Time of Arrival (ToA) or distance
information. We propose a localization algorithm based on a Force-directed method that
will allow us to estimate the approximate location of each node based on network
topology information from a local OLSR database. We assume the majority of nodes are
not equipped with GPS and thus do not have their exact location information. In our
proposed approach we make use of the possible existence of known landmarks as
reference points to enhance the accuracy of localization.UOIT
18
Li, Chen-Tai, and 李成泰. "The Implement of Repository-Based TCP/IP Network Topology Discovery and Management System." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/94983649322492890798.
Full textAbstract:
碩士輔仁大學
資訊管理學系
88
As the repaid development of network technology, the computer environment becomes more and more complexity. In order to keep network performance in normal operation, the integrated network management system is the most important tool. The general scope of network management consists of from managing any kind of network systems and devices of a network to the configuration management of a local area network in the enterprise and the performance management of a network connecting to the Internet. We propose a network fault management expert system, it includes three parts: network topology discovery and management system(NTMS), distributed network traffic flow collection and analytic system(DNTS), and distributed network fault management system(DNFS). The NTMS discoveries, records, and manages the devices residing in a network, and then uses graphic user interface to display the network topology, so that a network manager can monitor the network status and manage the network. The DNTS collects and analyzes the traffic flow in the network,and then generate alarm for the DNFS to analyze the fault events of the network. The DNFS analyzes the alarms, infers network fault events, and gives solution or suggestion to solve the problems raised in the network. It uses cased-based reasoning to increase the knowledge base. It also has self-learning capability to adapt more and more complicate network environments in the future. Many network management systems send ICMP packets to identify an alive device in a netowrk and what kind of the device is. Through this way, they find out the relationship of connectity of the devices and analyze the network topology. We propose another suggestion through the inofrmatoion provided in management information base (MIB) in a network device to analyze the network topology. The topology interface can be used to manage the network. We implement this system in Java language and test this system in the Fu-Jen University campus network. Our system also compares with other famous network management tools. The result shows that our system has the advantage over most of similar products in network fault management with providing history information. Our system has the same network topology output as that provided by other tools, but the GUI is not good enough. We are going to enhance it in the future.
19
Lehman, Li-wei, and Steven Lerman. "PALM: Predicting Internet Network Distances Using Peer-to-Peer Measurements." 2003. http://hdl.handle.net/1721.1/3965.
Full textAbstract:
Landmark-based architecture has been commonly adopted in the networking community as a mechanism to measure and characterize a host's location on the Internet. In most existing landmark based approaches, end hosts use the distance measurements to a common, fixed set of landmarks to derive an estimated location on the Internet. This paper investigates whether it is possible for participating peer nodes in an overlay network to collaboratively construct an accurate geometric model of its topology in a completely decentralized peer-to-peer fashion, without using a fixed set of landmarks. We call such a peer-to-peer approach in topology discovery and modeling using landmarks PALM (Peers As LandMarks). We evaluate the performance characteristics of such a decentralized coordinates-based approach under several factors, including dimensionality of the geometric space, peer distance distribution, and the number of peer-to-peer distance measurements used. We evaluate two PALM-based schemes: RAND-PALM and ISLAND. In RAND-PALM, a peer node randomly selects from existing peer nodes as its landmarks. In ISLAND (Intelligent Selection of Landmarks), each peer node selects its landmarks by exploiting the topological information derived based on existing peer nodes' coordinates values.Singapore-MIT Alliance (SMA)
20
Yi-Fan, Wang, and 王逸凡. "Web-based Distributed Topology Discovery of IP Networks." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/12994234894823231292.
Full text
21
Chan, Tung-Lung, and 詹東隆. "Cross-Layer Topology Discovery Algorithm in IP-Based Networks." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/31537764475800237995.
Full textAbstract:
碩士佛光大學
資訊學系
99
The current progress of network technique and the complication of network structure make administrators must spend more time and mind to maintain the system and the network under normal operation. With continuously increasing dependence on the network, it seems to be a knotty matter to know how to effectively manage all equipments on the network and to make sure they whether run it rightly or not. To make a comprehensive survey of present administrator’s management mode, administrators have to quite understand themselves rule network’s each equipmental IP and the entire topology structure to rapidly and efficiently tend more and more complicated network environment, which work fine in most small-scale network environments, but not in slightly large-scale enironments that reveal the vitalness of leading into automation management to relieve the burden of administrator towards network management. This essay’s presenting an ACLTD Algorithm (Automatic Cross-Layer Topology Discovery) that can work on network layer and data-link layer based on Simple Network Management Protocol (SNMP) that is widely used by each network administrator nowadays. It can be automatic exploration through random knotted dot, and possesses the feature of cross-layer and multiple protocols to support exploration of heterogeneous network, possesses quicker and more effective explorative ability of topology resource. The implement way will rely on the standard of the mutual communicative protocol to automatically discover the entire network topology and all network equipped link dot from integration to open source code’s network-managed system to prove the ACLTD Algorithm is effective.
22
Ye, Chen-Shin, and 葉陳欣. "Automatic Topology Discovery and Virtual Connection Trace for ATM Networks Using SNMP." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/15783124447445256618.
Full textAbstract:
碩士國立清華大學
資訊工程學系
86
The topology of an ATM network is referred to as the map of the network consisting of the devices in the network and the connections among them. Network topology information is useful for network administration and planning.Entering the network topology information manually is a tedious task if the number of network devices is large. Therefore, a tool for generating the network topology automatically is desirable. In ATMnetworks, the value of VPI and VCI have only local significance. It does notexplicitly reveal information about the source, destination, and path of thevirtual onnection. The source, destination, and path for a virtual connection can be found by tracing the VPIs and VCIs in the atm switches.In this paper, algorithms for discovering the topologies of ATM networks and tracing the paths of virtual connections automaticallyusing the Simple Network Management Protocol (SNMP) are proposed.