scispace - formally typeset
Search or ask a question
Topic

Routing table

About: Routing table is a research topic. Over the lifetime, 16589 publications have been published within this topic receiving 336842 citations. The topic is also known as: routing information base & RIB.


Papers
More filters
Proceedings ArticleDOI
15 Sep 2003
TL;DR: A novel randomized network coding approach for robust, distributed transmission and compression of information in networks is presented, and its advantages over routing-based approaches are demonstrated.
Abstract: A novel randomized network coding approach for robust, distributed transmission and compression of information in networks is presented, and its advantages over routing-based approaches is demonstrated.

1,171 citations

Proceedings ArticleDOI
01 Dec 2012
TL;DR: A survey of state-of-the-art routing techniques in Wireless Sensor Networks (WSNs) and compares the routing protocols against parameters such as power consumption, scalability, mobility, optimal routing and data aggregation.
Abstract: This paper presents a survey of state-of-the-art routing techniques in Wireless Sensor Networks (WSNs). Compared with traditional wireless networks, WSNs are characterized with denser levels of node deployment, higher unreliability of sensor nodes and severe power, computation and memory constraints. Various design challenges such as energy efficiency, data delivery models, quality of service, overheads etc., for routing protocols in WSNs are highlighted. We addressed most of the proposed routing methods along with scheme designs, benefits and result analysis wherever possible. The routing protocols discussed are classified into seven categories such as Data centric routing, Hierarchical routing, Location based routing, Negotiation based routing, Multipath based routing, Quality of Service (QoS) routing and Mobility based routing. This paper also compares the routing protocols against parameters such as power consumption, scalability, mobility, optimal routing and data aggregation. The paper concludes with possible open research issues in WSNs.

1,168 citations

Proceedings ArticleDOI
27 Aug 2013
TL;DR: A novel technique is developed that leverages a small amount of scratch capacity on links to apply updates in a provably congestion-free manner, without making any assumptions about the order and timing of updates at individual switches.
Abstract: We present SWAN, a system that boosts the utilization of inter-datacenter networks by centrally controlling when and how much traffic each service sends and frequently re-configuring the network's data plane to match current traffic demand. But done simplistically, these re-configurations can also cause severe, transient congestion because different switches may apply updates at different times. We develop a novel technique that leverages a small amount of scratch capacity on links to apply updates in a provably congestion-free manner, without making any assumptions about the order and timing of updates at individual switches. Further, to scale to large networks in the face of limited forwarding table capacity, SWAN greedily selects a small set of entries that can best satisfy current demand. It updates this set without disrupting traffic by leveraging a small amount of scratch capacity in forwarding tables. Experiments using a testbed prototype and data-driven simulations of two production networks show that SWAN carries 60% more traffic than the current practice.

1,096 citations

Proceedings ArticleDOI
27 Aug 2007
TL;DR: RAPID is presented, an intentional DTN routing protocol that can optimize a specific routing metric such as worst-case delivery latency or the fraction of packets that are delivered within a deadline and significantly outperforms existing routing protocols for several metrics.
Abstract: Many DTN routing protocols 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, so these approaches have only an incidental effect on such routing metrics as maximum or average delivery latency. In this paper, we present RAPID, an intentional DTN routing protocol that can optimize a specific routing metric such as worst-case delivery latency 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 which determine how packets should be replicated in the system.We evaluate RAPID rigorously through a prototype of RAPID 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 DTN at this scale. 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.

1,078 citations

Journal ArticleDOI
TL;DR: An augmented AS graph representation is proposed that classifies AS relationships into customer-provider, peering, and sibling relationships, and presents heuristic algorithms that infer AS relationships from BGP routing tables.
Abstract: The Internet consists of rapidly increasing number of hosts interconnected by constantly evolving networks of links and routers. Interdomain routing in the Internet is coordinated by the Border Gateway Protocol (BGP). The BGP allows each autonomous system (AS) to choose its own administrative policy in selecting routes and propagating reachability information to others. These routing policies are constrained by the contractual commercial agreements between administrative domains. For example, an AS sets its policy so that it does not provide transit services between its providers. Such policies imply that AS relationships are an important aspect of the Internet structure. We propose an augmented AS graph representation that classifies AS relationships into customer-provider, peering, and sibling relationships. We classify the types of routes that can appear in BGP routing tables based on the relationships between the ASs in the path and present heuristic algorithms that infer AS relationships from BGP routing tables. The algorithms are tested on publicly available BGP routing tables. We verify our inference results with AT&T internal information on its relationship with neighboring ASs. As much as 99.1% of our inference results are confirmed by the AT&T internal information. We also verify our inferred sibling relationships with the information acquired from the WHOIS lookup service. More than half of our inferred sibling-to-sibling relationships are confirmed by the WHOIS lookup service. To the best of our knowledge, there has been no publicly available information about AS relationships and this is the first attempt in understanding and inferring AS relationships in the Internet. We show evidence that some routing table entries stem from router misconfigurations.

1,073 citations


Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
92% related
Server
79.5K papers, 1.4M citations
91% related
Wireless ad hoc network
49K papers, 1.1M citations
91% related
Wireless network
122.5K papers, 2.1M citations
90% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
89% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202331
202294
2021119
2020293
2019411
2018493