Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Architecture for a non-deterministic simulation machine
Proceedings of the 30th conference on Winter simulation
SensorSim: a simulation framework for sensor networks
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Parallel rendering with k-way replication
PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
A taxonomy and survey of grid resource management systems for distributed computing
Software—Practice & Experience
SETI@home: an experiment in public-resource computing
Communications of the ACM
A Comparison among Grid Scheduling Algorithms for Independent Coarse-Grained Tasks
SAINT-W '04 Proceedings of the 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops)
Grid resource management: state of the art and future trends
Grid resource management: state of the art and future trends
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Peer to Peer Computing: The Evolution of a Disruptive Technology
Peer to Peer Computing: The Evolution of a Disruptive Technology
Missing Piece Issue and Upload Strategies in Flashcrowds and P2P-assisted Filesharing
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
GTapestry: A Locality-Aware Overlay Network for High Performance Computing
ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
Future Generation Computer Systems
Resource allocation on computational grids using a utility model and the knapsack problem
Future Generation Computer Systems
Enhancing end-to-end availability and performance via topology-aware overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
RTNS: an NS-2 extension to simulate wireless real-time distributed systems for structured topologies
WICON '07 Proceedings of the 3rd international conference on Wireless internet
Wireless Multicast Support for the NS-2 Emulation Environment
MASCOTS '07 Proceedings of the 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
A Hybrid Framework for Soft Real-Time WSN Simulation
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
A flexible object-oriented design of an event-driven wireless network simulator
WTS'09 Proceedings of the 2009 conference on Wireless Telecommunications Symposium
NS Simulator for Beginners
High throughput computing over peer-to-peer networks
Future Generation Computer Systems
Future Generation Computer Systems
| Hi-index | 0.00 |
A distributed computing system is able to perform data computation and distribution of results at the same time. The input task is divided into blocks, which are then sent to system participants that offer their resources in order to perform calculations. Next, a partial result is sent back by the participants to the task manager (usually one central node). In the case when system participants want to get the final result, the central node may become overloaded, especially if many nodes request the result at the same time. In this paper we propose a novel distributed computation system, which does not use the central node as the source of the final result, but assumes that partial results are sent between system participants. This way we avoid overloading the central node, as well as network congestion. There are two major types of distributed computing systems: grids and Peer-to-Peer (P2P) computing systems. In this work we focus on the latter case. Consequently, we assume that the computing system works on the top of an overlay network. We present a complete description of the P2P computing system, considering both computation and result distribution. To verify the proposed architecture we develop our own simulator. The obtained results show the system performance expressed by the operation cost for various types of network flows: unicast, anycast and Peer-to-Peer. Moreover, the simulations prove that our computing system provides about 66% lower cost compared to a centralized computing system.