[brite-users] edge connection mechanism in top-down approach
anukool at cs.bu.edu
Thu Sep 11 19:27:16 EDT 2003
The edge connection methods at  are borrowed from GT-ITM.
A form of preferential connectivity arises from Smallest k-degree method.
By setting k appropriately (say to the largest degree).
The question of what is a representative edge connection method is to the
best of my knowledge unknown. There are many issues involved when two
ASes connect and its not immediately clear why the largest degree
routers in two ASes should have a link between them. Public peering at
exchange points make things more complicated.
Hope this is helpful,
On Thu, 11 Sep 2003, Vladimir Blagojevic wrote:
> Why isn't the edge connection mechanism  in top-down approach using
> preferential connectivity methods described in Barabasi-Albert and Medina's
> Maybe I don't understand the existing methods properly but intuitively the
> do not make a lot of sense to me. Why would we want to connect two routers
> from different ASes if they are smallest degree nodes in respective ASes?
> I always thought of routers as being highly connected and "popular" nodes?
> brite-users mailing list
> brite-users at cs.bu.edu
More information about the brite-users