Journal articles on the topic 'Routers'

To see the other types of publications on this topic, follow the link: Routers.

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Routers.'

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

Saravanan, K., and R. Asokan. "An New Efficient Cluster Based Detection Mechanisms for Distributed Denial of Services (DDoS) Attacks." International Journal of Mathematics and Computers in Simulation 15 (November 27, 2021): 147–52. http://dx.doi.org/10.46300/9102.2021.15.27.

Full text
Abstract:
Cluster aggregation of statistical anomaly detection is a mechanism for defending against denial of service attack (dos) and distributed denial-of-service (DDoS) attacks. DDoS attacks are treated as a congestioncontrol problem; because most of the congestion is occurred in the malicious hosts not follow the normal endto- end congestion control. Upstream routers are also notified to drop such packets in order that the router’s resources are used to route legitimate traffic hence term cluster aggregation. If the victim suspects that the cluster aggregations are solved by most of the clients, it increases the complexity of the cluster aggregation. This aggregation solving technique allows the traversal of the attack traffic throughout the intermediate routers before reaching the destination. In this proposal, the aggregation solving mechanism is cluster aggregation to the core routers rather than having at the victim. The router based cluster aggregation mechanism checks the host system whether it is legitimate or not by providing a aggregation to be solved by the suspected host.
APA, Harvard, Vancouver, ISO, and other styles
2

Bessos, Mai Ben Adar, and Amir Herzberg. "Intercepting a Stealthy Network." ACM Transactions on Sensor Networks 17, no. 2 (June 2021): 1–39. http://dx.doi.org/10.1145/3431223.

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

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

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

Pranaya, Valen Brata, and Theophilus Wellem. "Implementasi BGP dan Resource Public Key Infrastructure menggunakan BIRD untuk Keamanan Routing." Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) 5, no. 6 (December 30, 2021): 1161–70. http://dx.doi.org/10.29207/resti.v5i6.3631.

Full text
Abstract:
The validity of the routing advertisements sent by one router to another is essential for Internet connectivity. To perform routing exchanges between Autonomous Systems (AS) on the Internet, a protocol known as the Border Gateway Protocol (BGP) is used. One of the most common attacks on routers running BGP is prefix hijacking. This attack aims to disrupt connections between AS and divert routing to destinations that are not appropriate for crimes, such as fraud and data breach. One of the methods developed to prevent prefix hijacking is the Resource Public Key Infrastructure (RPKI). RPKI is a public key infrastructure (PKI) developed for BGP routing security on the Internet and can be used by routers to validate routing advertisements sent by their BGP peers. RPKI utilizes a digital certificate issued by the Certification Authority (CA) to validate the subnet in a routing advertisement. This study aims to implement BGP and RPKI using the Bird Internet Routing Daemon (BIRD). Simulation and implementation are carried out using the GNS3 simulator and a server that acts as the RPKI validator. Experiments were conducted using 4 AS, 7 routers, 1 server for BIRD, and 1 server for validators, and there were 26 invalid or unknown subnets advertised by 2 routers in the simulated topology. The experiment results show that the router can successfully validated the routing advertisement received from its BGP peer using RPKI. All invalid and unknown subnets are not forwarded to other routers in the AS where they are located such that route hijacking is prevented.
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Xinming. "The Standard of Wireless Network Technology and Its Application in Router." Highlights in Science, Engineering and Technology 27 (December 27, 2022): 465–69. http://dx.doi.org/10.54097/hset.v27i.3802.

Full text
Abstract:
The development of routers has been a subject that has attracted researchers from a diverse range of fields including wireless networks standard and technology development. Make new products meet technical standards through continuous hardware upgrades such as chip updates and expansion of new frequencies. The direct effect of routers is that the speed of the Internet continues to increase, which promotes the development of many electronic products. By analyzing the development of routers and wireless network standards, this paper understands the general direction of future routers. The development of routers in the future needs to face the challenges of high network speed, low latency, intelligence, and more frequency bands. The application of hardware or new technology is a new opportunity brought by the development of routers. Keyword: Traditional Network. WIFI development, Router
APA, Harvard, Vancouver, ISO, and other styles
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 text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
8

