Relevant bibliographies by topics / Route caching

Academic literature on the topic 'Route caching'

Author: Grafiati
Published: 4 June 2021
Last updated: 29 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Route caching.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Route caching"

1

Kim, Junghwan, Myeong-Cheol Ko, Jinsoo Kim, and Moon Sun Shin. "Route Prefix Caching Using Bloom Filters in Named Data Networking." Applied Sciences 10, no. 7 (March 25, 2020): 2226. http://dx.doi.org/10.3390/app10072226.

Full text
Abstract:
This paper proposes an elaborate route prefix caching scheme for fast packet forwarding in named data networking (NDN) which is a next-generation Internet structure. The name lookup is a crucial function of the NDN router, which delivers a packet based on its name rather than IP address. It carries out a complex process to find the longest matching prefix for the content name. Even the size of a name prefix is variable and unbounded; thus, the name lookup is to be more complicated and time-consuming. The name lookup can be sped up by using route prefix caching, but it may cause a problem when non-leaf prefixes are cached. The proposed prefix caching scheme can cache non-leaf prefixes, as well as leaf prefixes, without incurring any problem. For this purpose, a Bloom filter is kept for each prefix. The Bloom filter, which is widely used for checking membership, is utilized to indicate the branch information of a non-leaf prefix. The experimental result shows that the proposed caching scheme achieves a much higher hit ratio than other caching schemes. Furthermore, how much the parameters of the Bloom filter affect the cache miss count is quantitatively evaluated. The best performance can be achieved with merely 8-bit Bloom filters and two hash functions.
APA, Harvard, Vancouver, ISO, and other styles
2

Xueyan Tang and S. T. Chanson. "Coordinated en-route Web caching." IEEE Transactions on Computers 51, no. 6 (June 2002): 595–607. http://dx.doi.org/10.1109/tc.2002.1009146.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gharaibeh, Ammar, Abdallah Khreishah, Issa Khalil, and Jie Wu. "Distributed Online En-Route Caching." IEEE Transactions on Parallel and Distributed Systems 27, no. 12 (December 1, 2016): 3455–68. http://dx.doi.org/10.1109/tpds.2016.2547396.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Branke, Jürgen, Pablo Funes, and Frederik Thiele. "Evolutionary design of en-route caching strategies." Applied Soft Computing 7, no. 3 (June 2007): 890–98. http://dx.doi.org/10.1016/j.asoc.2006.04.003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Bo, and Jian Yun. "State of Art Techniques in En-Route Caching." Advanced Materials Research 121-122 (June 2010): 1018–22. http://dx.doi.org/10.4028/www.scientific.net/amr.121-122.1018.

Full text
Abstract:
The World Wide Web has been considered as a large distributed information system based development and use of computer technology that both provide access to shared data objects. En-Cache techniques are important for reducing Internet access latency, network traffic, and server load in different networks. In this paper, we survey the state-of-art techniques used in En-route Caching and discuss the recent development.
APA, Harvard, Vancouver, ISO, and other styles
6

Shen, Hong, and Shihong Xu. "Coordinated En-Route Web Caching in Multiserver Networks." IEEE Transactions on Computers 58, no. 5 (May 2009): 605–19. http://dx.doi.org/10.1109/tc.2008.162.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Akinwande, Olumide. "Interest Forwarding in Named Data Networking Using Reinforcement Learning." Sensors 18, no. 10 (October 8, 2018): 3354. http://dx.doi.org/10.3390/s18103354.

Full text
Abstract:
In-network caching is one of the key features of information-centric networks (ICN), where forwarding entities in a network are equipped with memory with which they can temporarily store contents and satisfy en route requests. Exploiting in-network caching, therefore, presents the challenge of efficiently coordinating the forwarding of requests with the volatile cache states at the routers. In this paper, we address information-centric networks and consider in-network caching specifically for Named Data Networking (NDN) architectures. Our proposal departs from the forwarding algorithms which primarily use links that have been selected by the routing protocol for probing and forwarding. We propose a novel adaptive forwarding strategy using reinforcement learning with the random neural network (NDNFS-RLRNN), which leverages the routing information and actively seeks new delivery paths in a controlled way. Our simulations show that NDNFS-RLRNN achieves better delivery performance than a strategy that uses fixed paths from the routing layer and a more efficient performance than a strategy that retrieves contents from the nearest caches by flooding requests.
APA, Harvard, Vancouver, ISO, and other styles
8

