scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: This paper addresses an important combination of three-dimensional loading and vehicle routing, known as the Three-Dimensional Loading Capacitated Vehicle Routing Problem, by means of an Ant Colony Optimization algorithm that makes use of fast packing heuristics for the loading.

169 citations

Proceedings ArticleDOI
01 May 2003
TL;DR: A load-balanced adaptive routing algorithm for torus networks, GOAL - Globally Oblivious Adaptive Locally - that provides high throughput on adversarial traffic patterns, matching or exceeding fully randomized routing and exceeding the worst-case performance of Chaos, RLB, and minimal routing by more than 40%.
Abstract: We introduce a load-balanced adaptive routing algorithm for torus networks, GOAL - Globally Oblivious Adaptive Locally - that provides high throughput on adversarial traffic patterns, matching or exceeding fully randomized routing and exceeding the worst-case performance of Chaos [2], RLB [14], and minimal routing [8] by more than 40%. GOAL also preserves locality to provide up to 4.6× the throughput of fully randomized routing [19] on local traffic. GOAL achieves global load balance by randomly choosing the direction to route in each dimension. Local load balance is then achieved by routing in the selected directions adaptively. We compare the throughput, latency, stability and hot-spot performance of GOAL to six previously published routing algorithms on six specific traffic patterns and 1,000 randomly generated permutations.

169 citations

Proceedings ArticleDOI
30 Aug 2010
TL;DR: The model of energy-aware routing in data center network is established, and a heuristic algorithm is designed to achieve the idea, which shows that energy- aware routing can effectively save power consumed by network devices.
Abstract: The goal of data center network is to interconnect the massive number of data center servers, and provide efficient and fault-tolerant routing service to upper-layer applications. To overcome the problem of tree architecture in current practice, many new network architectures are proposed, represented by Fat-Tree, BCube, and etc. A consistent theme in these new architectures is that a large number of network devices are used to achieve 1:1 oversubscription ratio. However, at most time, data center traffic is far below the peak value. The idle network devices will waste significant amount of energy, which is now a headache for many data center owners.In this paper, we discuss how to save energy consumption in high-density data center networks in a routing perspective. We call this kind of routing energy-aware routing. The key idea is to use as few network devices to provide the routing service as possible, with no/little sacrifice on the network performance. Meanwhile, the idle network devices can be shutdown or put into sleep mode for energy saving. We establish the model of energy-aware routing in data center network, and design a heuristic algorithm to achieve the idea. Our simulation in typical data center networks shows that energy-aware routing can effectively save power consumed by network devices.

168 citations

Patent
25 Nov 2008
TL;DR: In this paper, the authors present a routing management system for VoIP calls in a Voice over Internet Protocol (VoIP) system, which includes a routing manager which maintains a list of local routes, establishes and manages connections to the routing server, exports routes to the Routing Server, imports disseminated routes from the routing Server, caches those routes for future use, finds all matching routes for a particular number dialed by the user and prioritizes those routes based on timing, access and ordering information.
Abstract: A method, system, and computer program product for routing network traffic (calls in a Voice over Internet Protocol (VoIP)), which expands the capabilities of existing systems by providing faster and more efficient direction of network traffic, is disclosed. A routing management system includes a routing manager which maintains a list of local routes, establishes and manages connections to the routing server(s), exports routes to the routing server(s), imports disseminated routes from the routing server(s), obtains static global and dynamic routes from the routing server(s), caches those routes for future use, finds all matching routes for a particular number dialed by the user, and prioritizing those routes based on timing, access and ordering information. An additional embodiment contains at least one routing server which provides look-up services for gateway server(s), allows export of local routes from gateway server(s), and distributes translation data; and at least one gateway server which handles calls received on either the Internet protocol (IP) or traditional telephony networks. The gateway server bridges calls between the different kinds of networks, interacts with users, interfaces with the routing system.

168 citations

Journal ArticleDOI
TL;DR: This paper presents rapid, an intentional DTN routing protocol that can optimize a specific routing metric such as the worst-case delivery delay or the fraction of packets that are delivered within a deadline, and significantly outperforms existing routing protocols for several metrics.
Abstract: Routing protocols for disruption-tolerant networks (DTNs) use a variety of mechanisms, including discovering the meeting probabilities among nodes, packet replication, and network coding. The primary focus of these mechanisms is to increase the likelihood of finding a path with limited information, and so these approaches have only an incidental effect on such routing metrics as maximum or average delivery delay. In this paper, we present rapid, an intentional DTN routing protocol that can optimize a specific routing metric such as the worst-case delivery delay or the fraction of packets that are delivered within a deadline. The key insight is to treat DTN routing as a resource allocation problem that translates the routing metric into per-packet utilities that determine how packets should be replicated in the system. We evaluate rapid rigorously through a prototype deployed over a vehicular DTN testbed of 40 buses and simulations based on real traces. To our knowledge, this is the first paper to report on a routing protocol deployed on a real outdoor DTN. Our results suggest that rapid significantly outperforms existing routing protocols for several metrics. We also show empirically that for small loads, RAPID is within 10% of the optimal performance.

168 citations


Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
95% related
Wireless network
122.5K papers, 2.1M citations
93% related
Wireless ad hoc network
49K papers, 1.1M citations
93% related
Wireless sensor network
142K papers, 2.4M citations
93% related
Server
79.5K papers, 1.4M citations
92% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202391
2022209
202130
202035
201962
2018132