Optimizing Link Assignment to Enhance Service in Probabilistic Network

Berchmans, Fredrick J.; Hon, Wing-Kai; Huang, Abner C. Y.; Liu, Chih-Shan; Lo, Eric; Yau, David K. Y.

doi:10.1109/secon.2010.5508251

Cited by 2 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Berchmans et al [2] considered the problem of assigning links in probabilistic networks such that the number of satisfied clients (whose overall service success probability is met) is maximized subject to server capacity constraints. In their models, servers are given and no cost issues are considered, which is different from our problem.…”

Section: Related Workmentioning

confidence: 99%

“…However, due to unpredictable environmental effects, which make wireless channels lossy and unreliable, the success of a transmission is inherently probabilistic [3]. Motivated by this fact, probabilistic network, a well-known notion from social science, bioscience, artificial intelligence and machine learning communities, is introduced into the wireless communication community by Berchmans et al [2].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

ESPN: Efficient server placement in probabilistic networks with budget constraint

Yang

Fang

Xue

2011

2011 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

The notion of probabilistic network has been used to characterize the unpredictable environment in wireless communication networks or other unstable networks. In this paper, we are interested in the problem of placing servers in probabilistic networks subject to budget constraint, so as to maximize the expected number of servable clients that can successfully connect to a server. We study this problem in both the single-hop model and the multi-hop model. We discuss the computational complexity of this problem and show that it is NP-hard under both models. We then develop efficient approximation algorithms, which produce solutions provably close to optimal. If the costs of candidate locations are uniform, when extra budget is available in the future, the progressive feature of our algorithms allows for placing additional servers instead of relocating all the servers, while retaining the guaranteed performance. Results of extensive experiments on different topologies confirm the performance of our algorithms compared to the optimal algorithm and other heuristic algorithms.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

ESPN: Efficient server placement in probabilistic networks with budget constraint

Yang

Fang

Xue

2011

2011 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

show abstract

“…In addition, the most reliable route problem has been studied in [9,14,19] and its delay-constrained version has been studied in [21]. Recently, the problem of placing servers [22] and the problem of assigning links [23] in probabilistic wireless networks have been considered. Also, the continuous data collection schemes have been proposed in probabilistic wireless sensor networks (WSNs) [24,25].…”

Section: Introductionmentioning

confidence: 99%

On the 2-MRS Problem in a Tree with Unreliable Edges

Ding

Zhou

Chen

et al. 2013

Journal of Applied Mathematics

View full text Add to dashboard Cite

This paper extends the well-known most reliable source (1-MRS) problem in unreliable graphs to the 2-most reliable source (2-MRS) problem. Two kinds of reachable probability models of node pair in unreliable graphs are considered, that is, the superior probability and united probability. The 2-MRS problem aims to find a node pair in the graph from which the expected number of reachable nodes or the minimum reachability is maximized. It has many important applications in large-scale unreliable computer or communication networks. The #P-hardness of the 2-MRS problem in general graphs follows directly from that of the 1-MRS problem. This paper deals with four models of the 2-MRS problem in unreliable trees where every edge has an independent working probability and devises a cubic-time and quadratic-space dynamic programming algorithm, respectively, for each model.

show abstract

Optimizing Link Assignment to Enhance Service in Probabilistic Network

Cited by 2 publications

References 20 publications

ESPN: Efficient server placement in probabilistic networks with budget constraint

ESPN: Efficient server placement in probabilistic networks with budget constraint

On the 2-MRS Problem in a Tree with Unreliable Edges

Contact Info

Product

Resources

About