Project Topics Seminar Topics School of Nursing Exam PDF Sign Up
Search Topic
PARKLYN
ERVICES
· RC: 2994849
Sparklyn Minimizing File Downloading Time in Stochastic Peer to Peer Networks
WhatsApp Channel

Minimizing File Downloading Time in Stochastic Peer to Peer Networks


This page presents an excerpt of the research material, providing a comprehensive overview of the study. It includes the Preliminary Pages, Table of Contents, Abstract, Chapters One to Five, and References, making it accessible and informative for students, researchers, and other readers interested in the topic of this study. Acknowledgement is also included, expressing gratitude to the individuals, institutions, and resources that contributed to the successful completion of the research, with materials and information sourced from the online platform sparklyn.com.ng, which provided valuable academic support.


PRELIMINARY PAGES

  • Title page
  • Approval page
  • Dedication
  • Acknowledgement
  • Table of Contents
  • Abstract

CHAPTER ONE

INTRODUCTION

  • 1.1 Introduction
  • 1.2 Background of Study
  • 1.3 Statement of the Problem
  • 1.4 Aim and Objective of the Study
  • 1.5 Research Questions
  • 1.6 Research Hypothesis
  • 1.7 Significance of Study
  • 1.8 Scope of Study
  • 1.9 Limitations of the Study
  • 1.10 Operational Definition of Terms

CHAPTER TWO

LITERATURE REVIEW

  • 2.1 Introduction
  • 2.2 Conceptual Review
  • 2.3 Theoretical Framework
  • 2.4 Empirical Studies
  • 2.5 Research Gaps
  • 2.6 Summary of Literature Review

CHAPTER THREE

RESEARCH METHODOLOGY

  • 3.1 Introduction
  • 3.2 Research Design
  • 3.3 Population of Study
  • 3.4 Sampling and Sampling Technique
  • 3.5 Validation of Research Instrument
  • 3.6 Method of Data Collection
  • 3.7 Method of Data Analysis
  • 3.8 Questionnaire Administration
  • 3.9 Ethical Consideration
  • 3.10 Statistical Analysis

CHAPTER FOUR

DATA ANALYSIS, RESULT AND DISCUSSION

  • 4.1 Introduction
  • 4.2 Presentation and Analysis of Data
  • 4.3 Re-statement of Research Questions
  • 4.4 Test of Hypotheses
  • 4.5 Discussion of Findings

CHAPTER FIVE

SUMMARY, CONCLUSION AND RECOMMENDATION

  • 5.1 Introduction
  • 5.2 Summary of Findings
  • 5.3 Conclusion
  • 5.4 Recommendation
  • 5.5 Suggestion for Further Study

REFERENCES

APPENDIX A - “QUESTIONNAIRE”


ABSTRACT


The peer-to-peer (P2P) file sharing applications are becoming increasingly popular and account for more than 70% of the interneta, cs bandwidth usage. Measurement studies show that a typical download of a file can take from minutes up to several hours depending on the level of network congestion or the service capacity fluctuation. In this paper, we consider two major factors that have significant impact on average download time, namely, the spatial heterogeneity of service capacities in different source peers and the temporal fluctuation in service capacity of a single source peer. We point out that the common approach of analyzing the average download time based on average service capacity is fundamentally flawed. We rigorously prove that both spatial heterogeneity and temporal correlations in service capacity increase the average download time in P2P networks and then analyze a simple, distributed algorithm to effectively remove these negative factors, thus minimizing the average download time. We show through analysis and simulations that it outperforms most of other algorithms currently used in practice under various network configurations.



1.0 Introduction

Peer-to-peer (P2P) technology is heavily used for content distribution applications. The early model for content distribution is a centralized one, in which the service provider simply sets up a serve and every user downloads files from it. In this type of network architecture (server-client), many users have to compete for limited resources in terms of bottleneck bandwidth or processing power of a single serve. As a result, each user may receive very poor performance. From a single user perspective, the duration of a download session, or the download time for that individual user is the most often used performance metric.

P2P technology tries to solve the issue of scalability by making the system distributed. Each computer (peer) in the network can act as both a server and a client at the same time. When a peer complete downloading some files from the network, it can become a server to service other peers in the network. It is obvious that as time goes on, the service capacity of the entire network will increase die to the increase in the number of servicing peers. With this increasing service capacity, theoretical studies have shown that the average download time for each user in the network is much shorter than that of a centralized network architecture in ideal cases (2), (3). In other words, users of a P2P network should enjoy much faster download.

1.1 Statement Of Problems

Owing to:

  1. The difficulties people face in locating a web application workshop.
  2. Urgent need to contact a web application workshop at emergency time.

CHAPTER TWO

LITERATURE REVIEW


2.1 Introduction

This chapter focuses on the review of related literature. A literature review presents current knowledge, as well as theoretical and methodological contributions, related to Minimizing File Downloading Time in Stochastic Peer to Peer Networks. It documents the state of the art on the subject under study and provides a comprehensive survey of existing literature. In this research work the literature review includes the conceputal review, theoretical framework, the review of related literature …


How to Download the Complete PDF Material (Table of Contents, Abstract, Chapter 1-5, and References)


Above is a preview excerpt of the full study on “Minimizing File Downloading Time in Stochastic Peer to Peer Networks”. The complete material, including all five chapters, is available for download upon request. Get in touch with us here!

Download Material (Docx)