Oda, Tetsuya. "A Delaunay Edges and Simulated Annealing-Based Integrated Approach for Mesh Router Placement Optimization in Wireless Mesh Networks." Sensors 23, no. 3 (January 17, 2023): 1050. http://dx.doi.org/10.3390/s23031050.

Full text
Abstract:
Wireless Mesh Networks (WMNs) can build a communications infrastructure using only routers (called mesh routers), making it possible to form networks over a wide area at low cost. The mesh routers cover clients (called mesh clients), allowing mesh clients to communicate with different nodes. Since the communication performance of WMNs is affected by the position of mesh routers, the communication performance can be improved by optimizing the mesh router placement. In this paper, we present a Coverage Construction Method (CCM) that optimizes mesh router placement. In addition, we propose an integrated optimization approach that combine Simulated Annealing (SA) and Delaunay Edges (DE) in CCM to improve the performance of mesh router placement optimization. The proposed approach can build and provide a communication infrastructure by WMNs in disaster environments. We consider a real scenario for the placement of mesh clients in an evacuation area of Kurashiki City, Japan. From the simulation results, we found that the proposed approach can optimize the placement of mesh routers in order to cover all mesh clients in the evacuation area. Additionally, the DECCM-based SA approach covers more mesh clients than the CCM-based SA approach on average and can improve network connectivity of WMNs.
APA, Harvard, Vancouver, ISO, and other styles
9

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

Pakhomova, V. M., and 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, no. 3(93) (June 15, 2021): 38–49. http://dx.doi.org/10.15802/stp2021/242046.

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

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

Lim, Merlyna. "Roots, Routes, and Routers: Communications and Media of Contemporary Social Movements." Journalism & Communication Monographs 20, no. 2 (May 24, 2018): 92–136. http://dx.doi.org/10.1177/1522637918770419.

Full text
Abstract:
This monograph is an interdisciplinary analysis of the complexity of communications and media as they are embedded in the making and development of contemporary social movements, in three parts. The first part, Roots, provides a broad context for analyzing communications and media of contemporary social movements by tracing varied and multifaceted roots of the wave of global protests since 2010. The second part, Routes, maps out the routes that social movements take, trace how communications and media are entangled in these routes, and identify various key mechanisms occurring at various junctures of movements’ life cycles. The last part, Routers, explores roles of human and nonhuman, fixed and mobile, traditional and contemporary, digital and analog, permanent and temporal routers in the making and development of social movements. These analyses of roots, routes, and routers are mutually intertwined in broadening and deepening our understanding of the complexity of communications and media in contemporary social movements.
APA, Harvard, Vancouver, ISO, and other styles
13

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

Du, Yi-Hong, and Shi-Hua Liu. "Epidemic Model of Algorithm-Enhanced Dedicated Virus through Networks." Security and Communication Networks 2018 (June 7, 2018): 1–7. http://dx.doi.org/10.1155/2018/4691203.

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

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

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

Aminah, Nina Siti, Muhamamad Reza Ramadhani Raharjo, and Maman Budiman. "Low-cost wireless mesh communications based on openWRT and voice over internet protocol." International Journal of Electrical and Computer Engineering (IJECE) 11, no. 6 (December 1, 2021): 5119. http://dx.doi.org/10.11591/ijece.v11i6.pp5119-5126.

Full text
Abstract:
Technology makes it easier for us to communicate over a distance. However, there are still many remote areas that find it difficult to communicate. This is due to the fact that communication infrastructure in some areas is expensive to build while the profit will be low. This paper proposes to combine voice over internet protocol (VoIP) over mesh network implemented on openWRT router. The routers are performing mesh functions. We set up a VoIP server on a router and enabled session initiation protocol (SIP) clients on other routers. Therefore, we only need routers as a means of communication. The experiment showed very good results, in the line-of-sight (LOS) condition, they are limited to reception distances up to 145 meters while in the non-line-of-sight (NLOS) condition, they are limited to reception distances up to 55 meters.
APA, Harvard, Vancouver, ISO, and other styles
18

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

