Academic literature on the topic 'Routers (Computer networks)'

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Routers (Computer networks).'

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 (Computer networks)"

1

Haeruddin, Haeruddin. "Analisa dan Implementasi Sistem Keamanan Router Mikrotik dari Serangan Winbox Exploitation, Brute-Force, DoS." JURNAL MEDIA INFORMATIKA BUDIDARMA 5, no. 3 (July 31, 2021): 848. http://dx.doi.org/10.30865/mib.v5i3.2979.

Full text
Abstract:
The advancement of technology development makes it easier to find and share any information using computer networks. Computer networks have been widely applied in homes and offices. The ease of exchanging data on the network makes the availability of computer networks and information security are vulnerable to attacks by threats. On a computer network, the device which has the vulnerability is a router. A router is the outermost device that connects the Local Area Network (LAN) to the internet so that it can be easily attacked by irresponsible parties. The Mikrotik router is a product that is widely used as a gateway router that connects LANs and the Internet. There are so many tools that can be used to carry out attacks on Mikrotik routers such as Hping3 (DoS), Hydra (Brute-Force), and Exploitation Script (Winbox Exploitation). To find out the security loop in Mikrotik routers, this study uses penetration testing methods and attack techniques such as Winbox Exploit, Brute-force, and DoS. After knowing the security gap, the next step is to provide and implementation recommendations so that similar attacks do not occur any more in the future.
APA, Harvard, Vancouver, ISO, and other styles
2

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
3

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
4

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
5

Sihotang, Bil Klinton, Sumarno Sumarno, and Bahrudi Efendi Damanik. "Implementasi Access Control List Pada Mikrotik dalam Mengamankan Koneksi Internet Koperasi Sumber Dana Mutiara." JURIKOM (Jurnal Riset Komputer) 7, no. 2 (April 26, 2020): 229. http://dx.doi.org/10.30865/jurikom.v7i2.2010.

Full text
Abstract:
The need for information and internet access at this time is very high. To accept it is wrong only with computer networks as a medium. In a network that requires a network that has been segmented using a Virtual Local Area Network (VLAN), the application of an Access Control List (ACL) is required to be granted access rights for each device in the network. The Access Control List (ACL) can filter the data traffic of a network by controlling whether the packets are passed or issued. A network is built using several different network devices, one of which is a router. A router is a tool that can process different data packet networks (between networks) through a process called routing. lots of companies that produce routers, mikrotik is one of the companies that produce routers. mikrotik is easy to do because it uses Winbox in Gui's view, besides that the hotspot server in it is provided with several management facilities that can be arranged according to network requirements
APA, Harvard, Vancouver, ISO, and other styles
6

Majid, Nuur Wachid Abdul, and Syifaul Fuada. "RIP VS. OSPF ROUTING PROTOCOLS: WHICH ONE IS THE BEST FOR A REAL-TIME COMPUTER NETWORK?" Simetris: Jurnal Teknik Mesin, Elektro dan Ilmu Komputer 11, no. 1 (April 30, 2020): 249–56. http://dx.doi.org/10.24176/simet.v11i1.3796.

Full text
Abstract:
The development of modern computer networks for internet access makes routing protocols needed, and it has an essential role in a real-time system. Therefore, the best and most effective routes can be reached. In this short article, we discuss the comparison of two popular routing protocols, i.e., Routing Information Protocol (RIP) and Open Shortest Path First (OSPF) using two network simulators, i.e., Graphical Network Simulator-3 (GNS3) and Enterprise Network Simulation Platform (ENSP). Both of OSPF and RIP routing protocols can be used in the same topology and have differences in the connection time required to connect communication between routers. Thru GNS3 and ENSP, we obtained the comparison result at ideal condition; we found that the OSPF routing protocol (83 ms) has a faster time or efficient in connection than RIP (177 ms). Besides, we found that compared to GNS3 network simulators (329 ms), the ENSP has a relatively more rapid average time (94 ms). This work suggests that a Huawei router with ENSP is faster than a Cisco router which is used by GNS3. Hopefully, this information can be refereed by internet network administrators to build real-time computer networks.
APA, Harvard, Vancouver, ISO, and other styles
7

Qureshi, Muhammad Aasim, Mohd Fadzil Hassan, Muhammad Khurram Ehsan, Muhammad Owais Khan, Md YeaKub Ali, and Shafiullah Khan. "A Robust Graph Theoretic Solution of Routing in Intelligent Networks." Wireless Communications and Mobile Computing 2022 (June 20, 2022): 1–7. http://dx.doi.org/10.1155/2022/9661411.

Full text
Abstract:
Implementation of robust routing is very critical in network communication. Connecting devices like routers maintain databases for the whole network topology in the routing table. Each router needs to keep these tables updated with the best possible routes so that an efficient communication can always take place in nondelay tolerant intelligent networks that include military and tactical systems, vehicular communication networks, underwater acoustic networks, and intelligent sensor networks. The fast construction of shortest-path tree (SPT) is important to devise an efficient routing in a nondelay tolerant networks. That is why a simple and efficient algorithm is the need of the time. A robust routing solution SPT with O V + E time complexity is proposed to supersede the existing landmark.
APA, Harvard, Vancouver, ISO, and other styles
8

Bidaybekov, Ye Y., Y. K. Khenner, Sh T. Shekerbekova, and Y. Н. Zhabayev. "ON THE ISSUE OF TRAINING FUTURE COMPUTER SCIENCE TEACHERS IN COMPUTER." BULLETIN Series of Physics & Mathematical Sciences 72, no. 4 (September 29, 2020): 174–79. http://dx.doi.org/10.51889/2020-4.1728-7901.27.

Full text
Abstract:
The article discusses of training future computer science teachers in computer networks based on network simulation. Analysis of scientific and pedagogical and educational literature has shown that in the training of computer science teachers, computer networks are studied in the aspect of information simulation of their structures, while simulation the processes of their functioning is not given due attention, despite the possibility of its use in the organization of training. Most educational institutions face organizational, technical and material difficulties when organizing training in computer networks on real equipment. The above-mentioned difficulties in training future computer science teachers in computer networks can be avoided by using network simulation. By network simulation, we mean reproducing a dynamic image of the main network components (network cables, switches, hubs, routers, etc.) and visualization the processes of their configuration and operation on the computer screen.
APA, Harvard, Vancouver, ISO, and other styles
9

Dasmen, Rahmat Novrianda, Abdur Rohman Syarif, Heru Saputra, and Rahmat Amrullah. "Perancangan Keamanan Internet Jaringan Hotspot Mikrotik pada Winbox dan Wireshark." DoubleClick: Journal of Computer and Information Technology 5, no. 2 (February 27, 2022): 71. http://dx.doi.org/10.25273/doubleclick.v5i2.11751.

Full text
Abstract:
<p>Mikrotik, a technology that provides Internet services by turning computers into network routers. The computer network of SMA Negeri 16 Palembang uses a traditional cable network with star type. In this research, the process of designing a network using Mikrotik and managing and distributing bandwidth as needed at SMA Negeri 16 Palembang is carried out using the Network Development Life Cycle (NDLC) model. The result of this research is that Mikrotik can manage all computer networks. In the distribution of bandwidth regularly on the proxy can provide efficiency over the use of the internet. Mikrotik can maximize network usage if the overall bandwidth has been set.</p><p><strong><em> </em></strong></p><p><strong><em>Keywords</em></strong><em>: </em><em>Mikrotik, Computer Network, Router and Type Network</em><em></em></p>
APA, Harvard, Vancouver, ISO, and other styles
10

MA, LIANG, and MIESO K. DENKO. "ENHANCED ROUTING METRIC FOR LOAD-BALANCING IN WIRELESS MESH NETWORKS." Journal of Interconnection Networks 08, no. 04 (December 2007): 407–26. http://dx.doi.org/10.1142/s0219265907002107.

