Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSimplified Biased Contribution Index (SBCI): A Mechanism to Make P2P Network Fair and Efficient for Resource Sharing
388
0
0.0
(
0
)
Added by
Sateesh Awasthi Kumar
Publication date
2017
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
To balance the load and to discourage the free-riding in peer-to-peer (P2P) networks, many incentive mechanisms and policies have been proposed in recent years. Global peer ranking is one such mechanism. In this mechanism, peers are ranked based on a metric called contribution index. Contribution index is defined in such a manner that peers are motivated to share the resources in the network. Fairness in the terms of upload to download ratio in each peer can be achieved by this method. However, calculation of contribution index is not trivial. It is computed distributively and iteratively in the entire network and requires strict clock synchronization among the peers. A very small error in clock synchronization may lead to wrong results. Furthermore, iterative calculation requires a lot of message overhead and storage capacity, which makes its implementation more complex. In this paper, we are proposing a simple incentive mechanism based on the contributions of peers, which can balance the upload and download amount of resources in each peer. It does not require iterative calculation, therefore, can be implemented with lesser message overhead and storage capacity without requiring strict clock synchronization. This approach is efficient as there are very less rejections among the cooperative peers. It can be implemented in a truly distributed fashion with $O(N)$ time complexity per peer.
rate research
Read More
To maintain fairness, in the terms of resources shared by an individual peer, a proper incentive policy is required in a peer to peer network. This letter proposes, a simpler mechanism to rank the peers based on their resource contributions to the network. This mechanism will suppress the free riders from downloading the resources from the network. Contributions of the peers are biased in such a way that it can balance the download and upload amount of resources at each peer. This mechanism can be implemented in a distributed system and it converges much faster than the other existing approaches.
In 5G and Beyond networks, Artificial Intelligence applications are expected to be increasingly ubiquitous. This necessitates a paradigm shift from the current cloud-centric model training approach to the Edge Computing based collaborative learning scheme known as edge learning, in which model training is executed at the edge of the network. In this article, we first introduce the principles and technologies of collaborative edge learning. Then, we establish that a successful, scalable implementation of edge learning requires the communication, caching, computation, and learning resources (3C-L) of end devices and edge servers to be leveraged jointly in an efficient manner. However, users may not consent to contribute their resources without receiving adequate compensation. In consideration of the heterogeneity of edge nodes, e.g., in terms of available computation resources, we discuss the challenges of incentive mechanism design to facilitate resource sharing for edge learning. Furthermore, we present a case study involving optimal auction design using Deep Learning to price fresh data contributed for edge learning. The performance evaluation shows the revenue maximizing properties of our proposed auction over the benchmark schemes.
We study a fair resource sharing problem, where a set of resources are to be shared among a set of agents. Each agent demands one resource and each resource can serve a limited number of agents. An agent cares about what resource they get as well as the externalities imposed by their mates, whom they share the same resource with. Apparently, the strong notion of envy-freeness, where no agent envies another for their resource or mates, cannot always be achieved and we show that even to decide the existence of such a strongly envy-free assignment is an intractable problem. Thus, a more interesting question is whether (and in what situations) a relaxed notion of envy-freeness, the Pareto envy-freeness, can be achieved: an agent i envies another agent j only when i envies both the resource and the mates of j. In particular, we are interested in a dorm assignment problem, where students are to be assigned to dorms with the same capacity and they have dichotomous preference over their dorm-mates. We show that when the capacity of the dorms is 2, a Pareto envy-free assignment always exists and we present a polynomial-time algorithm to compute such an assignment; nevertheless, the result fails to hold immediately when the capacities increase to 3, in which case even Pareto envy-freeness cannot be guaranteed. In addition to the existential results, we also investigate the implications of envy-freeness on proportionality in our model and show that envy-freeness in general implies approximations of proportionality.
The $alpha$-fair resource allocation problem has received remarkable attention and has been studied in numerous application fields. Several algorithms have been proposed in the context of $alpha$-fair resource sharing to distributively compute its value. However, little work has been done on its structural properties. In this work, we present a lower bound for the optimal solution of the weighted $alpha$-fair resource allocation problem and compare it with existing propositions in the literature. Our derivations rely on a localization property verified by optimization problems with separable objective that permit one to better exploit their local structures. We give a local version of the well-known midpoint domination axiom used to axiomatically build the Nash Bargaining Solution (or proportionally fair resource allocation problem). Moreover, we show how our lower bound can improve the performances of a distributed algorithm based on the Alternating Directions Method of Multipliers (ADMM). The evaluation of the algorithm shows that our lower bound can considerably reduce its convergence time up to two orders of magnitude compared to when the bound is not used at all or is simply looser.
Decentralized cryptocurrency systems, known as blockchains, have shown promise as infrastructure for mutually distrustful parties to agree on transactions safely. However, Bitcoin-derived blockchains and their variants suffer from the limitations of the CAP Trilemma, which is difficult to be solved through optimizing consensus protocols. Moreover, the P2P network of blockchains have problems in efficiency and reliability without considering the matching of physical and logical topologies. For the CAP Trilemma in consortium blockchains, we propose a physical topology based on the multi-dimensional hypercube with excellent partition tolerance in probability. On the other hand, the general hypercube has advantages in solving the mismatch problems in P2P networks. The general topology is further extended to a hierarchical recursive topology with more medium links or short links to balance the reliability requirements and the costs of physical network. We prove that the hypercube topology has better partition tolerance than the regular rooted tree topology and the ring lattice topology, and effectively fits the upper-layer protocols. As a result, blockchains constructed by the proposed topology can reach the CAP guarantee bound through adopting the proper transmission and the consensus protocols protocols that have strong consistency and availability.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