Baumgartner, Florian, Torsten Braun, Eveline Kurt, and Attila Weyland. "Virtual routers." ACM SIGCOMM Computer Communication Review 33, no. 3 (July 2003): 127–35. http://dx.doi.org/10.1145/956993.957008.

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

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

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

Bocovich, Cecylia, and Ian Goldberg. "Secure asymmetry and deployability for decoy routing systems." Proceedings on Privacy Enhancing Technologies 2018, no. 3 (June 1, 2018): 43–62. http://dx.doi.org/10.1515/popets-2018-0020.

Full text
Abstract:
Abstract Censorship circumvention is often characterized as a cat-and-mouse game between a nation-state censor and the developers of censorship resistance systems. Decoy routing systems offer a solution to censor- ship resistance that has the potential to tilt this race in the favour of the censorship resistor by using real connections to unblocked, overt sites to deliver censored content to users. This is achieved by employing the help of Internet Service Providers (ISPs) or Autonomous Systems (ASes) that own routers in the middle of the net- work. However, the deployment of decoy routers has yet to reach fruition. Obstacles to deployment such as the heavy requirements on routers that deploy decoy router relay stations, and the impact on the quality of service for customers that pass through these routers have deterred potential participants from deploying existing systems. Furthermore, connections from clients to overt sites often follow different paths in the upstream and downstream direction, making some existing designs impractical. Although decoy routing systems that lessen the burden on participating routers and accommodate asymmetric flows have been proposed, these arguably more deployable systems suffer from security vulnerabilities that put their users at risk of discovery or make them prone to censorship or denial of service attacks. In this paper, we propose a technique for supporting route asymmetry in previously symmetric decoy routing systems. The resulting asymmetric solution is more secure than previous asymmetric proposals and provides an option for tiered deployment, allowing more cautious ASes to deploy a lightweight, non-blocking relay station that aids in defending against routing-capable adversaries. We also provide an experimental evaluation of relay station performance on off-the-shelf hardware and additional security improvements to recently proposed systems.
APA, Harvard, Vancouver, ISO, and other styles
23

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

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

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

Stojanovic, Igor, and Goran Djordjevic. "In-channel misrouting suppression technique for deflection-routed networks on chip." Facta universitatis - series: Electronics and Energetics 29, no. 2 (2016): 309–23. http://dx.doi.org/10.2298/fuee1602309s.

Full text
Abstract:
Deflection routing, where port-contentions in routers are resolved by intentionally misrouting some of packets along unwanted directions instead of storing them, has been proposed as a promising approach for improving power and area efficiency of large-scale networks on chip (NoCs). However, at high network load, when packets are misrouted more frequently, the cost and energy benefits of this simple routing scheme are offset by the performance degradation. To address this problem, we propose a technique that uses small in-channel buffers to capture some of deflected packets before they take a misrouting hop. The captured packets are then looped-back to the routers where they suffered deflection and routed again. To improve the efficiency of this in-channel misrouting suppression scheme we also slightly modify the routing function of the deflection router by restricting the choice of productive directions for misrouted packets. Evaluations on synthetic traffic patterns show that the proposed misrouting suppression mechanism yields an improvement of 36.2% in network saturation throughput when implemented into the conventional deflection-routed network.
APA, Harvard, Vancouver, ISO, and other styles
27

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

Fethellah, Nour El Houda, Hafida Bouziane, and Abdallah Chouarfia. "New Efficient Caching Strategy based on Clustering in Named Data Networking." International Journal of Interactive Mobile Technologies (iJIM) 13, no. 12 (December 18, 2019): 104. http://dx.doi.org/10.3991/ijim.v13i12.11403.

