Journal articles on the topic 'Router'
To see the other types of publications on this topic, follow the link: Router.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Router.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Zhang, Chun Yang, Jun Fu Li, and Qian Xu. "BU-Router: Researching on Techniques of Global Router." Applied Mechanics and Materials 513-517 (February 2014): 539–44. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.539.
Full textAbstract:
Variety of routing approaches are employed by global routers in the VLSI circuit designs. Rip-up and reroute, as a conveniently implemented method, is widely used in most of modern global routers. Maze algorithm is always performed iteratively as the final technique to eliminate overflow. Maze algorithm and its ramifications can obtain an optimum solution. However, it will cost much CPU time if being used impertinently. In this work, we present a global router called Bottom-Up Router (BU-Router), with an optimized maze algorithm, which is based on multi-source multi-sink maze. BU-Router processes not the nets but the segments of nets in a sequence ordered by the length. In the progress, segments will be fixed on the global route graph edge, when the edge is saturated, which is as the basis, also known as bottom. Then the edge will be set as a blockage, which wont accept path goes through it any more. This means the edge will push the possible congestion in the future. Besides this, BU-Router optimized cost function in two ways: make the function adaptive and congestion center avoidable. Additionally, a specific optimized maze algorithm is proposed for routing a long distance segment so as to reduce the run-time.
2
Bhatia, Dinesh, and V. Shankar. "Greedy Segmented Channel Router." VLSI Design 5, no. 1 (January 1, 1996): 11–21. http://dx.doi.org/10.1155/1996/53512.
Full textAbstract:
An efficient solution to the generalized detailed routing problem in segmented channels for row-based FPGAs is presented. A generalized detailed routing allows routing of each connection using an arbitrary number of tracks, i.e., doglegs are allowed. This approach is different from the normally followed method where each connection is routed on a single straight track. We present a router that performs generalized segmented channel routing using a greedy approach to route channels. The router also renders itself to limited tolerance against faults in the routing architecture.
3
Sandeep, Darshanala, M. Vinodhini, and N. S. Murty. "Route-on-Fly Network-on-Chip Router Design with Soft-Error Tolerance." Journal of Computational and Theoretical Nanoscience 17, no. 1 (January 1, 2020): 329–33. http://dx.doi.org/10.1166/jctn.2020.8670.
Full textAbstract:
Decrease in size of IP cores, the Network-On-Chip (NOC), which is used to interconnect them, becomes more complex. NOC employ Network Interface (NI), routers and links. Chip process technology is shrinking day by day resulting in design complexities. This rises the chances of NOC becoming faulty and corrupting the packets transmitted through it. Further NOC has great influence on the complete system performance. Despite the fact that the NOC outperforms the traditional bus based interconnects, NOC faces problems with the usage of router pipeline stages. Generic pipelined router consists of Routing Computation (RC) stage, Virtual channel Allocator (VA) stage, Switch Allocator (SA) stage and CrossBar (CB) stage. These routers are more liable to hard faults and soft-errors. Hence, incorporation of an error tolerant technique to the pipeline stages is required. However, these results in area, power and delay overhead. In this paper, we proposes Route-On-Fly NOC router architecture with Soft-error tolerance (ROFNS), an optimized pipeline router with tolerance to soft errors. In addition, optimized VA stage to achieve overall reduction in area and delay penalty is also proposed. Implementation results show that there is 70%, 3% and 16% reduction in area, power and delay respectively when compared to Soft-error Tolerant NOC Router (STNR).
4
Gudmundsson, Gudni, and Simeon Ntafos. "A Greedy Algorithm for Over-The-Cell Channel Routing." VLSI Design 5, no. 1 (January 1, 1996): 23–36. http://dx.doi.org/10.1155/1996/10797.
Full textAbstract:
Recent advances in VLSI technology have made the area over cells available for routing. In this paper we present a new over-the-cell channel router that uses greedy heuristics to make the over-the-cell connections and to define the nets needed to complete the connections inside the channel. The router tries to reduce the channel density by moving segments that cross maximum density columns to the over-the-cell areas. The layout model used allows only planar connections over each cell. The final stage is to use an existing channel router to route the connections inside the channel. An important characteristic of the new router is that there is interaction between the decisions made for the over-the-cell connections and the connections needed inside the channel. It performs significantly better than previous over the-cell routers.
5
Yuliastuti, Gusti Eka, Citra Nurina Prabiantissa, and Agung Mustika Rizki. "Implementasi Simulated Annealing untuk Penentuan Rute pada Jaringan." MATICS 13, no. 2 (October 1, 2021): 42–46. http://dx.doi.org/10.18860/mat.v13i2.12969.
Full textAbstract:
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
6
Yang, Ya, Jing Lu, and Lan Zhou. "Few-photon routing via chiral light-matter couplings." Communications in Theoretical Physics 74, no. 2 (January 21, 2022): 025101. http://dx.doi.org/10.1088/1572-9494/ac46a6.
Full textAbstract:
Abstract A quantum router is one of the essential elements in the quantum network. Conventional routers only direct a single photon from one quantum channel into another. Here, we propose a few-photon router. The active element of the router is a single qubit chirally coupled to two independent waveguides simultaneously, where each waveguide mode provides a quantum channel. By introducing the operators of the scatter-free space and the controllable space, the output state of the one-photon and two-photon scattering are derived analytically. It is found that the qubit can direct one and two photons from one port of the incident waveguide to an arbitrarily selected port of the other waveguide with unity, respectively. However, two photons cannot be simultaneously routed to the same port due to the anti-bunch effect.
7
Tang, Xian Tuo, Guang Fu Zeng, Feng Wang, Zuo Cheng Xing, and Chao Chao Feng. "Locality-Route Pre-Configuration Mechanism for Latency Optimization in NoCs." Applied Mechanics and Materials 571-572 (June 2014): 381–88. http://dx.doi.org/10.4028/www.scientific.net/amm.571-572.381.
Full textAbstract:
By exploiting communication temporal and spatial locality represented in actual applications, the paper proposes a locality-route pre-configuration mechanism (i.e. LRPC) on top of the Pseudo-Circuit scheme, to further accelerate network performance. Under the original Pseudo-circuit scheme, LRPC attempts to preconfigure another sharable crossbar connection at each input port within a single router when the pseudo circuit is invalid currently, so as to produce more available sharable route for packets transfer, and hence to enhance the reusability of the sharable route as well as communication performance. Our evaluation results using a cycle-accurate network simulator with traces from Splash-2 Benchmark show 5.4% and 31.6% improvement in overall network performance compared to Pseudo-Circuit and BASE_LR_SPC routers, respectively. Evaluated with synthetic workload traffic, at most 10.91% and 33.72% performance improvement can be achieved by the LRPC router under the Uniform-random, Bit-complement and Transpose traffic as compared to Pseudo-Circuit and BASE_LR_SPC routers.
8
Nasir, M. H. M., N. A. M. Radzi, W. S. H. M. W. Ahmad, F. Abdullah, and M. Z. Jamaludin. "Comparison of router testbeds: embedded system-based, software-based, and multiprotocol label switching (MPLS)." Indonesian Journal of Electrical Engineering and Computer Science 15, no. 3 (September 1, 2019): 1250. http://dx.doi.org/10.11591/ijeecs.v15.i3.pp1250-1256.
Full textAbstract:
<span>Multiprotocol Label Switching (MPLS) is a promising packet switching technology in the field of communication network, allowing router to forward the packets based on labels. However, off-the-shelves routers are made to be non-configurable, making it less suitable for academic research purposes. The aim of this paper is to explore the possibility of developing a configurable MPLS router by reviewing embedded system-based router, software-based router and commercial MPLS router itself. The architecture of the routers will be described in detail and their performances will be compared. From the analysis, we found that the development of reconfigurable MPLS router testbed is achievable by using embedded system-based hardware due to its freedom of reconfigurability.</span>
9
Dong, Shaohua, Qing Zhang, Guangtao Cao, Jincheng Ni, Ting Shi, Shiqing Li, Jingwen Duan, et al. "On-chip trans-dimensional plasmonic router." Nanophotonics 9, no. 10 (April 23, 2020): 3357–65. http://dx.doi.org/10.1515/nanoph-2020-0078.
Full textAbstract:
AbstractPlasmons, as emerging optical diffraction-unlimited information carriers, promise the high-capacity, high-speed, and integrated photonic chips. The on-chip precise manipulations of plasmon in an arbitrary platform, whether two-dimensional (2D) or one-dimensional (1D), appears demanding but non-trivial. Here, we proposed a meta-wall, consisting of specifically designed meta-atoms, that allows the high-efficiency transformation of propagating plasmon polaritons from 2D platforms to 1D plasmonic waveguides, forming the trans-dimensional plasmonic routers. The mechanism to compensate the momentum transformation in the router can be traced via a local dynamic phase gradient of the meta-atom and reciprocal lattice vector. To demonstrate such a scheme, a directional router based on phase-gradient meta-wall is designed to couple 2D SPP to a 1D plasmonic waveguide, while a unidirectional router based on grating metawall is designed to route 2D SPP to the arbitrarily desired direction along the 1D plasmonic waveguide by changing the incident angle of 2D SPP. The on-chip routers of trans-dimensional SPP demonstrated here provide a flexible tool to manipulate propagation of surface plasmon polaritons (SPPs) and may pave the way for designing integrated plasmonic network and devices.
10
Khusnandar, Wahyudi, Fransiscus Ati Halim, and Felix Lokananta. "Design of TTL Based Routing Algorithm on UTAR Network on Chip Communication Architecture." International Journal of New Media Technology 5, no. 1 (July 5, 2018): 54–57. http://dx.doi.org/10.31937/ijnmt.v5i1.738.
Full textAbstract:
XY adaptive routing protocol is a routing protocol used on UTAR NoC communication architecture. This routing algorithm adapts shrotest-path first algorithm, which will forward will not be able to work optimally if the closest route no longer have enough bandwidth to continue the packet. Packet will be stored inside the router and forwarded to the nearest router when closest route has enough bandwidth. This paper suggest TTL based routing algorithm to resolve this issue. TTL based routing algorithm adapts XY adaptive routing protocol by adding several parameters on RTL UTAR NoC and additional bit in each packet sent by router. This additional bit and parameter will be used by TTL based algorithm as additional factors in choosing alternative routes inside the communication architecture. Use of TTL on TTL based routing different from use of TTL on communication network. Packets that carry TTL value that equal to Maximum TTL will be route using XY adaptive routing protocol. TTL based routing algorithm has shown better performance compared to XY adaptive routing on some of the experiment done using MSCL NoC Traffic Pattern Suite. This research also proves that TTL based routing algorithm cannot work optimally on small-scaled architecture.
11
Siddiqi, Umair F., Sadiq M. Sait, and Yoichi Shiraishi. "A Game Theory-Based Heuristic for the Two-Dimensional VLSI Global Routing Problem." Journal of Circuits, Systems and Computers 24, no. 06 (May 26, 2015): 1550082. http://dx.doi.org/10.1142/s0218126615500826.
Full textAbstract:
In this work we propose a game theory (GT)-based global router. It works in two steps: (i) Initial routing of all nets using maze routing with framing (MRF) and (ii) GT-based rip-up and reroute (R&R) process. In initial routing, the nets are divided into several small subsets which are routed concurrently using multithreading (MT). The main task of the GT-based R&R process is to eliminate congestion. Nets are considered as players and each player employs two pure strategies: (attempt to improve its spanning tree, and, do not attempt to improve its spanning tree). The nets also have mixed strategies whose values act as probabilities for them to select any particular pure strategy. The nets which select their first strategy will go through the R&R operation. We also propose an algorithm which computes the mixed strategies of nets. The advantage of using GT to select nets is that it reduces the number of nets and the number of iterations in the R&R process. The performance of the proposed global router was evaluated on ISPD'98 benchmarks and compared with two recent global routers, namely, Box Router 2.0 (configured for speed) and Side-winder. The results show that the proposed global router with MT has a shorter runtime to converge to a valid solution than that of Box Router 2.0. It also outperforms Side-winder in terms of routability. The experimental results demonstrated that GT is a valuable technique in reducing the runtime of global routers.
12
Ardiansyah, Ahmad Yusuf, and Riyanarto Sarno. "Performance analysis of wireless sensor network with load balancing for data transmission using xbee zb module." Indonesian Journal of Electrical Engineering and Computer Science 18, no. 1 (April 1, 2020): 88. http://dx.doi.org/10.11591/ijeecs.v18.i1.pp88-100.
Full textAbstract:
<p><span>In general, research in the field of wireless sensor network (WSN) has never discussed the reliability aspect of network routing with router devices that can find new routes when damage occurs. </span><span lang="IN">To date, o</span><span>verloaded routers will be </span><span lang="IN">ignored</span><span> without any response that gives control which can reduce the quality of network performance. Therefore, we propose research using the AODV routing</span><span lang="IN">,</span><span> and Mesh routing algorithm to find other routes as an alternative when problems occur and using the Round Robbin based xbee algorithm on providing load balance control carried out by the router. </span><span lang="IN">The experiments on</span><span> the performance of non-balancing networks and balancing</span><span lang="IN"> were conducted</span><span>. Both trials used quality of service (QoS) parameters as a guarantee of performance to be more effective and in line with expectations. Measurements performed by testing the parameters of packet loss, delay, throughput, and fault tolerance<em>. </em>The network performance in finding other alternative routes has been successfully carried out by </span><span lang="IN">transmitting</span><span> 100 packets from the end device node to the coordinator node via the router based on distance variations from 0 to 100 meters. The recovery time required by the dead router to find another route was 10 seconds, this was related to the parameter delay, and fault tolerance. The experimental results of the non-balancing system showed an average 20 % packet loss in one transmission, meanwhile the packet loss was smaller than the previous experiment by 37%. Therefore, the WSN with balancing system was proven to be more effective that could improve QoS performance by 17%.</span></p>
13
Susueno, Hendra Bayu, Imam Tri Wibowo, Siti Ummi Masruroh, Dewi Khairani, and I’im Umamil Khoiri. "Analisis Routing Protocol Is-Is Dengan MPLS Traffic Engineering Menggunakan GNS3." Jurnal Ilmiah FIFO 13, no. 1 (December 20, 2021): 32. http://dx.doi.org/10.22441/fifo.2021.v13i1.004.
Full textAbstract:
In the digital era is , the internet becomes a necessity . the increasing number of internet usage by various parties encourages ISPs to improve their service quality . To overcome the problem the IETF has introduced a service Multiprotcol . MPLS-TE allows for schemes TE where the tip router of the label switched path (LSP) can calculate the many routes efficiently through the network to the router tip of the tail of the LSP. TE consists of three steps principal that is the size , model, and control . MPLS-TE allows for schemes TE where the tip router of the label switched path (LSP) can calculate the many routes efficiently through the network to the router tip of the tail of the LSP. ISIS is one of the routing protocol that was created for the OSI mode, using the method of link state as a method of collecting the route , ISIS also will perform the collection of information and the status of all the links that exist in the network . Analysis of the IS-IS routing protocol with the Multiprotocol label switch Traffic Engineering based on the parameters of quality of service (QoS), namely throughput and packet loss where the simulation uses the GNS3 network emulator. The test results prove that the values of throughput and packet loss are not much different.
14
Syahputra, Ramdhani, Rahmadi Kurnia, and Rian Ferdian. "Analysis of FHRP Design and Implementation in RIPv2 and OSPF Routing Protocols." Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) 4, no. 1 (February 8, 2020): 102–8. http://dx.doi.org/10.29207/resti.v4i1.1490.
Full textAbstract:
The high reliability of data access has become a problem faced by many companies, institutions, and universities. For this reason, a protocol required that can protect the network from a communication breakdown. One method used to maintain communication is by implementing a protocol redundancy system. One or more routers will act as the primary router for load balancing, and some routers are in standby mode if one main router is down. First hop redundancy protocols (FHRP) is a protocol that implements redundancy and load balancing systems. This protocol can transfer access data traffic if one of the routers on the network is down. FHRP divided into virtual router redundancy protocol (VRRP) and gateway load balancing Protocol (GLBP). This research analyzes the design and implementation to provide information about the quality of VRRP and GLBP services on the main router and the backup router, by using an application graphical network simulator (GNS) simulation 3. In the GNS3 application, a LAN network topology is designed with eight router devices in the form of a ring topology using RIPv2 and OSPF routing protocols, then implemented in protocols VRRP and GLBP. The analysis results show that GLBP can back up the network faster than VRRP when the primary router is down. If implemented into a LAN network with RIPv2 and OSPF routing protocols, VRRP has better service quality than GLBP.
15
Rashid, Muhammad, Naveed Khan Baloch, Muhammad Akmal Shafique, Fawad Hussain, Shahroon Saleem, Yousaf Bin Zikria, and Heejung Yu. "Fault-Tolerant Network-On-Chip Router Architecture Design for Heterogeneous Computing Systems in the Context of Internet of Things." Sensors 20, no. 18 (September 18, 2020): 5355. http://dx.doi.org/10.3390/s20185355.
Full textAbstract:
Network-on-chip (NoC) architectures have become a popular communication platform for heterogeneous computing systems owing to their scalability and high performance. Aggressive technology scaling makes these architectures prone to both permanent and transient faults. This study focuses on the tolerance of a NoC router to permanent faults. A permanent fault in a NoC router severely impacts the performance of the entire network. Thus, it is necessary to incorporate component-level protection techniques in a router. In the proposed scheme, the input port utilizes a bypass path, virtual channel (VC) queuing, and VC closing strategies. Moreover, the routing computation stage utilizes spatial redundancy and double routing strategies, and the VC allocation stage utilizes spatial redundancy. The switch allocation stage utilizes run-time arbiter selection. The crossbar stage utilizes a triple bypass bus. The proposed router is highly fault-tolerant compared with the existing state-of-the-art fault-tolerant routers. The reliability of the proposed router is 7.98 times higher than that of the unprotected baseline router in terms of the mean-time-to-failure metric. The silicon protection factor metric is used to calculate the protection ability of the proposed router. Consequently, it is confirmed that the proposed router has a greater protection ability than the conventional fault-tolerant routers.
16
Savva, Savvas, Konstantinos Tatas, and Costas Kyriacou. "Approximate Priority Hybrid 3DNoC Buffered-Bufferless Router." Micromachines 14, no. 2 (January 28, 2023): 335. http://dx.doi.org/10.3390/mi14020335.
Full textAbstract:
This paper introduces a novel 3D NoC router that combines buffered and bufferless routing with approximate priority comparison when deflecting flits. Our proposal is a modification of an asymmetrical router that is buffered in the z dimension ports and bufferless in the x and y dimension ports. Flits that request output ports in the x and y dimensions are granted or deflected based on approximate, instead of accurate, priority comparison. Experimental results show that the proposed router, in addition to effectively combining the advantages of both buffered and bufferless routers, achieves additional performance and area gains due to the reduced logic required for approximate priority comparison in flit deflections. Experimental results using synthetic and realistic traffic show that the proposed router begins to saturate at a significantly higher injection rate than a bufferless router, but at a slightly lower injection rate than when using accurate priority comparison. Furthermore, the proposed router achieves higher clock frequencies and a reduced area compared to bufferles routers due to the simpler permutation network. The increased routing efficiency is shown to also translate to energy gains.
17
Yin, Jie, Ke Lou, and Guanhua Gong. "Overview of energy routers control strategies." Journal of Physics: Conference Series 2310, no. 1 (October 1, 2022): 012030. http://dx.doi.org/10.1088/1742-6596/2310/1/012030.
Full textAbstract:
Abstract In order to solve the problem of effective utilization of renewable energy, energy Internet technology came into being. As the key equipment of the energy Internet, the research on energy routers is of great importance. This paper introduces the energy router from the aspects of structure and operation mode, and summarizes a general energy router structure. At the same time, the control strategies of the energy router are systematically discussed. In view of the complex and diverse control strategies of the current energy router, this paper summarizes the research status of energy router control strategies and discusses the control strategies according to different classification methods.
18
Zhang, Yi Peng, Zheng Tao Jiang, and Chen Yang. "Attack and Analysis on the Vulnerability of Tenda Wireless Routers." Applied Mechanics and Materials 556-562 (May 2014): 5316–20. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.5316.
Full textAbstract:
Routers are the key equipments connecting Wan, LAN and Internet network, and are the main part of the Internet. The reliability and security of routers is very important to the network performance and information data security. The analysis and research on the technologies of router security and protection is the core issue for network security. This paper mainly aims at providing a series of test and analysis on the vulnerabilities of Tenda wireless routers. Technically, it’s very difficult to crack the WPA /WPA2 wireless encryption. In this paper, we use the related vulnerabilities of wireless routers, and open Wifi Protection Setup (WPS) and Quick Security Settings (QSS) to get router PIN code, which can help us bypass the WPA/WPA2 encryption and, realizesd the router attack.
19
Spang, Bruce. "Updating the Theory of Buffer Sizing." ACM SIGMETRICS Performance Evaluation Review 49, no. 3 (March 22, 2022): 55–56. http://dx.doi.org/10.1145/3529113.3529131.
Full textAbstract:
Internet routers have packet buffers which reduce packet loss during times of congestion. Sizing the router buffer correctly is important: if a router buffer is too small, it can cause high packet loss and link under-utilization. If a buffer is too large, packets may have to wait an unnecessarily long time in the buffer during congested periods, often up to hundreds of milliseconds. While an operator can reduce the operational size of a router buffer, the maximum size of a router buffer is decided by the router manufacturer, and the operator typically configures the router to use all the available buffers. Without clear guidance about how big a buffer needs to be, manufacturers tend to oversize buffers and operators tend to configure larger buffers than necessary, leading to increased cost and delay.
20
Sougoumar, Yazhinian, and Tamilselvan Sadasivam. "Performance Enhancement of Bidirectional NOC Router With and Without Contention for Reconfigurable Coarse Grained Architecture." Indonesian Journal of Electrical Engineering and Computer Science 11, no. 3 (September 1, 2018): 1068. http://dx.doi.org/10.11591/ijeecs.v11.i3.pp1068-1074.
Full textAbstract:
<p>Network on Chip (NoC) router plays a vital role in System on Chip (SoC) applications. Routing operation is difficult to perform inside the SoC chip. Because it contains millions of chips in one single Integrated Circuit (IC), in which every chip consists of millions of transistors. Hence NoC router is designed to enable efficient routing operation in the SoC board. NoC router consists of Network Interconnects (NI), Crossbar Switches, arbiters, a routing logic and buffers. Conventional unidirectional router is designed by priority based Round Robin Arbiter (RRA). It produces more delay to find the priority, which comes from various input channels and more area is consumed in unidirectional router. Also if any path failure occurs, it cannot route the data through other output channel. To overcome this problem, a novel bidirectional NoC router with and without contention is proposed, which offers less area and high speed than the existing unidirectional router. A novel bidirectional NoC router consists of round robin arbiter, Static RAM, switch allocator, virtual channel allocator and crossbar switch. The proposed bidirectional router can route the data from any input channel to each and every output channel. So it avoids conflict situation and path failure problems. If any path fails, immediately it will take the alternative path through the switch allocator. The proposed routing scheme is applied into the coarse grained architecture for improving the speed of the interconnection link between two processing elements. Simulation is performed by ModelSim6.3c and synthesis is carried out by Xilinx10.1.</p>
21
Wibowo, Ari Ramadhan, Anton Anton, and Puji Astuti. "THE APPLICATION OF ROUTING OF OSPF AND EIGRP USING THE METHOD REDISTRIBUTE TO IMPROVE THE EFFICIENCY OF THE NETWORK." Jurnal Riset Informatika 2, no. 4 (September 15, 2020): 219–26. http://dx.doi.org/10.34288/jri.v2i4.158.
Full textAbstract:
Routing OSPF dan EIGRP adalah dua routing yang banyak digunakan pada jaringan komputer. Dengan penerapan routing OSPF dan EIGRP menjadikan lebih mudah dan lebih efisien pada banyak router. Dalam penelitian yang telah dilakukan pada CV. Cyber Art Group Indonesia akan menghubungkan dengan menggunakan beberapa router sebagai gateway. Perbedaan karakteristik protokol routing tersebut dapat diselesaikan dengan cara menggunakan redistribusi router. Redistribution Router adalah metode agar router dapat mempelajari tabel route yang berbeda dari tiap routing dan mendapatkan komunikasi yang optimal di mana banyak protokol routing yang sedang digunakan. Dari penerapan teknik redistribution tersebut dapat diketahui hasilnya berupa waktu yang dibutuhkan dalam proses pengiriman data dengan parameter pengukuran Throughput, Delay, dan packet loss.
22
Harizal, Bangun, Adnan Purwanto, and Wahyu Pamungkas. "Analisis Perancangan PC (Personal Computer) Router Proxy Untuk Menggabungkan Tiga Jalur Koneksi Di Indospeed." JURNAL INFOTEL - Informatika Telekomunikasi Elektronika 4, no. 1 (May 10, 2012): 29. http://dx.doi.org/10.20895/infotel.v4i1.99.
Full textAbstract:
Router very important for computer network. To get the router can buy a router products but can also design your own using personal computers. Mikrotik is one of the router manufacturer that provides products in the form of hardware or software. If you want to pay less to design a router can use operating system Ubuntu. This operating system is open source and provided free of charge by the manufacturer. If you want to design a router with this OS can make use of personal computers are often used in homes or offices. Merging the performance of both types of routers can also be usedto cover the lack of one another. With the proxy on a local network then the use of bandwidth can be saved. Becausethere are several websites cached and stored therein if the same website is accessed by other users, the router transmits only from the proxy to the computerwhich make the request.
23
Chen, Yang, Luqing Zhang, Aikang Chen, Yanchi Zhang, and Da Xie. "Multi-energy Network Model of Virtual Energy Router." E3S Web of Conferences 118 (2019): 02052. http://dx.doi.org/10.1051/e3sconf/201911802052.
Full textAbstract:
Energy router is the main equipment of energy Internet to interact through energy and information. This paper proposes the routing algorithm of the virtual energy router composed of multiple energy routers and constructs the multi-energy coupling correlation model, and combines internal routing algorithm of the virtual energy router with multi-energy correlation model to plan the capacity of energy routers in the regional energy network composed of multiple parks. The simulation shows that the planning method based on the routing algorithm improves the energy, environment and economic benefits of the regional energy wide area network.
24
Hu, Hangyu, Weiyi Liu, Gaolei Fei, Song Yang, and Guangmin Hu. "A Novel Method for Router-to-AS Mapping Based on Graph Community Discovery." Information 10, no. 3 (February 27, 2019): 87. http://dx.doi.org/10.3390/info10030087.
Full textAbstract:
The last decades have witnessed the progressive development of research on Internet topology at the router or autonomous systems (AS) level. Routers are essential components of ASes, which dominate their behaviors. It is important to identify the affiliation between routers and ASes because this contributes to a deeper understanding of the topology. However, the existing methods that assign a router to an AS, based on the origin AS of its IP addresses do not make full use of the information during the network interaction procedure. In this paper, we propose a novel method to assign routers to their owners’ AS, based on community discovery. First, we use the initial AS information along with router-pair similarities to construct a weighted router level graph; secondly, with the large amount of graph data (more than 2M nodes and 19M edges) from the CAIDA ITDK project, we propose a fast hierarchy clustering algorithm with time and space complexity, which are both linear for graph community discovery. Finally, router-to-AS mapping is completed, based on these AS communities. Experimental results show that the effectiveness and robustness of the proposed method. Combining with AS communities, our method could have the higher accuracy rate reaching to 82.62% for Routers-to-AS mapping, while the best accuracy of prior works is plateaued at 65.44%.
25
Fan, Jin Dou, Hao Wu, Jian Yuan Lu, and Bin Liu. "Reducing Read Overhead in CCN Routers via Aggregating Interest Packets." Applied Mechanics and Materials 380-384 (August 2013): 1973–76. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.1973.
Full textAbstract:
Content-Centric Networking (CCN) is proposed to make content, instead of the content locations, as the first-class entity in future Internet. Content can be cached in CCN routers for better data delivery, which makes in-router caching system more important. Content Store (CS) is the CCN in-router cache that caches all the data packets traversing a CCN router. Nowadays the throughput of IP routers can reach up to hundreds or even thousands of Gbps, which makes it a great challenge to design CS architecture in CCN routers to support high read/write throughput. In this paper, via aggregating the interest packets that request for the same data packets, we propose an aggregation scheme system, which can help to reduce the read overhead of the CS in CCN routers.
26
Nagel, Kai, and Christopher L. Barrett. "Using Microsimulation Feedback For Trip Adaptation For Realistic Traffic In Dallas." International Journal of Modern Physics C 08, no. 03 (June 1997): 505–25. http://dx.doi.org/10.1142/s0129183197000412.
Full textAbstract:
This paper presents a day-to-day re-routing relaxation approach for traffic simulations. Starting from an initial planset for the routes, the route- based microsimulation is executed. The result of the microsimulation is fed into a re-router, which re-routes a certain percentage of all trips. This approach makes the traffic patterns in the microsimulation much more reasonable. Further, it is shown that the method described in this paper can lead to strong oscillations in the solutions.
27
Zhixun, Liang, Xu Chuanpei, Hu Cong, Zhu Aijun, and Bi Lvqing. "A Full-Duplex 5×5 Optical Router Based on a Hybrid Photonic-Plasmonic Switch." Journal of Nanoelectronics and Optoelectronics 16, no. 3 (March 1, 2021): 506–13. http://dx.doi.org/10.1166/jno.2021.2928.
Full textAbstract:
An optical router is an essential component of a photonic network-on-chip (PNoC). Normally, an optical router consists of traditional optical elements such as the micro-ring resonator (MRR) and the Mach-Zehnder interferometer (MZI). This type of router has many disadvantages, such as a large size, lack of thermal stability and low speed, although their manufacturing technologies are mature. In this paper, we propose a full duplex 5×5 optical router based on a hybrid photonic-plasmonic switch (HPPS). The HPPS has the advantages of compactness, thermal stability and high speed, which can effectively solve the problems of traditional optical routers. In this work, each optical communication link in the optical router is independent, and each optical communication link no longer shares the same switch, which avoids blocking between channels and achieves full-duplex communication. The modelling of the optical router using the HPPS is performed through MATLAB as well as by a finite-difference-time-domain (FDTD) simulation. The maximum and average insertion losses (ILs) of the router are 5.4 dB and 3.5 dB, respectively, and the router has a fast switching time (100 ps). The results show that this optical router has the advantages of low loss and low energy consumption and provides a 5×5 full-duplex optical router for the PNoC.
28
Sulaiman, Oris Krianto. "Analisis EIGRP Metric Dalam Penentuan Jalur Terbaik Pada Jaringan." JURIKOM (Jurnal Riset Komputer) 8, no. 6 (December 30, 2021): 475. http://dx.doi.org/10.30865/jurikom.v8i6.3781.
Full textAbstract:
In managing a large network, it takes the ability to manage the network so that traffic is good. To connect to such a large network requires many routers, each router will connect to one another. But the best choice of any router is required for network traffic efficiency. There are two routing protocols that can be used, namely static routing and dynamic routing. EIGRP is dynamic routing which, principally between routers, can communicate directly and dynamically, so that when there is a new router in a network, routers can communicate directly because they can exchange information. EIGRP uses the Diffussing Update Algorithm (DUAL) in determining the best path. In this study, EIGRP metrics will be analyzed to try the best path on the network by sending Internet Control Message Protocol (ICMP) packets. There are two networks that will be tested with differences in the Fast Ethernet bandwidth interface of each router. This experiment resulted in different values between Fast Ethernet default bandwidth and non-default bandwidth, so that the value of the variable affects the selection of the best path of network traffic
29
Li, Teng, Jianfeng Ma, Yulong Shen, and Qingqi Pei. "Anomalies Detection and Proactive Defence of Routers Based on Multiple Information Learning." Entropy 21, no. 8 (July 26, 2019): 734. http://dx.doi.org/10.3390/e21080734.
Full textAbstract:
Routers are of great importance in the network that forward the data among the communication devices. If an attack attempts to intercept the information or make the network paralyzed, it can launch an attack towards the router and realize the suspicious goal. Therefore, protecting router security has great importance. However, router systems are notoriously difficult to understand or diagnose for their inaccessibility and heterogeneity. A common way of gaining access to the router system and detecting the anomaly behaviors is to inspect the router syslogs or monitor the packets of information flowing to the routers. These approaches just diagnose the routers from one aspect but do not correlate multiple logs. In this paper, we propose an approach to detect the anomalies and faults of the routers with multiple information learning. First, we do the offline learning to transform the benign or corrupted user actions into the syslogs. Then, we construct the log correlation among different events. During the detection phase, we calculate the distance between the event and the cluster to decide if it is an anomalous event and we use the attack chain to predict the potential threat. We applied our approach in a university network which contains Huawei, Cisco and Dlink routers for three months. We aligned our experiment with former work as a baseline for comparison. Our approach obtained 89.6% accuracy in detecting the attacks, which is 5.1% higher than the former work. The results show that our approach performs in limited time as well as memory usages and has high detection and low false positives.
30
Cui, Xin. "Research on Enterprise Network Router Security Strategy." Advanced Materials Research 433-440 (January 2012): 1783–86. http://dx.doi.org/10.4028/www.scientific.net/amr.433-440.1783.
Full textAbstract:
Along with the enterprise economic powers strengthen continuously, for satisfying the applied demand of business, the enterprise has already built up gradually with each other the network infrastructure of the mutual communication of Internet. Security issues in open platform will explosive increase accompany with open requirements growing. Research and design security mechanism on router will be good for Internet security, as well as the developer to provide a powerful help. Router is a critical element in any security deployment. Routers are definite targets for network attackers. If an attacker can compromise and access a router, it can be a potential aid to them. Technique of router security is the technical importance of the network security to constitute the part, a scheme of router security operation of the enterprise network has been described.
31
Song, He, Xiaofeng Wang, Mengdong Zhai, and Guangjie Zhang. "High-Fidelity Router Emulation Technologies Based on Multi-Scale Virtualization." Information 11, no. 1 (January 16, 2020): 47. http://dx.doi.org/10.3390/info11010047.
Full textAbstract:
Virtualization has the advantages of strong scalability and high fidelity in host node emulation. It can effectively meet the requirements of network emulation, including large scale, high fidelity, and flexible construction. However, for router emulation, virtual routers built with virtualization and routing software use Linux Traffic Control to emulate bandwidth, delay, and packet loss rates, which results in serious distortions in congestion scenarios. Motivated by this deficiency, we propose a novel router emulation method that consists of virtualization plane, routing plane, and a traffic control method. We designed and implemented our traffic control module in multi-scale virtualization, including the kernel space of a KVM-based virtual router and the user space of a Docker-based virtual router. Experiments show not only that the proposed method achieves high-fidelity router emulation, but also that its performance is consistent with that of a physical router in congestion scenarios. These findings provide good support for network research into congestion scenarios on virtualization-based emulation platforms.
32
Supriyono, Abdul Rohman, and Yudi Prayudi. "LIVE FORENSICS ACQUISITION FILE SHARING SAMBA PADA MIKROTIK ROUTER OS." Cyber Security dan Forensik Digital 1, no. 1 (May 24, 2018): 7–13. http://dx.doi.org/10.14421/csecurity.2018.1.1.1210.
Full textAbstract:
Smart Router is a router device that is equipped with Smart Wi-Fi software that allows us to easily manage and monitor the home network, and has more features or services than regular routers in general. Routers of this type include one solution in building a local area network that can be used as file server in file sharing. But regardless of the benefits it does not rule out the possibility of a crime by utilizing file sharing. Therefore, in the field of digital forensics required live forensic methods and live acquisitions, since the smart router belongs to a critical electronic item category, where data (log) can be lost when the device is turned off.
33
Barolli, Admir, Kevin Bylykbashi, Ermioni Qafzezi, Shinji Sakamoto, and Leonard Barolli. "Performance Evaluation of Chi-Square and Normal Distributions of Mesh Clients for WMNs Considering Five Router Replacement Methods." International Journal of Distributed Systems and Technologies 13, no. 1 (January 1, 2022): 1–14. http://dx.doi.org/10.4018/ijdst.296247.
Full textAbstract:
In our previous work, we implemented a simulation system to solve the node placement problem in WMNs considering Particle Swarm Optimization (PSO) and Distributed Genetic Algorithm (DGA), called WMN-PSODGA. In this paper, we compare Chi-square and Normal distributions of mesh clients for different router replacement methods. The router replacement methods considered are Constriction Method (CM), Random Inertia Weight Method (RIWM), Linearly Decreasing Inertia Weight Method (LDIWM), Linearly Decreasing Vmax Method (LDVM) and Rational Decrement of Vmax Method (RDVM). The simulation results show that for both distributions, the mesh routers cover all mesh clients for all router replacement methods. In terms of load balancing, Normal distribution shows better results than Chi-square. The best router replacement method for this distribution is LDIWM. Thus, the best scenario is the Normal distribution of mesh clients with LDIWM as a router replacement method.
34
Zhanabaev, Z. Zh. "CLUSTER ROUTER BASED ON ECCENTRICITY." Eurasian Physical Technical Journal 19, no. 3 (41) (September 22, 2022): 84–90. http://dx.doi.org/10.31489/2022no3/84-90.
Full textAbstract:
In this paper, a cluster router based on eccentricity was worked out, related to the field of telecommunications, especially, to the field of message transmission. Messages in this router are transmitted as packets along the route specified in it between devices connected to the network. Each node in this network is assigned a unique address, thanks towhich routing can be accelerated. Each router forms a routing map, thanks to the calculated eccentricity of nodes, with which the physical route of the packet is selected at the logical address of the cluster. In addition, the routing map is stored in the register and non-volatile memory of the device to prevent information loss. To analyze this cluster device, a fractal analysis of the UV-flower model network was carried out and the information dimensions of Tsallis and Renyi were calculated.
35
Bhatia, Dinesh, and Amit Chowdhary. "A Multi-Terminal Net Router for Field-Programmable Gate Arrays." VLSI Design 4, no. 1 (January 1, 1996): 1–10. http://dx.doi.org/10.1155/1996/79127.
Full textAbstract:
This paper presents a router for routing multi-terminal nets in field-programmable gate arrays (FPGAs). The router does not require pre-assignment of routing channels, a phase that is normally accomplished during global routing. This direct routing approach greatly enhances the probability of routing (routability). The multi-terminal routing greatly reduces the total wire length as it approximates a Steiner tree. The total number of segments required to route the circuits is usually less as compared to other routing approaches. The router has generated excellent routing results for some industrial circuits. The memory requirements for this router are very low. The time needed for the routing is linear with respect to the size of the circuit.
36
Deebalakshmi, R., and V. L. Jyothi. "Intelligent Packet Delivery in Router Using Structure Optimized Neural Network." Indonesian Journal of Electrical Engineering and Computer Science 10, no. 2 (May 1, 2018): 545. http://dx.doi.org/10.11591/ijeecs.v10.i2.pp545-553.
Full textAbstract:
The Internet itself is a worldwide network connecting millions of computers and less significant networks. Computers communicated by routers. Crucial the role of a router is to our technique of communicating and computing. Routers are situated at gateways, the spaces where two or more networks connect, and are the decisive device that keeps data flow between networks and keeps the networks connected to the Internet. When data is sent between places on one network or from one network to a second network the data is always seen and intended for to the proper place by the router. The router carries out this by using headers and routing tables to establish the best path for routing the data packets. This trim down the effectiveness of edge router only when the path engaged, it will enhanced by classification method, predictable classification methods like port based ,deep packet inspection and statistical classification are give less precision. In this system structured optimized neural network is used for more precise organization. Classification output forwarded to router dynamically for intellectual packet delivery. The method will improve router competence by greater than before throughput and decreased latency.<span style="font-size: 9.0pt; line-height: 115%; font-family: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'; letter-spacing: .05pt; mso-ansi-language: EN-IN; mso-fareast-language: EN-US; mso-bidi-language: AR-SA; mso-bidi-font-weight: bold; mso-bidi-font-style: italic;" lang="EN-IN">The Internet itself is a worldwide <a href="https://www.webopedia.com/TERM/I/network.htm"><span style="color: windowtext; text-decoration-line: none;">network</span></a> connecting millions of <a href="https://www.webopedia.com/TERM/I/computer.htm"><span style="color: windowtext; text-decoration-line: none;">computers</span></a> and less significant networks. Computers communicated by routers. Crucial the role of a router is to our technique of communicating and computing. Routers are situated at <a href="https://www.webopedia.com/TERM/G/gateway.html"><span style="color: windowtext; text-decoration-line: none;">gateways</span></a>, the spaces where two or more networks connect, and are the decisive device that keeps data flow between networks and keeps the networks connected to the Internet. When data is sent between places on one network or from one network to a second network the data is always seen and intended for to the proper place by the router. The router carries out this by using <a href="https://www.webopedia.com/TERM/R/header.htm"><span style="color: windowtext; text-decoration-line: none;">headers</span></a> and routing tables to establish the best path for routing the data packets. This trim down the effectiveness of edge router only when the path engaged, it will enhanced by classification method, predictable classification methods like port based ,deep packet inspection and statistical classification are give less precision. In this system structured optimized neural network is used for more precise organization. Classification output forwarded to router dynamically for intellectual packet delivery. The method will improve router competence by greater than before throughput and decreased latency.</span>
37
Aoyama, Kazuhiro, and Andrew A. Chien. "The Cost of Adaptivity and Virtual Lanes in a Wormhole Router." VLSI Design 2, no. 4 (January 1, 1995): 315–33. http://dx.doi.org/10.1155/1995/49382.
Full textAbstract:
We examine the cost in router complexity of adaptivity and virtual lanes in wormhole routers, using f-flat adaptive routers (based on a generalization of planar-adaptive routing) which include routers with a range of routing freedom. Our studies show that adaptivity is expensive because it requires additional virtual channels and much larger crossbar switches for both adaptivity and deadlock prevention. Increases of 50 to 100% in channel utilization are required to justify additional degrees of routing freedom.Three internal router architectures for virtual lanes are examined and the fully expanded crossbar is found to be most effective because it gives simplest control and minimal internal blocking. Examining router designs with from 1–16 virtual lanes indicates that 30% improvements in channel utilization are required to justify each additional virtual lane. These studies combined with published simulation results indicate that only modest numbers of virtual lanes are likely to be cost effective.
38
Debbarma, Biman, and S. N. Pradhan. "Segmented Buffer for NOC Router." International Journal of Modeling and Optimization 5, no. 1 (February 2015): 32–35. http://dx.doi.org/10.7763/ijmo.2015.v5.431.
Full text
39
Yang, Yuehong, Ye Su, Bocheng Liu, Junxiong Chai, Li Dai, Xiao Jiang, Yichen Ye, Tingting Song, and Yiyuan Xie. "An N-Port Universal Multimode Optical Router Supporting Mode-Division Multiplexing." Micromachines 12, no. 12 (November 25, 2021): 1438. http://dx.doi.org/10.3390/mi12121438.
Full textAbstract:
Optical network-on-chip (ONoC) is based on optical interconnects and optical routers (ORs), which have obvious advantages in bandwidth and power consumption. Transmission capacity is a significant performance in ONoC architecture, which has to be fully considered during the design process. Relying on mode-division multiplexing (MDM) technology, the system capacity of optical interconnection is greatly improved compared to the traditional multiplexing technology. With the explosion in MDM technology, the optical router supporting MDM came into being. In this paper, we design a multimode optical router (MDM-OR) model and analyze its indicators. Above all, we propose a novel multimode switching element and design an N-port universal multimode optical router (MDM-OR) model. Secondly, we analyze the insertion loss model of different optical devices and the crosstalk noise model of N-port MDM-OR. On this basis, a multimode router structure of a single-mode five-port optical router is proposed. At the same time, we analyze the transmission loss, crosstalk noise, signal-to-noise radio (OSNR), and bit error rate (BER) of different input–output pairs by inputting the 1550 nm TE0, TE1, and TE2 modes to the router.
40
Lombardo, Alfio, Vincenzo Riccobene, and Giovanni Schembra. "Design of a Traffic-Aware Governor for Green Routers." Journal of Electrical and Computer Engineering 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/683408.
Full textAbstract:
Today the reduction of energy consumption in telecommunications networks is one of the main goals to be pursued by manufacturers and researchers. In this context, the paper focuses on routers that achieve energy saving by applying the frequency scaling approach. The target is to propose an analytical model to support designers in choosing the main configuration parameters of the Router Governor in order to meet Quality of Service (QoS) requirements while maximizing energy saving gain. More specifically, the model is used to evaluate the input traffic impacts on the choice of the active router clock frequencies and on the overall green router performance. A case study based on the open NetFPGA reference router is considered to show how the proposed model can be easily applied to a real case scenario.
41
Mishra, Sudha, and A. Arivazhagan. "Efficient and Secure Resource Allocation and Data Forwarding in Cellular Network." Indonesian Journal of Electrical Engineering and Computer Science 9, no. 2 (February 1, 2018): 267. http://dx.doi.org/10.11591/ijeecs.v9.i2.pp267-268.
Full textAbstract:
<span lang="EN-US">Data sharing in networks are now days a challenging one where the source is sending a file to destination, major problem is interference. Once the router is set to search for a path takes too time for identifying a better path to transmit data. The performance is affected due to the time delay of searching path and the interference cause data loss or interruption of transmission. We proposed an overlay router which search better path in short period of time with the help of BJP router. When a sender sends the data, the overlay router contact with BJP router to analyze existing path used to transmit. To ensure a better path and low travelling time will be an efficient way to share the data between source and destination without any interference, low performance and time delay. BJP searches the existing routes that will be low processing time to forward the data sent by the source and received on time by the destination. Whenever a data is been shared between these two: source and destination, overlaying protocol is user to find the shortest path among the existing path search. By using overlay router and BJP router the performance is increased, avoid interference, path identification is solved within short time and provide a better solution for the current environment.</span>
42
Haeruddin, Haeruddin. "Analisa dan Implementasi Sistem Keamanan Router Mikrotik dari Serangan Winbox Exploitation, Brute-Force, DoS." JURNAL MEDIA INFORMATIKA BUDIDARMA 5, no. 3 (July 31, 2021): 848. http://dx.doi.org/10.30865/mib.v5i3.2979.
Full textAbstract:
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.
43
Fadhel, Meaad, Lei Huang, and Huaxi Gu. "Universal Method for Constructing Fault-Tolerant Optical Routers Using RRW." Wireless Communications and Mobile Computing 2021 (August 17, 2021): 1–15. http://dx.doi.org/10.1155/2021/5371330.
Full textAbstract:
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.
44
Barolli, Admir, Kevin Bylykbashi, Ermioni Qafzezi, Shinji Sakamoto, Leonard Barolli, and Makoto Takizawa. "A comparison study of chi-square and uniform distributions of mesh clients for different router replacement methods using WMN-PSODGA hybrid intelligent simulation system." Journal of High Speed Networks 27, no. 4 (November 10, 2021): 319–34. http://dx.doi.org/10.3233/jhs-210670.
Full textAbstract:
Wireless Mesh Networks (WMNs) are gaining a lot of attention from researchers due to their advantages such as easy maintenance, low upfront cost and high robustness. Connectivity and stability directly affect the performance of WMNs. However, WMNs have some problems such as node placement problem, hidden terminal problem and so on. In our previous work, we implemented a simulation system to solve the node placement problem in WMNs considering Particle Swarm Optimization (PSO) and Distributed Genetic Algorithm (DGA), called WMN-PSODGA. In this paper, we compare chi-square and uniform distributions of mesh clients for different router replacement methods. The router replacement methods considered are Constriction Method (CM), Random Inertia Weight Method (RIWM), Linearly Decreasing Inertia Weight Method (LDIWM), Linearly Decreasing Vmax Method (LDVM) and Rational Decrement of Vmax Method (RDVM). The simulation results show that for chi-square distribution the mesh routers cover all mesh clients for all router replacement methods. In terms of load balancing, the method that achieves the best performance is RDVM. When using the uniform distribution, the mesh routers do not cover all mesh clients, but this distribution shows good load balancing for four router replacement methods, with RIWM showing the best performance. The only method that shows poor performance for this distribution is LDIWM. However, since not all mesh clients are covered when using uniform distribution, the best scenario is chi-square distribution of mesh clients with RDVM as a router replacement method.
45
Shi, Wenbo, and Robert Malaney. "Entanglement of Signal Paths via Noisy Superconducting Quantum Devices." Entropy 25, no. 1 (January 12, 2023): 153. http://dx.doi.org/10.3390/e25010153.
Full textAbstract:
Quantum routers will provide for important functionality in emerging quantum networks, and the deployment of quantum routing in real networks will initially be realized on low-complexity (few-qubit) noisy quantum devices. A true working quantum router will represent a new application for quantum entanglement—the coherent superposition of multiple communication paths traversed by the same quantum signal. Most end-user benefits of this application are yet to be discovered, but a few important use-cases are now known. In this work, we investigate the deployment of quantum routing on low-complexity superconducting quantum devices. In such devices, we verify the quantum nature of the routing process as well as the preservation of the routed quantum signal. We also implement quantum random access memory, a key application of quantum routing, on these same devices. Our experiments then embed a five-qubit quantum error-correcting code within the router, outlining the pathway for error-corrected quantum routing. We detail the importance of the qubit-coupling map for a superconducting quantum device that hopes to act as a quantum router, and experimentally verify that optimizing the number of controlled-X gates decreases hardware errors that impact routing performance. Our results indicate that near-term realization of quantum routing using noisy superconducting quantum devices within real-world quantum networks is possible.
46
Korotkyy, YE V., and O. M. Lysenka. "Behavioral model of an integrated router." Electronics and Communications 16, no. 3 (March 28, 2011): 221–25. http://dx.doi.org/10.20535/2312-1807.2011.16.3.266789.
Full text
47
Kellerhoff, Peter. "Blitzschnell-Router." VDI nachrichten 76, no. 06 (2022): 40. http://dx.doi.org/10.51202/0042-1758-2022-06-40-2.
Full text
48
ZHANG, Xiao-Ping. "Scalable Router." Journal of Software 19, no. 6 (October 21, 2008): 1452–64. http://dx.doi.org/10.3724/sp.j.1001.2008.01452.
Full text
49
Abad, Pablo, Valentin Puente, José Angel Gregorio, and Pablo Prieto. "Rotary router." ACM SIGARCH Computer Architecture News 35, no. 2 (June 9, 2007): 116–25. http://dx.doi.org/10.1145/1273440.1250678.
Full text
50
Konstantinidou, S., and L. Snyder. "Chaos router." ACM SIGARCH Computer Architecture News 19, no. 3 (May 1991): 212–21. http://dx.doi.org/10.1145/115953.115974.
Full text