1999•IEEE Internet ComputingRequires access

At the core of IP networks: link-state routing protocols

Chris Metz

Open publisher page 4 citations

Abstract

As end users and managers of both corporate and Internet service provider (ISP) IP networks, we ask a lot of those devices called routers. They must be reliable and easy to manage, while supporting a variety of LAN and WAN interfaces at a reasonable price. They must forward hundreds of thousands or even millions of packets per second. For each packet, this means the router receives it, extracts the destination address contained in the header, performs a lookup in a local routing table, finds the best match, and then transmits the packet to the next-hop router. The router may even be configured to examine additional fields in the packet and, based on this analysis, decide whether to place the packet in a high-priority transmission queue for expedited service. The author discusses link-state routing protocols.

About this research paper

What this paper is about

As end users and managers of both corporate and Internet service provider (ISP) IP networks, we ask a lot of those devices called routers. They must be reliable and easy to manage, while supporting a variety of LAN and WAN interfaces at a reasonable price. They must forward hundreds of thousands or even millions of packets per second. For each packet, this means the router receives it, extracts the destination address contained in the header, performs a lookup in a local routing table, finds the best match, and then transmits the packet to the next-hop router. The router may even be configured to examine additional fields in the packet and, based on this analysis, decide whether to place the packet in a high-priority transmission queue for expedited service. The author discusses link-state routing protocols.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

As end users and managers of both corporate and Internet service provider (ISP) IP networks, we ask a lot of those devices called routers. They must be reliable and easy to manage, while supporting a variety of LAN and WAN interfaces at a reasonable price. They must forward hundreds of thousands or even millions of packets per second. For each packet, this means the router receives it, extracts the destination address contained in the header, performs a lookup in a local routing table, finds the best match, and then transmits the packet to the next-hop router. The router may even be configured to examine additional fields in the packet and, based on this analysis, decide whether to place the packet in a high-priority transmission queue for expedited service. The author discusses link-state routing protocols.

Key concepts: Computer network, Computer science, Source routing, Link state packet, Loose Source Routing, Core router, IP forwarding, Virtual routing and forwarding

Related papers

Back to paper searchBrowse research topicsOriginal source
At the core of IP networks: link-state routing protocols — Research Paper | ScholarLens