Full text
Abstract:
<p>The Named Data Networking NDN is one of the most proposed architecture for the new model of Internet communications based on contents distribution, called Information-Centric Network ICN. It is widely accepted by the research community since it has become dominant in ICN design that resolves TCP-IP based Internet problems such as bandwidth, delay, location dependent and congestion. Based on location host IP addresses, TCP-IP designed for Peer-to-Peer communication P2P. NDN architecture is oriented Content Centric Networking CCN, where the data is stored on routers and distributed to users from the nearest router. Cache capacities of routers are limited compared to forwarded contents. To move from TCP-IP model to CCN model, many papers propose several new contents distribution based architecture ICN. In this paper, we propose a novel strategy to optimize the use of network resources inspired from Network clustering and cluster head selection in MANETs. Specifically, the improved K-medoids cluster algorithm is used to divide the global network in clusters, where for each cluster; three routers are selected as content routers. The first is the main caching router as well as the second and the third are the secondary caching router. The caching router selection process relies on three relevant criteria consisting of the distance between a node and its cluster centroid, the number of neighbors, and the congestion level. Two Multi Attribute Decision–Making methods MADM are applied, namely TOPSIS and AHP. Performance analysis of our proposed strategy with the established criteria showed � its effectiveness and strong potential.<em></em></p>
APA, Harvard, Vancouver, ISO, and other styles
29

Adhiwibowo, Whisnumurti, and Baik Catur Ardiansyah. "Rancang Bangun Wireless Router Menggunakan Raspberry PI." Jurnal Pengembangan Rekayasa dan Teknologi 14, no. 2 (January 21, 2019): 50. http://dx.doi.org/10.26623/jprt.v14i2.1227.

Full text
Abstract:
Raspberry Pi is a credit card-sized SBC (Single Board Computer) developed by the Raspberry Pi Foundation in the UK with the aim of teaching basic computer science at school. Raspberry Pi can be used for various things including wireless. In this study will be carried out the implementation of wireless routers by using Raspberry Pi as the main media. This is done to implement the use of Raspberry Pi devices as an alternative to Wireless Routers or in the world of networking. The Wireless Router implementation method used is the PPDIOO network cycle method owned by CISCO which has the stages of Prepare, Plan, Design, Implement, Operate, and Optimize. Wireless Router implementation uses several devices between Edimax - Wireless 802.11b / g / n usb wireless adapter as a device or Broadcast Wireless Raspberry Pi media as the main function of the device and system owned by the Wireless Router. Wireless Routers using Raspberry Pi become one of the best solutions for the needs of adding new wireless network segments if you see in terms of limited funds and existing devices. An administrator will easily build a new network using Raspberry Pi.
APA, Harvard, Vancouver, ISO, and other styles
30

Bi, Xia-an, Xiaohui Wang, and Hong Liu. "Evolutionary Game-Theoretic Solution for Virtual Routers with Padding Misbehavior in Cloud Computing." Mathematical Problems in Engineering 2015 (2015): 1–7. http://dx.doi.org/10.1155/2015/901461.

Full text
Abstract:
With the development of cloud computing and virtualization, a physical router can be multiplexed as a large number of virtual routers. TCP-based interactive applications have an incentive to improve their performance by padding “junk packets” into the network among real communication packets. This padding misbehavior will upgrade short TCP flows from “mice” to “elephants” and consequently lead to network congestion and breakdown. This paper presents a detailed solution and analysis for describing the normal behavior and padding misbehavior of virtual routers. In particular, a system model for analyzing behavior of virtual routers is based on evolutionary game model, and, through analyzing the stability of the equilibrium points, the stable point is the solution to the problem. The clear evolutionary path of network applications with the normal behavior and padding misbehavior is analyzed by the corresponding graph. Then this paper gives the behavior control suggestions to effectively restrain the padding misbehavior and maintain stable high-throughputs of the router. The simulation results demonstrate that our solution can effectively restrain the padding misbehavior and maintain stable high-throughputs of the router simultaneously compared with the classical queue management.
APA, Harvard, Vancouver, ISO, and other styles
31

Amin, Sadia, Saira Ahthasham, Aftab Ahmed Shaikh, Ahthasham Sajid, and Mirza Aamir Mehmood. "Improvement of BGP Session Maintenance." International Journal of Engineering & Technology 1, no. 2 (May 24, 2012): 94. http://dx.doi.org/10.14419/ijet.v1i2.77.

Full text
Abstract:
In the early days, the Internet used static routes, but very quickly network administrators couldnt keep manually updating their routing tables. Later, Internet network administrator used a protocol called EGP but EGP was not scalable so BGP was introduced to solve all problems and more. BGP stands for Border Gateway Protocol and the most current version is BGP4. BGP is a routing protocol that runs on routers. BGP allows fully decentralized management of the Internet. That means, if BGP router is on the Internet, it can tell all other routers that what networks are available to everyone in the world. BGP calls each routing domain an autonomous system (AS). It selects the best path, through the Internet, by choosing the route that has to traverse the fewest autonomous systems. As BGP provides information for controlling the flow of packets between ASes, the protocol plays a critical role in Internet efficiency, reliability, and security. However, slow convergence and abnormal termination of session are major vulnerability of BGP. Simplifying BGP design complexity helps in research, for the root cause analysis of BGP. Deriving technique to prevent the loss of data, reduce the convergence time and maintaining the sessions of BGP by instantly diverting the traffic from teardown / flapped link to the backup link considering as active link. It will be a great success to achieve the goal to maintain the sessions and reduce the BGP convergence time.
APA, Harvard, Vancouver, ISO, and other styles
32

Muttair, Karrar Shakir, Ali Z. Ghazi Zahid, Oras A. Shareef Al-Ani, Ahmed Mohammed Q. AL-Asadi, and Mahmood F. Mosleh. "Implementation Mixed Wireless Network with Lower Number of Wi-Fi Routers for Optimal Coverage." International Journal of Online and Biomedical Engineering (iJOE) 17, no. 13 (December 6, 2021): 59–80. http://dx.doi.org/10.3991/ijoe.v17i13.24149.

Full text
Abstract:
With the development of various wireless communication networks, Wi-Fi Router positioning and deployment systems have become widely popular in recent years to improve coverage in various environments. In this paper, we present an appropriate mechanism for defining the deployment of Wi-Fi Routers to improve coverage in the Oxford Languages Institute (OLI) environment. In addition, the institute's environment was simulated using the Wireless InSite (WI) Package. In this work, two types of Wi-Fi Routers are used. The first is the TP-Link, while the second is the Rocket. These two devices operate at 2.4 and 5 GHz frequencies. There are two objectives in this work. The first aim is to determine the best location to cover the simulated scene environment in a better way. The second aim is to compare Wi-Fi Routers to find out which Wi-Fi Router is better and find out how many Wi-Fi Routers we need to cover the institute's environment. The comparison between Wi-Fi Routers was based on basic parameters to measure the performance of wireless networks, the most important of which are Coverage Rate (CR) Percentage, Signal Quality Rate (SQR), and Received Power Rate (RPR). According to the results that were shown on the Graphical User Interface (GUI) using MATLAB Software. We noticed that the CR, SQR, and RPR of the Rocket are 83.9080%, 97.0082%, and -35.2337 dBm respectively, and these results are better than the results provided by the TP-Link, as it gave the CR, SQR, and RPR are 32.1839%, 77.8690%, and -58.1685 dBm, respectively. Finally, we conclude that CR using the Rocket is good and we need one device to cover the institute’s environment. While CR using the TP-Link is bad and we need five devices to reach the coverage provided by the Rocket because the Rocket has high transmitted power and gain capacity.
APA, Harvard, Vancouver, ISO, and other styles
33

Decasper, D., Z. Dittia, G. Parulkar, and B. Plattner. "Router plugins: a software architecture for next-generation routers." IEEE/ACM Transactions on Networking 8, no. 1 (2000): 2–15. http://dx.doi.org/10.1109/90.836474.

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

Decasper, Dan, Zubin Dittia, Guru Parulkar, and Bernhard Plattner. "Router plugins: a software architecture for next generation routers." ACM SIGCOMM Computer Communication Review 28, no. 4 (October 1998): 229–40. http://dx.doi.org/10.1145/285243.285285.

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

Li, Cunlu, Dezun Dong, Shazhou Yang, Xiangke Liao, Guangyu Sun, and Yongheng Liu. "CIB-HIER." ACM Transactions on Architecture and Code Optimization 18, no. 4 (December 31, 2021): 1–21. http://dx.doi.org/10.1145/3468062.

Full text
Abstract:
Hierarchical organization is widely used in high-radix routers to enable efficient scaling to higher switch port count. A general-purpose hierarchical router must be symmetrically designed with the same input buffer depth, resulting in a large amount of unused input buffers due to the different link lengths. Sharing input buffers between different input ports can improve buffer utilization, but the implementation overhead also increases with the number of shared ports. Previous work allowed input buffers to be shared among all router ports, which maximizes the buffer utilization but also introduces higher implementation complexity. Moreover, such design can impair performance when faced with long packets, due to the head-of-line blocking in intermediate buffers. In this work, we explain that sharing unused buffers between a subset of router ports is a more efficient design. Based on this observation, we propose Centralized Input Buffer Design in Hierarchical High-radix Routers (CIB-HIER), a novel centralized input buffer design for hierarchical high-radix routers. CIB-HIER integrates multiple input ports onto a single tile and organizes all unused input buffers in the tile as a centralized input buffer. CIB-HIER only allows the centralized input buffer to be shared between ports on the same tile, without introducing additional intermediate virtual channels or global scheduling circuits. Going beyond the basic design of CIB-HIER, the centralized input buffer can be used to relieve the head-of-line blocking caused by shallow intermediate buffers, by stashing long packets in the centralized input buffer. Experimental results show that CIB-HIER is highly effective and can significantly increase the throughput of high-radix routers.
APA, Harvard, Vancouver, ISO, and other styles
36

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

Killian, Cédric, Camel Tanougast, Fabrice Monteiro, and Abbas Dandache. "A New Efficient and Reliable Dynamically ReconfigurableNetwork-on-Chip." Journal of Electrical and Computer Engineering 2012 (2012): 1–16. http://dx.doi.org/10.1155/2012/843239.

Full text
Abstract:
We present a new reliableNetwork-on-Chip(NoC) suitable forDynamically Reconfigurable Multiprocessors on Chipsystems. The proposedNoCis based on routers performing online error detection of routing algorithm and data packet errors. Our work focuses on adaptive routing algorithms which allow to bypass faulty components or processor elements dynamically implemented inside the network. The proposed routing error detection mechanism allows to distinguish routing errors from bypasses of faulty components. The new router architecture is based on additional diagonal state indications and specific logic blocks allowing the reliable operation of theNoC. The main originality in the proposedNoCis that only the permanently faulty parts of the routers are disconnected. Therefore, our approach maintains a high run time throughput in theNoCwithout data packet loss thanks to a self-loopbackmechanism inside each router.
APA, Harvard, Vancouver, ISO, and other styles
38

Chao, H. J. "Next generation routers." Proceedings of the IEEE 90, no. 9 (September 2002): 1518–58. http://dx.doi.org/10.1109/jproc.2002.802001.

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

Hancock, Bill. "Attacking network routers." Network Security 1999, no. 1 (January 1999): 8–9. http://dx.doi.org/10.1016/s1353-4858(99)80001-4.

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

Seifert, W. M. "Bridges and routers." IEEE Network 2, no. 1 (January 1988): 57–64. http://dx.doi.org/10.1109/65.3239.

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

