Relevant bibliographies by topics / Distributed router

Academic literature on the topic 'Distributed router'

Author: Grafiati
Published: 14 March 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 'Distributed router.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Distributed router"

1

Li, Yufeng, Le Tian, Han Qiu, and Chuanhao Zhang. "Research Notes: Distributed Shadow for Router Security Defense." International Journal of Software Engineering and Knowledge Engineering 28, no. 02 (February 2018): 193–206. http://dx.doi.org/10.1142/s021819401840003x.

Full text
Abstract:
Router security defense technologies emerging in recent years could hardly detect and block the new booming threats with unknown signatures such as hardware Trojan, zero-day attacks, etc. We present a novel router defense technology, distributed router shadow, which builds a closed execution environment to deceive attacks entering into the router, thereby misleading the attackers into regarding it as the real attack target and executing the suspicious code to maximize the chances of detonating the system exploit; thus the original router is prevented from attacking and the suspicious code can be detected. Our experiment and analysis show that the router shadow can defend not only attacks with signature but also some new attacks without signature.
APA, Harvard, Vancouver, ISO, and other styles
2

Effiong, Charles, Gilles Sassatelli, and Abdoulaye Gamatié. "Combined Distributed Shared-Buffered and Diagonally-Linked Mesh Topology for High-Performance Interconnect." Micromachines 13, no. 12 (December 17, 2022): 2246. http://dx.doi.org/10.3390/mi13122246.

Full text
Abstract:
Networks-on-Chip (NoCs) have become the de-facto on-chip interconnect for multi/manycore systems. A typical NoC router is made up of buffers used to store packets that are unable to advance to their desired destination. However, buffers consume significant power/area and are often underutilized, especially in cases of applications with non-uniform traffic patterns thus leading to performance degradation for such applications. To improve network performance, the Roundabout NoC (R-NoC) concept is considered. R-NoC is inspired by real-life multi-lane traffic roundabouts and consists of lanes that are shared by multiple input/output ports to maximize buffering resource utilization. R-NoC relies on router-internal adaptive routing that decides the lane path based on back pressure. Back pressure makes it possible to assess lane utilization and route packets accordingly. This is made possible thanks to the use of elastic buffers for control flow, a clever type of handshaking in a way similar to asynchronous circuits. Another prominent feature of R-NoC is that internal routing and arbitration are completely distributed which allows for significant freedom in deciding internal router topology and parameters. This work leverages this property and proposes novel yet unexplored configurations for which an in-depth evaluation of corresponding implementations on 45 nm CMOS technology is given. Each configuration is evaluated performance and power-wise on both synthetic and real application traffic. Several R-NoC configurations are identified and demonstrated to provide very significant performance improvements over standard mesh configurations and a typical input-buffered router, without compromising area and power consumption. Exploiting the distributed nature of R-NoC routers, a diagonally-linked configuration is then proposed which incurs moderate area overhead and features yet better performance and energy efficiency.
APA, Harvard, Vancouver, ISO, and other styles
3

Kim, Changsu, Hankil Kim, Jongwon Lee, and Hoekyung Jung. "Web Server-based Distributed Machine Socialization System." International Journal of Electrical and Computer Engineering (IJECE) 8, no. 2 (April 1, 2018): 631. http://dx.doi.org/10.11591/ijece.v8i2.pp631-637.

Full text
Abstract:
<p>In recent years, there has been an increasing trend of offering services that are useful to users, such as Google's Nest, through machine socialization between parts and devices in specific spaces such as automobiles, homes, and factories. The existing inter - device collaboration system is a centralized system using router, and it controls collaboration between devices by building OpenWrt and web server on router. However, due to the limited hardware resources on the router, it generates network traffic congestion as the number of requests from the client increases or the number of clients connected to the server increases. In this paper, we propose a distributed machine collaboration system based on web server using inter - device collaboration algorithm. The study of Micro Controller Unit (MCU) has reduced the traffic incidence by solving the request sent to the router from each device by oneself.</p>
APA, Harvard, Vancouver, ISO, and other styles
4

