DESIGN AND SIMULATION OF CACHE UPDATING FOR THE DYNAMIC SOURCE ROUTING PROTOCOL

ABSTRACT
On-demand routing protocols use route caches to make routing decisions. Due to mobility, cached routes easily become stale. To address the cache staleness issue, prior work in DSR used heuristics with ad hoc parameters to predict the lifetime of a link or a route. However, heuristics cannot accurately estimate timeouts because topology changes are unpredictable. In this paper, we propose proactively disseminating the broken link information to the nodes that have that link in their caches. We define a new cache structure called a cache table and present a distributed cache update algorithm. Each node maintains in its cache table the information necessary for cache updates. When a link failure is detected, the algorithm notifies all reachable nodes that have cached the link in a distributed manner. The algorithm does not use any ad hoc parameters, thus making route caches fully adaptive to topology changes. We show that the algorithm outperforms DSR with path caches and with Link-MaxLife, an adaptive timeout mechanism for link caches. We conclude that proactive cache updating is key to the adaptation of on-demand routing protocols to mobility

TABLE OF CONTENTS
TITLE PAGE
CERTIFICATION
DEDICATION 
ACKNOWLEDGEMENT 
ORGANIZATION OF WORK
ABSTRACT
TABLE OF CONTENT

CHAPTER ONE 
1.0INTRODUCTION 
1.1STATEMENT OF THE PROBLEM 
1.2PURPOSE OF THE STUDY
1.3AIM AND OBJECTIVES 
1.4SCOPE OF STUDY
1.5CONSTRAINTS 
1.6ASSUMPTION
1.7DEFINITION OF TERMS

CHAPTER TWO
2.0LITERATURE REVIEW

CHAPTER THREE
3.0DESCRIPTION AND ANALYSIS OF THE EXISTING SYSTEM 
3.1FACT FINDING METHODS USED 
3.11REFERENCES TO WRITTEN DOCUMENT
3.1.2BROWSING OF INTERNET
3.2INPUT, PROCESS, OUTPUT ANALYSIS
3.2.1INPUT, ANALYSIS
3.2.2INPUT FORMAT
3.2.3PROCESS,  ANALYSIS
3.2.4OUTPUT, ANALYSIS
3.2.5INPUT FORMAT
3.3PROBLEM OF THE EXISTING SYSTEM
3.4OBJECTIVE OF THE EXISTING SYSTEM
3.5JUSTIFICATION OF THE NEW EXISTING SYSTEM

CHAPTER FOUR 
4.0THE DESIGN OF THE NEW SYSTEM 
4.1OUTPUT SPECIFICATION AND DESIGN
4.2INPUT SPECIFICATION AND DESIGN
4.3FILE DESIGN
4.4FILE STRUCTURE
4.5PROCEDURE CHART
4.6SYSTEM FLOWCHART
4.7SYSTEM REQUIREMENT
4.71HARDWARE REQUIREMENT
4.72SOFT WARE REQUIREMENT
 5.0IMPLEMENTATION 
5.1PROGRAM DESIGN
5.2PSEUDO CODE
5.3PROGRAM FLOWCHART
6.0DOCUMENTATION
6.1CHOICE OF LANGUAGE
6.2LANGUAGE INTRODUCTION
6.3CHANGE OVER METHOD
7.0CHAPTER FIVE
8.0CONCLUSION
7.1RECOMMENDATION
BIBLIOGRAPHY 
Subscribe to access this work and thousands more
Overall Rating

0

5 Star
(0)
4 Star
(0)
3 Star
(0)
2 Star
(0)
1 Star
(0)
APA

Possibility, A. (2018). DESIGN AND SIMULATION OF CACHE UPDATING FOR THE DYNAMIC SOURCE ROUTING PROTOCOL. Afribary. Retrieved from https://afribary.com/works/design-and-simulation-of-cache-updating-for-the-dynamic-source-routing-protocol-1717

MLA 8th

Possibility, Aka "DESIGN AND SIMULATION OF CACHE UPDATING FOR THE DYNAMIC SOURCE ROUTING PROTOCOL" Afribary. Afribary, 29 Jan. 2018, https://afribary.com/works/design-and-simulation-of-cache-updating-for-the-dynamic-source-routing-protocol-1717. Accessed 14 Apr. 2024.

MLA7

Possibility, Aka . "DESIGN AND SIMULATION OF CACHE UPDATING FOR THE DYNAMIC SOURCE ROUTING PROTOCOL". Afribary, Afribary, 29 Jan. 2018. Web. 14 Apr. 2024. < https://afribary.com/works/design-and-simulation-of-cache-updating-for-the-dynamic-source-routing-protocol-1717 >.

Chicago

Possibility, Aka . "DESIGN AND SIMULATION OF CACHE UPDATING FOR THE DYNAMIC SOURCE ROUTING PROTOCOL" Afribary (2018). Accessed April 14, 2024. https://afribary.com/works/design-and-simulation-of-cache-updating-for-the-dynamic-source-routing-protocol-1717

Document Details
Field: Computer Science Type: Project 48 PAGES (4230 WORDS) (rtf)