Hancock, Bill. "Attacking network routers." Network Security 1995, no. 9 (September 1995): 11–12. http://dx.doi.org/10.1016/1353-4858(96)89749-2.

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

Bharadwaj, Prashant. "Routers in internetworks." Resonance 9, no. 1 (January 2004): 12–25. http://dx.doi.org/10.1007/bf02902525.

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

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
APA, Harvard, Vancouver, ISO, and other styles
44

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

Deng, Xiaoping, Lujuan Ma, and Xiaoping Liu. "CCAIB: Congestion Control Based on Adaptive Integral Backstepping for Wireless Multi-Router Network." Sensors 22, no. 5 (February 25, 2022): 1818. http://dx.doi.org/10.3390/s22051818.

Full text
Abstract:
Wireless information collecting and processing terminals, such as cell phones, sensors and smart wearable devices, are expected to be deployed on a large scale in the future to promote the continuous advancement of the global information revolution. Since most of these terminals connect to each other using long-distance and high-speed networks by multiple routers and eventual access the internet, the application of mobile internet is gradually increasing and data traffic on the mobile internet is growing exponentially, from which arises congestion in wireless networks on multiple routers. This research solves the congestion problem for wireless networks with multiple bottleneck routers. First, the wireless network model is expanded to multi-router networks, which considers the interrelationships between connecting routers. Afterwards, a new Active Queue Management (AQM) method called Congestion Control Based on Adaptive Integral Backstepping (CCAIB) is designed to handle congestion in wireless networks. In CCAIB, an adaptive control method is used to estimate the packet loss ratios of wireless links and a controller is designed based on the estimation results through a backstepping procedure. It can be shown from the simulation results that the performance of CCAIB is better than the H∞ algorithm in queue length stability. Besides, the window size of CCAIB is 100 times that of the H∞ algorithm, and the proportion of packets marked as discarded when using CCAIB is about 0.1% of the H∞ algorithm. Moreover, CCAIB has satisfactory adaptability to network parameters such as wireless link capacity, propagation delay, wireless packet loss ratios, desired queue length and router location.
APA, Harvard, Vancouver, ISO, and other styles
46

Shah, Zawar, and Ashutosh Kolhe. "Throughput Analysis of IEEE 802.11ac and IEEE 802.11n in a Residential Home Environment." International Journal of Interdisciplinary Telecommunications and Networking 9, no. 1 (January 2017): 1–13. http://dx.doi.org/10.4018/ijitn.2017010101.

Full text
Abstract:
IEEE 802.11ac is the latest WiFi standard that operates in 5GHz frequency band and promises high data rate than IEEE 802.11n. In this paper, the authors carry out experiments using commercial off-the-shelf equipment in a typical home environment and quantify the gain provided by IEEE 802.11ac compared to IEEE 802.11n. Their experimental results obtained in a typical home environment show that in 5GHz frequency band with a 2x2 MIMO configuration, IEEE 802.11ac provides much higher throughput than IEEE 802.11n. IEEE 802.11ac provides an average throughput gain of 94% and 91% at a distance of 3.6m and 8.5m from the wireless router, respectively. The authors further investigate the gain in average throughput that is provided by IEEE 802.11ac when the transmit antenna diversity on the wireless router is increased from two to three. They note that IEEE 802.11ac with a 3x2 MIMO configuration helps to combat multipath fading effect present in residential home environment and provides higher average throughput than 2x2 MIMO e.g. at a distance of 11m from the wireless router, 3x2 MIMO configuration provides a gain of 15.13% than the 2x2 MIMO configuration. The authors conclude based on their results (obtained via experiments in a typical home environment) that although IEEE 802.11ac wireless routers are more expensive than IEEE 802.11n wireless routers however, high throughput provided by IEEE 802.11ac justifies the high cost associated with its routers.
APA, Harvard, Vancouver, ISO, and other styles
47

Wang, Longjuan, Chunjie Cao, Jun Ye, and Wenjie Zhong. "RW-Fuzzer: A Fuzzing Method for Vulnerability Mining on Router Web Interface." Wireless Communications and Mobile Computing 2022 (April 25, 2022): 1–9. http://dx.doi.org/10.1155/2022/5311295.

Full text
Abstract:
As the main routing device of the network, most routers can be set up and managed through their web enabled admin portal. This paper proposes a new method for router admin portal vulnerability mining fuzzing test (RW-fuzzer: Router Web fuzzer). The mutation samples that generated by Boofuzz are used to construct the test sample set for fuzzy testing. The constructed mutation test cases are more suitable for the attack load or critical value of the router’s Web interface. They can cause unexpected errors for the devices more easily, which achieves the goal of discover potential vulnerabilities, and the practicality is excellent. Based on the proposed RW-fuzzer method, this work conducted fuzzing tests on 4 widely sold router models from manufacturers. Four nday vulnerabilities and one 0day vulnerability have been found. Experiment results show that the proposed RW-fuzzer method is effective.
APA, Harvard, Vancouver, ISO, and other styles
48

Wang, Longjuan, Chunjie Cao, Jun Ye, and Wenjie Zhong. "RW-Fuzzer: A Fuzzing Method for Vulnerability Mining on Router Web Interface." Wireless Communications and Mobile Computing 2022 (April 25, 2022): 1–9. http://dx.doi.org/10.1155/2022/5311295.

Full text
Abstract:
As the main routing device of the network, most routers can be set up and managed through their web enabled admin portal. This paper proposes a new method for router admin portal vulnerability mining fuzzing test (RW-fuzzer: Router Web fuzzer). The mutation samples that generated by Boofuzz are used to construct the test sample set for fuzzy testing. The constructed mutation test cases are more suitable for the attack load or critical value of the router’s Web interface. They can cause unexpected errors for the devices more easily, which achieves the goal of discover potential vulnerabilities, and the practicality is excellent. Based on the proposed RW-fuzzer method, this work conducted fuzzing tests on 4 widely sold router models from manufacturers. Four nday vulnerabilities and one 0day vulnerability have been found. Experiment results show that the proposed RW-fuzzer method is effective.
APA, Harvard, Vancouver, ISO, and other styles
49

Schwarz, Franziska, Klaus Schwarz, Daniel Fuchs, Reiner Creutzburg, and David Akopian. "Firmware Vulnerability Analysis of Widely Used Low-Budget TP-Link Routers." Electronic Imaging 2021, no. 3 (June 18, 2021): 135–1. http://dx.doi.org/10.2352/issn.2470-1173.2021.3.mobmu-135.

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

Hariyadi, I. Putu. "Sentralisasi Manajemen Hotspot Menggunakan Transparent Bridge Tunnel EoIP over SSTP." Jurnal Matrik 16, no. 2 (July 26, 2017): 86. http://dx.doi.org/10.30812/matrik.v16i2.8.

Full text
Abstract:
STMIK Bumigora is the first computer college in the province of West Nusa Tenggara (NTB). There are 11 hotspots spread across the campus to provide Internet services through a wireless connection for the academic community. The increasing number of hotspots that must be managed with locations scattered in various Mikrotik routers hence make the process of management and monitoring hotspots become complex, ineffective and efficient. Centralized campus hotspot management using a transparent bridge EoIP over SSTP can help solve the problems at hand. Ethernet over IP (EoIP) Tunneling is a Mikrotik RouterOS protocol that creates an Ethernet tunnel between routers over IP connections. EoIP tunnel built on SSTP tunnel (EoIP over SSTP) with Site-to-Site type. SSTP is a new form of Virtual Private Network (VPN) tunnel that provides a mechanism for encapsulating Point-to-Point Protocol (PPP) traffic through the SSL path of the HTTPS protocol. The IP address of the SSTP interface is used as the local reference and remote address of the EoIP over SSTP tunnel. The application of bridging on EoIP interfaces and interfaces connected to Access Point devices forms a logical network so that the management and monitoring of hotspot services can be performed centrally on one router.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography