Journal articles: 'Network topology'

1

Hobbs, Linn W. "Network topology in aperiodic networks." Journal of Non-Crystalline Solids 192-193 (December 1995): 79–91. http://dx.doi.org/10.1016/0022-3093(95)00431-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Han Zengfu, Kong Jiankun, Wang Zhiguo, Zhang Yiwei, Liu Ke, Pan Liang, Li Sicong, and Wu Desheng. "AI-based network topology optimization system." ITU Journal on Future and Evolving Technologies 2, no. 4 (August 9, 2021): 81–90. http://dx.doi.org/10.52953/yxtb5085.

Full text

Abstract:

Existing network topology planning does not fully consider the increasing network traffic and problem of uneven link capacity utilization, resulting in lower resource utilization and unnecessary investments in network construction. The AI-based network topology optimization system introduced in this paper builds a Long Short-Term Memory (LSTM) model for time series traffic forecasting, which uses NetworkX, a Python library, for graph analysis, dynamically optimizes the network topology by edge deletion or addition based on traffic over nodes, and ensures network load balancing when node traffic increases, mainly introducing the LSTM forecasting model building process, parameter optimization strategy, and network topology optimization in some detail. As it effectively enhances resource utilization, this system is vital to the optimization of complex network topology. The end of this paper looks forward to the future development of artificial intelligence, and suggests the possibility of how to cooperate with operator networks and how to establish cross-border ecological development.

APA, Harvard, Vancouver, ISO, and other styles

3

Widodo, Charles, Marchellius Yana, and Halim Agung. "IMPLEMENTASI TOPOLOGI HYBRID UNTUK PENGOPTIMALAN APLIKASI EDMS PADA PROJECT OFFICE PT PHE ONWJ." JURNAL TEKNIK INFORMATIKA 11, no. 1 (May 4, 2018): 19–30. http://dx.doi.org/10.15408/jti.v11i1.6472.

Full text

Abstract:

ABSTRAK Penggunaan aplikasi EDMS di project office PT PHE ONWJ dinilai masih belum optimal karena masih lambat dalam pengunaan aplikasi EDMS. Oleh karena itu dilakukanlah penelitian ini dengan tujuan untuk mengoptimalkan jaringan yang digunakan untuk mengakses aplikasi EDMS pada project office PT PHE ONWJ. Pengoptimalan jaringan yang dimaksud adalah dengan membangun topologi di project office PT PHE ONWJ dan menerapkan metro sebagai perantara topologi star di project office dan topologi star dikantor pusat sehingga menciptakan topologi hybrid. Topologi hybrid yang dimaksud adalah penggabungan antara topologi star yang ada di jaringan pusat, metro sebagai perantara kantor pusat dengan project office PT PHE ONWJ dan topologi star yang akan dibangun di project office PT ONWJ. Diharapkan setelah menerapkan topologi yang telah dirancang dapat mengoptimalkan penggunaan aplikasi EDMS. Topologi star di project office PT ONWJ dan metro sebagai perantara 2 topologi kantor pusat dan project office menghasilkan topologi hybrid. Kesimpulan dari penelitian ini adalah penerapan topologi dalam jaringan dapat memberikan optimalisasi dibandingkan dengan tanpa menerapkan topologi. Hasil rata-rata ping saat pengaksesan aplikasi EDMS sebelum menerapkan topologi hybrid mendapatkan hasil sebesar 392,98 ms dan setelah menerapkan topologi hybrid mendapatkan hasil sebesar 143,50 ms, sehingga disimpulkan bahwa penerapan topologi hybrid lebih baik dalam menjalankan aplikasi EDMS. ABSTRACT The use of EDMS application in PT PHE ONWJ project office is considered not optimal because it is still slow in the use of EDMS applications. Therefore this study was conducted with the aim to optimize the network used to access the EDMS application on the PT PHE ONWJ project office. Network optimization in question is to build a topology in the project office of PT PHE ONWJ and apply the metro as an intermediate star topology in the project office and star topology at the headquarters so as to create a hybrid topology. Hybrid topology in question is a merger between the star topology in the central network, metro as an intermediary head office with PT PHE ONWJ project office and star topology to be built at PT ONWJ project office. It is expected that after applying the topology that has been designed to optimize the use of EDMS applications. Star topology in PT ONWJ project office and metro as intermediary 2 topology headquarters and project office produce hybrid topology. The conclusion of this research is application of topology in network can give optimization compared with without applying topology. The average result of ping when accessing EDMS application before applying hybrid topology got 392.98 ms result and after applying hybrid topology get result of 143,50 ms, so it is concluded that application of hybrid topology is better in running EDMS application. How To Cite : Widodo, C. Yana, M. Agung, H. (2018). IMPLEMENTASI TOPOLOGI HYBRID UNTUK PENGOPTIMALAN APLIKASI EDMS PADA PROJECT OFFICE PT PHE ONWJ. Jurnal Teknik Informatika, 11(1), 19-30. doi 10.15408/jti.v11i1.6472 Permalink/DOI: http://dx.doi.org/10.15408/jti.v11i1.6472

APA, Harvard, Vancouver, ISO, and other styles

4

Parinyataramas, Jamreonta, Sakuntam Sanorpim, Chanchana Thanachayanont, Hiroyaki Yaguchi, and Misao Orihara. "TEM Analysis of Structural Phase Transition in MBE Grown Cubic InN on MgO (001) by MBE: Effect of Hexagonal Phase Inclusion in an C-Gan Nucleation Layer." Applied Mechanics and Materials 229-231 (November 2012): 219–22. http://dx.doi.org/10.4028/www.scientific.net/amm.229-231.219.

