|
| |
| | Routing - Wikipedia, the free encyclopedia |
 | | Routing is a means of selecting paths in a computer network along which information should be sent. | | | This is usually accomplished through the use of a routing protocol using one of two broad classes of routing algorithms; distance vector algorithms and link state algorithms, which together account for nearly every routing algorithm in use on the Internet. | | | Routing directs forwarding, the passing of logically addressed packets from their source toward their ultimate destination through intermediary nodes, called routers. |
|
http://en.wikipedia.org/wiki/Routing
(1271 words)
|
|
| |
| | Onion Routing - Wikipedia, the free encyclopedia |
| | Onion Routing is a technique for pseudonymous (or anonymous) communication over a computer network, developed by David Goldschlag, Michael Reed, and Paul Syverson. | | | Even within these confines, Onion Routing does not provide any absolute guarantee of privacy; rather, it provides a continuum in which the degree of privacy is generally a function of the number of participating Routers vs. the number of compromised or malicious Routers. | | | To create an Onion, the Router at the head of a transmission selects a number of Onion Routers at random and generates a message for each one, providing it with symmetric keys for decrypting messages, and instructing it which Router will be next in the path. |
|
http://en.wikipedia.org/wiki/Onion_Routing
(1101 words)
|
|
| |
| | Routing Basics |
| | Routing algorithms also are designed to be as simple as possible. | | | A metric is a standard of measurement, such as path bandwidth, that is used by routing algorithms to determine the optimal path to a destination. | | | Routing algorithms should also be flexible, which means that they should quickly and accurately adapt to a variety of network circumstances. |
|
http://www.cisco.com/univercd/cc/td/doc/cisintwk/ito_doc/routing.htm
(2969 words)
|
|
| |
| | What is routing? - A Word Definition From the Webopedia Computer Dictionary |
| | Routing is a key feature of the Internet because it enables messages to pass from one computer to another and eventually reach the target machine. | | | Routing is usually performed by a dedicated device called a router. | | | The principal difference between the two is that bridging occurs at a lower level and is therefore more of a hardware function whereas routing occurs at a higher level where the software component is more important. |
|
http://www.webopedia.com/TERM/r/routing.html
(399 words)
|
|
| |
| | Routing in the Internet |
| | Routing is the technique by which data finds its way from one host computer to another. | | | The other is that the datagram is addressed to some other computer in which case the computer will attempt to re-transmit on one or other of the available interfaces. | | | The commonest interior gateway protocols are the Routing Information Protocol (RIP) defined in RFC 1058 and the more recent Open Shortest Path First (OSPF) protocol defined in RFC 1247. |
|
http://www.scit.wlv.ac.uk/~jphb/comms/iproute.html
(1998 words)
|
|
| |
| | Routing |
| | All computers that are networked have a routing table in one form or another. | | | Please be aware that various versions of Linux have different means of storing and retrieving network and routing information and you must use the tools that come with your system or learn it well enough to determine what files to modify. | | | Changes made with "route" without adding the changes to permanent files will no longer be valid when you reboot the machine. |
|
http://www.comptechdoc.org/os/linux/usersguide/linux_ugrouting.html
(1275 words)
|
|
| |
| | Frequently Asked Questions on Multi-homing and BGP |
| | This router is a route reflector client of "mel-bdr1" and provides a limited view of our routing table (the router doesn't have the CPU power or memory to take a full routing table). | | | You should consult your router vendor as requirements vary depending on a number of factors, such as router memory usage, number of routes accepted or other routing protocols in use on the router. | | | For this reason it is better to ask AAPT to filter the routes that you wish to accept by selecting a suitable announcement rather than requesting all routes and then filtering on your router. |
|
http://info.connect.com.au/docs/routing/general/multi-faq.shtml
(2410 words)
|
|
| |
| | Routing |
| | Internet uses a hop-by-hop routing model, which means that each host or router that handles a packet examines the Destination Address in the IP header, computes the next hop that will bring the packet one step closer to its destination, and delivers the packet to the next hop, where the process is repeated. | | | In both systems, there is a large group of "nodes", the decisions of each being driven by a cost-minimization algorithm. | | | Second, routing protocols determine the contents of these tables. |
|
http://www.freesoft.org/CIE/Topics/87.htm
(229 words)
|
|
| |
| | Onion Routing |
| | The Onion Routing program is made up of projects researching, designing, building, and analyzing anonymous communications systems. | | | In an attempt to maximize coherence between these as well as to follow good mathematical practice, we will consider the initial 1996 design to be generation 0; all design elements after that and before Tor are generation 1; and Tor, at least as conceived roughly 2002--2005, is generation 2. | | | In 1998, there were multiple independently deployed networks of around a dozen nodes each running on multiple platforms (Solaris, HP/UX, Linux, Windows NT, BSD), and embodying most of the "next generation" design, but none was ever publicly accessible. |
|
http://www.onion-router.net
(850 words)
|
|
| |
| | Route Views Project Page |
| | The Route Views project is funded by the University of Oregon's Advanced Network Technology Center, and by grants from Cisco Systems, the Defense Advanced Research Projects Agency, Juniper Networks. | | | The University's Route Views project was originally conceived as a tool for Internet operators to obtain real-time information about the global routing system from the perspectives of several different backbones and locations around the Internet. | | | BGP::Inspect An indexed subset (5 peers) of routeviews data with a simple query interface. |
|
http://www.routeviews.org
(621 words)
|
|
| |
| | Using the Border Gateway Protocol for Interdomain Routing |
| | In, Routers A and B are BGP peers, as are Routers B and C, and Routers C and D. The routing information consists of a series of AS numbers that describe the full path to the destination network. | | | In, Router B in AS 200 is originating network 160.11.0.0 and advertising it to Router C in AS 300. | | | In, Routers A and B learn about network 175.10.0.0 from AS 400, and each propagates the update to Router C. Router C has two routes for reaching 175.10.0.0 and has to decide which route to use. |
|
http://www.cisco.com/univercd/cc/td/doc/cisintwk/ics/icsbgp4.htm
(8174 words)
|
|
| |
| | Routing Reviews |
| | The advantages and disadvantages of routing versus layer 3 switching, and the question of when to use a router and when to use a switch are detailed here. | | | Routing TCP/IP Volume 1 by Jeff Doyle (ISBN 1578700418) is an advanced level book on the theory and practice of routing and its implementation in Cisco routers. | | | For example, to illustrate various aspects of EIGRP routing and load balancing, a 5-router mesh architecture is presented followed by a detailed discussion of concepts such as succession, load sharing, route transitions and updates, etc. This approach really helps in understanding all aspects of a particular topic with concrete examples to relate to. |
|
http://www.booksunderreview.com/Computers/Software/Networking/Routing
(8970 words)
|
|
| |
| | RADB/Merit IRRd software |
| | IRRd software is used to run Merit's RADB routing registry which can be queried at whois.radb.net. | | | The IRRToolSet will likely be of interest to those who wish to use a route registry for the generation of router configurations. | | | A new command, '!o', has been implemented for performing inverse queries on the 'mnt-by' attribute to get a real time list of all objects which reference a given maintainer. |
|
http://www.irrd.net
(427 words)
|
|
| |
| | Cisco - OSPF Design Guide |
| | The router uses the Dijkstra algorithm to calculate the shortest path tree. | | | The total memory used by OSPF is the sum of the memory used in the routing table (show ip route summary) and the memory used in the link-state database. | | | With the introduction of classless routing and the intelligent use of aggregation and summarization, RIP networks seem to have fallen behind. |
|
http://www.cisco.com/warp/public/104/1.html
(11789 words)
|
|
| |
| | Dictionary and Encyclopedia - "W" Listings |
| | This type of WDS PTMP network is much more simplistic than mesh routing, where intelligent edge devices auto-discover each other and set up forwarding paths via the shortest route. | | | When you've got a campus environment, with multiple buildings requiring interconnections, you have to weigh the capabilities of WDS versus a wireless mesh routing impelementation. | | | We could say, "You get what you pay for" but we would have to temper that with "Don't pay for something you don't need!" Sometimes WDS provides the most cost-effective solution to an interconnection problem. |
|
http://www.connect802.com/encyclopedia/enc-w.htm
(1666 words)
|
|
| |
| | [No title] |
| | The routes that match one of these filters and are learned from the corresponding protocol are used to form the aggregate. | | | OR Given two policy filters x and y, x OR y matches the union of the routes that are matched by x and that are matched by y. | | | AND Given two policy filters x and y, x AND y matches the intersection of the routes that are matched by x and that are matched by y. |
|
http://www.ietf.org/rfc/rfc2622.txt
(13221 words)
|
|
| |
| | Vehicle Routing Problem |
| | The VRP is a Nonlinear Programming (NP) problem. | | | The Very Offline k-Vehicle Routing Problem in Tress (PS Approximation algorithms for time-dependent orienteering (PS An Improved Approximation Ration for the Minimum Latency Problem (PS Faster Approximation Algorithms for the Minimum Latency Problem (PS VRP with Time Windows | | | Genetic Algorithms for the Vehicle Routing Problem with Time Windows (PDF) |
|
http://osiris.tuwien.ac.at/~wgarn/VehicleRouting/vehicle_routing.html
(578 words)
|
|
| |
| | NextHop :: Welcome to NextHop |
| | NextHop Technologies has acquired all the rights to GateD from Merit and the University of Michigan. | | | The NextHop Dynamic Network Architecture (DNA) provides a framework for integrating NextHop’s products and software components from NextHop’s partners to provide complete software solutions. | | | Thank you for your interest in the GateD routing software and the industry consortium that pioneered the de facto standard for network routing. |
|
http://www.gated.org
(392 words)
|
|
| |
| | Merit IRR Services |
| | We're also the developers of IRRd, a widely used database server using the RPSL specification. | | | We hope that other members of the IRR community will contribute ideas, information, and news to this new site. | | | This site is designed to promote coordination of the Internet Routing Registry (IRR), the union of a growing number of world-wide routing policy databases that use the |
|
http://www.irr.net
(200 words)
|
|
| |
| | Undernet Routing Committee |
| | A full description of the functions and procedures of the Routing Committees can be found in our Documents section. | | | For information on current or previous server applications, please refer to the Routing Committee Database. | | | The Undernet Routing Committee is responsible for the review, selection, and maintenance of server links to the Undernet IRC Network. |
|
http://routing-com.undernet.org
(142 words)
|
|
| |
| | ITPRC - IP Routing |
| | GNU Zebra - Free routing software distributed under the GNU general public license | | | OSI Reference Model - An overview of the components of the seven layer OSI communications model | | | Open Systems Interconnect (OSI) Routing Protocol - Cisco's technology guide for OSI protocols including IS-IS, ES-IS, and IDRP |
|
http://www.itprc.com/routing.htm
(505 words)
|
|
| |
| | GNU Zebra -- routing software |
| | Free routing software distributed under GNU General Public License | | | When write queue becomes empty stop write timer. |
|
http://www.zebra.org
(33 words)
|
|
| |
| | Open Shortest Path First IGP (ospf) Charter |
| | Develop multiple implementations, and test against each other. | | | Design the routing protocol, and write its specification. | | | Make changes to the specification (if necessary) and publish the protocol as a Draft Standard RFC. |
|
http://www.ietf.org/html.charters/ospf-charter.html
(559 words)
|
|
| |
| | Merit Network Routing Assets Database |
| | The Reports Section has been expanded to include analysis of mirrored registries. | | | We are now mirroring the MTO routing registry. | | | We are now mirroring the ROGERS routing registry. |
|
http://www.radb.net
(36 words)
|
|
| |
| | :: Reference :: Maps :: Trip Routing |
| | Subway Navigator - Maps and stations of subways and other heavy rail transit systems throughout the world, and a route finder detailing the path between any two stations. | | | Web Search for Reference Maps Trip Routing - News search for Reference Maps Trip Routing - encyclopedia entries for Reference Maps Trip Routing - |
|
http://www.localadsearch.com/Reference/Maps/Trip_Routing
(134 words)
|
|
| |
| | traceroute.org |
| | Hermes: A tool for visualizing the Internet Topology | | | BGP - Border Gateway Protocol (Advanced Internet Routing Resources) | | | Rio Grande do Sul Internet Exchange (RSiX) Route Server |
|
http://www.traceroute.org
(134 words)
|
|
|
