Relevant bibliographies by topics / Network topology discovery

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Network topology discovery'

Author: Grafiati
Published: 4 June 2021
Last updated: 12 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Network topology discovery"

1

Jian, Feng, and Zhu Li. "WebNMS-Based Topology Discovery in EPON Network." International Journal of Future Generation Communication and Networking 6, no. 6 (December 31, 2013): 161–68. http://dx.doi.org/10.14257/ijfgcn.2013.6.6.17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

FU, Hua Sen. "Practical Enhanced Topology Discovery Algorithm for MANET." Advanced Materials Research 760-762 (September 2013): 599–606. http://dx.doi.org/10.4028/www.scientific.net/amr.760-762.599.

Full text
Abstract:
In order to effectively manage the communication nodes in Mobile Ad Hoc Network (MANET), it is important to know the topology of such networks. Traditional Ad-hoc On-demand Distance Vector (AODV) protocol can not get the MANET topology due to the lack of the topology discovery mechanism. Aiming at this problem, an enhanced topology discovery algorithm based on AODV (AODV-TD) is proposed. AODV-TD can not only obtain the topology of dynamic network by topology discovery request, but also realize route discovery among nodes. Finally, the proposed algorithm is implemented on a hardware platform using CC1100, and the experiment results show that, even the network changes dynamically, AODV-TD can still discover the network topology rapidly and accurately, so that contribute to reducing the route discovery time and the RREQ forwarding packets.
APA, Harvard, Vancouver, ISO, and other styles
3

Ge, Jian Xia, and Wen Ya Xiao. "Network Layer Network Topology Discovery Algorithm Research." Applied Mechanics and Materials 347-350 (August 2013): 2071–76. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.2071.

Full text
Abstract:
Along with the development of the network information age, people on the dependence of the computer network is more and more high, the computer network itself the security and reliability of becomes very important, the network management put forward higher request. This paper analyzes two algorithms of the network layer topology discovery based on the SNMP and ICMP protocol, based on this, this paper puts forward a improved algorithm of the comprehensive two algorithm, and makes the discovery process that has a simple, efficient, and has a strong generalization, and solved in the discovery process met the subnet judge, multiple access routers identification.
APA, Harvard, Vancouver, ISO, and other styles
4

Ge, Jian Xia, and Wen Ya Xiao. "Network Layer Network Topology Discovery Algorithm Research." Applied Mechanics and Materials 380-384 (August 2013): 1327–32. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.1327.

Full text
Abstract:
Along with the development of the network information age, people on the dependence of the computer network is more and more high, the computer network itself the security and reliability of becomes very important, the network management put forward higher request. This paper analyzes two algorithms of the network layer topology discovery based on the SNMP and ICMP protocol, based on this, this paper puts forward a improved algorithm of the comprehensive two algorithm, and makes the discovery process that has a simple, efficient, and has a strong generalization, and solved in the discovery process met the subnet judge, multiple access routers identification.
APA, Harvard, Vancouver, ISO, and other styles
5

Zhao, Ruiqin, Yuan Liu, Octavia A. Dobre, Haiyan Wang, and Xiaohong Shen. "An Efficient Topology Discovery Protocol with Node ID Assignment Based on Layered Model for Underwater Acoustic Networks." Sensors 20, no. 22 (November 18, 2020): 6601. http://dx.doi.org/10.3390/s20226601.

Full text
Abstract:
Underwater acoustic networks are widely used in survey missions and environmental monitoring. When an underwater acoustic network (UAN) is deployed in a marine region or two UANs merge, each node hardly knows the entire network and may not have a unique node ID. Therefore, a network topology discovery protocol that can complete node discovery, link discovery, and node ID assignment are necessary and important. Considering the limited node energy and long propagation delay in UANs, it is challenging to obtain the network topology with reduced overheads and a short delay in this initial network state. In this paper, an efficient topology discovery protocol (ETDP) is proposed to achieve adaptive node ID assignment and topology discovery simultaneously. To avoiding packet collision in this initial network state, ETDP controls the transmission of topology discovery (TD) packets, based on a local timer, and divides the network into different layers to make nodes transmit TD packets orderly. Exploiting the received TD packets, each node could obtain the network topology and assign its node ID independently. Simulation results show that ETDP completes network topology discovery for all nodes in the network with significantly reduced energy consumption and short delay; meanwhile, it assigns the shortest unique IDs to all nodes with reduced overheads.
APA, Harvard, Vancouver, ISO, and other styles
6

Wazirali, Raniyah, Rami Ahmad, and Suheib Alhiyari. "SDN-OpenFlow Topology Discovery: An Overview of Performance Issues." Applied Sciences 11, no. 15 (July 29, 2021): 6999. http://dx.doi.org/10.3390/app11156999.