Bao, Zhen Shan, Bao Ping Wang, and Wen Bo Zhang. "Design and Performance Evaluation of Distributed Virtual Router Based on OpenStack." Applied Mechanics and Materials 687-691 (November 2014): 2888–92. http://dx.doi.org/10.4028/www.scientific.net/amm.687-691.2888.

Full text
Abstract:
With the booming of Cloud Compute, OpenStack has been more widely used in Data Center, but in tradition deployment of OpenStack, the traffic must traverse network node to get routing decision. So the network node would be a bottle-neck due to the increasing amount of data flow. In order to solve this problem, this paper propose an extensible design, we create a internal virtual router in each compute node, the internal virtual router just can process the East-West traffic in lay2. With the help of distributed router, the East-West traffic can be delivered directly from the source hypervisor to the destination hypervisor, no longer need to traverse the router in network node to get routing decision, Therefore, North-South and East-West traffic don't impact each other anymore. North-South traffic enjoys all the bandwidth of router in network node exclusively, hence reduce the load of the network node. Experiment results show that OpenStack with distributed router has a much better performance evaluation than original OpenStack. This will dramatically increase the total bandwidth, and also bring other advantages.
APA, Harvard, Vancouver, ISO, and other styles
5

Barolli, Admir, Kevin Bylykbashi, Ermioni Qafzezi, Shinji Sakamoto, and Leonard Barolli. "Performance Evaluation of Chi-Square and Normal Distributions of Mesh Clients for WMNs Considering Five Router Replacement Methods." International Journal of Distributed Systems and Technologies 13, no. 1 (January 1, 2022): 1–14. http://dx.doi.org/10.4018/ijdst.296247.

Full text
Abstract:
In our previous work, we implemented a simulation system to solve the node placement problem in WMNs considering Particle Swarm Optimization (PSO) and Distributed Genetic Algorithm (DGA), called WMN-PSODGA. In this paper, we compare Chi-square and Normal distributions of mesh clients for different router replacement methods. The router replacement methods considered are Constriction Method (CM), Random Inertia Weight Method (RIWM), Linearly Decreasing Inertia Weight Method (LDIWM), Linearly Decreasing Vmax Method (LDVM) and Rational Decrement of Vmax Method (RDVM). The simulation results show that for both distributions, the mesh routers cover all mesh clients for all router replacement methods. In terms of load balancing, Normal distribution shows better results than Chi-square. The best router replacement method for this distribution is LDIWM. Thus, the best scenario is the Normal distribution of mesh clients with LDIWM as a router replacement method.
APA, Harvard, Vancouver, ISO, and other styles
6

Kim, Kicheon. "Analysis of Distributed DDQ for QoS Router." ETRI Journal 28, no. 1 (February 8, 2006): 31–44. http://dx.doi.org/10.4218/etrij.06.0104.0193.

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

Subramanian, Kausik, Loris D'Antoni, and Aditya Akella. "Synthesis of Fault-Tolerant Distributed Router Configurations." ACM SIGMETRICS Performance Evaluation Review 46, no. 1 (January 17, 2019): 87–89. http://dx.doi.org/10.1145/3308809.3308853.

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

Subramanian, Kausik, Loris D'Antoni, and Aditya Akella. "Synthesis of Fault-Tolerant Distributed Router Configurations." ACM SIGMETRICS Performance Evaluation Review 46, no. 1 (January 17, 2019): 87–89. http://dx.doi.org/10.1145/3292040.3219652.

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

Subramanian, Kausik, Loris D'Antoni, and Aditya Akella. "Synthesis of Fault-Tolerant Distributed Router Configurations." Proceedings of the ACM on Measurement and Analysis of Computing Systems 2, no. 1 (April 3, 2018): 1–26. http://dx.doi.org/10.1145/3179425.

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

Chrysoulas, C., E. Haleplidis, G. Kostopoulos, R. Haas, S. Denazis, and O. Koufopavlou. "Towards a service-enabled distributed router architecture." IET Circuits, Devices & Systems 2, no. 1 (2008): 60. http://dx.doi.org/10.1049/iet-cds:20070041.

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

Dissertations / Theses on the topic "Distributed router"

1

