Artículos de revistas sobre el tema "Routers (Computer networks)"
Siga este enlace para ver otros tipos de publicaciones sobre el tema: Routers (Computer networks).
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores artículos de revistas para su investigación sobre el tema "Routers (Computer networks)".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
1
Pakhomova, V. M. y 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 de junio de 2021): 38–49. http://dx.doi.org/10.15802/stp2021/242046.
Texto completoResumen
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.
2
Haeruddin, Haeruddin. "Analisa dan Implementasi Sistem Keamanan Router Mikrotik dari Serangan Winbox Exploitation, Brute-Force, DoS". JURNAL MEDIA INFORMATIKA BUDIDARMA 5, n.º 3 (31 de julio de 2021): 848. http://dx.doi.org/10.30865/mib.v5i3.2979.
Texto completoResumen
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.
3
Du, Yi-Hong y Shi-Hua Liu. "Epidemic Model of Algorithm-Enhanced Dedicated Virus through Networks". Security and Communication Networks 2018 (7 de junio de 2018): 1–7. http://dx.doi.org/10.1155/2018/4691203.
Texto completoResumen
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.
4
Bessos, Mai Ben Adar y Amir Herzberg. "Intercepting a Stealthy Network". ACM Transactions on Sensor Networks 17, n.º 2 (junio de 2021): 1–39. http://dx.doi.org/10.1145/3431223.
Texto completoResumen
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.
5
Sihotang, Bil Klinton, Sumarno Sumarno y 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 de abril de 2020): 229. http://dx.doi.org/10.30865/jurikom.v7i2.2010.
Texto completoResumen
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 y 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 de abril de 2020): 249–56. http://dx.doi.org/10.24176/simet.v11i1.3796.
Texto completoResumen
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
Bidaybekov, Ye Y., Y. K. Khenner, Sh T. Shekerbekova y Y. Н. Zhabayev. "ON THE ISSUE OF TRAINING FUTURE COMPUTER SCIENCE TEACHERS IN COMPUTER". BULLETIN Series of Physics & Mathematical Sciences 72, n.º 4 (29 de septiembre de 2020): 174–79. http://dx.doi.org/10.51889/2020-4.1728-7901.27.
Texto completoResumen
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.
8
Qureshi, Muhammad Aasim, Mohd Fadzil Hassan, Muhammad Khurram Ehsan, Muhammad Owais Khan, Md YeaKub Ali y Shafiullah Khan. "A Robust Graph Theoretic Solution of Routing in Intelligent Networks". Wireless Communications and Mobile Computing 2022 (20 de junio de 2022): 1–7. http://dx.doi.org/10.1155/2022/9661411.
Texto completoResumen
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.
9
Schwarz, Franziska, Klaus Schwarz, Daniel Fuchs, Reiner Creutzburg y David Akopian. "Firmware Vulnerability Analysis of Widely Used Low-Budget TP-Link Routers". Electronic Imaging 2021, n.º 3 (18 de junio de 2021): 135–1. http://dx.doi.org/10.2352/issn.2470-1173.2021.3.mobmu-135.
Texto completoResumen
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.
10
MA, LIANG y MIESO K. DENKO. "ENHANCED ROUTING METRIC FOR LOAD-BALANCING IN WIRELESS MESH NETWORKS". Journal of Interconnection Networks 08, n.º 04 (diciembre de 2007): 407–26. http://dx.doi.org/10.1142/s0219265907002107.
Texto completoResumen
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
Dasmen, Rahmat Novrianda, Abdur Rohman Syarif, Heru Saputra y Rahmat Amrullah. "Perancangan Keamanan Internet Jaringan Hotspot Mikrotik pada Winbox dan Wireshark". DoubleClick: Journal of Computer and Information Technology 5, n.º 2 (27 de febrero de 2022): 71. http://dx.doi.org/10.25273/doubleclick.v5i2.11751.
Texto completoResumen
<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>
12
JESSHOPE, CHRIS. "LATENCY REDUCTION IN VLSI ROUTERS". Parallel Processing Letters 03, n.º 04 (diciembre de 1993): 485–94. http://dx.doi.org/10.1142/s0129626493000502.
Texto completoResumen
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.
13
Stepanov, P. P., G. V. Nikonova, T. S. Pavlyuchenko y V. V. Soloviev. "Features of Address Resolution Protocol Operation in Computer Networks". Programmnaya Ingeneria 13, n.º 5 (16 de mayo de 2022): 211–18. http://dx.doi.org/10.17587/prin.13.211-218.
Texto completoResumen
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 y 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.
Texto completoResumen
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
Goudreau, Mark W. y 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 (enero de 1992): 125–42. http://dx.doi.org/10.1142/s0129065792000115.
Texto completoResumen
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.
16
Du, Jiang y Yu Li. "A Solution for Anonymous Routers Discovery Based on Source-Routing Traceroute". Advanced Materials Research 765-767 (septiembre de 2013): 1050–54. http://dx.doi.org/10.4028/www.scientific.net/amr.765-767.1050.
Texto completoResumen
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.
17
Kim, Ku-Hwan, Hoang-Linh To, Won-Joo Hwang y 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.
Texto completoResumen
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.
18
Baumgartner, Florian, Torsten Braun, Eveline Kurt y Attila Weyland. "Virtual routers". ACM SIGCOMM Computer Communication Review 33, n.º 3 (julio de 2003): 127–35. http://dx.doi.org/10.1145/956993.957008.
Texto completo
19
MERKLE, DANIEL, MARTIN MIDDENDORF y ALEXANDER SCHEIDLER. "DECENTRALIZED PACKET CLUSTERING IN ROUTER-BASED NETWORKS". International Journal of Foundations of Computer Science 16, n.º 02 (abril de 2005): 321–41. http://dx.doi.org/10.1142/s0129054105003017.
Texto completoResumen
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.
20
Louati, W. y D. Zeghlache. "Network-based virtual personal overlay networks using programmable virtual routers". IEEE Communications Magazine 43, n.º 8 (agosto de 2005): 86–94. http://dx.doi.org/10.1109/mcom.2005.1497558.
Texto completo
21
Zhang, Min y Chiu-Sing Choy. "Low-Cost Allocator Implementations for Networks-on-Chip Routers". VLSI Design 2009 (15 de marzo de 2009): 1–10. http://dx.doi.org/10.1155/2009/415646.
Texto completoResumen
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.
22
Supraja, Dr P., Anas A. Salameh, Dr Varadaraju H R, Dr M. Anand y 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 de diciembre de 2022): 36–46. http://dx.doi.org/10.17762/ijcnis.v14i3.5569.
Texto completoResumen
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.
23
Sakamoto, Shinji, Algenti Lala, Tetsuya Oda, Vladi Kolici, Leonard Barolli y 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 (abril de 2014): 13–21. http://dx.doi.org/10.4018/ijmcmc.2014040102.
Texto completoResumen
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.
24
Decasper, Dan, Zubin Dittia, Guru Parulkar y Bernhard Plattner. "Router plugins: a software architecture for next generation routers". ACM SIGCOMM Computer Communication Review 28, n.º 4 (octubre de 1998): 229–40. http://dx.doi.org/10.1145/285243.285285.
Texto completo
25
Zhuang, Hongbin, Jou-Ming Chang, Xiao-Yan Li, Fangying Song y Qinying Lin. "All-to-All Broadcast Algorithm in Galaxyfly Networks". Mathematics 11, n.º 11 (26 de mayo de 2023): 2459. http://dx.doi.org/10.3390/math11112459.
Texto completoResumen
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.
26
Zhixun, Liang, Xu Chuanpei, Bi Lvqing, Shi Yunying, Yi Yunfei y 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 de julio de 2022): 1–24. http://dx.doi.org/10.1155/2022/9615610.
Texto completoResumen
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.
27
Suvorova, Elena, Yuriy Sheynin y Nadezhda Matveeva. "Quality of Service in Embedded Networks". International Journal of Embedded and Real-Time Communication Systems 5, n.º 4 (octubre de 2014): 77–98. http://dx.doi.org/10.4018/ijertcs.2014100104.
Texto completoResumen
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.
28
Krishnan, V. Gokula, K. Sankar, M. V. Vijaya Saradhi, K. Hema Priya y V. Vijayaraja. "Tom and Jerry Based Multipath Routing with Optimal K-medoids for choosing Best Clusterhead in MANET". International Journal of Communication Networks and Information Security (IJCNIS) 15, n.º 1 (26 de mayo de 2023): 70–82. http://dx.doi.org/10.17762/ijcnis.v15i1.5707.
Texto completoResumen
Given the unpredictable nature of a MANET, routing has emerged as a major challenge in recent years. For effective routing in a MANET, it is necessary to establish both the route discovery and the best route selection from among many routes. The primary focus of this investigation is on finding the best path for data transmission in MANETs. In this research, we provide an efficient routing technique for minimising the time spent passing data between routers. Here, we employ a routing strategy based on Tom and Jerry Optimization (TJO) to find the best path via the MANET's routers, called Ad Hoc On-Demand Distance Vector (AODV). The AODV-TJO acronym stands for the suggested approach. This routing technique takes into account not just one but three goal functions: total number of hops. When a node or connection fails in a network, rerouting must be done. In order to prevent packet loss, the MANET employs this rerouting technique. Analyses of AODV-efficacy TJO's are conducted, and results are presented in terms of energy use, end-to-end latency, and bandwidth, as well as the proportion of living and dead nodes. Vortex Search Algorithm (VSO) and cuckoo search are compared to the AODV-TJO approach in terms of performance. Based on the findings, the AODV-TJO approach uses 580 J less energy than the Cuckoo search algorithm when used with 500 nodes.
29
HU, WEI, TIANZHOU CHEN, QINGSONG SHI y SHA LIU. "CRITICAL-PATH DRIVEN ROUTERS FOR ON-CHIP NETWORKS". Journal of Circuits, Systems and Computers 19, n.º 07 (noviembre de 2010): 1543–57. http://dx.doi.org/10.1142/s021812661000689x.
Texto completoResumen
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.
30
Kulkarni, Raghavendra y Kalpana Sharma. "A Routing Algorithm with Sdn Controller Using Policy-Based Routing (PBR)". ECS Transactions 107, n.º 1 (24 de abril de 2022): 12661–70. http://dx.doi.org/10.1149/10701.12661ecst.
Texto completoResumen
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.
31
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.
Texto completo
32
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 de octubre de 2020): 20–36. http://dx.doi.org/10.32441/jaset.03.02.03.
Texto completoResumen
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
33
Musril, Hari Antoni. "SIMULASI INTERKONEKSI ANTARA AUTONOMOUS SYSTEM (AS) MENGGUNAKAN BORDER GATEWAY PROTOCOL (BGP)". InfoTekJar (Jurnal Nasional Informatika dan Teknologi Jaringan) 2, n.º 1 (1 de septiembre de 2017): 1–9. http://dx.doi.org/10.30743/infotekjar.v2i1.151.
Texto completoResumen
An autonomous system (AS) is the collection of networks having the same set of routing policies. Each AS has administrative control to its own inter-domain routing policy. Computer networks consisting of a bunch of AS's with different routing will not be able to interconnecttion one another. This is causes communication in the network to be inhibited. For that we need a protocol that can connect each different AS. Border Gateway Protocol (BGP) is an inter-domain routing protocol i.e. between different AS that is used to exchange routing information between them. In a typical inter-network (and in the Internet) each autonomous system designates one or more routers that run BGP software. BGP routers in each AS are linked to those in one or more other AS. The ability to exchange table routing information between Autonomous System (AS) is one of the advantages BGP. BGP implements routing policies based a set of attributes accompanying each route used to pick the “shortest” path across multiple ASs, along with one or more routing policies. BGP uses an algorithm which cannot be classified as a pure "Distance Vector", or pure "Link State". It is a path vector routing protocol as it defines a route as a collection of a number of AS that is passes through from source AS to destination AS. This paper discusses the implementation of the BGP routing protocol in the network that have different AS in order to interconnect. Its application using Packet Tracer 7.0 software for prototyping and simulating network. So that later can be applied to the actual network. Based on experiments that have been carried out, the BGP routing protocol can connect two routers that have different autonomous system.
34
SHANKER, O. y TAD HOGG. "EPIDEMIOLOGY MODEL ON SHORTCUT AND SMALL WORLD NETWORKS". Modern Physics Letters B 23, n.º 10 (20 de abril de 2009): 1249–62. http://dx.doi.org/10.1142/s0217984909019387.
Texto completoResumen
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
Yuliastuti, Gusti Eka, Citra Nurina Prabiantissa y Agung Mustika Rizki. "Implementasi Simulated Annealing untuk Penentuan Rute pada Jaringan". MATICS 13, n.º 2 (1 de octubre de 2021): 42–46. http://dx.doi.org/10.18860/mat.v13i2.12969.
Texto completoResumen
Abstract—Recently computer networks are increasingly complex. It needs to be a supporting device for network management such as a router. Router is a device that plays an important role in the routing process. In a router stored information in the form of routing paths, where the information includes data and which routers will be passed. In certain cases, a router can have more than one gateway. This is because the router needs to send data packets to several networks that have different segments. Such cases can be handled by using the appropriate routing path selection rules. The routing problem can be regarded as a traveling salesman problem (TSP), where a mechanism is needed to determine the shortest route to be traversed. The author implements the Simulated Annealing Algorithm because it can produce an optimal solution with light computing, so that the routing process can be more effective and efficient. Index Terms—Computer Network, Routing, Simulated Annealing, Travelling Salesman Problem Abstrak–-Jaringan komputer saat ini semakin kompleks. Perlu adanya suatu perangkat pendukung untuk manajemen jaringan seperti router. Router merupakan perangkat yang berperan penting dalam proses routing. Pada sebuah router tersimpan informasi berupa jalur routing, dimana informasi tersebut mencakup data dan router mana saja yang akan dilewati. Pada kasus tertentu, router dapat memiliki lebih dari satu gateway. Hal ini disebabkan karena router perlu mengirimkan paket data ke beberapa jaringan yang memiliki segmen berbeda. Kasus tersebut dapat ditangani dengan menggunakan aturan pemilihan jalur routing yang tepat. Permasalahan routing dapat dikatakan sebagai suatu permasalahan travelling salesman problem (TSP), dimana diperlukan suatu mekanisme dalam menentukan rute terpendek untuk dilalui. Penulis mengimplementasikan Algoritma Simulated Annealing karena dapat menghasilkan solusi yang optimal dengan komputasi ringan, sehingga proses routing dapat lebih efektif dan efisien. Kata Kunci—Jaringan Komputer, Penentuan Rute, Travelling Salesman Problem, Algoritma Simulated Annealing
36
Beshley, Mykola, Natalia Kryvinska, Halyna Beshley, Oleg Yaremko y Julia Pyrih. "Virtual Router Design and Modeling for Future Networks with QoS Guarantees". Electronics 10, n.º 10 (11 de mayo de 2021): 1139. http://dx.doi.org/10.3390/electronics10101139.
Texto completoResumen
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.
37
Anand, Ashok, Archit Gupta, Aditya Akella, Srinivasan Seshan y Scott Shenker. "Packet caches on routers". ACM SIGCOMM Computer Communication Review 38, n.º 4 (octubre de 2008): 219–30. http://dx.doi.org/10.1145/1402946.1402984.
Texto completo
38
Malone, David. "Counting 6to4 relay routers". ACM SIGCOMM Computer Communication Review 36, n.º 1 (10 de enero de 2006): 79–82. http://dx.doi.org/10.1145/1111322.1111340.
Texto completo
39
Mohd Fuzi, Mohd Faris, Khairunnisa Abdullah, Iman Hazwam Abd Halim y Rafiza Ruslan. "Network Automation using Ansible for EIGRP Network". Journal of Computing Research and Innovation 6, n.º 4 (20 de septiembre de 2021): 59–69. http://dx.doi.org/10.24191/jcrinn.v6i4.237.
Texto completoResumen
Network automation has evolved into a solution that emphasizes efficiency in all areas. Furthermore, communication and computer networks rely on a platform that provides the necessary technological infrastructure for packet transfer through the Internet using routing protocols. The Enhanced Interior Gateway Routing Protocol (EIGRP) is a hybrid routing protocol that combines the properties of both distance-vector and link-state routing methods. The traditional technique to configure EIGRP is inefficient and requires repeated processes compared to the network automation concept. Network automation helps to assist network administrators in automating and verifying the EIGRP configuration using scripting. This paper implemented network automation using Ansible to configure EIGRP routing and advanced configuration in the GNS3 environment. This study is focused on automated scripting to configure IP Addresses to the interfaces, EIGRP routing protocol, a default static route and advanced EIGRP configurations. Ansible ran the scripting on Network Automation Docker and pushed the configurations to the routers. The network automation docker communicated with other routers via SSH. In the testing phase, the running configuration between the traditional approach and automation scripting in the Ansible playbook was compared to verify EIGRP configurations' accuracy. The findings show that Ansible has successfully deployed the configuration to the routers with no errors. Ansible can help network administrators minimized human mistakes, reduce time-consuming and enable device visibility across the network environment. Implementing EIGRP authentication and hardening process can enhance the network security level for future study.
40
Jiang, Haifeng, Renke Sun y Shanshan Ma. "Energy Optimized Routing Algorithm for Hybrid Wireless Mesh Networks in Coal Mine". International Journal of Distributed Sensor Networks 2015 (2015): 1–11. http://dx.doi.org/10.1155/2015/237697.
Texto completoResumen
Mesh clients in hybrid wireless mesh networks can participate in networking and routing. When the backbone transmission network is broken, the mesh client can route and forward the data, which will eliminate the absolute dependence on the backbone network of traditional infrastructure wireless mesh networks in mine emergency rescue. However, the energy of mesh clients is limited. Based on the comprehensive consideration of the efficiency and balance of energy consumption of mesh clients for data transmission, a new energy cost criterion is designed. Energy optimized and fault recovered routing algorithm is proposed on account of different network states. At last, the simulation analysis on the performance of routing algorithm is conducted and compared with typical routing algorithms. Simulation results show that the algorithm has effectively extended the network lifetime and achieved optimized combination of energy efficiency and energy balance. When mesh routers in the backbone network are failed, this algorithm can rapidly rebuild the route and shows strong capacity of routing recovery.
41
Alanezi, Mohammed A., Houssem R. E. H. Bouchekara y Muhammad S. Javaid. "Optimizing Router Placement of Indoor Wireless Sensor Networks in Smart Buildings for IoT Applications". Sensors 20, n.º 21 (30 de octubre de 2020): 6212. http://dx.doi.org/10.3390/s20216212.
Texto completoResumen
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.
42
Lemeshko, Oleksandr, Oleksandra Yeremenko y Olena Nevzorova. "Hierarchical Method of Inter-Area Fast Rerouting". Transport and Telecommunication Journal 18, n.º 2 (1 de junio de 2017): 155–67. http://dx.doi.org/10.1515/ttj-2017-0015.
Texto completoResumen
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.
43
Wang, Qi, Yiming Ouyang, Zhengfeng Huang y Huaguo Liang. "Workload-Aware WiNoC Design with Intelligent Reconfigurable Wireless Interface". Security and Communication Networks 2023 (9 de mayo de 2023): 1–14. http://dx.doi.org/10.1155/2023/9519044.
Texto completoResumen
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.
44
Fadhel, Meaad, Lei Huang y Huaxi Gu. "Universal Method for Constructing Fault-Tolerant Optical Routers Using RRW". Wireless Communications and Mobile Computing 2021 (17 de agosto de 2021): 1–15. http://dx.doi.org/10.1155/2021/5371330.
Texto completoResumen
High-speed data transmission enabled by photonic network-on-chip (PNoC) has been regarded as a significant technology to overcome the power and bandwidth constraints of electrical network-on-Chip (ENoC). This has given rise to an exciting new research area, which has piqued the public’s attention. Current on-chip architectures cannot guarantee the reliability of PNoC, due to component failures or breakdowns occurring, mainly, in active components such as optical routers (ORs). When such faults manifest, the optical router will not function properly, and the whole network will ultimately collapse. Moreover, essential phenomena such as insertion loss, crosstalk noise, and optical signal-to-noise ratio (OSNR) must be considered to provide fault-tolerant PNoC architectures with low-power consumption. The main purpose of this manuscript is to improve the reliability of PNoCs without exposing the network to further blocking or contention by taking the effect of backup paths on signals sent over the default paths into consideration. Thus, we propose a universal method that can be applied to any optical router in order to increase the reliability by using a reliable ring waveguide (RRW) to provide backup paths for each transmitted signal within the same router, without the need to change the route of the signal within the network. Moreover, we proposed a simultaneous transmission probability analysis for optical routers to show the feasibility of this proposed method. This probability analyzes all the possible signals that can be transmitted at the same time within the default and the backup paths of the router. Our research work shows that the simultaneous transmission probability is improved by 10% to 46% compared to other fault-tolerant optical routers. Furthermore, the worst-case insertion loss of our scheme can be reduced by 46.34% compared to others. The worst-case crosstalk noise is also reduced by 24.55%, at least, for the default path and 15.7%, at least, for the backup path. Finally, in the network level, the OSNR is increased by an average of 68.5% for the default path and an average of 15.9% for the backup path, for different sizes of the network.
45
R. Das, Satya, Sayan Sen Sarma, Mitrabinda Khuntia, Indranil Roy, Koushik Sinha y Bhabani P. Sinha. "A Novel Routing Strategy Towards Achieving Ultra-Low End-to-End Latency in 6G Networks". International journal of Computer Networks & Communications 14, n.º 1 (31 de enero de 2022): 1–24. http://dx.doi.org/10.5121/ijcnc.2022.14101.
Texto completoResumen
Compared to 5G, 6G networks will demand even more ambitious reduction in endto-end latency for packet communication. Recent attempts at breaking the barrier of end-to-end millisecond latencies have focused on re-engineering networks using a hybrid approach consisting of an optical-fiber based backbone network architecture coupled with high-speed wireless networks to connect end-devices to the backbone network. In our approach, a wide area network (WAN) is considered with a high-speed optical fiber grid network as its backbone. After messages from a source node enter the backbone network through a local wireless network, these are delivered very fast to an access point in the backbone network closest to the destination node, followed by its transfer to the local wireless network for delivery to the destination node. We propose a novel routing strategy which is based on distributing the messages in the network in such a way that the average queuing delay of the messages through the backbone network is minimized, and also the route discovery time at each router in the backbone network is drastically reduced. Also, multiple messages destined towards a particular destination router in the backbone network are packed together to form a mailbag, allowing further reductions in processing overheads at intermediate routers and pipelining of mailbag formation and route discovery operations in each router. The performance of the proposed approach green based on these ideas has been theoretically analyzed and then simulated using the ns-3 simulator. Our results show that the average end-to-end latency is less than 380 µs (with only 46-79 µs within the backbone network under varying traffic conditions) for a 1 KB packet size, when using a 500 Gbps optical fiber based backbone network laid over a 15 Km × 15 Km area, a 50 Mbps uplink channel from the source to the backbone network, and a 1 Gbps downlink channel from the backbone network to the destination. The significant reduction in end-to-end latency as compared to existing routing solutions clearly demonstrates the potential of our proposed routing strategy for meeting the ultra-low latency requirements of current 5G and future 6G networks, particularly for mobile edge computing (MEC) application scenarios.
46
Suvorova, Elena, Yuriy Sheynin y Nadezhda Matveeva. "Fault Mitigation in Reconfigurable NoC Routers with Thin Design Rules". International Journal of Embedded and Real-Time Communication Systems 6, n.º 1 (enero de 2015): 28–46. http://dx.doi.org/10.4018/ijertcs.2015010102.
Texto completoResumen
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.
47
Charif, Amir, Alexandre Coelho, Nacer-Eddine Zergainoh y Michael Nicolaidis. "A Framework for Scalable TSV Assignment and Selection in Three-Dimensional Networks-on-Chips". VLSI Design 2017 (11 de diciembre de 2017): 1–15. http://dx.doi.org/10.1155/2017/9427678.
Texto completoResumen
3D integration can greatly benefit future many-cores by enabling low-latency three-dimensional Network-on-Chip (3D-NoC) topologies. However, due to high cost, low yield, and frequent failures of Through-Silicon Via (TSV), 3D-NoCs are most likely to include only a few vertical connections, resulting in incomplete topologies that pose new challenges in terms of deadlock-free routing and TSV assignment. The routers of such networks require a way to locate the nodes that have vertical connections, commonly known as elevators, and select one of them in order to be able to reach other layers when necessary. In this paper, several alternative TSV selection strategies requiring a constant amount of configurable bits per router are introduced. Each proposed solution consists of a configuration algorithm, which provides each router with the necessary information to locate the elevators, and a routing algorithm, which uses this information at runtime to route packets to an elevator. Our algorithms are compared by simulation to highlight the advantages and disadvantages of each solution under various scenarios, and hardware synthesis results demonstrate the scalability of the proposed approach and its suitability for cost-oriented designs.
48
LI, DAWEI, JIE WU, DAJIN WANG y JIAYIN WANG. "Software-Defined Networking Switches for Fast Single-Link Failure Recovery". Journal of Interconnection Networks 18, n.º 04 (diciembre de 2018): 1850014. http://dx.doi.org/10.1142/s0219265918500147.
Texto completoResumen
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.
49
DURRESI, ARJAN, VAMSI PARUCHURI, LEONARD BAROLLI, RAJGOPAL KANNAN y S. S. IYENGAR. "EFFICIENT AND SECURE AUTONOMOUS SYSTEM BASED TRACEBACK". Journal of Interconnection Networks 05, n.º 02 (junio de 2004): 151–64. http://dx.doi.org/10.1142/s0219265904001076.
Texto completoResumen
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.
50
Ding, Shichang, Fan Zhao y Xiangyang Luo. "A Street-Level IP Geolocation Method Based on Delay-Distance Correlation and Multilayered Common Routers". Security and Communication Networks 2021 (11 de enero de 2021): 1–11. http://dx.doi.org/10.1155/2021/6658642.
Texto completoResumen
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.