| M. Sidi. Failsafe distributed optimal routing in data-communication networks. Master's thesis, Technion-Israel Institute of Technology, Haifa, Israel, 1978. |
....complete, and to immediately start a new cycle. This is implemented by request messages REQ generated by nodes adjacent to the change, carrying the number of the last cycle handled by this node, and forwarded towards the destination. A formal description of the algorithm can be found in [24] and [29]. 34 4.4 Calculation of D 0 ik It is clear from the description of the algorithm that a very crucial factor for the minimization of the delay in steady state is the calculation of D 0 ik (f ik ) for a node i and all its links k. Each node i can estimate, as a time average, the link traffic ....
M. Sidi. Failsafe distributed optimal routing in data-communication networks. Master's thesis, Technion-Israel Institute of Technology, Haifa, Israel, 1978.
No context found.
M. Sidi. Failsafe distributed optimal routing in data-communication networks. Master's thesis, Technion-Israel Institute of Technology, Haifa, Israel, 1978.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC