Free riding is a major problem in peer-to-peer networks. Reputation management systems are generally proposed to overcome this problem. In this paper we have discussed a possible way of resource allocation on the basis of reputation management system i.e. probabilistic allocation based on reputation. This seems to be a better way for allocation of resources because in this case nodes that don’t...

Qualitative probabilistic reasoning in a Bayesian network often reveals tradeoffs: relationships that are ambiguous due to competing qualitative influences. We present two techniques that combine qualitative and numeric probabilistic reasoning to resolve such tradeoffs, inferring the qualitative relationship between nodes in a Bayesian network. The first approach incrementally marginalizes node...

We present a probabilistic cost model to analyze the performance of the kd-tree for nearest neighbor search in the context of content-based image retrieval. Our cost model measures the expected number of kd-tree nodes traversed during the search query. We show that our cost model has high correlations with both the observed number of traversed nodes and the runtime performance of search queries...

The IEEE 802.11 MAC layer is known for its low performances in wireless ad hoc networks. For instance, it has been shown in the literature that two independent emitters nodes can easily monopolize the medium, preventing other nodes to send packets. The protocol we introduce in this article is a simple variation of the original IEEE 802.1 1 MAC layer which significantly increases the fairness wh...

Broadcasting is a fundamental and effective data dissemination mechanism, which has several applications such as route discovery, address resolution, as well as many other network services. While data broadcasting has many advantages, it induces some difficulties known as broadcast storm problems, which are natural consequences of redundant retransmission, collision, and contention. Data broadc...

This paper reports on a probabilistic method for traffic engineering (specifically routing and resource allocation) in backbone networks, where the transport is the main service and robustness to the unexpected changes in network parameters is required. We analyze the network using the probabilistic betweenness of the network nodes (or links). The theoretical results lead to the definition of ”...

A wireless node is called isolated if it has no links to other nodes. The number of isolated nodes in a wireless network is an important connectivity index. However, most previous works on analytically determining the number of isolated nodes were not based on practical channel models. In this work, we study this problem using a generic probabilistic channel model that can capture the behaviors...

Power dissipation in a VLSI circuit poses a serious challenge in present and future VLSI design. A switching model for the data dependent behavior of the transistors is essential to model dynamic, load-dependent active power and also leakage power in active mode the two components of power in a VLSI circuit. A probabilistic Bayesian network based switching model can explicitly model all spatio-...

In probabilistic inference for signal processing, medical diagnosis, code theory, digital communication, machine learning and so on, belief propagation (BP) is one of powerful approximate methods to calculate a belief for each node within a practical computational time[1]. Recently, it has been pointed out that the BP has some mathematical structures in common with advanced mean-field (MF) meth...

Recently, mobile context inference becomes an important issue. Bayesian probabilistic model is one of the most popular probabilistic approaches for context inference. It efficiently represents and exploits the conditional independence of propositions. However, there are some limitations for probabilistic context inference in mobile devices. Mobile devices relatively lacks of sufficient memory. ...