Full text

Abstract:

In this paper, we introduced dbcube topology for Network-on Chips(NoC). We predicted the dbcube topology has high power and low latency comparing to other topologies, and in particular mesh topology. By using xmulator simulator,we compared power and latency of this topologyto mesh topology. Finally, it is demonstrated that the network has higher power and lower latency than the mesh topology.

APA, Harvard, Vancouver, ISO, and other styles

5

Mosafaie, Razieh, and Reza Sabbaghi-Nadooshan. "Using Dbcupe Topology for NoCs." Applied Mechanics and Materials 229-231 (November 2012): 2741–44. http://dx.doi.org/10.4028/www.scientific.net/amm.229-231.2741.

Full text

Abstract:

In this paper, we introduced dbcube topology for Network-on Chips(NoC). We predicted the dbcube topology has high power and low latency comparing to other topologies, and in particular mesh topology. By using xmulator simulator,we compared power and latency of this topologyto mesh topology. Finally, it is demonstrated that the network has higher power and lower latency than the mesh topology.

APA, Harvard, Vancouver, ISO, and other styles

6

Kamiyama, Noriaki. "DESIGNING NETWORK TOPOLOGY USING DATA ENVELOPMENT ANALYSIS." Journal of the Operations Research Society of Japan 56, no. 3 (2013): 199–220. http://dx.doi.org/10.15807/jorsj.56.199.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

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

8

Yegorova, N. V., A. V. Yakovlev, and A. G. Nikiforov. "Heating network topology." Journal of Physics: Conference Series 1683 (December 2020): 042078. http://dx.doi.org/10.1088/1742-6596/1683/4/042078.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Fencl, T., P. Burget, and J. Bilek. "NETWORK TOPOLOGY DESIGN." IFAC Proceedings Volumes 41, no. 2 (2008): 13581–86. http://dx.doi.org/10.3182/20080706-5-kr-1001.02300.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Fencl, Tomas, Pavel Burget, and Jan Bilek. "Network topology design." Control Engineering Practice 19, no. 11 (November 2011): 1287–96. http://dx.doi.org/10.1016/j.conengprac.2011.07.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Tangmunarunkit, Hongsuda, Ramesh Govindan, Sugih Jamin, Scott Shenker, and Walter Willinger. "Network topology generators." ACM SIGCOMM Computer Communication Review 32, no. 4 (October 2002): 147–59. http://dx.doi.org/10.1145/964725.633040.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Kincaid, Rex K., and David J. Phillips. "Network topology measures." Wiley Interdisciplinary Reviews: Computational Statistics 3, no. 6 (June 14, 2011): 557–65. http://dx.doi.org/10.1002/wics.180.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

PELLEGRINI, Lilla, Monica LEBA, and Alexandru IOVANOVICI. "CHARACTERIZATION OF URBAN TRANSPORTATION NETWORKS USING NETWORK MOTIFS." Acta Electrotechnica et Informatica 20, no. 4 (January 21, 2020): 3–9. http://dx.doi.org/10.15546/aeei-2020-0019.

Full text

Abstract:

We use tools and techniques specific to the field of complex networks analysis for the identification and extraction of key parameters which define ”good” patterns and practices for designing public transportation networks. Using network motifs we analyze a set of 18 cities using public data sets regarding the topology of network and discuss each of the identified motifs using the concepts and tools of urban planning.

APA, Harvard, Vancouver, ISO, and other styles

14

Windels, Sam F. L., Noël Malod-Dognin, and Nataša Pržulj. "Graphlet Laplacians for topology-function and topology-disease relationships." Bioinformatics 35, no. 24 (June 13, 2019): 5226–34. http://dx.doi.org/10.1093/bioinformatics/btz455.

Full text

Abstract:

Abstract Motivation Laplacian matrices capture the global structure of networks and are widely used to study biological networks. However, the local structure of the network around a node can also capture biological information. Local wiring patterns are typically quantified by counting how often a node touches different graphlets (small, connected, induced sub-graphs). Currently available graphlet-based methods do not consider whether nodes are in the same network neighbourhood. To combine graphlet-based topological information and membership of nodes to the same network neighbourhood, we generalize the Laplacian to the Graphlet Laplacian, by considering a pair of nodes to be ‘adjacent’ if they simultaneously touch a given graphlet. Results We utilize Graphlet Laplacians to generalize spectral embedding, spectral clustering and network diffusion. Applying Graphlet Laplacian-based spectral embedding, we visually demonstrate that Graphlet Laplacians capture biological functions. This result is quantified by applying Graphlet Laplacian-based spectral clustering, which uncovers clusters enriched in biological functions dependent on the underlying graphlet. We explain the complementarity of biological functions captured by different Graphlet Laplacians by showing that they capture different local topologies. Finally, diffusing pan-cancer gene mutation scores based on different Graphlet Laplacians, we find complementary sets of cancer-related genes. Hence, we demonstrate that Graphlet Laplacians capture topology-function and topology-disease relationships in biological networks. Availability and implementation http://www0.cs.ucl.ac.uk/staff/natasa/graphlet-laplacian/index.html Supplementary information Supplementary data are available at Bioinformatics online.

APA, Harvard, Vancouver, ISO, and other styles

15

Sankpal, Ms Mrunali Nagesh, Ms Pratiksha Vijay Chinchwade, Ms Rutuja Rajkumar Kognole, and Ms K. N. Rode. "Computer Network Topologies." International Journal for Research in Applied Science and Engineering Technology 10, no. 4 (April 30, 2022): 1508–11. http://dx.doi.org/10.22214/ijraset.2022.41553.

Full text

Abstract:

Abstract: Network topologies is various components of network link nodes, link, peripherals are arranged. The way of connecting the computers is called as the topology.so depending on the manner of connecting the computers we can have different network topologies. Network topology is links and nodes of a network are arranged to related are arranged to each other. They describe the physical and logical arrangement of network nodes. The way in which different system and node are connect and communicate with each other is determined by topology of the network. Keywords: Star Topology, Bus Topology, Ring Topology, Hybrid Topology, Mesh Topology, Tree Topology

APA, Harvard, Vancouver, ISO, and other styles

16

Faragó, András. "Network Topology Models for Multihop Wireless Networks." ISRN Communications and Networking 2012 (November 24, 2012): 1–23. http://dx.doi.org/10.5402/2012/362603.

Full text

Abstract:

A typical feature of huge, random network topologies is that they are too large to allow a fully detailed description. Such enormous, complex network topologies are encountered in numerous settings and have generated many research investigations. Well-known examples are the Internet and its logical overlay networks, such as the World Wide Web as well as online social networks. At the same time, extensive and rapidly growing wireless ad hoc and sensor networks also lead to hard topology modeling questions. In the current paper, we primarily focus on large, random wireless networks but also consider Web and Internet models. We survey a number of existing models that aim at describing the network topology. We also exhibit common generalizations of various sets of models that cover a number of known constructions as special cases. We demonstrate that higher levels of abstraction, despite their very general nature, can still be meaningfully analyzed and offers quite useful and unique help in solving certain hard networking problems. We believe that this research area can and will generate further significant contributions to the analysis of very large networks.

APA, Harvard, Vancouver, ISO, and other styles

17

Abd-El-Reheim, Mohamed Abd-El-Aal. "Power Network Topology Recognition Using Neural Networks." Electric Machines & Power Systems 27, no. 2 (January 15, 1999): 195–208. http://dx.doi.org/10.1080/073135699269398.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Pan, Lili. "Generic Topology Matching Algorithm of Structured P2P Network." International Journal of Future Computer and Communication 3, no. 5 (October 2014): 346–49. http://dx.doi.org/10.7763/ijfcc.2014.v3.324.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Zhang, Wei, Hong Ma, Tao Wu, Xueshu Shi, and Yiwen Jiao. "Efficient topology control for time-varying spacecraft networks with unreliable links." International Journal of Distributed Sensor Networks 15, no. 9 (September 2019): 155014771987937. http://dx.doi.org/10.1177/1550147719879377.

Full text

Abstract:

In spacecraft networks, the time-varying topology, intermittent connectivity, and unreliable links make management of the network challenging. Previous works mainly focus on information propagation or routing. However, with a large number of nodes in the future spacecraft networks, it is very crucial regarding how to make efficient network topology controls. In this article, we investigate the topology control problem in spacecraft networks where the time-varying topology can be predicted. We first develop a model that formalizes the time-varying spacecraft network topologies as a directed space–time graph. Compared with most existing static graph models, this model includes both temporal and spatial topology information. To capture the characteristics of practical network, links in our space–time graph model are weighted by cost, efficiency, and unreliability. The purpose of our topology control is to construct a sparse (low total cost) structure from the original topology such that (1) the topology is still connected over space–time graph; (2) the cost efficiency ratio of the topology is minimized; and (3) the unreliability parameter is lower than the required bound. We prove that such an optimization problem is NP-hard. Then, we provide five heuristic algorithms, which can significantly maintain low topology cost efficiency ratio while achieving high reliable connectivity. Finally, simulations have been conducted on random space networks and hybrid low earth orbit/geostationary earth orbit satellite-based sensor network. Simulation results demonstrate the efficiency of our model and topology control algorithms.

APA, Harvard, Vancouver, ISO, and other styles

20

Zhu, Jin, Liang Tang, Hongsheng Xi, and Zhenghuan Zhang. "Reliability Analysis of Wireless Sensor Networks Using Markovian Model." Journal of Applied Mathematics 2012 (2012): 1–21. http://dx.doi.org/10.1155/2012/760359.

Full text

Abstract:

This paper investigates reliability analysis of wireless sensor networks whose topology is switching among possible connections which are governed by a Markovian chain. We give the quantized relations between network topology, data acquisition rate, nodes' calculation ability, and network reliability. By applying Lyapunov method, sufficient conditions of network reliability are proposed for such topology switching networks with constant or varying data acquisition rate. With the conditions satisfied, the quantity of data transported over wireless network node will not exceed node capacity such that reliability is ensured. Our theoretical work helps to provide a deeper understanding of real-world wireless sensor networks, which may find its application in the fields of network design and topology control.

APA, Harvard, Vancouver, ISO, and other styles

21

Wang, Chunlin, Ning Huang, Yanan Bai, and Shuo Zhang. "A method of network topology optimization design considering application process characteristic." Modern Physics Letters B 32, no. 07 (March 5, 2018): 1850091. http://dx.doi.org/10.1142/s0217984918500914.

Full text

Abstract:

Communication networks are designed to meet the usage requirements of users for various network applications. The current studies of network topology optimization design mainly considered network traffic, which is the result of network application operation, but not a design element of communication networks. A network application is a procedure of the usage of services by users with some demanded performance requirements, and has obvious process characteristic. In this paper, we first propose a method to optimize the design of communication network topology considering the application process characteristic. Taking the minimum network delay as objective, and the cost of network design and network connective reliability as constraints, an optimization model of network topology design is formulated, and the optimal solution of network topology design is searched by Genetic Algorithm (GA). Furthermore, we investigate the influence of network topology parameter on network delay under the background of multiple process-oriented applications, which can guide the generation of initial population and then improve the efficiency of GA. Numerical simulations show the effectiveness and validity of our proposed method. Network topology optimization design considering applications can improve the reliability of applications, and provide guidance for network builders in the early stage of network design, which is of great significance in engineering practices.

