Essays on peer-to-peer resource allocation and caching mechanisms in computer networks

This dissertation deals with two important research problems in computer networks: resource allocation and caching. It consists of three essays in the broad research areas mentioned above. Essay 1 presents a pricing and allocation mechanism for peer-to-peer (P2P) networks. A P2P system can be defined as one where networked resources work together as peers, without the presence of dedicated servers or centralized administration. Essay 1 presents a mechanism that allows users to share their computing resources in a decentralized P2P network setting. Analytical research methods based on economics and operations research (OR) are utilized in this study. Essays 2 and 3 deal with caching. Caching is a technology that is used for reducing the delays experienced by users while accessing objects on the web. It involves storing copies of objects in locations that are relatively close to the user, thus allowing user requests to be served faster than if they were served directly from the web server. Essay 2 presents a new approach for a proxy-level caching mechanism. In this study we develop an integrated caching mechanism that utilizes both historically and currently observed request occurrences in order to reduce communication delays. Essay 2 employs both empirical and analytical tools in its research methodology. Essay 3 presents a mechanism for a network of cooperative proxy caches. In this study we investigate how proxy caches connected as a network can cooperate effectively in order to reduce user request delays. Essay 3 uses analytical research methods based on game theory and OR.