2,610 research outputs found

    Optimal Content Placement for En-Route Web Caching

    Get PDF
    This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the file placement problem, and therefore give only sub-optimal solutions. A dynamic programming algorithm of low complexity which computes the optimal solution is presented. It is shown both analytically and experimentally that the file-placement solution output by our algorithm outperforms existing en-route caching policies. The optimal placement of web files can be implemented with a reasonable level of cache coordination and management overhead for en-route caching; and importantly, it can be achieved with or without using data prefetching

    Backscatter from the Data Plane --- Threats to Stability and Security in Information-Centric Networking

    Full text link
    Information-centric networking proposals attract much attention in the ongoing search for a future communication paradigm of the Internet. Replacing the host-to-host connectivity by a data-oriented publish/subscribe service eases content distribution and authentication by concept, while eliminating threats from unwanted traffic at an end host as are common in today's Internet. However, current approaches to content routing heavily rely on data-driven protocol events and thereby introduce a strong coupling of the control to the data plane in the underlying routing infrastructure. In this paper, threats to the stability and security of the content distribution system are analyzed in theory and practical experiments. We derive relations between state resources and the performance of routers and demonstrate how this coupling can be misused in practice. We discuss new attack vectors present in its current state of development, as well as possibilities and limitations to mitigate them.Comment: 15 page

    Intra-domain mobility management

    Full text link
    Mobility supporting protocols are designed to provide connectivity of mobile nodes from any point of attachment to the Internet. Fast handoff, low signaling overhead and packet loss are the key factors to be addressed in designing a mobility management protocol. This work proposes Intra Domain Mobility Management (IDMM) protocol, based on micro-mobility concept. The protocol implements an efficient tracking mechanism for locating the mobile nodes and ensures that their movements remain transparent to communicating nodes. The protocol is designed with the hierarchical tree topology in mind that allows for low cost solution and efficient management. The optimized routing enables fast delivery of packets to the mobile node in the micro-mobility domain. IDMM is implemented using Network Simulator (ns2) tools. Packet loss, throughput, delay in the network and traffic overhead due to location management are studied. The comparison with major mobility protocols such as Mobile IP and Cellular IP is done to demonstrate the performance of IDMM under high frequency of roaming
    corecore