VAN MIEGHEM,P.,HOOGHIEMSTRA, G., AND VAN DER HOFSTAD, R. A scaling law for the hopcount. Tech. rep., Delft University of Technology, 2000.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of metrics, adding measured networks and degree based generators, and explicitly analyzing the degree of hierarchy. More recently, Barabasi et al. 3] have attempted to quantify the attack and error tolerance of random graphs and real world scalefree networks. Finally, van Mieghem et al. [44] have shown that the Internet s hop count distribution (the distribution of path lengths in hops) is well modeled by that of a random graph with uniformly or exponentially assigned link weights. Some of the topology metrics used in our paper are based on the metrics introduced in these papers. ....

VAN MIEGHEM, P., HOOGHIEMSTRA, G., AND VAN DER HOFSTAD, R. A scaling law for the hopcount. Tech. rep., Delft University of Technology, 2000.

....root to m arbitrary chosen group members is derived for the random graph Gp(N) and the k ary tree. It exhibits exponential behavior, in that the number of routers in the Internet that can be reached from a root grows exponentially in the number of hops with an effective degree of approximately 3. 2 [51]. Intuitively, this means that multicast provides efficient transmission of data when the receivers are spread wide apart. The pricing model for multicast was discussed in [30] A flat rate pricing is suggested for dense mode multicast and for applications such as webcasting. However a pricing ....

P. Van Mieghem, G. Hooghiemstra and R. van der Hofstad, "A Scaling Law for the Hopcount", Delft University of Technology, Delft, The Netherlands, Technical Report 2000125.

....of metrics, adding measured networks and degree based generators, and explicitly analyzing the degree of hierarchy. More recently, Barabasi et al. 3] have attempted to quantify the attack and error tolerance of random graphs and real world scale free networks. Finally, van Mieghem et al. [45] have shown that the Internet s hop count distribution (the distribution of path lengths in hops) is well modeled by that of a random graph with uniformly or exponentially assigned link weights. Some of the topology metrics used in our paper are based on the metrics introduced in these papers. ....

P. van Mieghem, G. Hooghiemstra, and R. van der Hofstad. A scaling law for the hopcount. Technical report, Delft University of Technology, 2000.

....of metrics, adding measured networks and degree based generators, and explicitly analyzing the degree of hierarchy. More recently, Barabasi et al. 3] have attempted to quantify the attack and error tolerance of random graphs and real world scale free networks. Finally, van Mieghem et al. [34] have shown that the Internet s hop count distribution (the distribution of path lengths in hops) is well modeled by that of a random graph with uniformly or exponentially assigned link weights. Some of the topology metrics used in our paper are based on the metrics introduced in these papers. ....

VAN MIEGHEM, P., HOOGHIEMSTRA, G., AND VAN DER HOFSTAD, R. A scaling law for the hopcount. Tech. rep., Delft University of Technology, 2000.

....Editor E. Biersack. The authors are with the Faculty of Information Technology and Systems (ITS) Delft University of Technology, 2628 BL Delft, The Netherlands (e mail: P.VanMieghem its.tudelft.nl) Publisher Item Identifier S 1063 6692(01)10554 6. model for the hopcount in the Internet in [17] and for ary graphs [13] Finally, using the same measurement data as in [13] our analysis indicates that the Internet is an exponentially growing graph (defined in Section VI) with an effective degree of approximately 3.2. Inspired by a remarkable paper by Phillips, Shenker, and Tangmunarunkit ....

....not hold for all . On the other hand, there are more regular graphs (such as a lattice, where ) with (and ) for which the mathematical condition is satisfied for all and . However, these classes of graphs, in contrast to random graphs, are not leading to realistic shortest path trees, as shown in [17]. For the random graph , we know from [17] for large where is Euler s constant. Below, in Theoreom 7, we prove that for the random graph and for large and (8) The above scaling explains the empirical Chuang Sirbu law for : for small with respect to , the graphs of and look very alike in a ....

[Article contains additional citation context not shown here]

P. Van Mieghem, G. Hooghiemstra, and R. van der Hofstad. A Scaling Law for the Hopcount, Report 2000125. Delft University of Technology, Delft, The Netherlands. [Online]. Available: http://wwwtvs.et.tudelft.nl/people/piet/telconference.html

No context found.

VAN MIEGHEM,P.,HOOGHIEMSTRA, G., AND VAN DER HOFSTAD, R. A scaling law for the hopcount. Tech. rep., Delft University of Technology, 2000.

No context found.

P. van Mieghem, G. Hooghiemstra, and R. van der Hofstad. A scaling law for the hopcount. Technical report, Delft University of Technology, 2000.

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