Sharif Digital Repository

This paper introduces a new class of interconnection networks named star-pyramid. An n-level star-pyramid is formed by piling up star graphs of dimensions 1 to n in a hierarchy, connecting any node in each i-dimensional star, 1 < i ? n, to a node in the (i - 1)-dimensional star whose index is reached by removing the i symbol from the index of the former node in the i-dimensional star graph. Having extracted the properties of the new topology, featuring topological properties, a minimal routing algorithm, a simple but efficient broadcast algorithm, Hamiltonicity and pancyclicity, we then compare the network properties of the proposed topology and the well-known pyramid topology. We show that... 

This paper introduces a new class of interconnection networks named star-pyramid. An n-level star-pyramid is formed by piling up star graphs of dimensions 1 to n in a hierarchy, connecting any node in each i-dimensional star, 1 < i ≤ n, to a node in the (i - 1)-dimensional star whose index is reached by removing the i symbol from the index of the former node in the i-dimensional star graph. Having extracted the properties of the new topology, featuring topological properties, a minimal routing algorithm, a simple but efficient broadcast algorithm, Hamiltonicity and pancyclicity, we then compare the network properties of the proposed topology and the well-known pyramid topology. We show that... 

When implementing some applications in multi-computer systems, broadcast operation is a necessity for efficient communication. Several broadcast algorithms have been proposed in the literature for hypercube networks. In this paper, we evaluate the performance of broadcast routing algorithms for hypercube networks, and propose a new approach by reducing the number of steps required to perform. © 2009 IEEE  

OTIS-based architectures appear to have the potential to be an interesting option for future generations of multiprocessing systems. In this paper, we propose a new adaptive unicast routing algorithm and four software-based (unicast-based) broadcast algorithms for the wormhole switched OTI S-hypercube. We then present an empirical performance evaluation of these algorithms in OTIS-hypercube for different topologies, message length and traffic loads. © 2008 IEEE  

Broadcast is among the most primitive collective communication operations of any interconnection network. Broadcast algorithms for the mesh topology have been widely reported in the literature. However, most existing algorithms have been studied in one-port and within limited conditions, such as light traffic loads. In contrast, this study simulates the broadcast operations, taking into account a wide range of traffic loads. Also, the performance evaluation of meshes in the presence of unicast and broadcast traffic is presented in this paper. To the best of our knowledge, this study is the first to consider the issue of broadcast latency at both the network and node levels. A new model for... 

The surface area which is defined as the number of vertices at a given distance from a base vertex of a graph is considered to be as one of the most useful yet abstract combinatorial properties of a graph. The applicability of surface area spans many problem spaces such as those in parallel and distributed computing. These problems normally involve combinatorial analysis of underlying graph structures (e.g., spanning tree construction, minimum broadcast algorithms, efficient VLSI layout, performance modeling). In this paper, we focus on the problem of finding the surface area of a class of popular graphs, namely the family of WK-recursive and swapped networks. These are attractive networks... 

There are applications where important and critical data should be sent to all nodes in a wireless Ad-hoc network. Flooding and its variants are typically used to achieve this target. Network coding can also be used for broadcasting in such an environment. Energy consumption in the network, coverage and total delay are all important parameters that should be considered when an algorithm is evaluated. In this article, a reliable and energy efficient single source broadcasting algorithm is proposed based on network coding. This algorithm guarantees the delivery of desired messages to all network nodes, consumes less energy compared and reduces the total delay compared to other algorithms. This... 

Some Applications need to propagate important and critical data to all nodes in a wireless ad-hoc network. Flooding and its variants are good and simple protocols to achieve this target, but they are not efficient. Network coding can improve the performance of these algorithms. In designing such algorithms there are some important parameters which should be taken into account. Energy consumption, coverage and total delay are the most important parameters in a wireless ad-hoc network. Also in the network coding based algorithms, complexity of coding and packet overhead that network coding inserts to the system are important design parameters. In this article, XRBCast, a reliable and energy... 

Peer-to-peer (P2P) networks are beginning to form the infrastructure of future applications. Computers are organized in P2P overlay networks to facilitate search queries with reasonable cost. So, scalability is a major aim in design of P2P networks. In this paper, to obtain a high factor of scalability, we partition network search space using a consistent static shared upper ontology. We name our approach semantic partition tree (SPT). All resources and queries are annotated using the upper ontology and queries are semantically routed in the overlay network. Also, each node indexes addresses of other nodes that possess contents expressible by the concept it maintains. So, our approach can be...