Discrete-event simulation of computer networks has significant scalability issues, which makes simulating large-scale networks problematic. We propose a highlevel abstraction modeling network domains, interdomain links and traffic with highly scalable analytical models, which is much more efficient

Through detailed analysis of scores of publicly available data sets corresponding to a wide range of large-scale networks, from communication and road networks to various forms of social networks, we explore a little-studied geometric characteristic of real-life networks, namely their hyperbolicity

Many useful techniques and infrastructures have been developed to test the correctness and performance of computer systems before deployment. However, they are limited when applied to the large-scale networked systems that are prevalent today, from Internet routing to peer-to-peer (P2P) video

Visualization is increasingly important for understanding the structure of communication networks and services on them, but displaying the data associated with very large networks is di cult. There

Abstract — We present a novel constrained flow control scheme for a class of large-scale networks, modelled by interconnected network resources with capacity and buffer size limitations. We first propose a decentralized sliding mode controller [7] to achieve asymptotic regulation of each individual

problem presents a challenge for large-scale, multi-hop sensor networks with a large number of nodes distributed over wide areas. In this thesis we develop the use of spatial averaging as an approach to mitigating the effects of the scalability problem. We first develop a cooperative synchronization

Automatic layout for large-scale network Large-scale biological MAP Dynamic simulator simulator optimizer system analyzer Virtual knockout

public comments and/or presentations will be treated as public documents and will be made available to the public via the JET Web site. Submitted by the National Science Foundation in support of the

, including novel techniques to balance emulation accuracy against scalability. The current ModelNet prototype is able to accurately subject thousands of instances of a distributed application to Internet-like conditions with gigabits of bisection bandwidth. Experiments with several large-scale distributed

Abstract A new routing scheme, Topological Routing, for large-scale networks is proposed. It allows for efficient routing without large routing tables as known from traditional routing schemes. It presupposes a certain level of order in the networks, known from Structural QoS. The main issues