| D. Sidhu, T. Fu, S. Abdallah, R. Nair, and R. Coltun. Open shortest path first (OSPF) routing protocol simulation. In Proceedings of ACM SIGCOMM '93, pages 53--62, 1993. |
....such as rings, trees and stars (e.g. 12, 44, 64] E. Zegura, K. Calvert, and M. Donahoo are with the College of Computing, Georgia Institute of Technology. ffl Well known topologies, such as the ARPAnet or NSFnet backbone (e.g. 5, 54, 65] ffl Randomly generated topologies (e.g. [55, 58, 61]) The limitations of each of these are obvious: well known and regular topologies reflect only parts of current or past real networks; random topologies may not reflect any (past, present or future) real network. Also clear from the cited references is the diverse set of problems that rely on ....
D. Sidhu, T. Fu, S. Abdallah, R. Nair, and R. Coltun. Open shortest path first (OSPF) routing protocol simulation. In Proceedings of ACM SIGCOMM '93, pages 53--62, 1993.
....network models to study a wide range of problems. The state of the art in modeling includes: ffl Regular topologies, such as rings, trees and stars (e.g. 3, 8, 14] ffl Well known topologies, such as the ARPAnet or NSFnet backbone (e.g. 1, 9, 15] ffl Randomly generated topologies (e.g. [10, 11, 12]) The limitations of each of these are obvious: wellknown and regular topologies reflect only parts of current or past real networks; random topologies may not reflect any (past, present or future) real network. What is additionally clear from the cited references is the diverse set of problems ....
D. Sidhu, T. Fu, S. Abdallah, R. Nair, and R. Coltun. Open shortest path first (OSPF) routing protocol simulation. In Proceedings of ACM SIGCOMM '93, pages 53--62, 1993.
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