Hidell, Markus. "Decentralized Modular Router Architectures." Doctoral thesis, Stockholm : Laboratory for Communications Networks, Royal Institute of Technology, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4090.

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

Yang, Rena Whei-Ming 1974. "Scalable distributed router mechanisms to encourage network congestion avoidance." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/47543.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.
Includes bibliographical references (p. 58-60).
by Rena Whei-Ming Yang.
M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
3

Rodríguez, Durón Francisco A. "Design and analysis of a new distributed IP router framework." Thesis, Lancaster University, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.551640.

Full text
Abstract:
Recently, we have seen routers' life expectancy dramatically shortened as a result of Internet Service Providers (ISPs) and enterprise companies equipment replacement patterns: new, high performance routers are usually introduced in the core of their network, pushing existing routers towards the network edge, with routers already at the edge being often decomissioned before the end of their hardware life cycle. Furthermore, ISPs' customers interconnection demands have become more difficult to meet considering that they might change in time and that ISPs not only need to provide an inteconnection link but also a whole network solution. For solving the previous problems, this thesis focuses to explore alternative ways to utilise routers which can further extend their serviceability life cycle while providing a flexible platform that can facilitate ISPs to meet customers interconnection demands. We investigate new methods that could allow us to decouple routers logical routing and forwarding functionalities from the hardware that implements them. In contrast with the traditional and well-known techniques for achieving the lat- ter, we employ an automatic configuration management approach that modifies dynamically the configurations of a set of routers which can further exploit their usefulness by using them in conjuncture. The previous approach relies on the flexibility that routers offer through their configuration interface, hence including most routers regardless its type and make. Our proposed approach is based on a routers management architecture, namely RoMa, aimed at hosting multiple and various routers through a set of interconnected routers. Such architecture not only considers to host routers using a single but multiple hardware chassis. To demonstrate the feasability of providing the means for building a logical router using multiple hardware routers represents the core of this thesis. For this, we have designed a logical entity called distributed IP router. We focus on two key issues for building this type of logical routers. First, supporting the intra-domain routing function in these logical entities. Second, provisioning such logicial entities with aggregated links. Our findings suggest that such logical routers are feasible and can provide new highly desirable features in comparison with standard routers, as it is the case of the aggregated links.
APA, Harvard, Vancouver, ISO, and other styles
4

Chan, Yik-Kwan Eric, and 陳奕鈞. "Investigation of a router-based approach to defense against Distributed Denial-of-Service (DDoS) attack." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B30173309.

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

Sadhukhan, Gautam, Deepak Vinodia, and Manmohan Sandhu. "PERFORMANCE EVALUATION OF ETHERNET LAN BASED DISTRIBUTED TELEMETRY DATA NETWORK AND ITS EXTENSION USING ROUTER AND BRIDGE." International Foundation for Telemetering, 2004. http://hdl.handle.net/10150/605803.

Full text
Abstract:
International Telemetering Conference Proceedings / October 18-21, 2004 / Town & Country Resort, San Diego, California
This paper evaluates the performance as well as effectiveness of the High Speed Ethernet LANBased Distributed Telemetry Data Network Architecture. It also attempts to obtain a feasible solution for the Extension of LAN over High Performance Digital Modem via Routers and Bridges. With the advent of highly efficient broadband TCP/IP network and rapid growth of data traffic demand in the area of Telemetry Data Acquisition and Processing, one has to adopt a high bit rate PCM Telemetry Data Stream with the strategy of distributed task scheduling in multiprocessor environment. The proposed Telemetry System Architecture is adopted as a milestone to Modern Telemetry system. It incorporates various value added services for the performance evaluation of various flight vehicles providing authenticated data. This paper shows that by configuring the IP addresses of various nodes and router / bridges with V.35 interfaces, it is possible to extend the Telemetry Data on a local LAN to the remote LAN for display and high speed processing in real time. Necessary comparisons of performance of the existing to the proposed systems are presented.
APA, Harvard, Vancouver, ISO, and other styles
6

Núñez, Benjamin. "Applying a router-based-distributed bandwidth allocation algorithm to dynamically implement traffic engineering over MPLS-based networks in order to increase the quality of service for non-elastic applications." Diss., Connect to online resource, 2006. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1435226.

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