APA, Harvard, Vancouver, ISO, and other styles

22

Ermagun, Alireza, and Nazanin Tajik. "Recovery patterns and physics of the network." PLOS ONE 16, no. 1 (January 19, 2021): e0245396. http://dx.doi.org/10.1371/journal.pone.0245396.

Full text

Abstract:

In a progressively interconnected world, the loss of system resilience has consequences for human health, the economy, and the environment. Research has exploited the science of networks to explain the resilience of complex systems against random attacks, malicious attacks, and the localized attacks induced by natural disasters or mass attacks. Little is known about the elucidation of system recovery by the network topology. This study adds to the knowledge of network resilience by examining the nexus of recoverability and network topology. We establish a new paradigm for identifying the recovery behavior of networks and introduce the recoverability measure. Results indicate that the recovery response behavior and the recoverability measure are the function of both size and topology of networks. In small sized networks, the return to recovery exhibits homogeneous recovery behavior over topology, while the return shape is dispersed with an increase in the size of network. A network becomes more recoverable as connectivity measures of the network increase, and less recoverable as accessibility measures of network increase. Overall, the results not only offer guidance on designing recoverable networks, but also depict the recovery nature of networks deliberately following a disruption. Our recovery behavior and recoverability measure has been tested on 16 distinct network topologies. The relevant recovery behavior can be generalized based on our definition for any network topology recovering deliberately.

APA, Harvard, Vancouver, ISO, and other styles

23

Virakwan Hai Kelian, Mohd Nazri Mohd Warip, R. Badlishah Ahmad, Phaklen Ehkan, Fazrul Faiz Zakaria, and Mohd Zaizu Ilyas. "Toward Adaptive and Scalable Topology in Distributed SDN Controller." Advanced Research in Applied Sciences and Engineering Technology 30, no. 1 (March 8, 2023): 115–31. http://dx.doi.org/10.37934/araset.30.1.115131.

Full text

Abstract:

The increasing need for automated networking platforms like the Internet of Things, as well as network services like cloud computing, big data applications, wireless networks, mobile Internet, and virtualization, has driven existing networks to their limitations. Software-defined network (SDN) is a new modern programmable network architectural technology that allows network administrators to control the entire network consistently and logically centralized in software-based controllers and network devices become just simple packet forwarding devices. The controller that is the network's brain, is mostly based on the OpenFlow protocol and has distinct characteristics that vary depending on the programming language. Its function is to control network traffic and increase network resource efficiency. Therefore, selecting the right controllers and monitoring their performance to increase resource usage and enhance network performance metrics is required. For network performance metrics analysis, the study proposes an implementation of SDN architecture utilizing an open-source OpenDaylight (ODL) distributed SDN controller. The proposed work evaluates the deployment of distributed SDN controller performance on three distinct customized network topologies based on SDN architecture for node-to-node performance metrics such as delay, throughput, packet loss, and bandwidth use. The experiments are conducted using the Mininet emulation tool. Wireshark is used to collect and analyse packets in real-time. The results obtained from the comparison of networks are presented to provide useful guidelines for SDN research and deployment initiatives.

APA, Harvard, Vancouver, ISO, and other styles

24

Ding, Rui, Jian Yin, Peng Dai, Lu Jiao, Rong Li, Tongfei Li, and Jianjun Wu. "Optimal Topology of Multilayer Urban Traffic Networks." Complexity 2019 (October 28, 2019): 1–19. http://dx.doi.org/10.1155/2019/4230981.

Full text

Abstract:

Previous urban traffic network-based studies have been based mostly on single-layer networks. Based on their shortcomings, starting from the perspective of a multilayer urban traffic network, this paper takes the different anticongestion abilities and network characteristics of various network structures under the condition of traffic congestion as the research object. Then, a comparative experiment is performed via simulation, and the optimal multilayer urban traffic network topology is obtained under different conditions. It is found that these scale-free related multilayer networks have relatively strong ability to support more traffic flows and have higher anticongestion abilities, regardless of whether it is a lower-layer or upper-layer network. The research results are helpful to deepen our understanding of the characteristics of traffic network structures, help scholars further cognize the structural properties of multilayer urban traffic networks, practically help urban traffic network planners to further optimize the urban traffic network, and broaden the study of multilayer traffic networks.

APA, Harvard, Vancouver, ISO, and other styles

25

Wei Yao, Wei Yao, Hai Zhao Wei Yao, and Jing-Jing Chen Hai Zhao. "Discovering and Mapping Subnet Level Topology." 網際網路技術學刊 24, no. 2 (March 2023): 291–303. http://dx.doi.org/10.53106/160792642023032402008.

Full text

Abstract:

<p>The research of Internet measurement has promoted the development of router-level topology discovery, while the subnet of the network layer can provide a more detailed intermediate complementary view. To improve the current level of router-level topology discovery, some researchers have proposed subnet discovery methods. However, the existing methods do not perform well in terms of efficiency and accuracy, which leads to the failure of the final resulting topology map. In this paper, we propose a new approach to discover subnets, which consists of a network pre-processing stage and a subnet inference stage. Given a set of target IP prefixes, the network pre-processing stage introduces a minimal probing overhead to improve probing efficiency. Based on the IP address allocation principle, the subnet inference stage utilizes a set of complementary inference rules to infer subnets. The experimental results show that our method can achieve a higher accuracy in discovering subnets while keeping lower probing overhead compared with existing methods. Finally, we utilize the proposed approach to discover the subnets of six geographically dispersed public Autonomous System (AS) networks and analyze their various subnet characteristics, including degree distribution.</p> <p> </p>

APA, Harvard, Vancouver, ISO, and other styles

26

He, Ming, Fangxin Liu, Zhuang Miao, Huan Zhou, and Qiuli Chen. "A mechanism of topology optimization for underwater acoustic sensor networks based on autonomous underwater vehicles." International Journal of Distributed Sensor Networks 13, no. 1 (January 2017): 155014771668697. http://dx.doi.org/10.1177/1550147716686979.

Full text

Abstract:

Limited energy, high mobility, and unsteady acoustic communication links render the underwater acoustic sensor networks subject to performance reduction. To solve this problem, a topology optimization method, also called TO-A algorithm, is developed based on topology reconfiguration. First, the proposed method optimizes the coverage rate of underwater acoustic sensor networks by adjusting the location of sensor nodes through simulating fish behaviors. Second, to optimize the connectivity of underwater acoustic sensor networks, the proposed method, using edge nodes, repairs disconnected positions and eliminates key nodes in underwater acoustic sensor networks. Third, a topology optimization strategy, also called TO-DA algorithm, is developed for Double-autonomous underwater vehicles to improve the robustness and adaptability of the network topology. When the inherent law of underwater acoustic sensor networks topology formation is further found, the method for optimizing network topology is proposed, which based on the triangle principle eliminates those key nodes and can help with the survivability of network regeneration. The method proves reasonable and valid by stimulation and contrast examinations. The comparison of TO-A algorithm and TO-DA algorithm shows that under low energy consumption, TO-A algorithm can keep the network coverage at about 97% for a long time, connectivity rate above 89%, while the TO-DA algorithm can improve the survivability of the network by above 50% at the expense of 8.5% of the network coverage.

APA, Harvard, Vancouver, ISO, and other styles

27

Abdulhussein, G. B., T. Kanakis, and A. A. R. Altahir. "Network Topology Detection System." IOP Conference Series: Materials Science and Engineering 433 (November 30, 2018): 012085. http://dx.doi.org/10.1088/1757-899x/433/1/012085.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Kumar, Rajeev, and Nilanjan Banerjee. "Multiobjective network topology design." Applied Soft Computing 11, no. 8 (December 2011): 5120–28. http://dx.doi.org/10.1016/j.asoc.2011.05.047.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Tokunaga, Kazuhiro. "Growing topology representing network." Applied Soft Computing 22 (September 2014): 311–22. http://dx.doi.org/10.1016/j.asoc.2014.04.028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

He, Hui, Guotao Fan, Jianwei Ye, and Weizhe Zhang. "A Topology Visualization Early Warning Distribution Algorithm for Large-Scale Network Security Incidents." Scientific World Journal 2013 (2013): 1–7. http://dx.doi.org/10.1155/2013/827376.

Full text

Abstract:

It is of great significance to research the early warning system for large-scale network security incidents. It can improve the network system’s emergency response capabilities, alleviate the cyber attacks’ damage, and strengthen the system’s counterattack ability. A comprehensive early warning system is presented in this paper, which combines active measurement and anomaly detection. The key visualization algorithm and technology of the system are mainly discussed. The large-scale network system’s plane visualization is realized based on the divide and conquer thought. First, the topology of the large-scale network is divided into some small-scale networks by the MLkP/CR algorithm. Second, the sub graph plane visualization algorithm is applied to each small-scale network. Finally, the small-scale networks’ topologies are combined into a topology based on the automatic distribution algorithm of force analysis. As the algorithm transforms the large-scale network topology plane visualization problem into a series of small-scale network topology plane visualization and distribution problems, it has higher parallelism and is able to handle the display of ultra-large-scale network topology.

APA, Harvard, Vancouver, ISO, and other styles

31

Hong, Jie, and Dehai Zhang. "TARCS: A Topology Change Aware-Based Routing Protocol Choosing Scheme of FANETs." Electronics 8, no. 3 (March 2, 2019): 274. http://dx.doi.org/10.3390/electronics8030274.

Full text

Abstract:

The rapid change of topology is one of the most important factors affecting the performance of the routing protocols of flying ad hoc networks (FANETs). A routing scheme suitable for highly dynamic mobile ad hoc networks is proposed for the rapid change of topology in complex scenarios. In the scheme moving nodes sense changes of the surrounding network topology periodically, and the current mobile scenario is confirmed according to the perceived result. Furthermore, a suitable routing protocol is selected for maintaining network performances at a high level. The concerned performance metrics are packet delivery ratio, network throughput, average end-to-end delay and average jitter. The experiments combine the random waypoint model, the reference point group mobility model and the pursue model to a chain scenario, and simulate the large changes of the network topology. Results show that an appropriate routing scheme can adapt to rapid changes in network topology and effectively improve network performance.

APA, Harvard, Vancouver, ISO, and other styles

32

Virmani, Dr Deepali. "Maximizing Network Lifetime Operator for Wireless Sensor Networks." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 4, no. 2 (March 18, 2013): 267–72. http://dx.doi.org/10.24297/ijct.v4i2a2.3172.

Full text

Abstract:

Optimizing and enhancing network lifetime with minimum energy consumption is the major challenge in field of wireless sensor networks. Existing techniques for optimizing network lifetime are based on exploiting node redundancy, adaptive radio transmission power and topology control. Topology control protocols have a significant impact on network lifetime, available energy and connectivity. In this paper we categorize sensor nodes as strong and weak nodes based on their residual energy as well as operational lifetime and propose a Maximizing Network lifetime Operator (MLTO) that defines cluster based topology control mechanism to enhance network lifetime while guarantying the minimum energy consumption and minimum delay. Extensive simulations in Java-Simulator (J-Sim) show that our proposed operator outperforms the existing protocols in terms of various performance metrics life network lifetime, average delay and minimizes energy utilization.

APA, Harvard, Vancouver, ISO, and other styles

33

Zhou, Fang, Xiang He, Yongbo Yuan, and Mingyuan Zhang. "Influence of Interlink Topology on Multilayer Network Robustness." Sustainability 12, no. 3 (February 7, 2020): 1202. http://dx.doi.org/10.3390/su12031202.

Full text

Abstract:

Cascading failures between interdependent multilayer networks are being widely studied, especially the trend of robustness caused by the interlinks between networks. However, few researchers pay attention to the effect of the interlink topology on the robustness of coupled networks, which is a critical interlink factor of multilayer networks. In this study, the method frame of multilayer network experiment simulation is given. Through numerical simulation and actual network simulation, the exhaustive method is used to enumerate all the patterns of interlink topological relations of multilayer networks (three-layer or more). The research verifies that the interlink topology affects the global robustness and that there exists a fragile interlink pattern in the patterns of interlink topologies. The star-like interlink pattern with the most uneven interlink-degree distribution leads to the weakest robustness; the pattern with average interlink-degree distribution reveals good global stability as a loop-like pattern or entire interlink pattern. In addition, the influence of interlink topology is independent. The simulation results are not affected by the network layer number and intraparameters (including the network-generated form, each layer of network node number, and average degree of each layer of network). Thus, ignoring the interlink topology may result in the actual system suddenly becoming vulnerable before the theoretical calculation point. Interlink topology as an independent factor affecting the robustness of multilayer networks should be paid more attention.

APA, Harvard, Vancouver, ISO, and other styles

34

Toju, Hirokazu, Paulo R. Guimarães, Jens M. Olesen, and John N. Thompson. "Below-ground plant–fungus network topology is not congruent with above-ground plant–animal network topology." Science Advances 1, no. 9 (October 2015): e1500291. http://dx.doi.org/10.1126/sciadv.1500291.

Full text

Abstract:

In nature, plants and their pollinating and/or seed-dispersing animals form complex interaction networks. The commonly observed pattern of links between specialists and generalists in these networks has been predicted to promote species coexistence. Plants also build highly species-rich mutualistic networks below ground with root-associated fungi, and the structure of these plant–fungus networks may also affect terrestrial community processes. By compiling high-throughput DNA sequencing data sets of the symbiosis of plants and their root-associated fungi from three localities along a latitudinal gradient, we uncovered the entire network architecture of these interactions under contrasting environmental conditions. Each network included more than 30 plant species and hundreds of mycorrhizal and endophytic fungi belonging to diverse phylogenetic groups. The results were consistent with the notion that processes shaping host-plant specialization of fungal species generate a unique linkage pattern that strongly contrasts with the pattern of above-ground plant–partner networks. Specifically, plant–fungus networks lacked a “nested” architecture, which has been considered to promote species coexistence in plant–partner networks. Rather, the below-ground networks had a conspicuous “antinested” topology. Our findings lead to the working hypothesis that terrestrial plant community dynamics are likely determined by the balance between above-ground and below-ground webs of interspecific interactions.

APA, Harvard, Vancouver, ISO, and other styles

35

Sivaraman, Himani. "A Distributed Algorithm for Topology Control in VANETs: Distributed Distant Node Graphical Structure (DDGST) Algorithm." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 11, no. 1 (April 30, 2020): 839–46. http://dx.doi.org/10.17762/turcomat.v11i1.13566.

Full text

Abstract:

Vehicle ad hoc networks—a subset of MANETs—allow cars to directly connect. These networks are independent of previous infrastructure. VANETs promote traffic safety, efficiency, and ITS application development. Their link allows this. Vehicular Ad-hoc Networks (VANETs) have grown in popularity due to its ability to efficiently and reliably connect automobiles. Vehicular networks evolve rapidly, making network topology maintenance problematic. VANET topologies are managed decentralized here. The algorithm uses neighbor numbers and distances to calculate vehicle transmission range. Simulations indicate that the suggested method reduces network partitions and maximizes connection. Due to the great mobility of VANET vehicles, the network architecture changes quickly. As this network topology is continually changing, creating strong and effective routing protocols is difficult. Topology control can overcome this difficulty. We present a distributed topology control mechanism that keeps VANETs online, reduces control messages, and prevents collisions. Node centrality and network density are used to fine-tune each node's transmission power. Computer simulations compare the proposed approach to different topology control algorithms. The results show that the suggested method outperforms the alternatives in network connectivity, longevity, and control overhead.

APA, Harvard, Vancouver, ISO, and other styles

36

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

37

Ye, Heng, Zhiping Li, Guangyue Li, and Yiran Liu. "Topology Analysis of Natural Gas Pipeline Networks Based on Complex Network Theory." Energies 15, no. 11 (May 24, 2022): 3864. http://dx.doi.org/10.3390/en15113864.

Full text

Abstract:

