Sharif Digital Repository

In this paper, we propose a hybrid packet-circuit switching for networks-on-chip to benefit from the advantages of both switching mechanisms. Integrating circuit and packet switching into a single NoC is achieved by partitioning the link bandwidth and router data-path and control-path elements into two parts and allocating each part to one of the switching methods. In this NoC, during injection in the source node, packets are initially forwarded on the packet-switched sub-network, but keep requesting a circuit towards the destination node. The circuit-switched part, at each cycle, collects the circuit construction requests, performs arbitration among the conflicting requests, and constructs... 

Realistic description of fractured reservoirs demands primarily for a comprehensive understanding of fracture networks and their geometry including various individual fracture parameters as well as network connectivities. Newly developed multiple-point geostatistical simulation methods like SIMPAT and FILTERSIM are able to model connectivity and complexity of fracture networks more effectively than traditional variogrambased methods. This approach is therefore adopted to be used in this paper. Among the multiple-point statistics algorithms, FILTERSIM has the priority of less computational effort than does SIMPAT by applying filters and modern dimensionality reduction techniques to the... 

Multiple description coding (MDC) is one of the promising solutions for live video delivery over lossy networks. In this paper, we present a review of MDC techniques based on their application domain and we explain their functionality, with the objective of giving enough insight to designers to decide which MDC scheme is best suited for their specific application based on requirements such as standard compatibility, redundancy tunability, complexity, and extendibility to n-description coding. The focus is mainly on video sources but imagebased algorithms applicable to video are considered as well. We also cover the well-known and important problem of drift and solutions to avoid it  

The compute-and-forward (CMF) method has shown a great promise as an innovative approach to exploit interference towards achieving higher network throughput. The CMF was primarily introduced by means of information theory tools. Although there have been some recent works discussing different aspects of efficient and practical implementation of CMF, there are still some issues that are not covered. In this study, the authors first introduce a method to decrease the implementation complexity of the CMF method. They then evaluate the exact outage probability of the authors proposed simplified CMF scheme, and hereby provide an upper bound on the outage probability of the optimum CMF in all... 

In this paper, we propose a hybrid packet-circuit switching for networks-on-chip to benefit from the advantages of both switching mechanisms. Integrating circuit and packet switching into a single NoC is achieved by partitioning the link bandwidth and router data-path and control-path elements into two parts and allocating each part to one of the switching methods. In this NoC, during injection in the source node, packets are initially forwarded on the packet-switched sub-network, but keep requesting a circuit towards the destination node. The circuit-switched part, at each cycle, collects the circuit construction requests, performs arbitration among the conflicting requests, and constructs... 

Social networks are inevitable parts of daily life and there has been an increasing interest in analyzing social phenomena on networked structures. Evolution of opinion formation is one of the topics that has attracted many scholars in the field. In this work we consider the influence of leaders and social power in the evolution of opinion formation. A number of central nodes with specific properties (e.g. nodes with highest degree, betweenness or vulnerability values) are taken as leaders whose opinions are kept unchanged, that is, not influenced by other agents. The leaders try to coordinate the opinions of other agents where the connection structure is considered to be preferential... 

In this paper, we review the literature on enhancing synchronizability of diffusively coupled dynamical networks with identical nodes. The last decade has witnessed intensive investigations on the collective behavior over complex networks and synchronization of dynamical systems is the most common form of collective behavior. For many applications, it is desired that the synchronizability - the ability of networks in synchronizing activity of their individual dynamical units - is enhanced. There are a number of methods for improving the synchronization properties of dynamical networks through structural perturbation. In this paper, we survey such methods including adding/removing nodes... 

Nowadays, we are facing epidemic spreading in many different areas; examples are infection propagation, rumor spreading and computer viruses in computer networks. Finding a strategy to control and mitigate the spread of these epidemics is gaining much interest in recent researches. Due to limitation of immunization resources, it is important to establish a strategy for selecting nodes which has the most effect in mitigating epidemics. In this paper, we propose a new algorithm that minimizes the worst expected growth of an epidemic by reducing the size of the largest connected component of the underlying contact network. The proposed algorithm is applicable to any level of available resources... 

Identifying communities has always been a fundamental task in analysis of complex networks. Many methods have been devised over the last decade for detection of communities. Amongst them, the label propagation algorithm brings great scalability together with high accuracy. However, it has one major flaw; when the community structure in the network is not clear enough, it will assign every node the same label, thus detecting the whole graph as one giant community. We have addressed this issue by setting a capacity for communities, starting from a small value and gradually increasing it over time. Preliminary results show that not only our extension improves the detection capability of the... 

Matching theory is a powerful tool to study the formation of dynamic and mutually beneficial relations among different types of rational and selfish agents. It has been widely used to develop high performance, low complexity, and decentralized protocols. In this article, a comprehensive survey of matching theory, its variants, and their significant properties appropriate for the demands of wireless communications and network engineers is provided. Recent research progress in applying matching theory to wireless communications to address major technical opportunities and challenges is presented. A novel classification of matching models from the practical perspective is provided, and the... 

