Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

University of Denver

Peer-to-peer

Publication Year

Articles 1 - 2 of 2

Full-Text Articles in Physical Sciences and Mathematics

A Location Aware P2p Voice Communication Protocol For Networked Virtual Environments, Gabor Papp Jan 2010

A Location Aware P2p Voice Communication Protocol For Networked Virtual Environments, Gabor Papp

Electronic Theses and Dissertations

Multiparty voice communication, where multiple people can communicate in a group, is an important component of networked virtual environments (NVEs), especially in many types of online games. While most research has been conducted on one-to-one communication, we focus on group communication. In this dissertation, we present the first measurement study on the characteristics of multiparty voice communications and develop a model of the talking and silence periods observed during multiparty communication. Over a total of 5 months, we measured over 11,000 sessions on an active multi-party voice communication server to quantify the characteristics of communication generated by game players, including …


Routing In The Dark: Pitch Black, Nathan S. Evans Jun 2009

Routing In The Dark: Pitch Black, Nathan S. Evans

Electronic Theses and Dissertations

In many networks, such as mobile ad-hoc networks and friend-to-friend overlay networks, direct communication between nodes is limited to specific neighbors. Friendto-friend “darknet” networks have been shown to commonly have a small-world topology; while short paths exist between any pair of nodes in small-world networks, it is non-trivial to determine such paths with a distributed algorithm. Recently, Clarke and Sandberg proposed the first decentralized routing algorithm that achieves efficient routing in such small-world networks.

Herein this thesis we discuss the first independent security analysis of Clarke and Sandberg’s routing algorithm. We show that a relatively weak participating adversary can render …