Segui questo link per vedere altri tipi di pubblicazioni sul tema: Routers (Computer networks).
Articoli di riviste sul tema "Routers (Computer networks)"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Vedi i top-50 articoli di riviste per l'attività di ricerca sul tema "Routers (Computer networks)".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Vedi gli articoli di riviste di molte aree scientifiche e compila una bibliografia corretta.
1
Haeruddin, Haeruddin. "Analisa dan Implementasi Sistem Keamanan Router Mikrotik dari Serangan Winbox Exploitation, Brute-Force, DoS". JURNAL MEDIA INFORMATIKA BUDIDARMA 5, n. 3 (31 luglio 2021): 848. http://dx.doi.org/10.30865/mib.v5i3.2979.
Testo completoAbstract (sommario):
The advancement of technology development makes it easier to find and share any information using computer networks. Computer networks have been widely applied in homes and offices. The ease of exchanging data on the network makes the availability of computer networks and information security are vulnerable to attacks by threats. On a computer network, the device which has the vulnerability is a router. A router is the outermost device that connects the Local Area Network (LAN) to the internet so that it can be easily attacked by irresponsible parties. The Mikrotik router is a product that is widely used as a gateway router that connects LANs and the Internet. There are so many tools that can be used to carry out attacks on Mikrotik routers such as Hping3 (DoS), Hydra (Brute-Force), and Exploitation Script (Winbox Exploitation). To find out the security loop in Mikrotik routers, this study uses penetration testing methods and attack techniques such as Winbox Exploit, Brute-force, and DoS. After knowing the security gap, the next step is to provide and implementation recommendations so that similar attacks do not occur any more in the future.
2
Du, Yi-Hong, e Shi-Hua Liu. "Epidemic Model of Algorithm-Enhanced Dedicated Virus through Networks". Security and Communication Networks 2018 (7 giugno 2018): 1–7. http://dx.doi.org/10.1155/2018/4691203.
Testo completoAbstract (sommario):
Wi-Fi networks almost cover all active areas around us and, especially in some densely populated regions, Wi-Fi signals are strongly overlapped. The broad and overlapped coverage brings much convenience at the cost of great security risks. Conventionally, a worm virus can infect a router and then attack other routers within its signal coverage. Nowadays, artificial intelligence enables us to solve problems efficiently from available data via computer algorithm. In this paper, we endow the virus with some abilities and present a dedicated worm virus which can pick susceptible routers with kernel density estimation (KDE) algorithm as the attacking tasks automatically. This virus can also attack lower-encryption-level routers first and acquire fast-growing numbers of infected routers on the initial stage. We simulate an epidemic behavior in the collected spatial coordinate of routers in a typical area in Beijing City, where 56.0% routers are infected in 18 hours. This dramatical defeat benefits from the correct infection seed selection and a low-encryption-level priority. This work provides a framework for a computer-algorithm-enhanced virus exploration and gives some insights on offence and defence to both hackers and computer users.
3
Bessos, Mai Ben Adar, e Amir Herzberg. "Intercepting a Stealthy Network". ACM Transactions on Sensor Networks 17, n. 2 (giugno 2021): 1–39. http://dx.doi.org/10.1145/3431223.
Testo completoAbstract (sommario):
We investigate an understudied threat: networks of stealthy routers (S-Routers) , relaying messages to a hidden destination . The S-Routers relay communication along a path of multiple short-range, low-energy hops, to avoid remote localization by triangulation. Mobile devices called Interceptors can detect communication by an S-Router, but only when the Interceptor is next to the transmitting S-Router. We examine algorithms for a set of mobile Interceptors to find the destination of the communication relayed by the S-Routers. The algorithms are compared according to the number of communicating rounds before the destination is found, i.e., rounds in which data is transmitted from the source to the destination . We evaluate the algorithms analytically and using simulations, including against a parametric, optimized strategy for the S-Routers. Our main result is an Interceptors algorithm that bounds the expected number of communicating rounds by a term quasilinear in the number of S-Routers. For the case where S-Routers transmit at every round (“continuously”), we present an algorithm that improves this bound.
4
Pakhomova, V. M., e A. O. Opriatnyi. "Software Model for Determining the Optimal Routes in a Computer Network Based on the Two-Colonial Ant Algorithm". Science and Transport Progress. Bulletin of Dnipropetrovsk National University of Railway Transport, n. 3(93) (15 giugno 2021): 38–49. http://dx.doi.org/10.15802/stp2021/242046.
Testo completoAbstract (sommario):
Purpose. At present, the computer networks of the information and telecommunication system (ITS) of railway transport use the OSPF protocol, which does not allow taking into account several metrics when determining the optimal route. Therefore, there is a need to study the possibility of organizing routing in computer networks of rail transport ITS using a two-colonial ant algorithm. Methodology. According to the Two-ACO software model, created in the Python language based on the two-colonial ant algorithm, the optimal route in a computer network was determined. Two-ACO model inputs: computer network parameters (network adjacency matrix, number of routers); parameters of the ant algorithm (number of iterations; number of ants in the colony; number of elite ants; initial pheromone level; evaporation rate; parameter for adjusting the amount of pheromone deposition). Findings. The results of the Two-ACO model are presented in the form of graphs depicting the optimal paths: the criterion of the total delay on the routers (for the first colony of ants) and the number of hops (for the second colony of ants). Originality. According to the created Two-ACO software model for a computer network of 7 routers and 17 channels, a study of the time for determining the optimal path in a computer network by the number of ordinary and elite ants, evaporation rate and deposited pheromone was conducted. It is determined that it is enough to use the number of ants equal to the number of routers and have 2 elite ants in the colony, with 1000 iterations, evaporation rate from 0.2 to 0.7, and pheromone deposition by ants close to one. Practical value. Created Two-ACO software model using two colonies of ants on the following criteria: the total delay on the routers (for the first colony of ants) and the number of hops that make up the route (for the second colony of ants) allows you to parallel determine the optimal routes in a computer network of railway transport. It is estimated that for a computer network of 15 routers and 17 channels, it is sufficient to have 30 agents (two ants on top), the value of the pheromone deposited by the agents is close to one, and the evaporation rate is 0.4.
5
Sihotang, Bil Klinton, Sumarno Sumarno e Bahrudi Efendi Damanik. "Implementasi Access Control List Pada Mikrotik dalam Mengamankan Koneksi Internet Koperasi Sumber Dana Mutiara". JURIKOM (Jurnal Riset Komputer) 7, n. 2 (26 aprile 2020): 229. http://dx.doi.org/10.30865/jurikom.v7i2.2010.
Testo completoAbstract (sommario):
The need for information and internet access at this time is very high. To accept it is wrong only with computer networks as a medium. In a network that requires a network that has been segmented using a Virtual Local Area Network (VLAN), the application of an Access Control List (ACL) is required to be granted access rights for each device in the network. The Access Control List (ACL) can filter the data traffic of a network by controlling whether the packets are passed or issued. A network is built using several different network devices, one of which is a router. A router is a tool that can process different data packet networks (between networks) through a process called routing. lots of companies that produce routers, mikrotik is one of the companies that produce routers. mikrotik is easy to do because it uses Winbox in Gui's view, besides that the hotspot server in it is provided with several management facilities that can be arranged according to network requirements
6
Majid, Nuur Wachid Abdul, e Syifaul Fuada. "RIP VS. OSPF ROUTING PROTOCOLS: WHICH ONE IS THE BEST FOR A REAL-TIME COMPUTER NETWORK?" Simetris: Jurnal Teknik Mesin, Elektro dan Ilmu Komputer 11, n. 1 (30 aprile 2020): 249–56. http://dx.doi.org/10.24176/simet.v11i1.3796.
Testo completoAbstract (sommario):
The development of modern computer networks for internet access makes routing protocols needed, and it has an essential role in a real-time system. Therefore, the best and most effective routes can be reached. In this short article, we discuss the comparison of two popular routing protocols, i.e., Routing Information Protocol (RIP) and Open Shortest Path First (OSPF) using two network simulators, i.e., Graphical Network Simulator-3 (GNS3) and Enterprise Network Simulation Platform (ENSP). Both of OSPF and RIP routing protocols can be used in the same topology and have differences in the connection time required to connect communication between routers. Thru GNS3 and ENSP, we obtained the comparison result at ideal condition; we found that the OSPF routing protocol (83 ms) has a faster time or efficient in connection than RIP (177 ms). Besides, we found that compared to GNS3 network simulators (329 ms), the ENSP has a relatively more rapid average time (94 ms). This work suggests that a Huawei router with ENSP is faster than a Cisco router which is used by GNS3. Hopefully, this information can be refereed by internet network administrators to build real-time computer networks.
7
Qureshi, Muhammad Aasim, Mohd Fadzil Hassan, Muhammad Khurram Ehsan, Muhammad Owais Khan, Md YeaKub Ali e Shafiullah Khan. "A Robust Graph Theoretic Solution of Routing in Intelligent Networks". Wireless Communications and Mobile Computing 2022 (20 giugno 2022): 1–7. http://dx.doi.org/10.1155/2022/9661411.
Testo completoAbstract (sommario):
Implementation of robust routing is very critical in network communication. Connecting devices like routers maintain databases for the whole network topology in the routing table. Each router needs to keep these tables updated with the best possible routes so that an efficient communication can always take place in nondelay tolerant intelligent networks that include military and tactical systems, vehicular communication networks, underwater acoustic networks, and intelligent sensor networks. The fast construction of shortest-path tree (SPT) is important to devise an efficient routing in a nondelay tolerant networks. That is why a simple and efficient algorithm is the need of the time. A robust routing solution SPT with O V + E time complexity is proposed to supersede the existing landmark.
8
Bidaybekov, Ye Y., Y. K. Khenner, Sh T. Shekerbekova e Y. Н. Zhabayev. "ON THE ISSUE OF TRAINING FUTURE COMPUTER SCIENCE TEACHERS IN COMPUTER". BULLETIN Series of Physics & Mathematical Sciences 72, n. 4 (29 settembre 2020): 174–79. http://dx.doi.org/10.51889/2020-4.1728-7901.27.
Testo completoAbstract (sommario):
The article discusses of training future computer science teachers in computer networks based on network simulation. Analysis of scientific and pedagogical and educational literature has shown that in the training of computer science teachers, computer networks are studied in the aspect of information simulation of their structures, while simulation the processes of their functioning is not given due attention, despite the possibility of its use in the organization of training. Most educational institutions face organizational, technical and material difficulties when organizing training in computer networks on real equipment. The above-mentioned difficulties in training future computer science teachers in computer networks can be avoided by using network simulation. By network simulation, we mean reproducing a dynamic image of the main network components (network cables, switches, hubs, routers, etc.) and visualization the processes of their configuration and operation on the computer screen.
9
Dasmen, Rahmat Novrianda, Abdur Rohman Syarif, Heru Saputra e Rahmat Amrullah. "Perancangan Keamanan Internet Jaringan Hotspot Mikrotik pada Winbox dan Wireshark". DoubleClick: Journal of Computer and Information Technology 5, n. 2 (27 febbraio 2022): 71. http://dx.doi.org/10.25273/doubleclick.v5i2.11751.
Testo completoAbstract (sommario):
<p>Mikrotik, a technology that provides Internet services by turning computers into network routers. The computer network of SMA Negeri 16 Palembang uses a traditional cable network with star type. In this research, the process of designing a network using Mikrotik and managing and distributing bandwidth as needed at SMA Negeri 16 Palembang is carried out using the Network Development Life Cycle (NDLC) model. The result of this research is that Mikrotik can manage all computer networks. In the distribution of bandwidth regularly on the proxy can provide efficiency over the use of the internet. Mikrotik can maximize network usage if the overall bandwidth has been set.</p><p><strong><em> </em></strong></p><p><strong><em>Keywords</em></strong><em>: </em><em>Mikrotik, Computer Network, Router and Type Network</em><em></em></p>
10
MA, LIANG, e MIESO K. DENKO. "ENHANCED ROUTING METRIC FOR LOAD-BALANCING IN WIRELESS MESH NETWORKS". Journal of Interconnection Networks 08, n. 04 (dicembre 2007): 407–26. http://dx.doi.org/10.1142/s0219265907002107.
Testo completoAbstract (sommario):
Wireless mesh networks (WMNs) have been drawing significant attention in recent years due to their flexibility in providing extensive wireless backbone. WMNs typically consist of mesh routers and mesh clients with each node operating not only as a host but also as a router. Due to the traffic patterns in WMNs, load-balancing becomes an important issue and may degrade the performance of the entire network. This paper proposes a routing metric known as Weighted Cumulative Expected Transmission Time with Load-Balancing (WCETT-LB) for wireless mesh networks. WCETTT-LB enhances the basic Weighted Cumulative Expected Transmission Time (WCETT) by incorporating load-balancing into the routing metric. Unlike existing schemes, WCETT-LB implements load-balancing at mesh routers. WCETT-LB provides a congestion-aware routing and traffic splitting mechanism to achieve global load-balancing in the network. By conducting an extensive simulation experiments, the result shows that WCETT-LB outperforms the existing routing metrics in load-balancing in terms of achieving high packet delivery ratio, low average end-to-end delay and low average congestion level in wireless mesh networks. The qualitative and quantitative analysis also show the significance of the proposed scheme.
11
Goudreau, Mark W., e C. Lee Giles. "ROUTING IN RANDOM MULTISTAGE INTERCONNECTIONS NETWORKS: COMPARING EXHAUSTIVE SEARCH, GREEDY AND NEURAL NETWORK APPROACHES". International Journal of Neural Systems 03, n. 02 (gennaio 1992): 125–42. http://dx.doi.org/10.1142/s0129065792000115.
Testo completoAbstract (sommario):
The problem of establishing point-to-point communication routes in a random multistage interconnection network (RMIN) is addressed. A neural network routing scheme is presented. This routing scheme is compared to two more traditional routing techniques—namely, exhaustive search routing and greedy routing. The main criterion that is examined is the ability of each routing methodology to solve routing problems. Results are obtained through simulation of the routing methodologies for three different RMINs. The sample RMINs are relatively small since the neural network router in its present form will only be competitive for small RMINs. The simulations show that the three routing schemes perform similarly for the three sample RMINs. Other criteria that will be touched upon are the speed and the resource utilization of each routing methodology and the pros and cons of each approach will be discussed. The results suggest that neural network routers may be appropriate for some communication applications involving RMINs.
12
Schwarz, Franziska, Klaus Schwarz, Daniel Fuchs, Reiner Creutzburg e David Akopian. "Firmware Vulnerability Analysis of Widely Used Low-Budget TP-Link Routers". Electronic Imaging 2021, n. 3 (18 giugno 2021): 135–1. http://dx.doi.org/10.2352/issn.2470-1173.2021.3.mobmu-135.
Testo completoAbstract (sommario):
TP-Link Technologies Co, Ltd. is a Chinese manufacturer of networking products and has a 42% share of the consumer WLAN market, making it the market leader. The company sells about 150 million devices per year. Many people worldwide use the Internet every day and are connected to the Internet with their computers. In the world of smart homes, even coffee machines, refrigerators, smart sockets, and light bulbs have found their way to the Internet, not to mention the many smartphones, which are, of course, also connected to the Internet. Since many different dangers come from a heater or printer and the many other smart devices directly connected to the Internet, there is a safe haven: the local area network. To connect to the Internet, one needs a modem, which is built into a router in many cases. Routers route network packets back and forth between several computer networks. They are used to connect to the Internet, and they are the bridge between the home network and the Internet in almost every household connected to the Internet. Because of their nature as a bridge between local and global networks, they are also the largest attack vector. [19] This paper examines how up-to-date the firmware of standard home network routers is and how secure the firmware is. In order to obtain a representative result, the examined routers were selected according to fixed rules. Each router had to be a product of the manufacturer TP-Link, the routers had to be in the low-budged range (less than 20 Euro) and be available from Amazon. Also, two different types of investigations were identified for the selected devices. Firstly, the devices were examined in the form of physically existing hardware, and secondly, an attempt was made to access the firmware via the manufacturer’s website. It was found that even the fixing of current vulnerabilities and recently released update files are no guarantee that older vulnerabilities have been fixed. Secrets such as private keys and certificates are hard-coded in the firmware and can be extracted from update files. Moreover, devices are deliberately built to make it impossible to install the latest alternative firmware.
13
Stepanov, P. P., G. V. Nikonova, T. S. Pavlyuchenko e V. V. Soloviev. "Features of Address Resolution Protocol Operation in Computer Networks". Programmnaya Ingeneria 13, n. 5 (16 maggio 2022): 211–18. http://dx.doi.org/10.17587/prin.13.211-218.
Testo completoAbstract (sommario):
The paper analyzes the network protocols of computer networks to identify potential vulnerabilities at the software level. The conditions for carrying out a man-in-the-middle attack in networks using the Address Resolution Protocol (ARP) are investigated. Such attacks are of a rather dangerous type, since they are based on the shortcomings of the ARP protocol. A detailed analysis of the stages of the attack and the sequence of impact on the attacked node is given. The technology of ARP spoofing (poisoning) and methods that allow one to infiltrate an existing connection and communication process are examined in detail. An implementation of an ARP spoofing attack in the Python and C# programming languages using the Soapy and SharpPcap libraries is presented. Examples of implementation of denial-of-service (DoS) attacks in a peer-to-peer network using the ARP protocol in C# are given. The article also describes examples of man-in-the-middle attacks associated with various protocols and infiltration into the address space of routers, such as DHCP (a protocol that dynamically assigns an IP address to a client computer) spoofing and ICMP (Internet Control Message Protocol) redirection. Methods for hacking a router and substituting a MAC address and examples of scripts that implement: sending a fake ARP packet; a function for performing a DoS attack; changing the Linux MAC address; router hacks, are presented in the article.
14
Ryndych, Yevhen, Andrii Borovyk e Oleksii Borovyk. "RESEARCH OF TUNNELING TECHNOLOGIES IN MODERN COMPUTER NETWORKS". Technical Sciences and Technologies, n. 4(26) (2021): 67–74. http://dx.doi.org/10.25140/2411-5363-2021-4(26)-67-74.
Testo completoAbstract (sommario):
Modern corporate networks are a combination of internal and external communication channels. The issue of confiden-tiality in such networks is relevant. To reduce the risks associated with implementing new solutions in continuous cycle systems, it is necessary to analyze and evaluate their impact.For now, there is a large number of network protocols that can be used to create tunnels. Modern network equipment is a rather complex software and hardware system that supports many standards and protocols. Well-known network equipment manufacturer MikroTik has upgraded the RouterOS operating system to version 7, where the main change is the use of an updated Linux kernel version 5.6.3, which allows routers to use several different waysto establish secure connections. In modern research, the main attention is paid to encryption algorithms and tunneling protocols without taking into account the peculiarities of implementation. The aim of the article is to develop semi-natural modeling of networks that can be used in the educational process and production systems. The result of the simulation is quantitative indicators of the performance of network equipment and com-munication channels. The use of semi-natural modeling is necessary when itis not possible to describe the operation of some elements of the system mathematically. Real network equipment and long-distance communication channels of providers were used to model the corporate network. To make the results objective in the test scheme, MikroTik hAP ac2 equipment with a hardware encryption chip and RouterOS v.7.1 were installed on both ends. A 100 Mbps channel was used as the ISP at both ends. The standard Bandwith test tool built into RouterOS is used as a data generator. The study allowed to determine the features of the modern version of the operating system RouterOS. A feature of this version is the built-in implementation of the tunnel using the WireGuard protocol, which showed high performance. The model was also used to obtain quantitative indica-tors of the performance of tunnels with different protocols under the condition of encrypting the transmitted data. As can beseen from the results of the experiments, the impact of protocols and their implementations on the useful bandwidth is significant and can reduce it several times.
15
Du, Jiang, e Yu Li. "A Solution for Anonymous Routers Discovery Based on Source-Routing Traceroute". Advanced Materials Research 765-767 (settembre 2013): 1050–54. http://dx.doi.org/10.4028/www.scientific.net/amr.765-767.1050.
Testo completoAbstract (sommario):
Discovery of computer networks topology is always an important basement for network management. As IPv6 becomes the official standard, topology discovery methods should be changed as well. In IPv6 network, Anonymous Routers (AR) is one problem that we must deal with. AR is one kind of router we dont know its interface information, which makes it very difficult to find out their interconnections through common ways. This paper introduces a solution to deal with it, using source-routing traceroute command and nodes degree to merge ARs or find out their relation, and finally get the topology graph.
16
Kim, Ku-Hwan, Hoang-Linh To, Won-Joo Hwang e Jung-Tae Lee. "Infinite Queue Management via Cascade Control for Industrial Routers in Smart Grid IP Networks". Scientific Programming 2016 (2016): 1–10. http://dx.doi.org/10.1155/2016/5796907.
Testo completoAbstract (sommario):
Smart grid applications experience an extremely wide range of communication delay. Data flows of those applications are normally aggregated at industrial network routers in substations, form infinite (long) queues termed bufferbloat issue, and might damage the operation of transmission control protocol. The default queue management scheme, DropTail, in such routers just drops packets if queue is full while the others in literature are mostly based on one-loop feedback control where an optimal point of performance between queue length and drop rate is limited. In this paper, we study the problem of managing a long queue of industrial router at substation under heterogeneous smart grid networks. Specifically, we propose an enqueue-dequeue dropping cascade control using a two-loop design method to control both window size and queue length. Moreover, our proposal can be easily implemented into router firmware with provided discrete expressions. Finally, our simulation results are presented to validate the possible benefits that can be gained from cascade control and compare the existing queue management methods as well.
17
JESSHOPE, CHRIS. "LATENCY REDUCTION IN VLSI ROUTERS". Parallel Processing Letters 03, n. 04 (dicembre 1993): 485–94. http://dx.doi.org/10.1142/s0129626493000502.
Testo completoAbstract (sommario):
This paper presents recent results on the MP1 router chip designed to implement scalable parallel computers. We survey design considerations used in order to reduce message delivery latency to a minimum. Results will be presented of simulations of the MP1 network which back up these considerations. It will be shown that there are many degrees of freedom in implementation and that implementation issues will often overwhelm other considerations, those on which simulation is focused, leading to anomalous predictions from those results. An example will be given on this. Even ultra-low latency networks will still have access times to remote data which are 10 to 100 times that for access to local data and architectures which tolerate low latency data-access must be exploited if scalable performance is to be obtained in these parallel machines based on networks.
18
Zhang, Min, e Chiu-Sing Choy. "Low-Cost Allocator Implementations for Networks-on-Chip Routers". VLSI Design 2009 (15 marzo 2009): 1–10. http://dx.doi.org/10.1155/2009/415646.
Testo completoAbstract (sommario):
Cost-effective Networks-on-Chip (NoCs) routers are important for future SoCs and embedded devices. Implementation results show that the generic virtual channel allocator (VA) and the generic switch allocator (SA) of a router consume large amount of area and power. In this paper, after a careful study of the working principle of a VA and the utilization statistics of its arbiters, opportunities to simplify the generic VA are identified. Then, the deadlock problem for a combined switch and virtual channel allocator (SVA) is studied. Next, the impact of the VA simplification on the router critical paths is analyzed. Finally, the generic architecture and two low-cost architectures proposed (the look-ahead, and the SVA) are evaluated with a cycle-accurate network simulator and detailed VLSI implementations. Results show that both the look-ahead and the SVA significantly reduce area and power compared to the generic architecture. Furthermore, cost savings are achieved without performance penalty.
19
Supraja, Dr P., Anas A. Salameh, Dr Varadaraju H R, Dr M. Anand e Unggul Priyadi. "An Optimal Routing Protocol Using a Multiverse Optimizer Algorithm for Wireless Mesh Network". International Journal of Communication Networks and Information Security (IJCNIS) 14, n. 3 (23 dicembre 2022): 36–46. http://dx.doi.org/10.17762/ijcnis.v14i3.5569.
Testo completoAbstract (sommario):
Wireless networks, particularly Wireless Mesh Networks (WMNs), are undergoing a significant change as a result of wireless technology advancements and the Internet's rapid expansion. Mesh routers, which have limited mobility and serve as the foundation of WMN, are made up of mesh clients and form the core of WMNs. Mesh clients can with mesh routers to create a client mesh network. Mesh clients can be either stationary or mobile. To properly utilise the network resources of WMNs, a topology must be designed that provides the best client coverage and network connectivity. Finding the ideal answer to the WMN mesh router placement dilemma will resolve this issue MRP-WMN. Since the MRP-WMN is known to be NP-hard, approximation methods are frequently used to solve it. This is another reason we are carrying out this task. Using the Multi-Verse Optimizer algorithm, we provide a quick technique for resolving the MRP-WMN (MVO). It is also proposed to create a new objective function for the MRP-WMN that accounts for the connected client ratio and connected router ratio, two crucial performance indicators. The connected client ratio rises by an average of 16.1%, 12.5%, and 6.9% according to experiment data, when the MVO method is employed to solve the MRP-WMN problem, the path loss falls by 1.3, 0.9, and 0.6 dB when compared to the Particle Swarm Optimization (PSO) and Whale Optimization Algorithm (WOA), correspondingly.
20
Sakamoto, Shinji, Algenti Lala, Tetsuya Oda, Vladi Kolici, Leonard Barolli e Fatos Xhafa. "Application of WMN-SA Simulation System for Node Placement in Wireless Mesh Networks". International Journal of Mobile Computing and Multimedia Communications 6, n. 2 (aprile 2014): 13–21. http://dx.doi.org/10.4018/ijmcmc.2014040102.
Testo completoAbstract (sommario):
One of the key advantages of Wireless Mesh Networks (WMNs) is their importance for providing cost-efficient broadband connectivity. In WMNs, there are issues for achieving the network connectivity and user coverage, which are related with the node placement problem. In this work, the authors consider the router node placement problem in WMNs. The objective is to find the optimal distribution of router nodes in order to provide the best network connectivity (the maximal number of connected routers) and coverage (maximal number of covered clients). The authors apply their proposed WMN-SA simulation system in a realistic scenario of the distribution of mesh clients considering Itoshima City, Fukuoka Prefecture, Japan. From simulation results, they found many insights that can be very important for real deployment of WMNs.
21
Zhixun, Liang, Xu Chuanpei, Bi Lvqing, Shi Yunying, Yi Yunfei e Hu Cong. "Modeling and Performance Analysis of a Fault-Tolerant 3D Photonic Network-on-Chip Based on Hybrid Photonics–Plasmonics". Computational Intelligence and Neuroscience 2022 (19 luglio 2022): 1–24. http://dx.doi.org/10.1155/2022/9615610.
Testo completoAbstract (sommario):
The performance of electro-optic modulators and optical routers and their routing algorithms are the key factors affecting the performance of networks on optical chips. This paper improves the mesh 3-dimensional photonic network-on-chip (3D-PNoC) topology. An SPP hybrid silicon-based electro-optic modulator and an improved fault-tolerant SPP router are used to improve the performance of the network on an optical chip. SPP switching and SPP MRR are combined to form a fault-tolerant SPP router. On this basis, an improved genetic optimization routing algorithm is implemented on the improved mesh 3D PNoC topology, which completes the data exchange of the IP core of the network on the optical chip. Compared with the case of traditional optoelectronic devices, the performance of on-chip optical networks can be improved effectively. The simulation results show that upon the application of the improved genetic optimization routing algorithm to the improved mesh 3D PNoC topology, the average end-to-end delay is reduced by 32.9%, the throughput rate is increased by 28.5%, and the system power consumption is reduced by 27.6%. On the other hand, the average insertion loss and noise of optical routers are increased by 2.94 dB and 2.95 dB, respectively.
22
MERKLE, DANIEL, MARTIN MIDDENDORF e ALEXANDER SCHEIDLER. "DECENTRALIZED PACKET CLUSTERING IN ROUTER-BASED NETWORKS". International Journal of Foundations of Computer Science 16, n. 02 (aprile 2005): 321–41. http://dx.doi.org/10.1142/s0129054105003017.
Testo completoAbstract (sommario):
Different types of decentralized clustering problems have been studied so far for networks and multi-agent systems. In this paper we introduce a new type of a decentralized clustering problem for networks. The so called Decentralized Packet Clustering (DPC) problem is to find for packets that are sent around in a network a clustering. This clustering has to be done by the routers using only few computational power and only a small amount of memory. No direct information transfer between the routers is allowed. We investigate the behavior of new a type of decentralized k-means algorithm — called DPClust — for solving the DPC problem. DPClust has some similarities with ant based clustering algorithms. We investigate the behavior of DPClust for different clustering problems and for networks that consist of several subnetworks. The amount of packet exchange between these subnetworks is limited. Networks with different connection topologies for the subnetworks are considered. A dynamic situation where the packet exchange rates between the subnetworks varies over time is also investigated. The proposed DPC problem leads to interesting research problems for network clustering.
23
Zhuang, Hongbin, Jou-Ming Chang, Xiao-Yan Li, Fangying Song e Qinying Lin. "All-to-All Broadcast Algorithm in Galaxyfly Networks". Mathematics 11, n. 11 (26 maggio 2023): 2459. http://dx.doi.org/10.3390/math11112459.
Testo completoAbstract (sommario):
The design of interconnection networks is a fundamental aspect of high-performance computing (HPC) systems. Among the available topologies, the Galaxyfly network stands out as a low-diameter and flexible-radix network for HPC applications. Given the paramount importance of collective communication in HPC performance, in this paper, we present two different all-to-all broadcast algorithms for the Galaxyfly network, which adhere to the supernode-first rule and the router-first rule, respectively. Our performance evaluation validates their effectiveness and shows that the first algorithm has a higher degree of utilization of network channels, and that the second algorithm can significantly reduce the average time for routers to collect packets from the supernode.
24
Turovsky, Oleksandr, Andrii Zakharzhevskyi, Anatoliy Makarenko e Larysa Dakova. "Construction of a simulated dynamic model of data packet routing on a telecommunication network fragment". Eastern-European Journal of Enterprise Technologies 5, n. 9 (125) (31 ottobre 2023): 45–52. http://dx.doi.org/10.15587/1729-4061.2023.287677.
Testo completoAbstract (sommario):
The object of the current research is the process of routing data packets in a telecommunications network. It was established that the state and parameters of data transmission channels and routers could have a negative impact and need to be taken into account in the process of modeling the routing of data packets in telecommunication networks. A model of simulated dynamic modeling of data packet routing in telecommunication networks has been devised and proposed. The suggested model makes it possible to establish quantitative values of the delay time of processing data packets during their routing along a separate segment of the telecommunications network, taking into account the state and parameters of the data transmission channel and routers. It has been established that the achievement of the minimum delay time of data packets during routing is achieved by choosing the path of their transmission under the condition of minimum transmission time by communication lines and the capabilities of routers in terms of their accumulation and service speed. At the same time, the reduction of packet transmission delay time relative to the average for the time network segment can reach from 21 to 38 percent. It is shown that the main factor affecting the value of the delay time is the speed of data processing along the selected path of packet transmission. The number of routing nodes in a separate data transmission path can affect the delay time only if the parameters of the routers are equal compared to others that are included in alternative routes. The model of simulated dynamic modeling of data packet routing reported in this work, unlike the existing ones, takes into account the state and parameters of data transmission channels and routers. It can be used in practical improvement of existing and development of new multi-service telecommunication communication networks
25
Baumgartner, Florian, Torsten Braun, Eveline Kurt e Attila Weyland. "Virtual routers". ACM SIGCOMM Computer Communication Review 33, n. 3 (luglio 2003): 127–35. http://dx.doi.org/10.1145/956993.957008.
Testo completo
26
Kulkarni, Raghavendra, e Kalpana Sharma. "A Routing Algorithm with Sdn Controller Using Policy-Based Routing (PBR)". ECS Transactions 107, n. 1 (24 aprile 2022): 12661–70. http://dx.doi.org/10.1149/10701.12661ecst.
Testo completoAbstract (sommario):
Software defined networking (SDN) is a modern computer network architecture in which the control plane is separated from the data plane and applied centrally. SDN use in businesses necessitates the replacement of legacy network infrastructure, which comes at a high cost to the business. The phased rollout of SDN in the form of hybrid networks is the solution to this issue. Legacy devices' control planes must communicate with the SDN controller in hybrid networks. This connectivity facilitates the use of SDN in hybrid networks. Policy-based routing (PBR) is a mechanism in legacy networks that makes routing decisions based on policies set by network administrators and offers a versatile routing mechanism. Using an SDN controller and the Open Flow protocol, we presented a new approach for policy-based routing (PBR) in RIP-based hybrid networks in this article. The Open Flow switches send false metrics advertising packets to the legacy routers using this tool. We may alter the routing table of a legacy router using this procedure, which is dependent on the controller's policy.
27
Louati, W., e D. Zeghlache. "Network-based virtual personal overlay networks using programmable virtual routers". IEEE Communications Magazine 43, n. 8 (agosto 2005): 86–94. http://dx.doi.org/10.1109/mcom.2005.1497558.
Testo completo
28
Suvorova, Elena, Yuriy Sheynin e Nadezhda Matveeva. "Quality of Service in Embedded Networks". International Journal of Embedded and Real-Time Communication Systems 5, n. 4 (ottobre 2014): 77–98. http://dx.doi.org/10.4018/ijertcs.2014100104.
Testo completoAbstract (sommario):
Embedded systems are widely used in many fields, from space industry to medicine. In this paper we consider Quality of Service (QoS) in embedded networks. Different QoS are analyzed. The authors consider three structures and implementations of the network layer for providing QoS, compare their implementation characteristics and evaluate hardware costs. They consider QoS mechanisms support in modern space network protocols, possibility of using them in embedded networks. Hardware costs are one of the main constraints for embedded networks. Therefore hardware costs of basic routers with these QoS mechanisms are compared.
29
AL Khawaldah, Ibrahim Ismail Abdelhadi. "The task of managing flows in a communication network of the X.25 protocol". Journal of Advanced Sciences and Engineering Technologies 3, n. 2 (10 ottobre 2020): 20–36. http://dx.doi.org/10.32441/jaset.03.02.03.
Testo completoAbstract (sommario):
One of the most established and well-known standards for packet switched networks are the international standard X.25, The X.25 Recommendation defines the interface requirements between the user equipment (such as a terminal, bridge, router, and computer) and a packet switching network for data exchange X.25 network provides an efficient way to transfer data within one region, the country and even all over the world. The synchronous data transfer with a speed of up to 64 Kbps. The X.25 standards provides automatic error detection and correction, which allows X.25 networks to work effectively even in regions where the quality of communication lines is low. The X.25 interface provides Access to the remote user to the host computer (host). The X.25 standard describes the interface between the data entry equipment – DTE (Data Terminal Equipment) and data network equipment – DCE (Data Circuit terminating Equipment). Bridges, routers, terminals, personal computers (PCs), workstations are an example of equipment that can function as a (DTE) . When it is connected to a packet switched network. DTE provides the user part of the user-network interface. The equipment to which the DTE is connected is called DCE. DCE provides the network part of the user-network interface. Each DTE has its own DCE. However, several DTE devices can be connected to the same DCE. DTE-DTE connection is invalid; communication is only possible between DTE-DCE and DCE-DCE
30
Decasper, Dan, Zubin Dittia, Guru Parulkar e Bernhard Plattner. "Router plugins: a software architecture for next generation routers". ACM SIGCOMM Computer Communication Review 28, n. 4 (ottobre 1998): 229–40. http://dx.doi.org/10.1145/285243.285285.
Testo completo
31
Rivera Torres, Pedro J., Carlos Gershenson García e Samir Kanaan Izquierdo. "Fault Detection and Isolation in Smart-Grid Networks of Intelligent Power Routers Modeled as Probabilistic Boolean Networks". Complexity 2023 (14 dicembre 2023): 1–12. http://dx.doi.org/10.1155/2023/6690805.
Testo completoAbstract (sommario):
A self-organizing complex-network modeling method, probabilistic Boolean networks, is presented as a model-based diagnostic system for detecting and isolating different types of faults, failures, and modes of operation in which a network of intelligent power routers is deployed over a standard power test case: the Western System Coordinating Council 9 Bus System. Such a system allows designers and engineering professionals to make educated decisions pertaining to the design of smart-grid systems endowed with intelligent power routers. There is a recurrent necessity to design reliable and fault-tolerant smart power systems, maintaining adequate operation and adherence to performance specifications, while keeping costs at the minimum. This diagnostics system will help achieve such goals: better design through thorough analysis of the conditions that lead to a fault on a smart grid, proper detection of these faults, and isolation of the respective assets.
32
Beshley, Mykola, Natalia Kryvinska, Halyna Beshley, Oleg Yaremko e Julia Pyrih. "Virtual Router Design and Modeling for Future Networks with QoS Guarantees". Electronics 10, n. 10 (11 maggio 2021): 1139. http://dx.doi.org/10.3390/electronics10101139.
Testo completoAbstract (sommario):
A virtual router model with a static and dynamic resource reconfiguration for future internet networking was developed. This technique allows us to create efficient virtual devices with optimal parameters (queue length, queue overflow management discipline, number of serving devices, mode of serving devices) to ensure the required level of quality of service (QoS). An analytical model of a network device with virtual routers is proposed. By means of the mentioned mathematical representation, it is possible to determine the main parameters of the virtual queue system, which are based on the first in, first out (FIFO) algorithm, in order to analyze the efficiency of network resources utilization, as well as to determine the parameters of QoS flows, for a given intensity of packets arrival at the input interface of the network element. In order to research the guaranteed level of QoS in future telecommunications networks, a simulation model of a packet router with resource virtualization was developed. This model will allow designers to choose the optimal parameters of network equipment for the organization of virtual routers, which, in contrast to the existing principle of service, will provide the necessary quality of service provision to end users in the future network. It is shown that the use of standard static network device virtualization technology is not able to fully provide a guaranteed level of QoS to all present flows in the network by the criterion of minimum delay. An approach for dynamic reconfiguration of network device resources for virtual routers has been proposed, which allows more flexible resource management at certain points in time depending on the input load. Based on the results of the study, it is shown that the dynamic virtualization of the network device provides a guaranteed level of QoS for all transmitted flows. Thus, the obtained results confirm the feasibility of using dynamic reconfiguration of network device resources to improve the quality of service for end users.
33
Lemeshko, Oleksandr, Oleksandra Yeremenko e Olena Nevzorova. "Hierarchical Method of Inter-Area Fast Rerouting". Transport and Telecommunication Journal 18, n. 2 (1 giugno 2017): 155–67. http://dx.doi.org/10.1515/ttj-2017-0015.
Testo completoAbstract (sommario):
Abstract In this paper, in order to increase the scalability and fault-tolerance of routing solutions the hierarchical method of inter-area fast rerouting in communication networks was presented. The method is based on the decomposed representation of the flow-based routing model with the introduction of the area interaction conditions to ensure connectivity of the inter-area routes. The model includes conditions for border routers protection, adapted for both single path and multipath routing. During the research it was established that the efficiency of the proposed method in terms of the speed of the coordinating procedure convergence was most influenced by the number of border routers and the implemented routing strategy.
34
SHANKER, O., e TAD HOGG. "EPIDEMIOLOGY MODEL ON SHORTCUT AND SMALL WORLD NETWORKS". Modern Physics Letters B 23, n. 10 (20 aprile 2009): 1249–62. http://dx.doi.org/10.1142/s0217984909019387.
Testo completoAbstract (sommario):
We show that the behavior of an epidemiology model depends sensitively on the shortcut density in the shortcut network. This is consistent with an earlier work on other processes on the shortcut network. We analytically study the reason for the sensitivity. The shortcut network is similar to the small world network, and it has the advantage that the model dependence on the shortcut density can be analytically studied. The model would be relevant to the spread of diseases in human, animal, plant or other populations, to the spread of viruses in computer networks, or to the spread of social contagion in social networks. It would also be relevant in understanding the variations in the load on routers connecting different computer networks, as the network topology gets extended by the addition of new links, and in analyzing the placement of certain special sensors in a sensor network laid out in a non-random way with some shortcut links.
35
HU, WEI, TIANZHOU CHEN, QINGSONG SHI e SHA LIU. "CRITICAL-PATH DRIVEN ROUTERS FOR ON-CHIP NETWORKS". Journal of Circuits, Systems and Computers 19, n. 07 (novembre 2010): 1543–57. http://dx.doi.org/10.1142/s021812661000689x.
Testo completoAbstract (sommario):
Multithreaded programming has become the dominant paradigm in computer architecture, mainly in the form of multi-core processors. The performance bottleneck of a multithreaded program is its critical path, whose length is its total execution time. As the number of cores within a processor increases, Network-on-Chip (NoC) has been proposed as a promising approach for inter-core communication. In order to optimize the performance of a multithreaded program running on an NoC based multi-core platform, we design and implement the critical-path driven router, which prioritizes inter-thread communication on the critical path when routing packets. The experimental results show that the critical-path driven router improves the execution time of the test case by 14.8% compared to the ordinary router.
36
Alanezi, Mohammed A., Houssem R. E. H. Bouchekara e Muhammad S. Javaid. "Optimizing Router Placement of Indoor Wireless Sensor Networks in Smart Buildings for IoT Applications". Sensors 20, n. 21 (30 ottobre 2020): 6212. http://dx.doi.org/10.3390/s20216212.
Testo completoAbstract (sommario):
Internet of Things (IoT) is characterized by a system of interconnected devices capable of communicating with each other to carry out specific useful tasks. The connection between these devices is ensured by routers distributed in a network. Optimizing the placement of these routers in a distributed wireless sensor network (WSN) in a smart building is a tedious task. Computer-Aided Design (CAD) programs and software can simplify this task since they provide a robust and efficient tool. At the same time, experienced engineers from different backgrounds must play a prominent role in the abovementioned task. Therefore, specialized companies rely on both; a useful CAD tool along with the experience and the flair of a sound expert/engineer to optimally place routers in a WSN. This paper aims to develop a new approach based on the interaction between an efficient CAD tool and an experienced engineer for the optimal placement of routers in smart buildings for IoT applications. The approach follows a step-by-step procedure to weave an optimal network infrastructure, having both automatic and designer-intervention modes. Several case studies have been investigated, and the obtained results show that the developed approach produces a synthesized network with full coverage and a reduced number of routers.
37
Wang, Qi, Yiming Ouyang, Zhengfeng Huang e Huaguo Liang. "Workload-Aware WiNoC Design with Intelligent Reconfigurable Wireless Interface". Security and Communication Networks 2023 (9 maggio 2023): 1–14. http://dx.doi.org/10.1155/2023/9519044.
Testo completoAbstract (sommario):
By introducing wireless interfaces in conventional wired routers or hubs, wireless network-on-chip (WiNoC) is proposed to relieve congestion pressure from high volume inter-subnet data transmission. Generally, processing elements on chip receive input data and return feedback through network interface, and data transmission function in Network-on-Chip (NoC) is completed by routers. Hubs equipped with wireless interface are fixed to certain wired routers. While wireless channels may not be fully utilized due to unbalanced workload and constant hub-router connection, e.g., certain nodes processing excess inter-subnet data traffic are far away from hubs. In this paper, we proposed a workload-aware WiNoC design with intelligent reconfigurable wireless interface to improve wireless resources utilization and mitigate congestion. Through multidimensional analysis of traffic flow, a 4-layer neural network is trained offline and applied to analyze workload in each tile, and return three most potential tiles for wireless interface reconfiguration to fully utilize wireless channel and lowing latency. We also implement a historical traffic information-based reconfigurable scheme for comparation. Evaluation results show that in an 8 × 8 hybrid mesh topology, the proposed scheme can achieve 10%–16% reduction in network latency and 5%–11% increment in network throughput compared with fixed-link hub-node connection scheme under several mixed traffic patterns.
38
Karbowski, Andrzej. "PARALLEL ALGORITHMS FOR MULTICORE ROUTERS IN LARGE COMPUTER NETWORKS – A REVIEW". IFAC Proceedings Volumes 40, n. 9 (2007): 298–303. http://dx.doi.org/10.3182/20070723-3-pl-2917.00048.
Testo completo
39
Andara, Andi, Setyawan Widyarto e Rusdah. "Development of Web-Based Network Automation Applications Using the Kano Method and Paramiko Library to Simplify the Configuration of Multivendor Network Devices at PT. Digital Vision Nusantara". International Journal of Science and Society 5, n. 5 (6 dicembre 2023): 976–92. http://dx.doi.org/10.54783/ijsoc.v5i5.965.
Testo completoAbstract (sommario):
Computer network is never separated with configuration which is the main task which has to be done in order to make it work. As we know, to configure some devices either server, switch, or router has several methods if we understand how we communicate with the system. Configuration on routers and switches is currently still conventionally done, which means that to configure routers or switches one by one. This is very inefficient, because if the routers and switches that you want to configure are carried out in hundreds or many routers, then the time required by a network administrator is very long. Therefore, network automation is needed which is a solution to perform these complex and repetitive tasks. This automation can help network administrators to configure networks with many devices at once and minimize errors that occur when configuring in a short time. Repetitive work such as configuration backups, configuration restores, and others can be automated. In this project create a web-based network administration automation application. For application development using the Kano method to identify application requirements, design, build and implement applications, this application utilizes the main library, namely paramiko as a liaison and network automation from servers to network devices using the SSHv2 protocol and the Django framework as a Web developers. For the tests carried out on the application using the Black-Box Testing method. The results of this project application can be used as network automation in terms of configuration of network devices such as router configuration, switch configuration, backup and restore configuration centrally so that they can be managed better. This research was conducted with the aim of knowing the category of each feature in a network automation application, the results of this study obtained priority ospf dynamic routing configuration features that entered Must be with a satisfaction level of 0.4285 if implemented and a disappointment level of -0.4285 if this feature not stated, while for the ip address configuration feature, and the On-Dimensional Login feature with a satisfaction level of 0.5713 and a disappointment level of -0.5713 if this feature is implemented, unlike the PIM routing feature configuration feature and the Indifferent configuration verification feature, which for this feature is not often used.
40
LI, DAWEI, JIE WU, DAJIN WANG e JIAYIN WANG. "Software-Defined Networking Switches for Fast Single-Link Failure Recovery". Journal of Interconnection Networks 18, n. 04 (dicembre 2018): 1850014. http://dx.doi.org/10.1142/s0219265918500147.
Testo completoAbstract (sommario):
In this paper, we consider IP fast recovery from single-link failures in a given network topology. The basic idea is to replace some existing routers with a designated switch. When a link fails, the affected router will send all the affected traffic to the designated switch (through pre-configured IP tunnels), which will deliver the affected traffic to its destination without using the failed link. The goal of the approach is to achieve faster failure recovery than traditional routing protocols that employ reactive computing upon link failures. Software-Defined Networking (SDN) switches can serve as the designated switches because they can flexibly redirect affected traffic to other routes, instead of only to the shortest paths in the network. However, SDN switches are very expensive. Our objective is to minimize the number of SDN switches needed and to guarantee that the network can still recover from any single-link failure. For networks with uniform link costs, we show that using normal non-SDN switches with IP tunneling capability as designated switches can guarantee recovery from any single-link failure. For networks with general link costs, we find that not all single-link failures can be recovered by using non-SDN switches as designated switches; by using SDN switches only when necessary, we can reduce the total number of SDN switches needed compared to an existing work. We conduct extensive simulations to verify our proposed approaches.
41
DURRESI, ARJAN, VAMSI PARUCHURI, LEONARD BAROLLI, RAJGOPAL KANNAN e S. S. IYENGAR. "EFFICIENT AND SECURE AUTONOMOUS SYSTEM BASED TRACEBACK". Journal of Interconnection Networks 05, n. 02 (giugno 2004): 151–64. http://dx.doi.org/10.1142/s0219265904001076.
Testo completoAbstract (sommario):
The design of the IP protocol makes it difficult to reliably identify the originator of an IP packet, causing the defense against Distributed Denial of Service attacks to become one of the hardest problems on the Internet today. Previous solutions for this problem try to traceback to the exact origin of the attack by requiring every router's participation. For many reasons this requirement is impractical and the victim results with an approximate location of the attacker. Reconstruction of the whole path is also very difficult due to the sheer size of the Internet. This paper presents lightweight schemes for tracing back to the attack-originating AS instead to the exact origin itself. Once the attack-originating AS is determined, all further routers in the path to the attacker are within that AS and under the control of a single entity; which can presumably monitor local traffic in a more direct way than a generalized, Internet scale, packet marking scheme can. We furthermore, provide a scheme to prevent compromised routers from forging markings.
42
Suvorova, Elena, Yuriy Sheynin e Nadezhda Matveeva. "Fault Mitigation in Reconfigurable NoC Routers with Thin Design Rules". International Journal of Embedded and Real-Time Communication Systems 6, n. 1 (gennaio 2015): 28–46. http://dx.doi.org/10.4018/ijertcs.2015010102.
Testo completoAbstract (sommario):
Modern networks-on-chip (NoC) for embedded systems are manufactured by thin design rules; they should be resistant to failures due to the specific aspects of the technology. In the paper we consider failure mitigation approaches, evaluate them for thin design rules. Most fault mitigation approaches are based on reconfiguration of NoC and its main components – routers. We suggest the methodology for development of reconfigurable routers with fault mitigation, estimate them using simulation that enables dynamic failure injection. The proposed method can be used for routers with different structures in NoC with various interconnection graphs.
43
Ghani, Rana Fareed, e Laith Al-Jobouri. "Packet Loss Optimization in Router Forwarding Tasks Based on the Particle Swarm Algorithm". Electronics 12, n. 2 (16 gennaio 2023): 462. http://dx.doi.org/10.3390/electronics12020462.
Testo completoAbstract (sommario):
Software-defined networks (SDNs) are computer networks where parameters and devices are configured by software. Recently, artificial intelligence aspects have been used for SDN programs for various applications, including packet classification and forwarding according to the quality of service (QoS) requirements. The main problem is that when packets from different applications pass through computer networks, they have different QoS criteria. To meet the requirements of packets, routers classify these packets, add them to multiple weighting queue systems, and forward them according to their priorities. Multiple queue systems in routers usually use a class-based weighted round-robin (CBWRR) scheduling algorithm with pre-configured fixed weights for each priority queue. The problem is that the intensity of traffic in general and of each packet class occasionally changes. Therefore, in this work, we suggest using the particle swarm optimization algorithm to find the optimal weights for the weighted fair round-robin algorithm (WFRR) by considering the variable densities of the traffic. This work presents a framework to simulate router operations by determining the weights and schedule packets and forwarding them. The proposed algorithm to optimize the weights is compared with the conventional WFRR algorithm, and the results show that the particle swarm optimization for the weighted round-robin algorithm is more efficient than WFRR, especially in high-intensity traffic. Moreover, the average packet-loss ratio does not exceed 7%, and the proposed algorithms are better than the conventional CBWRR algorithm and the related work results.
44
Baskoro, Andri Nuki, Anton Anton e Puji Astuti. "DESIGNING A ROUTER REDUCTION SYSTEM USING HOT STANDBY ROUTER PROTOCOL METHOD FOR BACKUP LINK IN DITJEN PPKL". Jurnal Techno Nusa Mandiri 17, n. 2 (15 settembre 2020): 117–22. http://dx.doi.org/10.33480/techno.v17i2.1643.
Testo completoAbstract (sommario):
Computer networks play an important role in data communication at companies or government institutions to support them in terms of work. In this case, the authors conducted observational research and direct interviews with IT staff at the Ditjen PPKL Control about how the network operates in that place. Routers have a very important role in data communication and connecting different networks, so a router reduction system is needed as a solution to minimize failures on the network or these devices. The network topology in each office or government agency is different, which makes the problems in each government office or agency different. Based on the research that has been done, the network of the Ditjen PPKL often experiences a link down which causes disconnection of the internet connection and hinders the productivity of staff. So a router redundancy system is needed to maintain network availability, such as the Hot Standby Router Protocol (HSRP) which has two lines, one as the mainline and the other as a backup if the mainline is down. That way network availability will always be maintained without having to wait for the IT staff to do troubleshooting if there is a network failure. The result of this research is to provide maintained network availability. Even if a link goes down, the network will automatically return to normal.
45
Ding, Shichang, Fan Zhao e Xiangyang Luo. "A Street-Level IP Geolocation Method Based on Delay-Distance Correlation and Multilayered Common Routers". Security and Communication Networks 2021 (11 gennaio 2021): 1–11. http://dx.doi.org/10.1155/2021/6658642.
Testo completoAbstract (sommario):
The geographical locations of smart devices can help in providing authentication information between multimedia content providers and users in 5G networks. The IP geolocation methods can help in estimating the geographical location of these smart devices. The two key assumptions of existing IP geolocation methods are as follows: (1) the smallest relative delay comes from the nearest host; (2) the distance between hosts which share the closest common routers is smaller than others. However, the two assumptions are not always true in weakly connected networks, which may affect accuracy. We propose a novel street-level IP geolocation algorithm (Corr-SLG), which is based on the delay-distance correlation and multilayered common routers. The first key idea of Corr-SLG is to divide landmarks into different groups based on relative-delay-distance correlation. Different from previous methods, Corr-SLG geolocates the host based on the largest relative delay for the strongly negatively correlated groups. The second key idea is to introduce the landmarks which share multilayered common routers into the geolocation process, instead of only relying on the closest common routers. Besides, to increase the number of landmarks, a new street-level landmark collection method called WiFi landmark is also presented in this paper. The experiments in one province capital city of China, Zhengzhou, show that Corr-SLG can improve the geolocation accuracy remarkably in a real-world network.
46
Riyadi, Slamet, e Ade Surya Budiman. "Perencanaan Pembangunan WAN Menggunakan EIGRP Dynamic Routing". Jurnal Sisfokom (Sistem Informasi dan Komputer) 9, n. 3 (25 agosto 2020): 296. http://dx.doi.org/10.32736/sisfokom.v9i3.779.
Testo completoAbstract (sommario):
The development of company's business area will have implications for the development of computer network infrastructure as a means of exchanging data and information between regions. As a company that continues to develop its business area, PT. Timur Raya Lestari requires a computer network infrastructure that is adaptive to the development of the number of branch offices. The company's computer network currently uses the Static Routing method in determining the interconnection path between Routers connecting the head office and branch offices. The development of a dynamic company must be accompanied by the development of a dynamic network infrastructure as well. Development of a network infrastructure that continues to develop requires Dynamic Routing Protocol. In this study, it was simulated the use of EIGRP as Dynamic Routing Protocol for PT. Timur Raya Lestari. From the simulation results using Cisco Packet Tracer software, it can be seen that there is a stable interconnection, both for existing networks plan and planning for adding networks on new branch offices.
47
Anand, Ashok, Archit Gupta, Aditya Akella, Srinivasan Seshan e Scott Shenker. "Packet caches on routers". ACM SIGCOMM Computer Communication Review 38, n. 4 (ottobre 2008): 219–30. http://dx.doi.org/10.1145/1402946.1402984.
Testo completo
48
Malone, David. "Counting 6to4 relay routers". ACM SIGCOMM Computer Communication Review 36, n. 1 (10 gennaio 2006): 79–82. http://dx.doi.org/10.1145/1111322.1111340.
Testo completo
49
Cheong, Se-Hang, Yain-Whar Si e Leong-Hou U. "Saving lives: design and implementation of lifeline emergency ad hoc network". International Journal of Pervasive Computing and Communications 14, n. 2 (4 giugno 2018): 90–110. http://dx.doi.org/10.1108/ijpcc-d-18-00001.
Testo completoAbstract (sommario):
Purpose This paper aims to propose a system for automatically forming ad hoc networks using mobile phones and battery-powered wireless routers for emergency situations. The system also provides functions to send emergency messages and identify the location of victims based on the network topology information. Design/methodology/approach Optimized link state routing protocol is used to instantly form an ad hoc emergency network based on WiFi signals from mobile phones of the victims, backup battery-powered wireless routers preinstalled in buildings and mobile devices deployed by search and rescue teams. The proposed system is also designed to recover from partial crash of network and nodes lost. Findings Experimental results demonstrate the effectiveness of the proposed system in terms of battery life, transmission distance and noises. Originality/value A novel message routing schedule is proposed for conserving battery life. A novel function to estimate the location of a mobile device which sent an emergency message is proposed in this paper.
50
Alhisnawi, Mohammad, e Aladdin Abdulhassan. "Designing Cuckoo Based Pending Interest Table for CCN Networks". International Journal of Interactive Mobile Technologies (iJIM) 15, n. 07 (9 aprile 2021): 140. http://dx.doi.org/10.3991/ijim.v15i07.21149.
Testo completoAbstract (sommario):
<p class="JESTECAbstract">Content Centric Networking (CCN) is a modern architecture that got wide attention in the current researches as a substitutional for the current IP-based architecture. Many studies have been investigated on this novel architecture but only little of them focused on Pending Interest Table (PIT) which is very important component in every CCN router. PIT has fundamental role in packet processing in both upstream process (Interest packets) and downstream process (Data packets). PIT must be fast enough in order to not become an obstruction in the packet processing and also it must be big enough to save a lot of incoming information. In this paper, we suggest a new PIT design and implementation named CF-PIT for CCN router. Our PIT design depends on modifying and utilizing an approximate data structure called Cuckoo filter (CF). Cuckoo filter has ideal characteristics like: high insertion/query/deletion performance, acceptable storage demands and false positive probability which make it with our modification convenient for PIT implementation. The experimental results showed that our CF-PIT design has high performance in different side of views which make it very suitable to be implemented on CCN routers.</p>