Categories
Biology & Chemistry Admission tests History & Philosophy Pyhsics and AstroPhysics Statistics for Psychologists Applied Physics Law of Torts Political sciences Business Administration History Software Engineering Questions on universities Data Communication and Computer Networks Behavioural Science Literature and Communication Pharmacy Business System Economic Theory Operating System Biostatistics Criminal Law Medicine and Pharma Engineering Physics Botony Human Resource Management College Physics A Engineering Management Information Systems Geochemistry Project Management Managerial Economics Civil procedure Economics Effective Business Communication Security Analysis Statistics and Economics Computer Architecture The Physics of Everyday Life Biological Systems United States Philosophy Financial Management Consumer Behaviour Sociology Computer science Psycology & Sociology Management Finance Aerospace Engineering Methods in Psychology Digital electronics Law Advanced Physics Information System Analysis and Design American (United States) History Chemistry Internet and Java Programming Physics Microeconomics Social Psychology Basic Electrical Engineering Professional Communication for Pharmacists Advanced Computer Architecture Developmental Psychology Job and Internships Psychology Languages Mathematics Introduction to Business Analytical Chemistry Engineering Materials Computer Fundamentals Java Programming Biology Business Management Business Law Computer Graphics and Animation Fuzzy Intelligence Political Science Statistics Soil Mechanics and Foundations General Pharmacy Computer Programming Communication Skills Introduction to the Science and Engg Electronics and Communication Biochemistry Boilers and Welding Fundamentals of Operating Systems English Grammar On Docsity Agronomy Fundamentals of Information Technology Accounting Object Oriented Programming Generic Network Technologies and TCP/IP

Compare the three main approaches to routing.

0 votes

October 11th, 2012 18:29
in Data Communication and Computer Networks by rajeshi (Dakota State University (SD), Mass transfer)

Compare the three main approaches to routing.

Breifly exlpain main approaches of routing?

7 Answers
0 votes

October 12th, 2012 15:46
ronyx (London Metropolitan University, Mathematics, phd)
"Distance-vector routing: requires that each node (router or host that implements the routing protocol) exchange information with its neighboring nodes. For this purpose, each node maintains a vector of link costs for each directly attached network and distance and next-hop vectors for each destination. Link-state routing: When a router is initialized, it determines the link cost on each of its network interfaces. The router then advertises this set of link costs to all other routers in the internet topology, not just neighboring routers. From then on, the router monitors its link costs. Whenever there is a significant change (a link cost increases or decreases substantially, a new link is created, an existing link becomes unavailable), the router again advertises its set of link costs to all other routers in the configuration. Path-vector routing: dispenses with routing metrics and simply provide information about which networks can be reached by a given router and the ASs that must be crossed to get there. The approach differs from a distancevector algorithm in two respects: First, the path-vector approach does not include a distance or cost estimate. Second, each block of routing information lists all of the ASs visited in order to reach the destination network by this route."

Please log in or register to add a comment.

0 votes

November 1st, 2012 07:14
anala (Adams State College (CO), Elecrtonics)
An additional recognized handle the actual switch-primarily based plans arises from Hazeyama et al. Of their technique, they wish to incorporate your SPIE approaching as reported by Snoeren,[7] because of their method associated with documenting your bed ii url-username with the multilevel Identification (VLAN or correct Username), this Mackintosh target with the bed ii switching that will received the particular box plus the website link username it started in along. This information is then placed in a couple glimpse-in place furniture – each that contains this move (layer ii modem) Macintosh no . for glimpse-up. That they depend on the Mackintosh:larboard tuple to be a approach to doing a trace for any packet rear (choice . Mac pc savoir-faire has become spoofed).  

Please log in or register to add a comment.

0 votes

November 2nd, 2012 08:16
ameen (Johns Hopkins University (MD), Technical writing)
The area essential at each modem is bound and controlled (2n chunks). A small n helps to make the probability of collision connected with mailboat hashes (and also false i . d .) greater. Every time a packet is to be traced back, it is forwarded in order to originating hubs where finger marks matches are usually checkered.  

Please log in or register to add a comment.

0 votes

November 2nd, 2012 08:33
shafi (Chipola College (FL), Mechanical Engineering)
Snoeren et al.. project marking inside router. The thought planned of their newspaper is usually to beget a finger print of the box, dependant on your invariant servings of the mailboat (origin, getaway, etc.) and also the primary 8-10 bytes connected with cargo (that is special sufficient undertake a reduced chance of collision). More specially, m independent simple hasheesh functions each and every generate a great productivity in the choice of 2n-1. A tad is then hardened on the list developed to generate a fingerprint as soon as combined with end result of other hashish features. Almost all finger prints are usually kept in the 2n little bit kitchen table intended for later access. This document exhibits an easy class of hasheesh functions ideal for that function and found some sort of components setup of it  

Please log in or register to add a comment.

0 votes

November 3rd, 2012 06:42
parvini (Albany State University (GA), Computer sciences)
To help you mitigate the issue connected with storage area limitations they will use Snoeren’S hashing strategy and also rendering (SPIE) – adjusting the item to receive their particular info intended for hashing. They declare their own algorithmic program can be slow (I(N2)) and with just several.several zillion bundle hashes organism stored your approx . moment ahead of the break up furniture are ill is definitely one particular instant. That requires that will any strike reception has to be authentic-meter – a chance just on unmarried-administrative LAN domains.  

Please log in or register to add a comment.

0 votes

November 3rd, 2012 10:13
parolie (Donnelly College (KS), Computer sciences)
After some time, this finger print info is “clobbered” aside hashes made by simply some other packages. As a result, the particular selectivity with this approach degrades while using occasion that's handed involving the passageway of the packet and the traceback inquiry.  

Please log in or register to add a comment.

0 votes

November 9th, 2012 08:28
percyval (Johns Hopkins University (MD), Anathomy)
Along with hub centered methods, the particular hub is definitely charged with maintaining selective information concerning packets that traverse the item. E.g., Sager offers to log packets then files acquire these individuals afterwards. It's the main benefit of staying away from wedding band therefore certainly not clogging the fast way.

Please log in or register to add a comment.

Related questions
6 Answers
5 Answers
Answer
danmarino (Ohio State University (OH), Physics)
6 Answers
Answer
shokha (Jawaharlal Nehru Technological University, Electrical Engineering)
8 Answers
Answer
pumpedup (Johns Hopkins University (MD), General physics, phd)
8 Answers
Answer
pumpedup (Johns Hopkins University (MD), General physics, phd)
Subjects