Gökden, Burç2016-02-082016-02-0820050219-7499http://hdl.handle.net/11693/27386Date of Conference: 16-19 April 2004Conference Name: International Meeting on Quantum Information Science – Foundations of Quantum Information, 2004In this paper we briefly define distance vector routingalgorithms, their advantages and possible drawbacks. On thesepossible drawbacks, currently widely used methods split horizonand poisoned reverse are defined and compared. The count toinfinity problem is specified and classified to be a haltingproblem, and a proposition stating that entangled states used inquantum computation can be used to handle this problem isexamined. Several solutions to this problem by using entangledstates are proposed and a very brief introduction to entangledstates is presented.EnglishComputer networksCounting to infinity problemDistance vector routingEntanglementHalting problemQuantum computersRouting information protocolConference Paper10.1142/S0219749905000645