Home About us Products Services Contact us Bookmark
:: wikimiki.org ::
Path Vector

Path vector

Path Vector Protocol is a computer network routing protocol, sometimes known as a policy routing protocol, that is used to span different autonomous systems. Exterior Gateway Protocol (EGP) and Border Gateway Protocol (BGP) are examples. The routing table maintains the autonomous systems that are traversed in order to reach the destination system. Contrast with distance vector protocol and link state protocol.



Policy based routing

Policy-based routing (PBR) is a term used in computer networking. It refers to a technique used to make routing decisions based on policies set by the network administrator. When a router receives a packet, it normally decides where to forward this packet to based on the destination address in the packet, which is then used to look up an entry in a routing table. However, in some cases, there may be a need to forward the packet based on other criteria. For example, a network administrator might want to forward a packet based on the source address, not the destination address. This is also called source routing. Policy based routing may also be based on the size of the packet, the protocol of the payload, or some other characteristic. It can also be based on a combination of characteristics. (Policy Based) Routing can be based on the source and the destination, i.e. when the packet comes from this source and wants to go to that destination then route to this next hop or onto that specific interface. This allows e.g. to route over different links/towards different networks even while the destination is the same but depending on where the packet is originating from. This can be useful when interconnecting several private networks. If you have the possibility to design an architecture without IP-overlaps, then that is highly recommended over using PBR. On Cisco IOS, PBR is implemented using route maps. Category:Routing Category:Computer networks

Autonomous system (Internet)

In the Internet, an autonomous system (AS) is a collection of IP networks and routers, under the control of one or more entities, that presents a common routing policy to the Internet. See RFC 1930 for additional detail on this updated definition. Originally, the definition required control by a single entity, typically an Internet service provider or a very large organization with independent connections to multiple networks, that adhere to a single and clearly defined routing policy. See RFC 1771, the original definition (now obsolete) of the Border Gateway Protocol. The newer definition of RFC 1930 came into use because multiple organizations can run BGP using private AS numbers to an ISP that connects all those organizations to the Internet. Even though there are multiple autonomous systems supported by the ISP, the Internet only sees the routing policy of the ISP. That ISP must have a public, registered ASN. A unique AS number (or ASN) is allocated to each AS for use in BGP routing. With BGP, AS numbers are important because the ASN uniquely identifies each network on the internet.

Assignment

AS numbers are assigned by the IANA, which also allocate IP addresses, to regional internet registries (RIRs) in blocks. The local RIR then assigns an AS number to an entity from the block assigned by the IANA. Entities wishing to receive an ASN must complete the application process of their local RIR and be approved before being assigned an ASN. Current IANA ASN assignments can be found on their website: [http://www.iana.org/assignments/as-numbers] AS numbers are currently 16-bit integers, which allow for a maximum of 65536 assignments. AS numbers are divided into 2 ranges. The first are public AS numbers, which may be used on the internet and range from 1 to 64511. The second range, from 64512 to 65535, are known as private numbers, and can only be used internally within an organization. While there is no immediate danger of exhausting the 16-bit AS number space, several factors, principally the need of enterprises to run BGP to multihome, is reason for concern that more space will be needed in the moderate term. As of mid-2005, the IETF has several drafts underway that define mechanisms for the use of an upwardly compatible four-octet, or 32-bit, AS number space. This space will not replace the existing 16-bit space.

Types

Autonomous Systems can be grouped into 3 categories, depending on their connections and operation. A multihomed AS is an AS that maintains connections to more than one ISP. This allows the AS to remain connected to the internet in the event of a complete failure of one of their ISPs. In addition, this type of AS would not allow traffic from one ISP to pass through on its way to another ISP. A stub AS refers to an AS that is only connected to a single ISP. This is generally regarded to be a needless use of an AS number, as the network is completely under a single ISP, and thus does not need to be uniquely identified. A transit AS is an AS that provides connections through itself to the networks connected to it. That is, network A can use the transit AS to connect to network B. ISPs are always transit ASs, because it is their business to connect disparate networks in exchange for money. The ISP is considered to be 'selling transit service' to the end network, thus the term transit AS.

Related Topics


- Border Gateway Protocol
- Internet Assigned Numbers Authority
- Regional Internet Registry
- Routing

External links


- [http://www.apnic.net/services/asn_guide.html ASN Resource Guide] Category:Internet architecture

Exterior Gateway Protocol

The Exterior Gateway Protocol (EGP) is a routing protocol for the Internet originally specified in 1982 by Eric C. Rosen of Bolt, Beranek and Newman, and David L. Mills. It was first described in [http://www.faqs.org/rfcs/rfc827.html RFC 827] and formally specified in [http://www.faqs.org/rfcs/rfc904.html RFC 904] (1984). EGP is a type of path vector protocol. During the early days of the Internet, an Exterior Gateway Protocol, EGP version 3, was used to interconnect autonomous systems. EGP3 should not be confused with EGPs in general. Currently, BGP is the accepted standard for Internet routing and has essentially replaced the more limited EGP3. Category:Internet protocols Category:Internet standards Category:Routing protocols

Distance-vector routing protocol

A distance-vector routing protocol is a routing protocol used in routing of packet-switched networks in computer communications, as in for example the Routing Information Protocol for Internet traffic. They use the Bellman-Ford algorithm to calculate paths. Examples of distance-vector routing protocols include RIPv1 or 2 and IGRP.

Workings

The distance-vector routing protocol assumes a network connected through several routers, each of which is connected to two or more computer networks. Each network may be connected to one or more routers. The description below describes a very simple distance-vector routing protocol: #In the first stages, the router makes a list of which networks it can reach, and how many hops it will cost. In the outset this will be the two or more networks to which this router is connected. The number of hops for these networks will be 1. This table is called a routing table. #Periodically (typically every 30 seconds) the routing table is shared with other routers on each of the connected networks via some specified inter-router protocol. These routers will add 1 to every hop-count in the table, as it associates a hop cost of 1 for reaching the router that sent the table. This information is just shared inbetween physically connected routers ("neighbors"), so routers on other networks are not reached by the new routing tables yet. #A new routing table is constructed based on the directly configured network interfaces, as before, with the addition of the new information received from other routers. The hop-count is used as a cost measure for each path. The table also contains a column stating which router offered this hop count, so that the router knows who is next in line for reaching a certain network. # Bad routing paths are then purged from the new routing table. If two identical paths to the same network exists, only the one with the smallest hop-count is kept. When the new table has been cleaned up, it may be used to replace the existing routing table used for packet forwarding. #The new routing table is then communicated to all neighbors of this router. This way the routing information will spread and eventually all routers know the routing path to each network, which router it shall use to reach this network, and to which router it shall route next.

Advantages and disadvantages

Distance-vector routing protocols are simple and efficient in small networks, and require little, if any management. However, they do not scale well, and have poor convergence properties, which has led to the development of more complex but more scalable link-state routing protocols for use in large networks. Category:Routing protocols Category:Routing algorithms

Wikipedia:Votes for deletion/J-Revolution.com



wegetarianizm rozstępy slots Sennik online oszust










































:: RELATED NEWS ::





All Rights Reserved 2005 wikimiki.org