Full text
Abstract:
Software-defined networking (SDN) is an innovative architecture that separates the control plane from the data plane to simplify and speed up the management of large networks. This means the control logic has been moved from the network hardware level to the centralized control management level. Therefore, the use of the OpenFlow Discovery Protocol (OFDP) is one of the most common protocols used to discover the network topology in a data plane and then transmit it to the control plane for management. However, OFDP has various shortcomings in its performance such as exchanging too many messages between both levels (control and data), which in turn increases the load on the SDN-Controller. Additionally, since the application layer depends entirely on the network topologies plotted in the control plane, it is very important to obtain accurate network topology information from data plane. Therefore, after providing background on topology discovery protocols to the reader, we will concentrate on performance issues. The present study identifies and discuss the primary concerns involved in the complex query process, infrastructure, influencing factors, and challenges for the topology discovery process. Furthermore, this paper will present several recent studies that have overcome and enhanced these issues. In addition, open discussion and future work concerning these issues are also discussed.
APA, Harvard, Vancouver, ISO, and other styles
7

He, Hui, Chi Xin Li, and Cheng Ying Gong. "Network Topology Discovery Algorithm Based on MIB." Applied Mechanics and Materials 496-500 (January 2014): 2134–37. http://dx.doi.org/10.4028/www.scientific.net/amm.496-500.2134.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
8

Wenxing, Liao, Shi Xiaofei, and Chen Xinying. "The impacts of weak links on topology discovery process in large-scale wireless multi-hop networks." International Journal of Distributed Sensor Networks 16, no. 11 (November 2020): 155014772097452. http://dx.doi.org/10.1177/1550147720974526.

Full text
Abstract:
In wireless multi-hop networks, especially large-scale wireless multi-hop networks, obtaining the network topology is of vital significance. In fact, in both proactive and reactive routing protocols, before establishing an appropriate end-to-end route, the source node needs to obtain the global or local topology. Our previous research has studied the impacts of weak links on reactive routing protocols, which can also be considered as local topology discovery process. In this article, in order to get insight of the impacts of weak links on topology discovery process, especially the global topology discovery on which the proactive routing protocols rely, we apply a Markov chain to model the most common used topology discovery process in large-scale wireless multi-hop networks. Considering the fading characteristics of wireless channel, we analyze the impacts of weak links on topology discovery algorithms. Simulation and theoretical results show that, with the increase in the network scale, the weak links have great impacts on the stability and even on the feasibility of wireless multi-hop networks.
APA, Harvard, Vancouver, ISO, and other styles
9

LIAO chunsheng. "Complex Network Based Computer Network Topology Discovery Optimization Algorithm." Journal of Convergence Information Technology 8, no. 9 (May 15, 2013): 348–55. http://dx.doi.org/10.4156/jcit.vol8.issue9.44.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Song, Shan Wang, and Ming-tian Zhou. "A New Physical Network Topology Discovery Algorithm." JOURNAL OF ELECTRONICS INFORMATION & TECHNOLOGY 2010, no. 1 (February 8, 2010): 172–77. http://dx.doi.org/10.3724/sp.j.1146.2008.01783.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Network topology discovery"

1

Oliveira, Olga Margarida Fajarda. "Network topology discovery." Doctoral thesis, Universidade de Aveiro, 2017. http://hdl.handle.net/10773/18692.

Full text
Abstract:
Doutoramento em Matemática
A 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.
APA, Harvard, Vancouver, ISO, and other styles
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 text
Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles
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
APA, Harvard, Vancouver, ISO, and other styles
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 text
Abstract:
Approved for public release; distribution is unlimited
As 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.
APA, Harvard, Vancouver, ISO, and other styles
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 text
Abstract:
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 Databases
Diese 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
APA, Harvard, Vancouver, ISO, and other styles
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 text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
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
APA, Harvard, Vancouver, ISO, and other styles
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 text
Abstract:
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).
APA, Harvard, Vancouver, ISO, and other styles
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 text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
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 text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Network topology discovery"

1