WANG, Sen, Jun BI, and Jianping WU. "CRRP: Cost-Based Replacement with Random Placement for En-Route Caching." IEICE Transactions on Information and Systems E97.D, no. 7 (2014): 1914–17. http://dx.doi.org/10.1587/transinf.e97.d.1914.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

LI, Chun-Hong, Guo-Fu FENG, Tie-Cheng GU, Sang-Lu LU, and Dao-Xu CHEN. "Optimal Placement and Replacement Scheme in En-Route Transcoding Caching Systems." Journal of Software 19, no. 4 (March 25, 2010): 956–66. http://dx.doi.org/10.3724/sp.j.1001.2008.00956.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

LI, K. "Optimal Methods for Proxy Placement in Coordinated En-Route Web Caching." IEICE Transactions on Communications E88-B, no. 4 (April 1, 2005): 1458–66. http://dx.doi.org/10.1093/ietcom/e88-b.4.1458.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Route caching"

1

Xu, Sanlin, and SanlinXu@yahoo com. "Mobility Metrics for Routing in MANETs." The Australian National University. Faculty of Engineering and Information Technology, 2007. http://thesis.anu.edu.au./public/adt-ANU20070621.212401.

Full text
Abstract:
A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without the need for base stations or any other pre–existing network infrastructure. In a peer-to-peer fashion, mobile nodes can communicate with each other by using wireless multihop communication. Due to its low cost, high flexibility, fast network establishment and self-reconfiguration, ad hoc networking has received much interest during the last ten years. However, without a fixed infrastructure, frequent path changes cause significant numbers of routing packets to discover new paths, leading to increased network congestion and transmission latency over fixed networks. Many on-demand routing protocols have been developed by using various routing mobility metrics to choose the most reliable routes, while dealing with the primary obstacle caused by node mobility. ¶ In the first part, we have developed an analysis framework for mobility metrics in random mobility model. Unlike previous research, where the mobility metrics were mostly studied by simulations, we derive the analytical expressions of mobility metrics, including link persistence, link duration, link availability, link residual time, link change rate and their path equivalents. We also show relationships between the different metrics, where they exist. Such exact expressions constitute precise mathematical relationships between network connectivity and node mobility. ¶ We further validate our analysis framework in Random Walk Mobility model (RWMM). Regarding constant or random variable node velocity, we construct the transition matrix of Markov Chain Model through the analysis of the PDF of node separation after one epoch. In addition, we present intuitive and simple expressions for the link residual time and link duration, for the RWMM, which relate them directly to the ratio between transmission range and node speed. We also illustrate the relationship between link change rate and link duration. Finally, simulation results for all mentioned mobility metrics are reported which match well the proposed analytical framework. ¶ In the second part, we investigate the mobility metric applications on caching strategies and hierarchy routing algorithm. When on-demand routing employed, stale route cache information and frequent new-route discovery in processes in MANETs generate considerable routing delay and overhead. This thesis proposes a practical route caching strategy to minimize routing delay and/or overhead by setting route cache timeout to a mobility metric, the expected path residual time. The strategy is independent of network traffic load and adapts to various non-identical link duration distributions, so it is feasible to implement in a real-time route caching scheme. Calculated results show that the routing delay achieved by the route caching scheme is only marginally more than the theoretically determined minimum. Simulation in NS-2 demonstrates that the end-to-end delay from DSR routing can be remarkably reduced by our caching scheme. By using overhead analysis model, we demonstrate that the minimum routing overhead can be achieved by increasing timeout to around twice the expected path residual time, without significant increase in routing delay. ¶ Apart from route cache, this thesis also addresses link cache strategy which has the potential to utilize route information more efficiently than a route cache scheme. Unlike some previous link cache schemes delete links at some fixed time after they enter the cache, we proposes using either the expected path duration or the link residual time as the link cache timeout. Simulation results in NS-2 show that both of the proposed link caching schemes can improve network performance in the DSR by reducing dropped data packets, latency and routing overhead, with the link residual time scheme out-performing the path duration scheme. ¶ To deal with large-scale MANETs, this thesis presents an adaptive k-hop clustering algorithm (AdpKHop), which selects clusterhead (CH) by our CH selection metrics. The proposed CH selection criteria enable that the chosen CHs are closer to the cluster centroid and more stable than other cluster members with respect to node mobility. By using merging threshold which is based on the CH selection metric, 1-hop clusters can merge to k-hop clusters, where the size of each k-hop cluster adapts to the node mobility of the chosen CH. Moreover, we propose a routing overhead analysis model for k-hop clustering algorithm, which is determined by a range of network parameters, such as link change rate (related to node mobility), node degree and cluster density. Through the overhead analysis, we show that an optimal k-hop cluster density does exist, which is independent of node mobility. Therefore, the corresponding optimal cluster merging threshold can be employed to efficiently organise k-hop clusters to achieve minimum routing overhead, which is highly desirable in large-scale networks. ¶ The work presented in this thesis provides a sound basis for future research on mobility analysis for mobile ad hoc networks, in aspects such as mobility metrics, caching strategies and k-hop clustering routing protocols.
APA, Harvard, Vancouver, ISO, and other styles
2

