shortest path routing A form of ROUTING which attempts to send PACKETS of data over a network in such a way that the path taken from the sending computer to the recipient computer is minimized. The path can be measured in either physical distance or in the number of HOPS. This form of routing uses a NON-ADAPTIVE ROUTING ALGORITHM.
Refrence:http://www.encyclopedia.com/doc/1O12-shortestpathrouting.html
skip to main |
skip to sidebar
Posts
Custom Search
Counter
Flag counter
Blog Archive
-
▼
2009
(36)
-
▼
September
(28)
- What is shortest path routing
- Open Shortest Path First
- Neighbor relationships
- Area types
- Proprietary extensions
- Path preference
- Traffic engineering
- OSPF router types
- Designated router
- Distance-Vector Routing Protocols
- Distance-vector routing protocol
- Method of Distance-vector routing protocol
- Limitations in Distance-vector routing protocol
- Partial solutions of Distance-vector routing protocol
- On-demand routing protocols
- Routing protocols for mobile ad-hoc networks
- Mobile ad hoc network
- Types of MANET
- Practical use
- Wireless Sensor Network Videos
- What is Wireless ad hoc network?
- Application of Wireless ad hoc network
- Wireless Ad Hoc Sensor Networks
- Sensor node
- Wireless local loop
- Wireless sensor network
- Applications of wireless technology
- Wireless communication
-
▼
September
(28)
Followers
Back on top ^
created by Nuvio | Webdesign
Wireless Network © 2008 Ken ahlin | Converted to XML Blogger Template by ThemeLib