Sharif Digital Repository

Combination of three-dimensional (3D) IC technology and network on chip (NoC) is an effective solution to increase system scalability and also alleviate the interconnect problem in large-scale integrated circuits. However, because of the increased power density in 3D NoC systems and the destructive effect of high temperatures on chip reliability, applying thermal management solutions becomes crucial in such circuits. In this study, the authors propose a runtime distributed migration algorithm based on game theory to balance the heat dissipation among processing elements (PEs) in a 3D NoC chip multiprocessor. The objective of this algorithm is to minimise the 3D NoC system's peak temperature,... 

The synergy of fundamental factors like changes in governmental policies, global expansions of the manufacturing industries and improvements in technology related to reliability of manufacturing information flow have created the global manufacturing revolution in the first years of the twenty-first century. Although the concept of global manufacturing enterprise has created benefits and opportunities for todays manufacturing enterprises, it has enforced enterprises to endure costs to adopt the global manufacturing solutions. Besides, considering the researches aimed to enable the global manufacturing paradigm, there is still a need for efficient solutions to fulfil the global product... 

In this paper, we propose a new architecture for nanophotonic Networks on Chip (NoC), named 2D-HERT, which consists of optical data and control planes. The proposed data plane is built upon a new topology and all-optical switches that passively route optical data streams based on their wavelengths. Utilizing wavelength routing method, the proposed deterministic routing algorithm, and Wavelength Division Multiplexing (WDM) technique, the proposed data plane eliminates the need for optical resource reservation at the intermediate nodes. For resolving end-point contention, we propose an all-optical request-grant arbitration architecture which reduces optical losses compared to the alternative... 

Packet loss recovery is an important part of P2P video streaming networks due to inevitable packet loss in today's internet and interdependency of data units in compressed video streams. In addition, the architecture of P2P streaming networks, in which the data delivered to the receivers through chain of peers, can intensify the impact of the internet packet loss on the quality of perceived video at the receivers. FEC and ARQ are the two most important techniques that can be used to overcome the side effect of the internet packet loss in P2P video streaming networks. Based on these two techniques, different packet loss recovery strategies can be applied in different overlay hops of a given... 

In this paper, a new search algorithm in heterogeneous hierarchical unstructured p2p networks is presented which takes into account heterogeneity of peers such as upload bandwidth, life time in the network and process capacity in its peer discovery policy as factors that influence download performance and user satisfaction. One advantage of this algorithm is that it can be performed in a completely unstructured network without imposing any change on network topology and file replication. However, it obviously decreases file download time as it is designed to discover broad-bandwidth nodes with a higher probability. This property results in a fair distribution of load over heterogeneous p2p... 

This paper compares the computation time of two algorithms for solving a structured constrained linear optimal control problem with finite horizon quadratic cost within the context of automated irrigation networks. The first is a standard centralized algorithm based on the active set method that does not exploit problem structure. The second is distributed and is based on a consensus algorithm, not specifically tailored to account for system structure. It is shown that there is a significant advantage in terms of computation overhead (the time spent computing the optimal solution) in using the second algorithm in large-scale networks. Specifically, for a fixed horizon length the computation... 

Combination of three-dimensional (3D) IC technology and network on chip (NoC) is an effective solution to increase system scalability and also alleviate the interconnect problem in large-scale integrated circuits. However, because of the increased power density in 3D NoC systems and the destructive effect of high temperatures on chip reliability, applying thermal management solutions becomes crucial in such circuits. In this study, the authors propose a runtime distributed migration algorithm based on game theory to balance the heat dissipation among processing elements (PEs) in a 3D NoC chip multiprocessor. The objective of this algorithm is to minimise the 3D NoC system's peak temperature,... 

The probability hypothesis density (PHD) filter has been recently introduced by Mahler as a relief for the intractable computation of the optimal Bayesian multi-target filtering. It propagates the posterior intensity of the random finite set (RFS) of targets in time. Despite serving as a powerful decluttering algorithm, PHD filter still has the problem of large variance of the estimated expected number of targets. The cardinalized PHD (CPHD) filter overcomes this problem through jointly propagating the posterior intensity and the posterior cardinality distribution. Unfortunately, the particle filter implementation of the CPHD filter suffers from lack of an efficient method for boosting its... 

Target tracking through particle filter (PF) for time-varying presence of a target is compared for thresholded and nonthresholded measurements, where in both cases a track produces more than one measurement. To that end, thresholded split measurements PF along with non-thresholded measurements, sequential importance resampling PF (SIR PF) and auxiliary variable PF (AV PF) are extended to cope with time-varying target presence. Simulations show superiorities in working through non-thresholded measurements. Furthermore, they surprisingly demonstrate that non-thresholded measurements SIR PF leads to less root-mean-square position estimation error than non-thresholded measurements AV PF in case... 

The current multi-channel P2P video streaming architectures still suffer from several performance problems such as low Quality of Service (QoS) in unpopular channels. The P2P systems are inherently dynamic, and their performance problems could be categorized into four groups; peer churn, channel churn, uncooperative peers, and geographical distribution of peers. In this paper, for the first time, we develop a novel locality-incentive framework for multi-channel live video streaming. We propose a hierarchical overlay network architecture by utilizing a dual-mode locality-Awareness method (spatial and temporal). Moreover, an incentive mechanism for encouraging peers to dedicate their upload... 

