Topic
Static routing
About: Static routing is a research topic. Over the lifetime, 25733 publications have been published within this topic receiving 576732 citations.
Papers published on a yearly basis
Papers
More filters
08 Apr 2002
TL;DR: Content-based routing algorithms that exploit filter similarities in order to reduce the size of routing tables and the number of control messages that are exchanged among the brokers in orderto keep the routing tables up-to-date are described.
Abstract: Matching notifications to subscriptions and routing notifications from producers to interested consumers are the main problems in large-scale publish/subscribe systems.Most previously proposed distributed notification services either use flooding or, if filtering is performed, they assume that each event broker has global knowledge about all active subscriptions. Both approaches degrade the scalability of notification services as the former wastes network resources and the latter generates overly large routing tables.In this paper we describe content-based routing algorithms that exploit filter similarities in order to reduce the size of routing tables and the number of control messages that are exchanged among the brokers in order to keep the routing tables up-to-date. In particular, the proposed algorithms do not assume global knowledge about all active subscriptions. Furthermore, we describe how these optimizations can be supported if the underlying data and filter model is based on structured records.
104 citations
TL;DR: This paper presents a comprehensive overview of the known topology-agnostic routing algorithms, classify these algorithms by their most important properties, and evaluate them consistently, providing significant insight into the algorithms and their appropriateness for different on- and off-chip environments.
Abstract: Most standard cluster interconnect technologies are flexible with respect to network topology. This has spawned a substantial amount of research on topology-agnostic routing algorithms, which make no assumption about the network structure, thus providing the flexibility needed to route on irregular networks. Actually, such an irregularity should be often interpreted as minor modifications of some regular interconnection pattern, such as those induced by faults. In fact, topology-agnostic routing algorithms are also becoming increasingly useful for networks on chip (NoCs), where faults may make the preferred 2D mesh topology irregular. Existing topology-agnostic routing algorithms were developed for varying purposes, giving them different and not always comparable properties. Details are scattered among many papers, each with distinct conditions, making comparison difficult. This paper presents a comprehensive overview of the known topology-agnostic routing algorithms. We classify these algorithms by their most important properties, and evaluate them consistently. This provides significant insight into the algorithms and their appropriateness for different on- and off-chip environments.
104 citations
TL;DR: In this article, the authors proposed an iterative exact algorithm for vehicle routing with time windows and multiple routes, which considers that a given vehicle can be assigned to more than one route per planning period.
103 citations
02 Jul 1986
TL;DR: Two n -layer channel routing algorithms that guarantee successful routing of the channel for n greater than three are presented and one is linear and optimal given a VHV …HV assignment of layers and the other is quasilinear and performs optimally on examples from the literature.
Abstract: In this paper we present two n-layer channel routing algorithms that guarantee successful routing of the channel for n greater than three. The first is linear and optimal given a VHV...HV assignment of layers. The second, using an HVH...VH layer assignment, is quasilinear and performs optimally on examples from the literature. Except in pathological cases, we expect the latter router to perform within one row of optimal. For comparison with published examples we implemented the second router in five and three layers. The five-layer implementation routed all examples optimally while the three-layer implementation routed the examples with the same or fewer rows than the published examples. With its n-layer capability this channel router will allow channel routing to be used when more than three layers are available. This router can also be used to evaluate the utility of additional layers.
103 citations
Patent•
11 Jul 1996TL;DR: In this paper, an electronic messaging system which has multiple sites and in which each site is defined by a unique address space and has connectivity to at least one other site, messages are sent by receiving at a first site message routing information from a second site.
Abstract: In an electronic messaging system which has multiple sites, and in which each site is defined by a unique address space and has connectivity to at least one other site, messages are sent by receiving at a first site message routing information from a second site. The message routing information defines routes from the second site to one or more of the plurality of sites. The received message routing information is assimilated into previously known routing information to generate an updated accumulation of routing information. The updated accumulation of routing information is used to route messages to one or more of the plurality of sites. The updated accumulation of routing information may be replicated to still other sites in the messaging system, which in turn assimilate the information into their respective collections of known routing information. This process of receiving, assimilating and replicating may be repeated until each of the sites has substantially the same updated accumulation of routing information.
103 citations