1 |
C. Hedrick, 'Routing information protocol,' http://www.ietf.org/rfc/rfc1058.txt, June, 1988
|
2 |
J. Moy, 'OSPF Version 2,' http://www.ietf.org/rfc/rfc1583.txt, March, 1994
|
3 |
D. Bertsekas and R. Gallager, 'Data Networks', 2nd Ed., Englewood Cliffs, NJ : Prentice-Hall, 1992
|
4 |
M. Garey and D. Johnson, 'Computers and intractability : A Guide to the Theory of NP-completencess,' New York : Freeman, 1979
|
5 |
R. Widyono, 'The Design and Evaluation of Routing Algorithms for Real-Time Channels,' International Computer Science Institure, Univ. of California at Berkely, Tech. Rep, ICSI TR-94-024
|
6 |
A. S. Rodionov and H. Choo, 'On Generationg Random Network Structures : Connected Graphs,' Information Networking, Proc. ICOIN-18, pp.1145-1152, February, 2004
|
7 |
A. S. Rodionov and H. Choo, 'On Generationg Random Networks Stuctures : Trees,' Springer-Verlang Lecuure Notes in Computer Science, Vol.2658, pp.879-887, June, 2003
|
8 |
D. S. Reeves and H. F. Salama, 'A distributed algorithm for delay-constrained unicast routing,' IEEE/ACM Transaction on Networking, Vol.8, pp.239-250, April, 2000
DOI
ScienceOn
|
9 |
V. P. Kompella, J. C. Pasquale, and G. C. Polyzos, 'Multicast routing for multimedia communication,' IEEE/ACM Transaction on Networkg, Vol.1, No.3, pp.286-292, June, 1993
DOI
|