With the improvement of natural gas network interconnection, the network topology becomes increasingly complex. The significance of analyzing topology is gradually becoming prominent, and a systematic analysis method is required. This paper selects two typical natural gas pipeline networks: one in Europe, and the other in North China. Based on complex network theory and the nature of natural gas pipelines, topological models for the two typical networks were established and the evaluation indexes were developed based on four factors: network type, overall topological structure characteristics, path-related topological structure characteristics, and topological structure robustness. Using these indexes, the topological structure of the two typical networks is compared and analyzed quantitatively. The comparison shows that the European network topology has more redundancy, higher transmission efficiency, and greater robustness. The topology analysis method proposed in this paper is practical and suitable for the preliminary analysis of natural gas pipeline networks. The conclusions achieved by this method can assist operators in gaining an intuitive understanding of the overall characteristics, robustness, and key features of pipeline network topology, which is useful in the implementation of hierarchical prevention and control. It also serves as a solid theoretical foundation and guidance for network expansion, interconnection construction, and precise hydraulic simulation calculation in the next stage.

APA, Harvard, Vancouver, ISO, and other styles

38

Zhang, Jianchen, Jiayao Wang, and Heying Li. "Topology Conflict Detection Considering Incremental Updating of Multi-Scale Road Networks." ISPRS International Journal of Geo-Information 10, no. 10 (September 28, 2021): 655. http://dx.doi.org/10.3390/ijgi10100655.

Full text

Abstract:

Incremental updating is an important technical method used to maintain the data of road networks. Topology conflict detection of multiscale road networks in incremental updating is an important link. Most of the previous algorithms focus on a single scale road network, which cannot be applied to topology conflict detection for different scale road networks during incremental updating. Therefore, this study proposes a topology conflict detection algorithm that considers the incremental updating of multiscale networks. The algorithm designs a K-order topological neighborhood to judge incremental neighborhood links and builds a topology refinement model based on geometric measurement. Furthermore, we propose a network topology conflict detection rule considering the influence of cartographic generalization operator and use the improved topological distance to detect topology conflicts. The experimental results show that (1) the overall accuracy and recall rate of the proposed method are more than 90%; (2) after considering the topology conflict caused by cartography generalization, the accuracy was increased by 29.2%; and (3) the value of average path length of a network can be used as the basis for setting the best K value.

APA, Harvard, Vancouver, ISO, and other styles

39

Sun, Qi. "The Research of Ad Hoc Network Routing Protocols." Advanced Materials Research 926-930 (May 2014): 2626–29. http://dx.doi.org/10.4028/www.scientific.net/amr.926-930.2626.

Full text

Abstract:

Wireless Ad Hoc network routing algorithm is one of the core technologies of wireless Ad Hoc networks. Ad Hoc network is dynamic topology on characteristic, mainly reflected on the network node number and node movement, which lead to network topology changes, in order to study the Ad Hoc network size and topology changes influence on packet delivery, time delay and routing control, through experiment it is concluded that, the dynamic source routing protocol is an ideal choice.

APA, Harvard, Vancouver, ISO, and other styles

40

Wang, Mei-Qi, En-Li Chen, Shuang Hou, Peng-Fei Liu, and Wan-Jie Hang. "An energy-optimized game algorithm for wireless sensor networks." Measurement and Control 53, no. 7-8 (August 2020): 1548–57. http://dx.doi.org/10.1177/0020294020932345.

Full text

Abstract:

The ongoing development of wireless sensor networks has been greatly restricted because of scarce spectrum resources, limited battery power, and ineffective topologic structures. Thus, how to construct a suitable topological structure and allocate the appropriate node channels has become an urgent problem. In this study, we built a game model that took into account the influence of channel allocation and topology structure on network performance. The game model considered the nodes in wireless sensor networks to be players and took transmitting power, node channels, and node rest energy into account to establish the income function. Then, the model certified that it has Nash equilibrium. Next, we propose an energy-optimized game algorithm joint topology and channel for wireless sensor network (CETGA) in accordance with the game model. The CETGA algorithm improved each node’s income by changing the transmitting power and node channel gradually, assuming that the network retained connectivity. Then, we demonstrated that the algorithm could converge to a Pareto optimal. Finally, we used MATLAB software to verify the simulation. The results show that the topology created by CETGA is with low interference and long lifetime. In addition, the nodes’ average residual energy is more balanced and the network robustness and real time are improved.

APA, Harvard, Vancouver, ISO, and other styles

41

Banerjee, Avah, and Dana Richards. "A Sorting Network on Trees." Parallel Processing Letters 29, no. 04 (December 2019): 1950015. http://dx.doi.org/10.1142/s0129626419500154.

Full text

Abstract:

Sorting networks are a class of parallel oblivious sorting algorithms. Not only do they have interesting theoretical properties but they can be fabricated. A sorting network is a sequence of parallel compare-exchange operations using comparators which are grouped into stages. This underlying graph defines the topology of the network. The majority of results on sorting networks concern the unrestricted case where the underlying graph is the complete graph. Prior results are also known for paths, hypercubes, and meshes. In this paper we introduce a sorting network whose underlying topology is a tree and formalize the concept of sorting networks on a restricted graph topology by introducing a new parameter for graphs called its sorting number. The main result of the paper is a description of an [Formula: see text] depth sorting network on a tree with maximum degree [Formula: see text].

APA, Harvard, Vancouver, ISO, and other styles

42

Kwon, Minhae, and Hyunggon Park. "Distributed topology design for network coding deployed networks." Signal Processing 165 (December 2019): 380–92. http://dx.doi.org/10.1016/j.sigpro.2019.07.018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Chi, Kaikai, Xiaohong Jiang, Susumu Horiguchi, and Minyi Guo. "Topology Design of Network-Coding-Based Multicast Networks." IEEE Transactions on Parallel and Distributed Systems 19, no. 5 (May 2008): 627–40. http://dx.doi.org/10.1109/tpds.2007.70743.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