Shakya, Rosish. "Optimal Placement of Video Caching Routers for Minimization of Retransmission Delay." University of Akron / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=akron1306429551.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Burgess, Jasen Lewis School of History UNSW. "The origins of the banlieue rouge: politics, local government and communal identity in Arcueil and Cachan, 1919-1958." Awarded by:University of New South Wales. School of History, 2005. http://handle.unsw.edu.au/1959.4/23345.

Full text
Abstract:
By elucidating the origins of the banlieue rouge, a belt of communist-dominated suburbs surrounding Paris that arose during the interwar years and reached its apogee under the Fourth Republic, this thesis addresses the problem of why twentieth-century France was home to a pro-Soviet communist party with mass support. Specifically, a local study of the PCF in Arcueil and Cachan, two neighbouring communes south of Paris with divergent political evolutions since World War I, is used to discern how and why the Parti communiste fran??ais (PCF) came to exert hegemony in the working-class suburbs of Paris. After surveying the historiography of communism in France and beyond, this thesis concludes that the communist banlieue rouge was born of working-class alienation from bourgeois society that was nourished by a communist counter-society that was contingent upon the PCF???s capacity to adapt and respond to local circumstances. Using archival sources and statistical analysis, it demonstrates that in Arcueil and Cachan rapid suburbanisation and an attendant proletarianisation created the pre-conditions for the rise of the PCF. This study finds that during the interwar period the PCF rapidly emerged as an electoral force in both suburbs as it set about laying the foundations of a communist counter-society, especially in Arcueil where it won control of local government in 1935. In Arcueil, the PCF spearheaded the local Resistance movement during World War II and then under the Fourth Republic went on to consolidate a nascent communist communal identity, while in Cachan its influence fell victim to Cold War politics. The pre-conditions for the rise of communism were apparent earlier and to a greater degree in Arcueil, an industrialised, working-class suburb with long-standing radical traditions, than in the traditionally conservative Cachan. In Arcueil, the PCF was more successful than its counterpart in Cachan at exploiting an alienation that was not only part of the deep-seated historical traditions of the French working class but was also part of everyday life f or workers forced to live in miserable conditions. In suburbs such as Arcueil, suburban working-class pride at being a social outcast was conflated with communism to create a durable communist communal identity.
APA, Harvard, Vancouver, ISO, and other styles
4

Shyu, Woei-Luen, and 徐偉倫. "Architecture Design and Performance Analysis of Internet Route Caching." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/34019318673127447298.

Full text
Abstract:
博士
國立中正大學
電機工程研究所
93
Things usually obey the 20/80 rule, the Pareto Principle, which means that relatively few of components account for relatively most of overall activity. If we can accelerate the activity of these intense components, the overall throughput can be significantly improved. In the activity of routing lookups in network routers, we also observe this 20/80 rule: relatively most of network packets are toward relatively few of destination addresses. Therefore, assume the results of routing lookups are changed infrequently. By caching routing results in fast storage for future reuse, we can efficiently amortize the cost of routing-lookups over subsequently arrived packets and provide short average routing-lookup time. In particular, the assumption of infrequent changes can be relaxed. Moreover, in recent years, the lookup speed of Content Address Memory (CAM), a hardware solution for IP caching, is greatly improved. So CAM is a good candidate for “lightweight” routing-lookup modules on input line-cards in parallelism router architecture, especially if lightweight modules can efficiently share a “full” module. In this dissertation, we start from discussing the design considerations for routing caches of network routes. Then we collect two backbone traffic traces, and analyze the temporal locality in them to know how to exploit it efficiently. Next, several cache replacement algorithms, including FIFO, LRU, random, and a proposed LFU implementation alternative with three schemes, are investigated by trace-driven simulations. Especially, their efficiency and robustness are severely tested under the worst case scenarios. Furthermore, we propose aligned-ancestor poisoning (AAP) and aligned-prefix caching (APC) to enhance IP caching. AAP is a marking scheme for tree-based routing tables. With limited additional routing overhead, routing results carry singleton information, which indicates whether predefined aligned prefixes are cacheable or not. APC is a caching scheme to utilize such routing results. To properly configure AAP and APC, we further investigate the relationship between network packets and referred singleton prefixes. Our trace-driven simulations show that our schemes can significantly reduce the required cache, compared with the conventional caching schemes.
APA, Harvard, Vancouver, ISO, and other styles
5

Xu, Sanlin. "Mobility Metrics for Routing in MANETs." Phd thesis, 2007. http://hdl.handle.net/1885/49272.

Full text
Abstract:
A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without the need for base stations or any other pre–existing network infrastructure. In a peer-to-peer fashion, mobile nodes can communicate with each other by using wireless multihop communication. Due to its low cost, high flexibility, fast network establishment and self-reconfiguration, ad hoc networking has received much interest during the last ten years. However, without a fixed infrastructure, frequent path changes cause significant numbers of routing packets to discover new paths, leading to increased network congestion and transmission latency over fixed networks. Many on-demand routing protocols have been developed by using various routing mobility metrics to choose the most reliable routes, while dealing with the primary obstacle caused by node mobility. ¶ In the first part, we have developed an analysis framework for mobility metrics in random mobility model. ... ¶ In the second part, we investigate the mobility metric applications on caching strategies and hierarchy routing algorithm. ...
APA, Harvard, Vancouver, ISO, and other styles
6

Xu, Qingfeng. "Router buffering and caching techniques for multi-session reliable multicast." Thesis, 2003. http://spectrum.library.concordia.ca/1930/1/MQ77978.pdf.

Full text
Abstract:
Reliable multicast has been studied extensively during the past 10 years. Recently, several reliable multicast schemes employing router assistance have been proposed, which not only promise performance gains, but also simplify applications. But the existing schemes based on router assistance didn't consider either simultaneous multiple sessions in network, or the problem of how to share the forwarding buffer of router outgoing port and partition the router cache for multiple multicast sessions so that a better performance of reliable multicast can be achieved. Our work is an attempt to address some of these problems. In this thesis, we consider a multi-session multicast network and the data caching technique at router for loss recovery. Several policies of router forwarding buffer allocation and router cache partition are introduced for use in the multi-session multicast network. The effect of these policies on the performance of reliable multicast is tested, compared and analyzed. Additionally, the performance of the ARQ scheme with caching is compared with that of the ARQ scheme without caching. Simulation results show that for the scheme with router caching technique, significant improvements are achieved in terms of end-to-end delay, session transmission time, feedback traffic, and bandwidth utilization.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Route caching"

1

Branke, Jürgen, Pablo Funes, and Frederik Thiele. "Evolving En-Route Caching Strategies for the Internet." In Genetic and Evolutionary Computation – GECCO 2004, 434–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24855-2_55.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Keqiu, and Hong Shen. "Coordinated En-Route Web Caching in Transcoding Proxies." In Advanced Web Technologies and Applications, 772–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24655-8_84.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kim, Changhoon, Matthew Caesar, Alexandre Gerber, and Jennifer Rexford. "Revisiting Route Caching: The World Should Be Flat." In Lecture Notes in Computer Science, 3–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00975-4_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Keqiu, and Hong Shen. "An Optimal Method for Coordinated En-route Web Object Caching." In Lecture Notes in Computer Science, 368–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39707-6_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Li, Keqiu, and Hong Shen. "Optimal Methods for Object Placement in En-Route Web Caching for Tree Networks and Autonomous Systems." In Grid and Cooperative Computing, 263–70. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24680-0_48.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Murugan, K., Sivasankar, Balaji, and S. Shanmugavel. "Implementation and Performance Study of Route Caching Mechanisms in DSR and HER Routing Algorithms for MANET." In Parallel and Distributed Processing and Applications, 1135–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11576235_112.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Katsaros, Dimitrios. "Information-Theoretic Methods for Prediction in the Wireless and Wired Web." In Web Data Management Practices, 159–78. IGI Global, 2007. http://dx.doi.org/10.4018/978-1-59904-228-2.ch007.

Full text
Abstract:
Discrete sequence modeling and prediction is an important goal and a challenge for Web environments, both wired and wireless. Web client’s data request forecasting and mobile location tracking in wireless cellular networks are characteristic application areas of sequence prediction in such environments. Accurate data request prediction results in effective data prefetching which combined with a caching mechanism can reduce user-preceived latencies as well as server and network loads. Also, effective solutions to the mobility tracking/prediction problem can reduce the update and paging costs, freeing the network from exceesive signaling traffic. Therefore, sequence prediction comprises a very important study and development area . This article presents information-theoretic techniques for discrete sequence prediction. It surveys, classifies, and compares the state-of-the-art solutions, suggesting routes for further research by discussing the critical issues and challenges of prediction in wired and wireless networks
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Route caching"

1

Haque, Md Enamul, Yasser Kamal Hassan, Anika Aziz, Cristian Borcea, and Shigeki Yamada. "Route caching in DTNs interconnected by infrastructure." In 2013 Australasian Telecommunication Networks and Applications Conference (ATNAC). IEEE, 2013. http://dx.doi.org/10.1109/atnac.2013.6705360.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gharaibeh, Ammar, Abdallah Khreishah, Issa Khalil, and Jie Wu. "Asymptotically-Optimal Incentive-Based En-Route Caching Scheme." In 2014 IEEE 11th International Conference on Mobile Ad Hoc and Sensor Systems (MASS). IEEE, 2014. http://dx.doi.org/10.1109/mass.2014.84.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, K., and H. Shen. "Transcoding proxy placement in en-route Web caching." In Proceedings. Second Annual Conference on Communication Networks and Services Research, 2004. IEEE, 2004. http://dx.doi.org/10.1109/dnsr.2004.1344739.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tran, Thinh Duy, Kim-Khoa Nguyen, and Mohamed Cheriet. "Joint Route Selection and Content Caching in O-RAN Architecture." In 2022 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2022. http://dx.doi.org/10.1109/wcnc51071.2022.9771623.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Keqiu Li and Hong Shen. "Proxy placement in coordinated en-route transcoding caching for tree networks." In 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. IEEE, 2004. http://dx.doi.org/10.1109/ispan.2004.1300485.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Xu, Shihong, and Hong Shen. "An Efficient Method for p-Server Coordinated En-Route Web Caching." In Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007). IEEE, 2007. http://dx.doi.org/10.1109/pdcat.2007.4420149.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Xu, Shihong, and Hong Shen. "An efficient method for p-server coordinated en-route web caching." In 2007 8th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2007. IEEE, 2007. http://dx.doi.org/10.1109/pdcat.2007.72.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Patil, Prachee N., and Ashish T. Bhole. "Black hole attack prevention in mobile Ad Hoc networks using route caching." In 2013 Tenth International Conference on Wireless and Optical Communications Networks - (WOCN). IEEE, 2013. http://dx.doi.org/10.1109/wocn.2013.6616204.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Yu, Xiaojing, Xiang-Yang Li, Jing Zhao, Guobin Shen, Nikolaos M. Freris, and Lan Zhang. "ANTIGONE: Accurate Navigation Path Caching in Dynamic Road Networks leveraging Route APIs." In IEEE INFOCOM 2022 - IEEE Conference on Computer Communications. IEEE, 2022. http://dx.doi.org/10.1109/infocom48880.2022.9796817.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Salonidis, T., and L. Tassiulas. "On optimal cooperative route caching in large, memory-limited wireless ad hoc networks." In 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577). IEEE, 2004. http://dx.doi.org/10.1109/icc.2004.1313375.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Route caching' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography