Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Dijkstra Algorithms
To calculate its routing table each router applies an algorithm called the dijkstra algorithm to its state database. The dijkstra algorithm calculates the shortest path between two points on a network using a graph using a made up of nodes and arcs. Notes are of two types networks and routers. Arcs are the connection between a router and a network ( router to network and network to router). Cost is applied only to the are from router to network. The cost of the from network to router is always zero .
Costs in the dijkstra algorithm
Q. TCP – numbering bytes? Numbering is utilized for flow & error control Segments aren't numbered only bytes Full-duplex connection - numbering is independent in
Explain the concept of router-root path The mean router-router path is double the mean router-root path. Number levels of tree with root as 1 and the deepest level as n. The pa
Why it is necessary to have layering in a network? A computer network is a very complex system. It becomes very difficult to execute as a single entity. The layered approach di
Q. TCP-IP and OSI Differences - TCP/IP combines the Presentation and Application Layers - TCP/IP combines the OSI Data Link and Physical Layers into 1 Layer - TCP/IP app
Explain in brief -Ring Topolgy Comments 1 - A faulty connection amid two stations can cause network failure 2 - It's difficult to add a new station/device as it has to come betwe
What do mean by tunnel mode? This is a mode of data exchange wherein two communicating computers do not use IPSec themselves. Instead, the gateway that is linking their LANs to
Message Passing The PVM communication model gives asynchronous blocking receive, asynchronous blocking send and nonblocking receive functions. In our methodology, a blocking se
Can you Describe IGRP?
Q. Show the Congestion avoidance in TCP? Slow Start (SS) & Additive Increase (AI) (AI=Congestion Avoidance) start with the congestion window (cwnd) = max segment si
FDDI Media Access Control Unlike CSMA/CD networks such like Ethernet token-passing networks are deterministic--you are able to calculate the maximum time that will pass before
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd