Abstract: Large networks are often structured hierarchically by grouping nodes into different domains in order to deal with the scaling problem. The internal topologies of the domains are aggregated before broadcasting and this process is called topology aggregation. We propose a new method of aggregating networks that are delay-bandwidth sensitive. Traditional approaches represent each logical link as a delay-bandwidth pair which is basically a point on a delay-bandwidth plane. We introduce a new QoS parameter representation and present an aggregation a...
(read more)
Topics: 
Computer network
Distributed computing
Algorithm