The purpose of this paper is to address the question of well-posedness and spectral controllability of the wave equation perturbed by potential on networks which may contain unbounded potentials in the external edges. It has been shown before that in the absence of any potential, there exists an optimal time T∗ (which turns out to be simply twice the sum of all length of the strings of the network) that describes the spectral controllability of the system. We will show that this holds in our case too, i.e., the potentials have no effect on the value of the optimal time T∗. The proof is based on the famous Beurling-Malliavin’s Theorem on the completeness interval of real exponentials and on a... 

In the binary majority voting problem, each node initially chooses between two alternative choices. The goal is to design a distributed algorithm that informs nodes which choice is in majority. In this study, the authors formulate this problem as a hypothesis testing problem and propose fixed-size and sequential solutions using classical and Bayesian approaches. In the sequential version, the proposed mechanism enables nodes to test which choice is in majority, successively in time. Hence, termination of the algorithm is embedded within it, contrary to the existing approaches which require a monitoring algorithm to indicate the termination. This property makes the algorithm more efficient in... 

BGP/MPLS IP VPN and VPLS services are considered to be widely used in IP/MPLS networks for connecting customers' remote sites. However, service providers struggle with many challenges to provide these services. Management complexity, equipment costs, and last but not least, scalability issues emerging as the customers increase in number, are just some of these problems. Software-defined networking (SDN) is an emerging paradigm that can solve aforementioned issues using a logically centralized controller for network devices. In this paper, we propose a SDN-based solution called SDxVPN which considerably lowers the complexity of VPN service definition and management. Our method eliminates... 

5-th generation mobile networks aim the peak data rates in excess of few Gbs, which may appear to be challenging to achieve due to the existence of some blocks such as the turbo decoder. In fact, the interleaver is known to be a major challenging part of the turbo decoder due to its need to the parallel interleaved memory access. LTE uses Quadratic Permutation Polynomial (QPP) interleaver, which makes it suitable for the parallel decoding. In this paper, a new property of the QPP interleaver, called the correlated shifting property, is theoretically proved, leading to a fully scalable interleaver and a low-complexity address generator for an arbitrary order of parallelism. The proposed... 

The purpose of this paper is to address the question of well-posedness and spectral controllability of the wave equation perturbed by potential on networks which may contain unbounded potentials in the external edges. It has been shown before that in the absence of any potential, there exists an optimal time T∗ (which turns out to be simply twice the sum of all length of the strings of the network) that describes the spectral controllability of the system. We will show that this holds in our case too, i.e., the potentials have no effect on the value of the optimal time T∗. The proof is based on the famous Beurling-Malliavin’s Theorem on the completeness interval of real exponentials and on a... 

This paper introduces a novel framework for modeling temporal events with complex longitudinal dependency that are generated by dependent sources. This framework takes advantage of multidimensional point processes for modeling time of events. The intensity function of the proposed process is a mixture of intensities, and its complexity grows with the complexity of temporal patterns of data. Moreover, it utilizes a hierarchical dependent nonparametric approach to model marks of events. These capabilities allow the proposed model to adapt its temporal and topical complexity according to the complexity of data, which makes it a suitable candidate for real world scenarios. An online inference... 

The great surge in the research of community discovery in complex network is going on due to its challenging aspects. Dynamicity and overlapping nature are among the common characteristics of these networks which are the main focus of this paper. In this research, we attempt to approximate the granular human-inspired viewpoints of the networks. This is especially helpful when making decisions with partial knowledge. In line with the principle of granular computing, in which precision is avoided, we define the micro- and macrogranules in two levels of nodes and communities, respectively. The proposed algorithm takes microgranules as input and outputs meaningful communities in rough... 

Recently, demand-response (DR) programmes are one of the appropriate tools for energy systems to encourage flexible customers to participate in the operation of energy systems. One of the complex tasks in multi-energy environments is optimal energy flow (OEF) problem of these systems. In this regard, this study investigates the OEF of an integrated electrical, heat, and gas system considering flexible heat and electrical demands. The conventional DR programme has been combined with the demand-side energy supplying management activity by introducing switching concept among input energy carriers. The way of the supplying energy of flexible customer can be changed by switching among input... 

In real-world networks, nodes might have more than one type of relationship. Signed networks are an important class of such networks consisting of two types of relations: positive and negative. Recently, embedding signed networks has attracted increasing attention and is more challenging than classic networks since nodes are connected by paths with multi-types of links. Existing works capture the complex relationships by relying on social theories. However, this approach has major drawbacks, including the incompleteness/inaccurateness of such theories. Thus, we propose network transformation based embedding to address these shortcomings. The core idea is that rather than directly finding the...