Network topology

About: Network topology is a research topic. Over the lifetime, 52259 publications have been published within this topic receiving 1006627 citations.

Routing in overlay multicast networks

Abstract: Multicast services can be provided either as a basic network service or as an application-layer service. Higher level multicast implementations often provide more sophisticated features, and can provide multicast services, where no network layer support is available. Overlay multicast networks offer an intermediate option, potentially combining the flexibility and advanced features of application layer multicast with the greater efficiency of network layer multicast. Overlay multicast networks play an important role in the Internet. Indeed, since Internet service providers have been slow to enable IP multicast in their networks, Internet multicast is only widely available as an overlay service. This paper introduces several routing algorithms that are suitable for overlay multicast networks and evaluates their performance. The algorithms seek to optimize the end-to-end delay and the interface bandwidth usage at the routing sites within the overlay network. The interface bandwidth is typically a key resource for an overlay network provider, and needs to be carefully managed in order to maximize the number of sessions that can be served. The simultaneous optimization of both delay and bandwidth is an NP-hard problem. We propose several heuristic algorithms and simulate their performance under various traffic conditions and on various network topologies.

adaptive mobile multimedia networks

Abstract: The authors consider a networking environment in which the users are mobile, the topology changes, code division multiple access (CDMA) provides multiple wireless channels, the bandwidth of a given link is unpredictable and possibly very low, the error rates are extremely high and variable, major interference occurs when multiple transmissions take place over (possibly different) links on the same or different codes, real-time multimedia traffic must be supported as well as datagram traffic, there is no stable communication infrastructure, and there is no central control. They consider the problem of developing a design prototyping methodology, performance evaluation techniques, and networking algorithms to support a rapidly deployable radio network for such an environment. The network must be capable of providing guaranteed quality of service (QoS) to real-time multimedia traffic in a mobile, wireless, multihop radio network with no fixed infrastructure (e.g., no base stations). Another element of the environment with which they deal is that of multihop communications. They focus on two layers of key importance in multimedia wireless network design, namely compression algorithms and adaptivity in the voice/video applications layer, and network algorithms at the wireless subnet layer. Simulation tools are used to evaluate our design as well as to provide a path toward their implementation in software.

Ranking stability and super-stable nodes in complex networks

Abstract: Pagerank, a network-based diffusion algorithm, has emerged as the leading method to rank web content, ecological species and even scientists. Despite its wide use, it remains unknown how the structure of the network on which it operates affects its performance. Here we show that for random networks the ranking provided by pagerank is sensitive to perturbations in the network topology, making it unreliable for incomplete or noisy systems. In contrast, in scale-free networks we predict analytically the emergence of super-stable nodes whose ranking is exceptionally stable to perturbations. We calculate the dependence of the number of super-stable nodes on network characteristics and demonstrate their presence in real networks, in agreement with the analytical predictions. These results not only deepen our understanding of the interplay between network topology and dynamical processes but also have implications in all areas where ranking has a role, from science to marketing.

A peer-to-peer approach to content-based publish/subscribe

Abstract: Publish/subscribe systems are successfully used to decouple distributed applications. However, their efficiency is closely tied to the topology of the underlying network, the design of which has been neglected. Peer-to-peer network topologies can offer inherently bounded delivery depth, load sharing, and self-organisation. In this paper, we present a content-based publish/subscribe system routed over a peer-to-peer topology graph. The implications of combining these approaches are explored and a particular implementation using elements from Rebeca and Chord is proven correct.