These are academic papers and articles produced by the members of the Peerialism team.
Description or abstract
Cloud computing – gå på moln eller tankar i det blå
March 2, 2009
Cloud computing has for the past few years been a buzz word. The advantages are supposedly undeniable. Many companies provide advanced services based on cloud computing which is said to increase efficiency and security at the same or lower cost. Some claim that it is a new way to relate to the Internet, perhaps even to data management overall.
This is an attempt to describe what differentiates cloud computing from other phenomena, to give an overview of a number of ongoing debates, and to propose plausible future developments. (In Swedish.)
NATCracker: NAT Combinations Matter
May 15, 2009
Published at the 18th International Conference on Computer Communications and Networks (ICCCN 2009). Abstract:
In this paper, we report our experience in working with Network Address Translators (NATs). Traditionally, there were only 4 types of NATs. For each type, the (im)possibility of traversal is well-known. Recently, the NAT community has provided a deeper dissection of NAT behaviors resulting into at least 27 types and documented the (im)possibility of traversal for some types. There are, however, two fundamental issues that were not previously tackled by the community. First, given the more elaborate set of behaviors, it is incorrect to reason about traversing a single NAT, instead combinations must be considered and we have not found any study that comprehensively states, for every possible combination, whether direct connectivity with no relay is feasible. Such a statement is the first outcome of the paper. Second, there is a serious need for some kind of formalism to reason about NATs which is a second outcome of this paper. The results were obtained using our own scheme which is an augmentation of currently-known traversal methods. The scheme is validated by reasoning using our formalism, simulation and implementation in a real P2P network.
MyP2PWorld: Highly Reproducible Application-level Emulation of P2P Systems
Roberto Roverso, Mohammed Al-Aggan, Amgad Naiem, Andreas Dahlström, Sameh El-Ansary, Mohammed El-Beltagy, Seif Haridi
November 21, 2008
In this paper, we describe an application-level emulator for P2P systems with a special focus on high reproducibility. We achieve reproduciblity by taking control over the scheduling of concurrent events from the operating system. We accomplish that for inter- and intra- peer concurrency. The development of the system was driven by the need to enhance the testing process of an already-developed industrial product. Therefore, we were constrained by the architecture of the overlying application. However, we managed to provide highly transparent emulation by wrapping standard/widely-used networking and concurrency APIs. The resulting environment has proven to be useful in a production environment. At this stage, it started to be general enough to be used in the testing process of applications other than the one it was created to test.