SANTIAGO, A., J. P. CÁRDENAS, M. L. MOURONTE, V. FELIU, and R. M. BENITO. "MODELING THE TOPOLOGY OF SDH NETWORKS." International Journal of Modern Physics C 19, no. 12 (December 2008): 1809–20. http://dx.doi.org/10.1142/s0129183108013369.

Full text

Abstract:

SDH (Synchronous Digital Hierarchy) is the standard technology for the information transmission in broadband optical networks. Unlike the Internet, SDH networks are strictly planned; rings, meshes, stars, or tree-branches topologies are designed to connect their basic elements. In spite of that, we have found that the SDH network operated by Telefónica in Spain shares remarkable topological properties with other real complex networks empirically analyzed, such as the worldwide web network. In particular, we have found power-law scaling in the degree distribution (P(k) ~ k-γ) and properties of small world networks. Considering real planning directives that take into account geographical and technological variables, we propose an ad hoc computational model that reproduces the aforementioned topological traits observed in the Spanish SDH network.

APA, Harvard, Vancouver, ISO, and other styles

45

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

46

Lee, Jongkwan. "Opportunistic Data Relay Scheme for Narrowband Multihop Combat Radio Networks." Journal of the Korea Institute of Military Science and Technology 25, no. 1 (February 5, 2022): 65–71. http://dx.doi.org/10.9766/kimst.2022.25.1.065.

Full text

Abstract:

In this paper, we propose an opportunistic data relay scheme in narrowband multihop combat radio networks. Narrowband networks have physical restrictions on high-speed transmission. Furthermore, the topology changes dynamically due to the jamming of the enemy, signal interference between friendly forces, and movement of network entities. Therefore, the traditional relay scheme that collects topology information and calculates a relay path before transmission is unsuitable for such networks. Our proposed scheme does not collect topology information and transmits data opportunistically. The scheme can cause unnecessary data relaying that is not related to data delivery to the destination node. However, for small networks, the effect of increasing network throughput by not gathering topology information is much greater than the effect of reducing throughput by unnecessary data relays. We demonstrate the performance superiority of the proposed scheme through simulation in the worst case of network topology.

APA, Harvard, Vancouver, ISO, and other styles

47

He, Ming, Lin Chen, Hong Wang, and Zheng Hu Gong. "Distributed Network Topology Management in Network Coding." Advanced Materials Research 546-547 (July 2012): 1270–75. http://dx.doi.org/10.4028/www.scientific.net/amr.546-547.1270.

Full text

Abstract:

In this research, we focus on distributed network management in network coding. Web Services Distributed Management (WSDM) is one of the industry standards for distributed management. With the advantage of WSDM, we improve the efficiency of topology management in network coding and propose Distributed Topology Management System (DTMS). Under the campus network as our experimental environment, we analyze the performance of our system in this paper. Further, we compare the performance of our system with AdventNet Web NMS which is one of popular network management tools. Our work is the first solution to distributed network management in network coding. It is also the first to introduce WSDM specification to network coding. WSDM brings us a loosely coupling topology management system which is user-friendly and performs well.

APA, Harvard, Vancouver, ISO, and other styles

48

Bunimovich, L. A., D. C. Smith, and B. Z. Webb. "Specialization Models of Network Growth." Journal of Complex Networks 7, no. 3 (September 17, 2018): 375–92. http://dx.doi.org/10.1093/comnet/cny024.

Full text

Abstract:

AbstractOne of the most important features observed in real networks is that, as a network’s topology evolves so does the network’s ability to perform various complex tasks. To explain this, it has also been observed that as a network grows certain subnetworks begin to specialize the function(s) they perform. Herein, we introduce a class of models of network growth based on this notion of specialization and show that as a network is specialized using this method its topology becomes increasingly sparse, modular and hierarchical, each of which are important properties observed in real networks. This procedure is also highly flexible in that a network can be specialized over any subset of its elements. This flexibility allows those studying specific networks the ability to search for mechanisms that describe their growth. For example, we find that by randomly selecting these elements a network’s topology acquires some of the most well-known properties of real networks including the small-world property, disassortativity and a right-skewed degree distribution. Beyond this, we show how this model can be used to generate networks with real-world like clustering coefficients and power-law degree distributions, respectively. As far as the authors know, this is the first such class of models that can create an increasingly modular and hierarchical network topology with these properties.

APA, Harvard, Vancouver, ISO, and other styles

49

Krishnagopal, Sanjukta, Judith Lehnert, Winnie Poel, Anna Zakharova, and Eckehard Schöll. "Synchronization patterns: from network motifs to hierarchical networks." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 375, no. 2088 (March 6, 2017): 20160216. http://dx.doi.org/10.1098/rsta.2016.0216.

Full text

Abstract:

We investigate complex synchronization patterns such as cluster synchronization and partial amplitude death in networks of coupled Stuart–Landau oscillators with fractal connectivities. The study of fractal or self-similar topology is motivated by the network of neurons in the brain. This fractal property is well represented in hierarchical networks, for which we present three different models. In addition, we introduce an analytical eigensolution method and provide a comprehensive picture of the interplay of network topology and the corresponding network dynamics, thus allowing us to predict the dynamics of arbitrarily large hierarchical networks simply by analysing small network motifs. We also show that oscillation death can be induced in these networks, even if the coupling is symmetric, contrary to previous understanding of oscillation death. Our results show that there is a direct correlation between topology and dynamics: hierarchical networks exhibit the corresponding hierarchical dynamics. This helps bridge the gap between mesoscale motifs and macroscopic networks. This article is part of the themed issue ‘Horizons of cybernetical physics’.

APA, Harvard, Vancouver, ISO, and other styles

50

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

Journal articles on the topic 'Network topology'

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