Full text
Abstract:
Wireless mesh networks (WMNs) have been drawing significant attention in recent years due to their flexibility in providing extensive wireless backbone. WMNs typically consist of mesh routers and mesh clients with each node operating not only as a host but also as a router. Due to the traffic patterns in WMNs, load-balancing becomes an important issue and may degrade the performance of the entire network. This paper proposes a routing metric known as Weighted Cumulative Expected Transmission Time with Load-Balancing (WCETT-LB) for wireless mesh networks. WCETTT-LB enhances the basic Weighted Cumulative Expected Transmission Time (WCETT) by incorporating load-balancing into the routing metric. Unlike existing schemes, WCETT-LB implements load-balancing at mesh routers. WCETT-LB provides a congestion-aware routing and traffic splitting mechanism to achieve global load-balancing in the network. By conducting an extensive simulation experiments, the result shows that WCETT-LB outperforms the existing routing metrics in load-balancing in terms of achieving high packet delivery ratio, low average end-to-end delay and low average congestion level in wireless mesh networks. The qualitative and quantitative analysis also show the significance of the proposed scheme.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Routers (Computer networks)"

1

Prado, Alexandre B. "Auto-configuration of Cisco routers with application software /." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2003. http://library.nps.navy.mil/uhtbin/hyperion-image/03sep%5FPrado.pdf.

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

Awad, Ashraf A. "Scalable application-aware router mechanisms." Diss., Available online, Georgia Institute of Technology, 2004:, 2003. http://etd.gatech.edu/theses/available/etd-04052004-180005/unrestricted/awad%5Fashraf%5Fa%5F200312%5Fphd.pdf.

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

Tam, Wing-yan. "Quality of service routing with path information aggregation." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B36782956.

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

Al-Amoudi, Ahmed. "Evaluation of virtual routing appliances as routers in a virtual environment /." Online version of thesis, 2008. http://hdl.handle.net/1850/7544.

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

林俊? and Chun-wing Lam. "Fault-tolerant routing for unidirectional networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B29506530.

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

Shah, Subodh. "CAD-HOC a CAD like tool for generating mobility benchmarks in ad-hoc networks /." [Gainesville, Fla.] : University of Florida, 2001. http://etd.fcla.edu/etd/uf/2001/anp1049/FinalETDCopy.pdf.

Full text
Abstract:
Thesis (M.S.)--University of Florida, 2001.
Title from first page of PDF file. Document formatted into pages; contains xiii, 90 p.; also contains graphics. Vita. Includes bibliographical references (p. 85-89).
APA, Harvard, Vancouver, ISO, and other styles
7

Vik, Knut-Helge. "Quality of service aware source initiated ad-hoc routing." Online access for everyone, 2004. http://www.dissertations.wsu.edu/thesis/Spring2004/K%5FVik%5F050704.pdf.

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

Zang, Joanna Q. "Design of a redundancy protocol /." free to MU campus, to others for purchase, 2003. http://wwwlib.umi.com/cr/mo/fullcit?p1418080.

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

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
10

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

Books on the topic "Routers (Computer networks)"

1

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
2

Gai, Silvano. Internetworking IPv6 with Cisco routers. New York: McGraw-Hill, 1998.

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

Hossain, Ekram, and Kin K. Leung. Wireless mesh networks: Architectures and protocols. New York: Springer, 2011.

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

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

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

Jeff, Doyle, and Kolon Matthew C, eds. Juniper Networks routers: The complete reference. Berkeley, Calif: McGraw-Hill/Osborne, 2002.

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

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
7

Southwick, Peter. JUNOS enterprise routing. 2nd ed. Beijing: O'reilly, 2011.

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

Lee, Donald C. Enhanced IP services for Cisco networks. Indianapolis, IN, USA: Cisco Press, 1999.

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

Sivalingam, Krishna M., and Suresh Subramaniam. Optical WDM networks: Principles and practice. New York: Kluwer Academic, 2002.

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

Alvaro, Retana. EIGRP for IP: Basic operation and configuration. Boston: Addison-Wesley, 2000.

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

Book chapters on the topic "Routers (Computer networks)"

1

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
2

Gebali, Fayez. "Switches and Routers." In Analysis of Computer and Communication Networks, 1–30. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-74437-7_13.

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

Mrozowski, Pawel, and Andrzej Chydzinski. "Performance Evaluation of Routers with the Dropping-Function Queueing." In Computer Networks, 243–52. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07941-7_25.

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

Kogan, Yaakov. "Reliability Metrics for Routers in IP Networks." In Computer Communications and Networks, 97–112. London: Springer London, 2010. http://dx.doi.org/10.1007/978-1-84882-828-5_3.

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

Adamu, Aminu, Vsevolod Shorgin, Sergey Melnikov, and Yuliya Gaidamaka. "Flexible Random Early Detection Algorithm for Queue Management in Routers." In Distributed Computer and Communication Networks, 196–208. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-66471-8_16.

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

Matos, Debora, Caroline Concatto, Luigi Carro, Fernanda Kastensmidt, and Altamiro Susin. "The Need for Reconfigurable Routers in Networks-on-Chip." In Lecture Notes in Computer Science, 275–80. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00641-8_28.

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

Li, Zhi, and Zhongwei Zhang. "A Coupled Fuzzy Logic Control for Routers’ Queue Management over TCP/AQM Networks." In Lecture Notes in Computer Science, 357–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11552451_47.

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

Hidell, Markus, Peter Sjödin, and Olof Hagsand. "Control and Forwarding Plane Interaction in Distributed Routers." In NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 1339–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11422778_110.

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

Lepe-Aldama, Oscar-Iván, and Jorge García-Vidal. "I/O Bus Usage Control in PC-Based Software Routers." In NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications, 1135–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-47906-6_97.

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

Wydrowski, Bartek, and Moshe Zukerman. "High Performance DiffServ Mechanism for Routers and Switches: Packet Arrival Rate Based Queue Management for Class Based Scheduling." In NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications, 62–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-47906-6_5.

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

Conference papers on the topic "Routers (Computer networks)"

1

Ben Neji, Nizar, and Adel Bouhoula. "Self-adjusting scheme for high speed routers." In 2008 33rd IEEE Conference on Local Computer Networks (LCN 2008). IEEE, 2008. http://dx.doi.org/10.1109/lcn.2008.4664229.

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

Zheng, Xing, Lingling Sun, Jie Jin, and Xiaojun Wang. "Energy efficient solutions for the networks and routers." In 2015 2nd International Conference on Electrical, Computer Engineering and Electronics. Paris, France: Atlantis Press, 2015. http://dx.doi.org/10.2991/icecee-15.2015.239.

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

Lareida, Andri, George Petropoulos, Valentin Burger, Michael Seufert, Sergios Soursos, and Burkhard Stiller. "Augmenting home routers for socially-aware traffic management." In 2015 IEEE 40th Conference on Local Computer Networks (LCN). IEEE, 2015. http://dx.doi.org/10.1109/lcn.2015.7366329.

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

Jain, Animesh, Ritesh Parikh, and Valeria Bertacco. "High-radix on-chip networks with low-radix routers." In 2014 IEEE/ACM International Conference on Computer-Aided Design (ICCAD). IEEE, 2014. http://dx.doi.org/10.1109/iccad.2014.7001365.

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

Fahmi, Kariem, Douglas Leith, Stepan Kucera, and Holger Claussen. "Understanding MPTCP in Multi-WAN Routers: Measurements and System Design." In 2021 IEEE 46th Conference on Local Computer Networks (LCN). IEEE, 2021. http://dx.doi.org/10.1109/lcn52139.2021.9524976.

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

Karrakchou, Ouassim, Nancy Samaan, and Ahmed Karmouch. "FCTree: A Space Efficient FIB Data Structure for NDN Routers." In 2018 IEEE 43rd Conference on Local Computer Networks (LCN). IEEE, 2018. http://dx.doi.org/10.1109/lcn.2018.8638116.

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

Seddiki, M. Said, and Mounir Frikha. "Resource Allocation for Virtual Routers through Non-Cooperative Games." In 2012 21st International Conference on Computer Communications and Networks - ICCCN 2012. IEEE, 2012. http://dx.doi.org/10.1109/icccn.2012.6289214.

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

