Shkolla për Kompjuterë Informatika ofron kurse dhe trajnime profesionale për Sistemeve Operative, Microsoft Office, Multimedia & Dizajn, Rrjeta Kompjuterike. stability, tema diplome rrjeta kompjuterike, design procedure reactive distillation aspen manual, reloading guide, face image analysis by. 1 Ndarjet e rrjetave; 2 Topologjitë e lidhjes së rrjeteve kompjuterike. Topologjia Këto rrjeta sot përdoren më rrallë të mbetura nga e kaluara. Në figurë.


Author: Stanton Schumm
Country: Mongolia
Language: English
Genre: Education
Published: 19 November 2016
Pages: 442
PDF File Size: 33.98 Mb
ePub File Size: 27.62 Mb
ISBN: 324-9-51277-764-4
Downloads: 80991
Price: Free
Uploader: Stanton Schumm


Web - CourseCatalogue

July 27, Rrjeta kompjuterike a comment Introduction The Routing Information Protocol, or RIP, as it is more commonly called, is the earliest and one rrjeta kompjuterike the most enduring of all routing protocols. RIP was designed to work with moderate-size networks using reasonably homogeneous technology.

RIP uses distance-vector routing algorithm.


This protocol has since been extended and updated several rrjeta kompjuterike resulting in more advanced version RIP v2. RIP as a distance-vector routing protocol, uses the hop count as routing metric.

The maximum number rrjeta kompjuterike hops allowed for RIP is In other words, all subnets in a network class must have the same size. RIPv2 maintains backward compatibility with previous version, and uses the hop count limit of The RIP v2 extensions are listed in the following: Unicast addressing is still allowed for special applications.

Support of IPv6 networking. RIPv2 Characteristics In rrjeta kompjuterike section we will introduce the main features that characterize RIPv2 as true member of distance-vector routing protocol. The main characteristics of RIPv2 are: Count to infinity — A router advertising networks heard from a neighboring router back to the same neighboring rrjeta kompjuterike could create a loop.

In repeating networks to the router that informed the routing table, when a network goes down, each router may believe that there is an existing path through its neighbor.

This rrjeta kompjuterike is rrjeta kompjuterike because each router increments the hop count before it sends out the update.

When the hop count reaches 16, the network is rejected as unreachable because the diameter of a RIPv1 network cannot be greater than Although the liability is controlled, it rrjeta kompjuterike still slow convergence of the network. Split rrjeta kompjuterike — This is a mechanism to prevent loops and, thereby, the necessity of count to rrjeta kompjuterike.

The routing process will not advertise networks learned through an interface in an update out that interface.

It will not repeat information to the router that told of the networks. Split horizon with poison reverse — Split horizon on its own may not prevent loops. Poison reverse includes all the networks that have been learned from the neighbor, but it sets the metric to infinity By changing the metric value to 16, the networks are reported to be unreachable.

TICK Education Center (@tickeducation) • Instagram photos and videos

It acknowledges the network but denies a valid path. Although this increases network overhead by increasing the update size, it rrjeta kompjuterike prevent loops.


Holddown timer — After deciding that a network in the routing rrjeta kompjuterike is no longer valid, the routing process waits for three routing updates by default before it believes a routing update with a less-favorable metric.

Again, this is to prevent routing loops from generating rrjeta kompjuterike information throughout the network.


Triggered updates — As soon as a routing process changes a rrjeta kompjuterike for a network in its routing table, it sends an update. This informs the other routers immediately.

UBT Summer of Code

If there is a problem in the network, all the affected routers go into hold-down immediately instead of waiting for the periodic timer. This increases convergence and helps prevent loops. Load balancing — If rrjeta kompjuterike routing process sees multiple rrjeta kompjuterike of equal cost to a remote network, it distributes the routed datagram traffic evenly among the paths.