Kosowski, Adrian. "Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network." Habilitation à diriger des recherches, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00867765.

Full text
Abstract:
Computing with mobile agents is rapidly becoming a topic of mainstream research in the theory of distributed computing. The main research questions undertaken in this study concern the feasibility of solving fundamental tasks in an anonymous network, subject to limitations on the resources available to the agent. The considered challenges include: exploring a graph by means of an agent with limited memory, discovery of the network topology, and attempting to meet with another agent in another network (rendezvous). The constraints imposed on the agent include the number of moves which the agent is allowed to perform in the network, the amount of state memory available to the agent, the ability of the agent to communicate with other agents, as well as its a priori knowledge of the network topology or of global parameters.
APA, Harvard, Vancouver, ISO, and other styles
8

Halwan, Vivek. "Efficient and fault-tolerant communication algorithms in wormhole-routed distributed membory multiprocessors /." The Ohio State University, 1999. http://rave.ohiolink.edu/etdc/view?acc_num=osu1488187049539756.

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

Dixit-Radiya, Vibha. "Mapping on wormhole-routed distributed-memory systems : a temporal communication graph-based approach /." The Ohio State University, 1995. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487863429091928.

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

Pajak, Dominik. "Algorithms for Deterministic Parallel Graph Exploration." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2014. http://tel.archives-ouvertes.fr/tel-01064992.

Full text
Abstract:
Nous étudions dans cette thèse le problème de l'exploration parallèle d'un graphe à l'aide des multiples, synchronisés et mobiles agents. Chaque agent est une entité individuelle qui peut, indépendamment des autres agents, visitez les sommets du graphe ou parcourir ses arêtes. Le but de ensemble des agents est de visiter tous les sommets de graphe. Nous étudions d'abord l'exploration du graphe dans un modèle où chaque agent est équipé de mémoire interne, mais les nœuds n'ont pas de mémoire. Dans ce modèle les agents sont autorisés à communiquer entre eux en échangeant des messages. Nous présentons des algorithmes qui s'exécutent dans un minimum de temps possible pour polynomiale nombre d'agents (polynomiale en nombre de sommets du graphe). Nous étudions aussi quelle est l'impacte de différent méthodes des communications. Nous étudions des algorithmes où les agents peuvent se communiquer à distance arbitraire, mais aussi où communication est possible seulement entre les agents situés dans le même sommet. Dans les deux cas nous présentons des algorithmes efficaces. Nous avons aussi obtenu des limites inférieures qui correspondent bien à la performance des algorithmes. Nous considérons également l'exploration de graphe en supposant que les mouvements des agents sont déterminés par le soi-disant rotor-router mécanisme. Du point de vue d'un sommet fixé, le rotor- router envoie des agents qui visitent les sommet voisins dans un mode round-robin. Nous étudions l'accélération défini comme la proportion entre le pire des cas de l'exploration d'un agent unique et des plusieurs agents. Pour générales graphes, nous montrerons que le gain de vitesse en cas de multi-agent rotor-router est toujours entre fonction logarithmique et linéaire du nombre d'agents. Nous présentons également des résultats optimaux sur l'accélération de multi-agent rotor-router pour cycles, expanseurs, graphes aléatoires, cliques, tores de dimension fixé et une analyse presque optimale pour hypercubes. Finalement nous considérons l'exploration sans collision, où chaque agent doit explorer le graphe de manière indépendante avec la contrainte supplémentaire que deux agents ne peuvent pas occuper le même sommet. Dans le cas où les agents sont donnés le plan de graphe, on présente un algorithme optimal pour les arbres et un algorithme asymptotiquement optimal pour générales graphes. Nous présentons aussi des algorithmes dans le cas de l'exploration sans collision des arbres et des générales graphes dans la situation où les agents ne connaissent pas le graphe. Nous fermons la thèse par des observations finales et une discussion de problèmes ouverts liés dans le domaine de l'exploration des graphes.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Distributed router"

1

Cathy, Gadecki, and Garrett Aviva, eds. JUNOS for dummies. Hoboken, N.J: Wiley, 2008.

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

Universal routing strategies for interconnection networks. Berlin: Springer, 1998.

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

Verschure, Paul F. M. J. A chronology of Distributed Adaptive Control. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780199674923.003.0036.

Full text
Abstract:
This chapter presents the Distributed Adaptive Control (DAC) theory of the mind and brain of living machines. DAC provides an explanatory framework for biological brains and an integration framework for synthetic ones. DAC builds on several themes presented in the handbook: it integrates different perspectives on mind and brain, exemplifies the synthetic method in understanding living machines, answers well-defined constraints faced by living machines, and provides a route for the convergent validation of anatomy, physiology, and behavior in our explanation of biological living machines. DAC addresses the fundamental question of how a living machine can obtain, retain, and express valid knowledge of its world. We look at the core components of DAC, specific benchmarks derived from the engagement with the physical and the social world (the H4W and the H5W problems) in foraging and human–robot interaction tasks. Lastly we address how DAC targets the UTEM benchmark and the relation with contemporary developments in AI.
APA, Harvard, Vancouver, ISO, and other styles
4

Zientara, David. Mastering pfSense: Manage, secure, and monitor your on-premise and cloud network with pfSense 2.4, 2nd Edition. Packt Publishing, 2018.

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

Practical AWS Networking: Build and manage complex networks using services such as Amazon VPC, Elastic Load Balancing, Direct Connect, and Amazon Route 53. Packt Publishing - ebooks Account, 2018.

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

Ferguson, Gillum. Headwinds. University of Illinois Press, 2017. http://dx.doi.org/10.5406/illinois/9780252036743.003.0010.

Full text
Abstract:
This chapter explores how the loss of Prairie du Chien dealt a heavy blow at the British stronghold on Mackinac Island. Construction of Fort Shelby threatened the route by which the British supplied their Indian allies on the Mississippi. Supplies could still be distributed at Green Bay, Chicago, but for western tribes such as the Sioux and the Sauk, the Wisconsin River route was essential. Even to supply his own soldiers with food proved a constant struggle for the British commandant at Mackinac, and the constant throng of hungry allied Indians, usually accompanied by their families, often forced him to choose between depriving his own troops and alienating the Indians. The other danger threatening Mackinac was an American task force gathering under the command of Colonel George Croghan to retake the island.
APA, Harvard, Vancouver, ISO, and other styles
7

Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Springer London, Limited, 2006.

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

Brown, Sylvia. Bunyan and Empire. Edited by Michael Davies and W. R. Owens. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780199581306.013.39.

Full text
Abstract:
This chapter examines the global circulation of Bunyan’s writings along the routes of empire. Translations and adaptations, distributed for the most part by missionaries, were recruited both for and against empire. The universalism imputed to The Pilgrim’s Progress (1678; 1684) facilitated its global distribution, seemingly overcoming differences as if by magic. Yet this same assumption of universalism also made the authority of Bunyan available to local uses, needs, and even resistance against colonialism and empire. The history of Bunyan’s global textual circulation suggests a mixed and problematic relation to imperial expansion and colonial ambitions. Finally, while the continuing global reach of Bunyan might be understood as a residue of the mobility of his texts both within and against empire, this has also generated a multitude of diverse local adaptations and appropriations which enable a refocusing away from the totalizing categories of nation and empire.
APA, Harvard, Vancouver, ISO, and other styles
9

Herman, David. Coda: Toward a Bionarratology; or, Storytelling at Species Scale. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190850401.003.0009.

Full text
Abstract:
The coda to the book puts forward the hypothesis that narrative, even though it is grounded in and optimally calibrated for meso-level, human-scale phenomena, furnishes routes of access to emergent structures and processes extending beyond the size limits of the lifeworld, including species transformations at the macro level of phylogenetic history. In this way, the coda suggests how the study of what can be called storytelling at species scale constitutes an important aspect of narratology beyond the human. Focusing on the heuristic potentials of “multiscale narration” across a range of fictional and nonfictional examples, the chapter explores how narrative provides structural affordances that can be used to trace out pathways between, on the one hand, localized environments in which temporally and spatially bounded events involving particular animals or groups of animals take place, and, on the other hand, more or less massively distributed transformations at species scale.
APA, Harvard, Vancouver, ISO, and other styles
10

