• Login
    View Item 
    •   Home
    • Faculty/ Researcher Works
    • Faculty/ Researcher Works
    • View Item
    •   Home
    • Faculty/ Researcher Works
    • Faculty/ Researcher Works
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of TUScholarShareCommunitiesDateAuthorsTitlesSubjectsGenresThis CollectionDateAuthorsTitlesSubjectsGenres

    My Account

    LoginRegister

    Help

    AboutPeoplePoliciesHelp for DepositorsData DepositFAQs

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Asymptotically-optimal incentive-based en-route caching scheme

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    1404.4639v3.pdf
    Size:
    277.9Kb
    Format:
    PDF
    Download
    Genre
    Conference Proceeding
    Date
    2015-02-06
    Author
    Gharaibeh, A
    Khreishah, A
    Khalil, I
    Wu, J
    Subject
    En-route caching
    caching incentive
    competitive ratio
    asymptotic optimality
    quality of service
    Permanent link to this record
    http://hdl.handle.net/20.500.12613/5820
    
    Metadata
    Show full item record
    DOI
    10.1109/MASS.2014.84
    Abstract
    © 2014 IEEE. Content caching at intermediate nodes is a very effective way to optimize the operations of Computer networks, so that future requests can be served without going back to the origin of the content. Several caching techniques have been proposed since the emergence of the concept, including techniques that require major changes to the Internet architecture such as Content Centric Networking. Few of these techniques consider providing caching incentives for the nodes or quality of service guarantees for content owners. In this work, we present a low complexity, distributed, and online algorithm for making caching decisions based on content popularity, while taking into account the aforementioned issues. Our algorithm performs en-route caching. Therefore, it can be integrated with the current TCP/IP model. In order to measure the performance of any online caching algorithm, we define the competitive ratio as the ratio of the performance of the online algorithm in terms of traffic savings to the performance of the optimal offline algorithm that has a complete knowledge of the future. We show that under our settings, no online algorithm can achieve a better competitive ratio than Ω(log n), where n is the number of nodes in the network. Furthermore, we show that under realistic scenarios, our algorithm has an asymptotically optimal competitive ratio in terms of the number of nodes in the network.
    Citation to related work
    IEEE
    Has part
    Proceedings - 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014
    ADA compliance
    For Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact scholarshare@temple.edu
    ae974a485f413a2113503eed53cd6c53
    http://dx.doi.org/10.34944/dspace/5802
    Scopus Count
    Collections
    Faculty/ Researcher Works

    entitlement

     
    DSpace software (copyright © 2002 - 2023)  DuraSpace
    Temple University Libraries | 1900 N. 13th Street | Philadelphia, PA 19122
    (215) 204-8212 | scholarshare@temple.edu
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.