Partially-observed network data collected by link-tracing based sampling methods is often being studied to obtain the characteristics of a large complex network. However, little attention has been paid to sampling from directed networks such as WWW and Peer-to-Peer networks. In this paper, we propose a novel two-step (sampling/estimation) framework to measure nodal characteristics which can be defined by an average target function in an arbitrary directed network. To this end, we propose a personalized PageRank-based algorithm to visit and sample nodes. This algorithm only uses already visited nodes as local information without any prior knowledge about the latent structure of the network.... 

Inter-wire coupling capacitance may lead to crosstalk faults that significantly limits the reliability of NoCs. In this paper, we propose a numerical-based crosstalk avoidance code that can omit the Triplet Opposite Direction (TOD) transitions produced by crosstalk faults. The proposed coding does not have ambiguity and uses all of the codeword space. Simulations using VHDL for different channel widths show that the proposed method can reduce crosstalk fault in the NoC links with negligible power and area overheads  

This paper considers the computation time of two algorithms for solving a structured constrained linear optimal control problem with finite horizon quadratic cost within the context of automated irrigation networks. The first is a standard centralized algorithm based on the interior point method that does not exploit problem structure. The second is distributed and based on a consensus algorithm, not specifically tailored to account for system structure, but devised rather to facilitate the management of conflicting computational and communication overheads. It is shown that there is a significant advantage in terms of computation time in using the second algorithm in large-scale networks.... 

Modeling arbitrary connectivity changes of mobile ad hoc networks (MANETs) makes application of automated formal verification challenging. We introduced constrained labeled transition systems (CLTSs) as a semantic model to represent mobility. To model check MANET protocol with respect to the underlying topology and connectivity changes, we here introduce a branching-time temporal logic interpreted over CLTSs. The temporal operators, from Action Computation Tree Logic with an unless operator, are parameterized by multi-hop constraints over topologies, to express conditions on successful scenarios of a MANET protocol. We moreover provide a bisimilarity relation with the same distinguishing... 

Success rate, query hit rate and speed of search are some common metrics for evaluating p2p search algorithms. Yet, these metrics do not consider properties of discovered sources and their impact on download performance. A requesting peer is interested in stable serving peers with high upload bandwidth to minimize its download time and therefore, this is the superiority of a search algorithm to find sources with higher upload bandwidth in the p2p heterogeneous environment. In this paper, a new bio-inspired metric for comparing p2p search algorithms is introduced which takes the upload bandwidth of supplying nodes into account as a factor influencing quality of a search algorithm and user... 

Since tracking algorithms should be robust with respect to appearance changes, online algorithms has been investigated recently instead of offline ones which has shown an acceptable performance in controlled environments. The most challenging issue in online algorithms is updating of the model causing tracking failure because of introducing small errors in each update and disturbing the appearance model (drift). in this paper, we propose an online generative tracking algorithm in order to overcome the challenges such as occlusion, object shape changes, and illumination variations. In each frame, color distribution of target candidates is obtained and the candidate having the lowest distance... 

Nowadays, deployment of peer-to-peer video streaming systems over wireless mesh networks has attained raising popularity among large number of users around the world. In this paper, we present an efficient peer-to-peer live video streaming architecture over multi-hop wireless mesh networks. In our proposed architecture, we take the physical topology of network into account and based on a distributed distributed locality-aware neighbor selection algorithm in the overlay construction phase, we generate an efficient mesh-based overlay on top of wireless mesh networks. In locality-aware neighbor selection algorithm, instead of choosing randomly, peers find their best neighbors based on their... 

Recently, using Peer-to-Peer (P2P) overlay architectures have become a popular approach for live video streaming over the Internet. Since the peers in these systems are geographically distributed, the communication between them imposes huge redundant traffic into the Internet. One solution to address this problem is utilizing the locality aware algorithms to optimize the neighbor selection policy. However, for real-time applications like live video streaming we need to consider the trade-off between localizing the traffic and service quality. In this paper, we propose a novel pure P2P framework through two phases; (1) Local tracker selection, and (2) Overlay mesh construction. We introduce... 

Today modern computing systems leverage distributed models such as cloud, grid, etc. One of the obstacles of wide spreading these distributed computing models is security challenges which includes access control problem. These computing models because of providing features like on-demand self-service, ubiquitous network access, rapid elasticity and scalability, having dynamic infrastructure and offering measured service, need a powerful and continuous control over access and usage session. Usage control (UCON) model is emerged to cover some drawbacks of traditional access control models with features like attribute mutability and continuity of control. Several recent works have been done to... 

Service-oriented computing has emerged as a new software development paradigm that enables implementation of Web accessible software systems that are composed of distributed services which interact with each other via exchanging messages. Modeling and analysis of interactions among services is a crucial problem in this domain. Interactions among a set of services that participate in a service composition can be described from a global point of view as a choreography. Choreographies can be specified using specification languages such as Web Services Choreography Description Language (WS-CDL) and visualized using graphical formalisms such as collaboration diagrams. In this paper, we present an...