Proceedings of the 28th ACM symposium on Principles of distributed computing
Modeling of network computing systems for decision tree induction tasks
IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
A case for content distribution in peer-to-peer networks
AMT'10 Proceedings of the 6th international conference on Active media technology
Towards microeconomic resources allocation in overlay networks
AMT'10 Proceedings of the 6th international conference on Active media technology
Journal of Parallel and Distributed Computing
A non-strategic microeconomic model for single-service multi-rate application layer multicast
ICICA'10 Proceedings of the First international conference on Information computing and applications
An economic case for end system multicast
FIS'10 Proceedings of the Third future internet conference on Future internet
Modeling and optimization of survivable P2P multicasting
Computer Communications
Optimizing distributed computing workflows in heterogeneous network environments
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Evolutionary algorithm for P2P multicasting network design problem
HAIS'11 Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part I
On modelling of fair throughput allocation in overlay multicast networks
NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking
Toward microeconomic allocation of resources in multi-service overlay networks
Journal of Computer and Systems Sciences International
1+1 protection of overlay distributed computing systems: modeling and optimization
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part IV
Scheduling and capacity design in overlay computing systems
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part IV
| Hi-index | 0.00 |
Overlay networks are virtual networks residing overthe IP network, consequently, overlay links may share hiddenl ower-level bottlenecks. Previous work have assumed an independent overlay model: a graph with independent link capacities.We introduce a model of overlays which incorporates correlated link capacities and linear capacity constraints (LCC) to formulate hidden shared bottlenecks; we refer to these as LCC-overlays. We define metrics to qualitatively measure overlay quality in terms of its accuracy (in representing the true network topology) and efficiency (i.e., performance). Through analysis and simulations,we show that LCC-overlay is perfectly accurate and hence enjoys much higher efficiency than the inaccurate independent overlay. We discover that even a highly restricted LCC class — node basedLCC— yields near-optimal accuracy and significantly higher efficiency. We study two network flow problems in the context of LCC-graphs: Widest-Path and Maximum-Flow. Weprove that Widest-Path with LCC is NP-complete. We formulate Maximum-Flow with LCC as a linear program, and propose an efficient distributed algorithm to solve it. Based on the LCCmodel, we further study the problem of optimizing delay while still maintaining optimal or near-optimal bandwidth. We also outline a distributed algorithm to efficiently construct an overlay with node-based LCC.