Donnet, Benoit, Timur Friedman, and Mark Crovella. "Improved Algorithms for Network Topology Discovery." In Lecture Notes in Computer Science, 149–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31966-5_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Xu, Chongyang, Yi Man, Luona Song, and Yinglei Teng. "Network Topology Discovery Based on Classification Algorithm." In Advances in Artificial Intelligence and Security, 276–86. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-78618-2_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Dancheng, Tianyi Yin, Cheng Liu, Chunyan Han, and Yixian Liu. "An Approach for IPSecVPN Network Topology Discovery Based on Layer 3 Topology." In Communications in Computer and Information Science, 223–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23214-5_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Skoura, Angeliki, Vasileios Megalooikonomou, Athanasios Diamantopoulos, George C. Kagadis, and Dimitrios Karnabatidis. "Classification of Tree and Network Topology Structures in Medical Images." In Data Mining for Biomarker Discovery, 79–90. Boston, MA: Springer US, 2012. http://dx.doi.org/10.1007/978-1-4614-2107-8_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sidibé, Guéréguin Der Sylvestre, Hamadoun Tall, Raphael Bidaud, Marie-Françoise Servajean, and Michel Misson. "Topology Discovery Delay Evaluation in Star Topology Network with Switched-Beam Antenna Sink." In Ad-Hoc, Mobile, and Wireless Networks, 62–73. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-31831-4_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ehounou, Wilfried Joseph, Dominique Barth, and Arnaud De Moissac. "Discovery of Energy Network Topology from Uncertain Flow Measurements." In Algorithmic Decision Theory, 355–60. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-67504-6_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Chen, Huaixi Wang, Nina Shu, and Han Wang. "Complex Network Approaches to Analyze the Topology of China High Speed Railway Network." In Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery, 841–51. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-70665-4_91.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Dancheng, Chen Zheng, Chunyan Han, and Yixian Liu. "Research and Application of Multiple Spanning Tree Network Topology Discovery Algorithm." In Lecture Notes in Electrical Engineering, 165–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25541-0_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Li, Dancheng, Chen Zheng, Chunyan Han, and Yixian Liu. "Research and Application of Heterogeneous Network Topology Discovery Algorithm Based on Multiple Spanning Tree Protocol." In Advances in Intelligent and Soft Computing, 437–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27708-5_60.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dolev, Shlomi, Omri Liba, and Elad M. Schiller. "Self-stabilizing Byzantine Resilient Topology Discovery and Message Delivery." In Networked Systems, 42–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40148-0_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Network topology discovery"

1

Ge, Jianxia, and Wenya Xiao. "Network layer network topology discovery algorithm research." In 2nd International Symposium on Computer, Communication, Control and Automation. Paris, France: Atlantis Press, 2013. http://dx.doi.org/10.2991/isccca.2013.136.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yao Zhao, Jianliang Yan, and Hua Zou. "Study on network topology discovery in IP networks." In Multimedia Technology (IC-BNMT 2010). IEEE, 2010. http://dx.doi.org/10.1109/icbnmt.2010.5705077.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Farrell, Ryan, and Larry S. Davis. "Decentralized discovery of camera network topology." In 2008 Second ACM/IEEE International Conference on Distributed Smart Cameras (ICDSC). IEEE, 2008. http://dx.doi.org/10.1109/icdsc.2008.4635696.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Jun, Li, Zhang Xuefeng, Shen Weihong, and Zou Qilin. "Network Topology Discovery Based on SNMP." In 2013 Ninth International Conference on Computational Intelligence and Security (CIS). IEEE, 2013. http://dx.doi.org/10.1109/cis.2013.48.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Huang, Lisheng, Mingyong Yin, Changchun Li, and Xin Wang. "Passive mode discovery of network topology." In International Conference on Communication Technology. Southampton, UK: WIT Press, 2014. http://dx.doi.org/10.2495/icct130831.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hao, He, Daniel Silvestre, and Carlos Silvestre. "Source Localization and Network Topology Discovery in Infection Networks." In 2018 37th Chinese Control Conference (CCC). IEEE, 2018. http://dx.doi.org/10.23919/chicc.2018.8482274.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yun-Sheng Yen, Tung-Lung Chan, Chia-Yi Liu, and Chwan-Yi Shiah. "Topology discovery service in the universal network." In 2011 3rd International Conference on Computer Research and Development (ICCRD). IEEE, 2011. http://dx.doi.org/10.1109/iccrd.2011.5764028.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Bo, Jingsha He, and Henghua Shi. "Improving the Efficiency of Network Topology Discovery." In 2008 3rd International Conference on Grid and Pervasive Computing Workshops (GPC Workshops). IEEE, 2008. http://dx.doi.org/10.1109/gpc.workshops.2008.34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ahmed, Adnan, and Behrouz Far. "Mobile Agent System for Network Topology Discovery." In 2006 Canadian Conference on Electrical and Computer Engineering. IEEE, 2006. http://dx.doi.org/10.1109/ccece.2006.277680.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wang Yong, Pan Nan, and Tao Xiaoling. "Network topology discovery algorithm based on OSPF." In 2010 International Conference on Intelligent Computing and Integrated Systems (ICISS). IEEE, 2010. http://dx.doi.org/10.1109/iciss.2010.5656788.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Network topology discovery' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography