Link-state routing protocol

Link-state routing protocol - Factbites
Where results make sense
About us | Why use us? | Reviews | PR | Contact us

Topic: Link-state routing protocol

Note: these results are not from the primary (high quality) database.

In the News (Mon 16 Nov 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Link-state routing protocol - Wikipedia, the free encyclopedia
		A Link-state routing protocol is one of the two main classes of routing protocols used in packet-switched networks for computer communications.
		Link-state routing was invented in 1978 by John McQuillan, then at Bolt, Beranek and Newman, as a mechanism that would calculate routes more quickly when network conditions changed, and thus lead to more stable routing.
		To create the routing table, it is only necessary to walk the tree, remembering the identity of the node at the head of each branch, and filling in the routing table entry for each node one comes across with that identity.
	en.wikipedia.org /wiki/Link-state_routing_protocol (1526 words)

	Optimized link state routing protocol - Wikipedia, the free encyclopedia
		Another is Hazy Sighted Link State Routing Protocol, a careful mathematical optimization of proactive link-state features and reactive features.
		Another is AODV, a distance vector routing protocol solving the same problem.
		Distance vector routing is simpler, requires less memory and calculation, but requires more delay, and when a route is needed, communication is much heavier.
	en.wikipedia.org /wiki/Optimized_link_state_routing_protocol (249 words)

	RFC 3626 - Optimized Link State Routing Protocol (OLSR). T. Clausen, Ed., P. Jacquet, Ed..
		RFC 3626 Optimized Link State Routing October 2003 heard (i.e., communication from the neighbor node is possible), however it is not confirmed that this node is also able to receive messages (i.e., communication to the neighbor node is not confirmed).
		RFC 3626 Optimized Link State Routing October 2003 where a is the integer represented by the four highest bits of Htime field and b the integer represented by the four lowest bits of Htime field.
		RFC 3626 Optimized Link State Routing October 2003 affects the overhead through affecting the amount of links being advertised, the amount of nodes advertising links and the efficiency of the MPR flooding mechanism.
	rfc.sunsite.dk /rfc/rfc3626.html (15203 words)

	Link State Routing Basics
		Routers that use a link state routing protocol maintain a database of their individual autonomous system (AS)topology.
		Routers distribute their local state by flooding the autonomous system with link state advertisements (sometimes referred to as link state packets).
		Link state advertisements (LSAs) are special packets which contain information about neighbors and route cost.
	support.microsoft.com /default.aspx?scid=kb;en-us;168036 (258 words)

	NetWare Link-Services Protocol (NLSP)
		The NetWare Link-Services Protocol (NLSP) is a link-state routing protocol from Novell designed to overcome some of the limitations associated with the IPX Routing Information Protocol (RIP) and its companion protocol, the Service Advertisement Protocol (SAP).
		To maintain a WAN link, the router maintains a state variable indicating whether the link is up, down, or initializing for each adjacency.
		Routing information is transmitted only when the topology has changed, not every 60 seconds as RIP-based routers do, regardless of whether the topology has changed.
	www.cisco.com /univercd/cc/td/doc/cisintwk/ito_doc/nlsp.htm (2249 words)

	Link-state routing protocol - Wikipedia, the free encyclopedia
		A Link-state routing protocol is one of the two main classes of routing protocols used in packet-switched networks for computer communications.
		Link-state routing was invented in 1978 by John McQuillan, then at Bolt, Beranek and Newman, as a mechanism that would calculate routes more quickly when network conditions changed, and thus lead to more stable routing.
		To create the routing table, it is only necessary to walk the tree, remembering the identity of the node at the head of each branch, and filling in the routing table entry for each node one comes across with that identity.
	en.wikipedia.org /wiki/Link-state_routing_protocol (1508 words)

	Connected: An Internet Encyclopedia - Link State Routing Protocols
		OSPF and OSI's IS-IS are link state routing protocols.
		This type of routing protocol requires each router to maintain at least a partial map of the network.
		When a network link changes state (up to down, or vice versa), a notification, called a link state advertisement (LSA) is flooded throughout the network.
	ie.activedomain.org /118.htm (133 words)

	An Extended Fault-Tolerant Link-State Routing Protocol in the Internet (ResearchIndex)
		In link-state routing protocols, global network topology is first collected at each node.
		Abstract: Link-state routing protocols, such as OSPF and IS-IS, are widely used in the Internet nowadays.
		Link-state protocols normally require the flooding of new information to the entire (sub)network after changes in any link state (including link faults).
	citeseer.ist.psu.edu /477011.html (357 words)

	Open Shortest Path First (OSPF)
		OSPF is a link-state routing protocol that calls for the sending of link-state advertisements (LSAs) to all other routers within the same hierarchical area.
		Intra-area routing occurs when the source and destination are in the same area; interarea routing occurs when they are in different areas.
		Area partitioning creates two different types of OSPF routing, depending on whether the source and the destination are in the same or different areas.
	www.cisco.com /univercd/cc/td/doc/cisintwk/ito_doc/ospf.htm (1590 words)

	RFC 3626 (rfc3626) - Optimized Link State Routing Protocol (OLSR)
		The protocol is an optimization of the classical link state algorithm tailored to the requirements of a mobile wireless LAN.
		Route Calculation Given the link state information acquired through periodic message exchange, as well as the interface configuration of the nodes, the routing table for each node can be computed.
		This is considered as a neighbor loss if the link described by the expired tuple was the last link with a neighbor node (on the contrary, a link with an interface may break while a link with another interface of the neighbor node remains without being observed as a neighborhood change).
	www.faqs.org /rfcs/rfc3626.html (15581 words)

	Optimized link state routing protocol - Wikipedia, the free encyclopedia
		The Optimized Link State Routing Protocol (OLSR) is a protocol to connect mobile ad-hoc networks, also sometimes called wireless mesh networks.
		Another is Hazy Sighted Link State Routing Protocol, a careful mathematical optimization of proactive link-state features and reactive features.
		Another is AODV, a distance vector routing protocol solving the same problem.
	en.wikipedia.org /wiki/OLSR (231 words)

	[ O L S R . O R G ]
		The olsr.org OLSR daemon is an implementation of the Optimized Link State Routing protocol.
		OLSR is a routing protocol for mobile ad-hoc networks.
		The solution is based upon Ciscos own proprietary routing technology Adaptive Wireless Path Protocol.
	www.olsr.org (349 words)

	The page cannot be found
		If you reached this page by clicking a link, contact the Web site administrator to alert them that the link is incorrectly formatted.
		Click the Back button to try another link.
		Make sure that the Web site address displayed in the address bar of your browser is spelled and formatted correctly.
	www.absoluteastronomy.com /encyclopedia/l/li/link-state_routing_protoc... (121 words)

	Optimized Link State Routing Protocol for Ad Hoc Networks - Jacquet, Muhlethaler, Clausen, Laouiti, Qayyum, Viennot (ResearchIndex)
		Jacquet, P. Muhlethaler, T. Clausen, A. Laouiti, A. Qayyum, and L. Viennot, "Optimized link state routing protocol for ad hoc networks," Proceedings of the 5th IEEE Multi Topic Conference (INMIC 2001.
		OLSR is an optimization over a pure link state protocol as it compacts the size of information sent in the messages, and furthermore, reduces the number of retransmissions to...
		The protocol is based on the link state algorithm and it is proactive (or table-driven) in nature.
	citeseer.ist.psu.edu /618305.html (522 words)

	Project-Team - Hipercom
		We have developped OLSR, an optimized link state routing protocol which is based on MPR flooding.
		The routing protocol is the key component of any mobile ad hoc network, this is the minimum requisite in order to enable communication within the network.
		Another contribution of the project lies in the development of source code of the OLSR routing protocol.
	www.inria.fr /rapportsactivite/RA2003/hipercom2003/module15.html (292 words)

	olsr.htm
		OLSR is link state algorithm adapted to the requirements of a wireless LAN.
		Heard link signifies that this node is hearing from the relevant neighbor but its not confirmed that this neighbor is also hearing from the node.
		Routing table is evaluated based on the information in the neighbor table and topology table.
	www.stanford.edu /~jatinder/academic/EE359/report/olsr.htm (1312 words)

	Linux: UniK OLSR daemon - Optimized Link State Routing protocol for MANETs (0.3.6)
		The UniK olsrd is an implementation of the Optimized Link State Routing protocol for mobile ad-hoc networks (MANETs).
		UniK OLSR daemon - Optimized Link State Routing protocol for MANETs (0.3.6)
		Linux: UniK OLSR daemon - Optimized Link State Routing protocol for MANETs (0.3.6)
	www.linuxforum.com /article/413.php?close_left=true (103 words)

	Home page of Thomas Heide Clausen
		Specifically, we investigate security properties of the Optimized Link-State Routing Protocol - one example of a proactive routing protocol for MANETs.
		In this paper, we examine security issues related to proactive routing protocols for MANETs.
		While we use OLSR as an example protocol for our studies, we argue that the presented techniques apply equally to any proactive routing protocol for MANETs
	voop.free.fr /Publications/2003/medhoc03.shtml (164 words)

	Impementing and extending the Optimized Link State Routing Protocol
		Impementing and extending the Optimized Link State Routing Protocol
	www.olsr.org /docs/report_html (26 words)

	lectures.html
		Zone Routing Protocol (ZRP): M. Pearlman and Z.J. Haas, Determining the Optimal Configuration for the Zone Routing Protocol, IEEE JSAC, August 1999.
		Asis Nasipuri, Shengchun Ye, and Robert E. Hiromoto, A MAC Protocol for Mobile Ad Hoc Networks Using Directional Antennas, Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC 2000), Chicago, September 2000.
		Dynamic Source Routing (DSR): D.B. Johnson and D.A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks, In Mobile Computing, edited by T. Imielinski and H. Korth, Chapter 5, pages 153-181, Kluwer Academic Publishers, 1996.
	www.cis.udel.edu /~cshen/861/lectures.html (594 words)

	Linux: UniK OLSR daemon - Optimized Link State Routing protocol for MANETs (0.3.7)
		The UniK olsrd is an implementation of the Optimized Link State Routing protocol for mobile ad-hoc networks (MANETs).
		UniK OLSR daemon - Optimized Link State Routing protocol for MANETs (0.3.7)
		Linux: UniK OLSR daemon - Optimized Link State Routing protocol for MANETs (0.3.7)
	www.linuxforum.com /article/634.php?close_left=true (103 words)

	Reseau Citoyen: NoDeepLink
		Deep links to the editorial functionnalities are not allowed on this site.
		Veuillez utilisez les liens fournis sur les pages pour cela.
	reseaucitoyen.be /index.php?edit=OLSR (48 words)

	[ O L S R . O R G ]
		The olsr.org OLSR daemon is an implementation of the Optimized Link State Routing protocol.
		OLSR is a routing protocol for mobile ad-hoc networks.
		A plugin that implements a tiny HTTP server serving a dynamic page( example) displaying information of the current state of the running olsrd process is now available.
	www.olsr.org (48 words)

	1.3. Brief history of link-state routing technology
		These modifications dealt with increasing the fault tolerance of the routing protocol through, among other things, adding a checksum to the link state advertisements (thereby detecting database corruption).
		The first link-state routing protocol was developed for use in the ARPANET packet switching network.
		This was accomplished by introducing mechanisms which enabled the interval between link state advertisement originations to be increased by an order of magnitude.
	www.freesoft.org /CIE/RFC/1583/4.htm (48 words)

	NetWare Link-Services Protocol (NLSP)
		The NetWare Link-Services Protocol (NLSP) is a link-state routing protocol from Novell designed to overcome some of the limitations associated with the IPX Routing Information Protocol (RIP) and its companion protocol, the Service Advertisement Protocol (SAP).
		To maintain a WAN link, the router maintains a state variable indicating whether the link is up, down, or initializing for each adjacency.
		Finally, Router A changes its state for the link to up.
	www.cisco.com /univercd/cc/td/doc/cisintwk/ito_doc/nlsp.htm (2249 words)

	CS765 - Mobile Ad-Hoc Networks Analysis of the Zone Routing Protocol
		The Interzone Routing Protocol and the Bordercast Resolution Protocol are presented in Sections 3.2 and 3.3.
		This protocol is responsible for determining the routes to the peripheral nodes and is commonly a pro-active protocol.
		The Bordercast Resolution Protocol, or BRP, is used in the ZRP to direct the route requests initiated by the global reactive IERP to the peripheral nodes, thus removing redundant queries and maximizing efficiency.
	www.netmeister.org /misc/zrp/zrp.html (2249 words)

	draft-ietf-manet-fsr-02.txt
		It periodically broadcasts the Link State update of a destination to its neighbors with a frequency that depends on the hop distance to that destination Gerla, Hong and Pei [Page 1] INTERNET-DRAFT Fisheye State Routing Protocol December 17, 2001 (i.e., the "scope" relative to that destination).
		As the protocol uses link state algorithm, so the routing is loop-free in a stable state.
		Link state packets are generated and flooded into the network periodically or whenever a node detects a topology change.
	www.geocities.com /ray_gng/draft-ietf-manet-fsr-02.txt (2249 words)

	ipedia.com: Enhanced Interior Gateway Routing Protocol Article
		EIGRP works like a link state and distance vector routing protocol to optimize the use...
		EIGRP works like a link state and distance vector routing protocol to optimize the use of bandwidth and processing power on the local router.
		Enhanced Interior Gateway Routing Protocol (EIGRP) is a Cisco proprietary routing protocol based on their original IGRP.
	www.ipedia.com /enhanced_interior_gateway_routing_protocol.html (240 words)

	(WO 01/58237) SCALABLE UNIDIRECTIONAL ROUTING WITH ZONE ROUTING PROTOCOL EXTENSIONS FOR MOBILE AD-HOC NETWORKS
		The invention is configured to provide a robust scalable framework for routing data in wireless ad-hoc networks when unidirectional links (210) are present.
		When the reverse path from a destination node (the tail) of a unidirectional link (210) to the originating node (the head) of the link is beyond a designated length, the invention is configured to revert to an on-demand search mechanism.
		The on-demand search mechanism recursively attempts to build a path to the destination (206) by recognizing nodes that have a route to the destination.
	www.wipo.int /ipdl/IPDL-CIMAGES/view/pct/getbykey5?KEY=01/58237.010816 (240 words)

Try your search on: Qwika (all wikis)

Topic: Link-state routing protocol

Ads by Google

Related Topics

In the News (Mon 16 Nov 09)