van Dorp, Eveline L. A., Douglas Eleveld, Erik Olofsen, and Jaap Vuyk. Drug distribution and elimination in anaesthetic practice. Edited by Michel M. R. F. Struys. Oxford University Press, 2017. http://dx.doi.org/10.1093/med/9780199642045.003.0012.

Full text
Abstract:
An understanding of pharmacokinetics is vital for the practice of anaesthesia. Drugs are, after administration, distributed throughout the body to the effect site (mostly the brain) to exert their effects. This can be influenced by differences in protein binding, systemic blood flow, and concomitant medication. Elimination of drugs from the body is through two main routes: either unchanged through the kidneys or through metabolism by the liver (and consecutive excretion through the kidneys). This process depends on the amount of hepatic blood flow and the amount of hepatic extraction. This in turn depends on the amount of protein binding and the intrinsic hepatic clearance. The cytochrome P450 enzyme family also plays an important role in drug elimination. Individual differences in enzyme activity can lead to differences in drug effect and clearances. Changes in enzyme activity by enzyme induction and inhibition can also be of influence on drug clearance. Compartmental, non-compartmental, and physiologically based models, and various statistical approaches to estimate these models, may be used to analyze the distribution and elimination of anaesthetic agents.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Distributed router"

1

Düser, Michael, Eugene Kozlovski, Robert I. Killey, and Polina Bayvel. "Distributed Router Architecture for Packet-Routed Optical Networks." In IFIP Advances in Information and Communication Technology, 187–202. New York, NY: Springer US, 2001. http://dx.doi.org/10.1007/978-0-387-35410-1_13.

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

Ray, Swapan Kumar, and Susmit Shannigrahi. "Fast BGP Convergence Following Link/Router Failure." In Distributed Computing and Networking, 473–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11322-2_45.

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

Rayanchu, Shravan K., and Gautam Barua. "Tracing Attackers with Deterministic Edge Router Marking (DERM)." In Distributed Computing and Internet Technology, 400–409. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30555-2_47.

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

Liu, Yubao, and Wenlong Chen. "Multicast Storage and Forwarding Method for Distributed Router." In Frontiers in Internet Technologies, 106–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-46826-5_9.

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

Zhao, Dongping, Deyun Zhang, Jiuxing Cao, Weibin Zheng, and Zhiping An. "Loss Rate Aware Preferential Treamtment Scheme at the Congested Router." In Parallel and Distributed Processing and Applications, 308–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11576235_35.

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

Pontes, Julian, Matheus Moreira, Fernando Moraes, and Ney Calazans. "Hermes-A – An Asynchronous NoC Router with Distributed Routing." In Integrated Circuit and System Design. Power and Timing Modeling, Optimization, and Simulation, 150–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-17752-1_15.

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

Jiang, Yu, Binxing Fang, and Mingzeng Hu. "Techniques in Mapping Router-Level Internet Topology from Multiple Vantage Points." In Parallel and Distributed Computing: Applications and Technologies, 410–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30501-9_84.

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

Choi, Sun-O., and Jongbae Kim. "Design and Implementation of 3-Phase Home Plugin Gateway PLC Router System." In Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, 51–61. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67008-5_5.

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

Biswas, Amitava, Suneil Mohan, Jagannath Panigrahy, Aalap Tripathy, and Rabi Mahapatra. "Representation of Complex Concepts for Semantic Routed Network." In Distributed Computing and Networking, 127–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92295-7_17.

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

Bein, Doina, Ajoy K. Datta, and Shashirekha Yellenki. "Cluster-Based Route Discovery Protocol." In Advances in Intelligent and Distributed Computing, 53–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-74930-1_6.

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

Conference papers on the topic "Distributed router"

1

He, Yuan, Hiroshi Sasaki, Shinobu Miwa, and Hiroshi Nakamura. "Predict-More Router: A Low Latency NoC Router with More Route Predictions." In 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW). IEEE, 2013. http://dx.doi.org/10.1109/ipdpsw.2013.40.

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

