Interview Questions Answers.ORG
Interviewer And Interviewee Guide
Interviews
Quizzes
Home
Quizzes
Interviews Computer Networking Interviews:Active DirectoryBasic NetworkingCable TesterCCNACCNA SecurityCCNPCDMA (Code division multiple access)Cisco Certified Internetwork Expert (CCIE)Client ServerClient-Server ComputingComputer NetworksCorbaData CommunicationsData Link LayerDigital RouterEthernet NetworkingFOC (Fiber Optic Route Checker)Java Network programmingLocal area network (LAN)MCSAMCSEMetropolitan area network (MAN)Network AdministratorNetwork ProgrammingNetwork/System AdministratorNetworks SecurityRoutersRoutingSWG and AWGSystem AdministrationSystem Support EngineerVoIPVPNWide area network (WAN)
Copyright © 2018. All Rights Reserved
MCSE Interview Question:
Explain distance vector routing algorithm with the help of suitable example.
Submitted by: AdministratorDistance Vector Routing Algorithms calculate a best route to reach a destination based solely on distance. E.g., RIP. RIP calculates the reach ability based on hop count. It is different from link state algorithms, which consider some other factors like bandwidth and other metrics to reach a destination. Distance vector routing algos are not preferable for complex networks and take longer to converge.
Submitted by: Administrator
Submitted by: Administrator
Copyright 2007-2024 by Interview Questions Answers .ORG All Rights Reserved.
https://InterviewQuestionsAnswers.ORG.
https://InterviewQuestionsAnswers.ORG.