Relevant bibliographies by topics / Routers

Academic literature on the topic 'Routers'

Author: Grafiati
Published: 4 June 2021
Last updated: 24 January 2023

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Routers"

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
More sources

Dissertations / Theses on the topic "Routers"

1

BANTAN, NOUMAN. "A ROUTING PROTOCOL AND ROUTING ALGORITHM FOR SPACE COMMUNICATION." Kent State University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=kent1172099125.

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

Mizrak, Alper Tugay. "Detecting malicious routers." Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2007. http://wwwlib.umi.com/cr/ucsd/fullcit?p3274932.

Full text
Abstract:
Thesis (Ph. D.)--University of California, San Diego, 2007.
Title from first page of PDF file (viewed October 10, 2007). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 13--140).
APA, Harvard, Vancouver, ISO, and other styles
3

Szczepankiewicz, Peter J. Velazquez Luis E. "Authentication in SAAM routers." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2000. http://handle.dtic.mil/100.2/ADA380178.

Full text
Abstract:
Thesis (M.S. in Information Technology Management) Naval Postgraduate School, June 2000. Peter J. Szczepankiewicz, Luis E. Velazquez.
Thesis advisor(s): Xie, Geoffrey; Buddenberg, Rex. "June 2000." Includes bibliographical references (p. 205-206). Also available in print.
APA, Harvard, Vancouver, ISO, and other styles
4

Szczepankiewicz, Peter J., and Luis E. Velazquez. "Authentication in SAAM routers." Thesis, Monterey, California. Naval Postgraduate School, 2000. http://hdl.handle.net/10945/9331.

Full text
Abstract:
Approved for public release, distribution unlimited.
Authentication is particularly important in the SAAM system because SAAM uses mobile codes, called resident agents. These resident agents are loaded onto SAAM routers dynamically, and execute on the destination SAAM router. Mobile code in the SAAM system requires an authentication scheme to prevent an outsider from sending a malicious resident agent. The primary focus of this research is to find the best-fit authentication scheme for the SAAM system. SAAM with authentication can be used as the technical network infrastructure to support Network Centric Warfare (NCW) as described in JV2OlO. The prototype in this thesis authenticates new nodes that join a SAAM network using Kerberos. Signaling data, called control traffic, is authenticated with a dynamic signature key that changes every two minutes. Once a SAAM node is authenticated, its identity is protected throughout the battle.
APA, Harvard, Vancouver, ISO, and other styles
5

Sivaraman, Kaushalram Anirudh. "Designing fast and programmable routers." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113936.

Full text
Abstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 141-155).
Historically, the evolution of network routers was driven primarily by performance. Recently, owing to the need for better control over network operations and the constant demand for new features, programmability of routers has become as important as performance. However, today's fastest routers, which have 10-100 ports each running at a line rate of 10-100 Gbit/s, use fixed-function hardware, which cannot be modified after deployment. This dissertation describes three router hardware primitives and their corresponding software programming models that allow network operators to program specific classes of router functionality on such fast routers. First, we develop a system for programming stateful packet-processing algorithms such as algorithms for in-network congestion control, buffer management, and data-plane traffic engineering. The challenge here is the fact that these algorithms maintain and update state on the router. We develop a small but expressive instruction set for state manipulation on fast routers. We then expose this to the programmer through a high-level programming model and compiler. Second, we develop a system to program packet scheduling: the task of picking which packet to transmit next on a link. Our main contribution here is the finding that many packet scheduling algorithms can be programmed using one simple idea: a priority queue of packets in hardware coupled with a software program to assign each packet's priority in this queue. Third, we develop a system for programmable and scalable measurement of network statistics. Our goal is to allow programmers to flexibly define what they want to measure for each flow and scale to a large number of flows. We formalize a class of statistics that permit a scalable implementation and show that it includes many useful statistics (e.g., moving averages and counters). These systems show that it is possible to program several packet-processing functions at speeds approaching today's fastest routers. Based on these systems, we distill two lessons for designing fast and programmable routers in the future. First, specialized designs that program only specific classes of router functionality improve packet processing throughput by 10-100x relative to a general-purpose solution. Second, joint design of hardware and software provides us with more leverage relative to designing only one of them while keeping the other fixed.
by Anirudh Sivaraman Kaushalram.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
6

Becker, Matthew E. (Matthew Erin). "Fast arbitration in dilated routers." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/39080.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
Includes bibliographical references (p. 84-85).
by Matthew E. Becker.
M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
7

Gavgani, Yashar Ganjali. "Buffer sizing in internet routers /." May be available electronically:, 2007. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.

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

Wang, Feng. "Building scalable next generation Internet routers /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?CSED%202008%20WANGF.

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

Egi, Norbert. "Software virtual routers on commodity hardware architectures." Thesis, Lancaster University, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539674.

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

He, Rongsen. "Indirect interconnection networks for high performance routers/switches." Online access for everyone, 2007. http://www.dissertations.wsu.edu/Dissertations/Summer2007/R_He_072307.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Routers"

1

Swapan, Zakariya. Routers. Dhaka: Ananya, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Brenton, Chris. Mastering Cisco routers. San Francisco: Sybex, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

International, Inc (Firm) Wave Technologies. Practical Cisco routers. St. Louis, MO: Wave Technologies International, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

C, Marney-Petix V., ed. Switches, routers, gateways! 2nd ed. Fremont, CA: Numidia Press, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bridges, routers, gateways! Fremont, CA: Numidia Press, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Andrew, Hamilton, and Kessler Gary C, eds. Mastering Cisco routers. 2nd ed. San Francisco: Sybex, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

service), SpringerLink (Online, ed. Guide to Cisco Routers Configuration: Becoming a Router Geek. London: Springer London, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Interconnections: Bridges and routers. Reading, Mass: Addison-Wesley Pub. Co., 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rosendahl, Robert R. The router. Winnipeg: Oak Park Enterprises, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Spielman, Patrick. The new router handbook. New York: Sterling, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Routers"

1

Buchanan, W. J. "Routers." In The Complete Handbook of the Internet, 653–72. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-0-306-48331-8_31.

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

Song, Min. "Routers." In Handbook of Computer Networks, 364–74. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2011. http://dx.doi.org/10.1002/9781118256053.ch23.

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

Buchanan, W. J. "Routers." In The Handbook of Data Communications and Networks, 1141–60. Boston, MA: Springer US, 2004. http://dx.doi.org/10.1007/978-1-4020-7870-5_69.

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

Nelson, Brett. "Using Routers." In Getting to Know Vue.js, 235–59. Berkeley, CA: Apress, 2018. http://dx.doi.org/10.1007/978-1-4842-3781-6_12.

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

Uzayr, Sufyan bin. "React Routers." In Mastering React, 87–104. Boca Raton: CRC Press, 2022. http://dx.doi.org/10.1201/9781003309369-5.

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

Aweya, James. "Rate Management Mechanisms in Switch/Routers." In Designing Switch/Routers, 305–25. Boca Raton: CRC Press, 2022. http://dx.doi.org/10.1201/9781003311249-9.

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

Aweya, James. "Designing the Switch/Router." In Designing Switch/Routers, 159–235. Boca Raton: CRC Press, 2022. http://dx.doi.org/10.1201/9781003311256-3.

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

Aweya, James. "Introducing Multilayer Switching and the Switch/Router." In Designing Switch/Routers, 13–32. Boca Raton: CRC Press, 2022. http://dx.doi.org/10.1201/9781003311249-2.

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

Aweya, James. "OSI and TCP/IP Reference Models." In Designing Switch/Routers, 33–52. Boca Raton: CRC Press, 2022. http://dx.doi.org/10.1201/9781003311249-3.

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

Aweya, James. "High-Performance Switch/Routers." In Designing Switch/Routers, 41–158. Boca Raton: CRC Press, 2022. http://dx.doi.org/10.1201/9781003311256-2.

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

Conference papers on the topic "Routers"

1

Son, Hyojun, Hanjoon Kim, Hao Wang, Nam Sung Kim, and John Kim. "Ghost routers." In NOCS '19: International Symposium on Networks-on-Chip. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3313231.3352360.

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

Tekdas, Onur, and Volkan Isler. "Robotic routers." In 2008 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2008. http://dx.doi.org/10.1109/robot.2008.4543416.

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

Decasper, Dan, Zubin Dittia, Guru Parulkar, and Bernhard Plattner. "Router plugins: a software architecture for next generation routers." In the ACM SIGCOMM '98 conference. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/285237.285285.

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

Wu, Qiang, Yong Liao, Tilman Wolf, and Lixin Gao. "Benchmarking BGP Routers." In 2007 IEEE 10th International Symposium on Workload Characterization. IEEE, 2007. http://dx.doi.org/10.1109/iiswc.2007.4362183.

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

Liao, Haiguang, Qingyi Dong, Xuliang Dong, Wentai Zhang, Wangyang Zhang, Weiyi Qi, Elias Fallon, and Levent Burak Kara. "Attention Routing: Track-Assignment Detailed Routing Using Attention-Based Reinforcement Learning." In ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/detc2020-22219.

Full text
Abstract:
Abstract In the physical design of integrated circuits, global and detailed routing are critical stages involving the determination of the interconnected paths of each net on a circuit while satisfying the design constraints. Existing actual routers as well as routability predictors either have to resort to expensive approaches that lead to high computational times, or use heuristics that do not generalize well. Even though new, learning-based routing methods have been proposed to address this need, requirements on labelled data and difficulties in addressing complex design rule constraints have limited their adoption in advanced technology node physical design problems. In this work, we propose a new router — attention router, which is the first attempt to solve the track-assignment detailed routing problem by applying reinforcement learning. Complex design rule constraints are encoded into the routing algorithm and an attention-model-based REINFORCE algorithm is applied to solve the most critical step in routing: sequencing device pairs to be routed. The attention router and its baseline genetic router are applied to solve different commercial advanced technologies analog circuits problem sets. The attention router demonstrates generalization ability to unseen problems and is also able to achieve more than 100× acceleration over the genetic router without severely compromising the routing solution quality. Increasing the number of training problems greatly improves the performance of attention router. We also discover a similarity between the attention router and the baseline genetic router in terms of positive correlations in cost and routing patterns, which demonstrate the attention router’s ability to be utilized not only as a detailed router but also as a predictor for routability and congestion.
APA, Harvard, Vancouver, ISO, and other styles
6

Charland, Randy, Leonid Veytser, and Bow-Nan Cheng. "Integrating multiple radio-to-router interfaces to open source dynamic routers." In MILCOM 2012 - 2012 IEEE Military Communications Conference. IEEE, 2012. http://dx.doi.org/10.1109/milcom.2012.6415572.

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

Jiang, Xuezhi, Mingwei Xu, and Qi Li. "Compact Route Computation: Improving Parallel BGP Route Processing for Scalable Routers." In Distributed Processing, Workshops and Phd Forum (IPDPSW). IEEE, 2011. http://dx.doi.org/10.1109/ipdps.2011.302.

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

Argyraki, Katerina, Sylvia Ratnasamy, Salman Baset, Byung-Gon Chun, Kevin Fall, Gianluca Iannaccone, Allan Knies, Eddie Kohler, Maziar Manesh, and Sergiu Nedevschi. "Can software routers scale?" In the ACM workshop. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1397718.1397724.

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

Bolla, Raffaele, and Roberto Bruschi. "Pc-based software routers." In the ACM workshop. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1397718.1397725.

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

Anand, Ashok, Archit Gupta, Aditya Akella, Srinivasan Seshan, and Scott Shenker. "Packet caches on routers." In the ACM SIGCOMM 2008 conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1402958.1402984.

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

Reports on the topic "Routers"

1

Almquist, P., and F. Kastenholz. Towards Requirements for IP Routers. RFC Editor, November 1994. http://dx.doi.org/10.17487/rfc1716.

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

Sahni, Sartaj. Energy-Efficient High-Performance Routers. Fort Belvoir, VA: Defense Technical Information Center, February 2012. http://dx.doi.org/10.21236/ada555969.

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

Baker, F., ed. Requirements for IP Version 4 Routers. RFC Editor, June 1995. http://dx.doi.org/10.17487/rfc1812.

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

Towsley, Don. Study of Buffer Size in Internet Routers. Fort Belvoir, VA: Defense Technical Information Center, August 2006. http://dx.doi.org/10.21236/ada457457.

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

Gilligan, R., and E. Nordmark. Transition Mechanisms for IPv6 Hosts and Routers. RFC Editor, April 1996. http://dx.doi.org/10.17487/rfc1933.

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

Gilligan, R., and E. Nordmark. Transition Mechanisms for IPv6 Hosts and Routers. RFC Editor, August 2000. http://dx.doi.org/10.17487/rfc2893.

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

Huitema, C. An Anycast Prefix for 6to4 Relay Routers. RFC Editor, June 2001. http://dx.doi.org/10.17487/rfc3068.

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

Hagino, J., and H. Snyder. IPv6 Multihoming Support at Site Exit Routers. RFC Editor, October 2001. http://dx.doi.org/10.17487/rfc3178.

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

Bernet, Y., S. Blake, D. Grossman, and A. Smith. An Informal Management Model for Diffserv Routers. RFC Editor, May 2002. http://dx.doi.org/10.17487/rfc3290.

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

Zinin, A., A. Lindem, and D. Yeung. Alternative Implementations of OSPF Area Border Routers. RFC Editor, April 2003. http://dx.doi.org/10.17487/rfc3509.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Routers' for particular source types:
Journal articles Dissertations / Theses Books
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