Hamzeh, Wissam, and Abdelhakim Hafid. "A scalable cluster distributed BGP architecture for next generation routers." In 2009 IEEE 34th Conference on Local Computer Networks (LCN 2009). IEEE, 2009. http://dx.doi.org/10.1109/lcn.2009.5355204.

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

Cotter, David. "Ultrafast Computer Networking." In Optics in Computing. Washington, D.C.: Optica Publishing Group, 1997. http://dx.doi.org/10.1364/oc.1997.ofb.1.

Full text
Abstract:
In recent years research on ‘optics in computing’ has focused increasingly on the use of optical interconnects within future electronic computers, packet switches and routers to enhance their power and performance as stand-alone machines. At the same time, however, the interconnection between computers today has undergone a revolution; the widespread adoption of common network transport protocols has stimulated the rapidly increasing and extensive use of inter-networking, and this is manifest by the explosive growth of the global Internet. Increasingly, intelligence— data, applications, computing power itself—is becoming distributed across networks of machines. The efficiency with which machines are interconnected becomes vitally important for acceptable performance of these advanced distributed applications. The interconnection must certainly provide sufficient bandwidth, but equally important is the need to minimise latency. A simple and common example of the inadequacy of today’s computer networks is the frustratingly poor performance often experienced by users of the Worldwide Web. Increasingly in the future there will be a demand for multi-media applications that can operate with a slick and seamless interface to the network, and that provide long interaction periods with human immersion in computer generated environments, synthesised from wide-ranging distributed intelligence. There will also be an increasing volume of computer-to-computer interaction with little human intervention, using software agents. For these applications, interconnection latency must be minimised and should ideally be dominated by the fundamental delay due to the optical transmission time-of-flight.
APA, Harvard, Vancouver, ISO, and other styles
10

Bahnasy, Mahmoud Mohamed, Andre Beliveau, Brian Alleyne, Bochra Boughzala, Chakri Padala, Karim Idoudi, and Halima Elbiaze. "Using Ethernet Commodity Switches to Build a Switch Fabric in Routers." In 2015 24th International Conference on Computer Communication and Networks (ICCCN). IEEE, 2015. http://dx.doi.org/10.1109/icccn.2015.7288483.

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

Reports on the topic "Routers (Computer networks)"

1

Seginer, Ido, James Jones, Per-Olof Gutman, and Eduardo Vallejos. Optimal Environmental Control for Indeterminate Greenhouse Crops. United States Department of Agriculture, August 1997. http://dx.doi.org/10.32747/1997.7613034.bard.

Full text
Abstract:
Increased world competition, as well as increased concern for the environment, drive all manufacturing systems, including greenhouses, towards high-precision operation. Optimal control is an important tool to achieve this goal, since it finds the best compromise between conflicting demands, such as higher profits and environmental concerns. The report, which is a collection of papers, each with its own abstract, outlines an approach for optimal, model-based control of the greenhouse environment. A reliable crop model is essential for this approach and a significant portion of the effort went in this direction, resulting in a radically new version of the tomato model TOMGRO, which can be used as a prototype model for other greenhouse crops. Truly optimal control of a very complex system requires prohibitively large computer resources. Two routes to model simplification have, therefore, been tried: Model reduction (to fewer state variables) and simplified decision making. Crop model reduction from nearly 70 state variables to about 5, was accomplished by either selecting a subset of the original variables or by forming combinations of them. Model dynamics were then fitted either with mechanistic relationships or with neural networks. To simplify the decision making process, the number of costate variables (control policy parametrs) was recuced to one or two. The dry-matter state variable was transformed in such a way that its costate became essentially constant throughout the season. A quasi-steady-state control algorithm was implemented in an experimental greenhouse. A constant value for the dry-matter costate was able to control simultaneously ventilation and CO2 enrichment by continuously producing weather-dependent optimal setpoints and then maintaining them closely.
APA, Harvard, Vancouver, ISO, and other styles
2

Kodupuganti, Swapneel R., Sonu Mathew, and Srinivas S. Pulugurtha. Modeling Operational Performance of Urban Roads with Heterogeneous Traffic Conditions. Mineta Transportation Institute, January 2021. http://dx.doi.org/10.31979/mti.2021.1802.

Full text
Abstract:
The rapid growth in population and related demand for travel during the past few decades has had a catalytic effect on traffic congestion, air quality, and safety in many urban areas. Transportation managers and planners have planned for new facilities to cater to the needs of users of alternative modes of transportation (e.g., public transportation, walking, and bicycling) over the next decade. However, there are no widely accepted methods, nor there is enough evidence to justify whether such plans are instrumental in improving mobility of the transportation system. Therefore, this project researches the operational performance of urban roads with heterogeneous traffic conditions to improve the mobility and reliability of people and goods. A 4-mile stretch of the Blue Line light rail transit (LRT) extension, which connects Old Concord Rd and the University of North Carolina at Charlotte’s main campus on N Tryon St in Charlotte, North Carolina, was considered for travel time reliability analysis. The influence of crosswalks, sidewalks, trails, greenways, on-street bicycle lanes, bus/LRT routes and stops/stations, and street network characteristics on travel time reliability were comprehensively considered from a multimodal perspective. Likewise, a 2.5-mile-long section of the Blue Line LRT extension, which connects University City Blvd and Mallard Creek Church Rd on N Tryon St in Charlotte, North Carolina, was considered for simulation-based operational analysis. Vissim traffic simulation software was used to compute and compare delay, queue length, and maximum queue length at nine intersections to evaluate the influence of vehicles, LRT, pedestrians, and bicyclists, individually and/or combined. The statistical significance of variations in travel time reliability were particularly less in the case of links on N Tryon St with the Blue Line LRT extension. However, a decrease in travel time reliability on some links was observed on the parallel route (I-85) and cross-streets. While a decrease in vehicle delay on northbound and southbound approaches of N Tryon St was observed in most cases after the LRT is in operation, the cross-streets of N Tryon St incurred a relatively higher increase in delay after the LRT is in operation. The current pedestrian and bicycling activity levels seemed insignificant to have an influence on vehicle delay at intersections. The methodological approaches from this research can be used to assess the performance of a transportation facility and identify remedial solutions from a multimodal perspective.
APA, Harvard, Vancouver, ISO, and other styles
3

Videa, Aldo, and Yiyi Wang. Inference of Transit Passenger Counts and Waiting Time Using Wi-Fi Signals. Western Transportation Institute, August 2021. http://dx.doi.org/10.15788/1715288737.

Full text
Abstract:
Passenger data such as real-time origin-destination (OD) flows and waiting times are central to planning public transportation services and improving visitor experience. This project explored the use of Internet of Things (IoT) Technology to infer transit ridership and waiting time at bus stops. Specifically, this study explored the use of Raspberry Pi computers, which are small and inexpensive sets of hardware, to scan the Wi-Fi networks of passengers’ smartphones. The process was used to infer passenger counts and obtain information on passenger trajectories based on Global Positioning System (GPS) data. The research was conducted as a case study of the Streamline Bus System in Bozeman, Montana. To evaluate the reliability of the data collected with the Raspberry Pi computers, the study conducted technology-based estimation of ridership, OD flows, wait time, and travel time for a comparison with ground truth data (passenger surveys, manual data counts, and bus travel times). This study introduced the use of a wireless Wi-Fi scanning device for transit data collection, called a Smart Station. It combines an innovative set of hardware and software to create a non-intrusive and passive data collection mechanism. Through the field testing and comparison evaluation with ground truth data, the Smart Station produced accurate estimates of ridership, origin-destination characteristics, wait times, and travel times. Ridership data has traditionally been collected through a combination of manual surveys and Automatic Passenger Counter (APC) systems, which can be time-consuming and expensive, with limited capabilities to produce real-time data. The Smart Station shows promise as an accurate and cost-effective alternative. The advantages of using Smart Station over traditional data collection methods include the following: (1) Wireless, automated data collection and retrieval, (2) Real-time observation of passenger behavior, (3) Negligible maintenance after programming and installing the hardware, (4) Low costs of hardware, software, and installation, and (5) Simple and short programming and installation time. If further validated through additional research and development, the device could help transit systems facilitate data collection for route optimization, trip planning tools, and traveler information systems.
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