Bianco, Andrea, Fikru Getachew Debele, and Nanfang Li. "Energy efficient distributed router design." In ICC 2013 - 2013 IEEE International Conference on Communications. IEEE, 2013. http://dx.doi.org/10.1109/icc.2013.6655149.

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

Bianco, Andrea, Fikru Getachew Debele, and Luca Giraudo. "Energy saving in distributed router architectures." In ICC 2012 - 2012 IEEE International Conference on Communications. IEEE, 2012. http://dx.doi.org/10.1109/icc.2012.6364157.

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

Subramanian, Kausik, Loris D'Antoni, and Aditya Akella. "Synthesis of Fault-Tolerant Distributed Router Configurations." In SIGMETRICS '18: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3219617.3219652.

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

Elahi, Mahdi, and Hadi Shahriar Shahhosseini. "LTD-Router: Low Latency Traffic Distributed FPGA Based Router Architecture Using Dedicated Paths." In 2018 Iranian Conference on Electrical Engineering (ICEE). IEEE, 2018. http://dx.doi.org/10.1109/icee.2018.8472707.

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

Nguyen, Kim-Khoa, and Brigitte Jaumard. "A Distributed Model for Next Generation Router Software." In 2007 Workshop on High Performance Switching and Routing. IEEE, 2007. http://dx.doi.org/10.1109/hpsr.2007.4281246.

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

Lin, Sen, Qifu Cheng, Qiuye Sun, and Dazhong Ma. "Coordinated operation of energy router with distributed devices." In 2017 IEEE Conference on Energy Internet and Energy System Integration (EI2). IEEE, 2017. http://dx.doi.org/10.1109/ei2.2017.8245519.

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

Xuezhi Jiang, Mingwei Xu, Lingtao Pan, and Wenlong Chen. "Cluster router: homogeneous OSPF for distributed control plane." In China-Ireland International Conference on Information and Communications Technologies (CIICT 2008). IEE, 2008. http://dx.doi.org/10.1049/cp:20080867.

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

Bianco, Andrea, Robert Birke, Fikru Getachew Debele, and Luca Giraudo. "SNMP Management in a Distributed Software Router Architecture." In ICC 2011 - 2011 IEEE International Conference on Communications. IEEE, 2011. http://dx.doi.org/10.1109/icc.2011.5963221.

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

Yoo-Hwa Kang and Tae-Il Kim. "IPv4/IPv6 forwarding control architecture in distributed router." In 8th International Conference on Advanced Communication Technology. IEEE, 2006. http://dx.doi.org/10.1109/icact.2006.206425.

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

Reports on the topic "Distributed router"

1

Mathew, Jijo K., Christopher M. Day, Howell Li, and Darcy M. Bullock. Curating Automatic Vehicle Location Data to Compare the Performance of Outlier Filtering Methods. Purdue University, 2021. http://dx.doi.org/10.5703/1288284317435.

Full text
Abstract:
Agencies use a variety of technologies and data providers to obtain travel time information. The best quality data can be obtained from second-by-second tracking of vehicles, but that data presents many challenges in terms of privacy, storage requirements and analysis. More frequently agencies collect or purchase segment travel time based upon some type of matching of vehicles between two spatially distributed points. Typical methods for that data collection involve license plate re-identification, Bluetooth, Wi-Fi, or some type of rolling DSRC identifier. One of the challenges in each of these sampling techniques is to employ filtering techniques to remove outliers associated with trip chaining, but not remove important features in the data associated with incidents or traffic congestion. This paper describes a curated data set that was developed from high-fidelity GPS trajectory data. The curated data contained 31,621 vehicle observations spanning 42 days; 2550 observations had travel times greater than 3 minutes more than normal. From this baseline data set, outliers were determined using GPS waypoints to determine if the vehicle left the route. Two performance measures were identified for evaluating three outlier-filtering algorithms by the proportion of true samples rejected and proportion of outliers correctly identified. The effectiveness of the three methods over 10-minute sampling windows was also evaluated. The curated data set has been archived in a digital repository and is available online for others to test outlier-filtering algorithms.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Distributed router' for particular source types:
Journal articles Dissertations / Theses
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