A quantitative measure for telecommunications networks topology design

73

Research on Cache Placement in ICN

Ubiquitous in-network caching is one of key features of Information Centric Network, together with receiver-drive content retrieval paradigm, Information Centric Network is better support for content distribution, multicast, mobility, etc. Cache placement strategy is crucial to improving utilization of cache space and reducing the occupation of link bandwidth. Most of the literature about caching policies considers the overall cost and bandwidth, but ignores the limits of node cache capacity. This paper proposes a G-FMPH algorithm which takes into ac-count both constrains on the link bandwidth and the cache capacity of nodes. Our algorithm aims at minimizing the overall cost of contents caching afterwards. The simulation results have proved that our proposed algorithm has a better performance

An Evaluation on Robustness and Utility of Fingerprinting Schemes

Fingerprinting of data is a method to embed a traceable marker into the data to identify which specific recipient a certain copy of the data set has been released to. This is crucial for releasing data sets to third parties, especially if the release involves a fee, or if the data contains sensitive information due to which further sharing and potential subsequent leaks should be discouraged and deterred from. Fingerprints generally involve distorting the data set to a certain degree, in a trade off to preserve the utility of the data versus the robustness and traceability of the fingerprint. In this paper, we will thus compare several approaches for fingerprinting for their robustness against various types of attacks, such as subset or collusion attacks. We further evaluate the effects the fingerprinting has on the utility of the datasets, specifically for Machine Learning tasks

A Combined Fast-Routing and Bandwidth-Reservation Algorithm for ATM Networks

Traditionally, the task of establishing a connection in connection-oriented networks is divided into two subtasks. First, a route is selected based on a topology database that is maintained in every node according to some optimization rule, such as, shortest path, minimal delay, etc. After the route is selected, the source tries to allocate resources (such as bandwidth, buffers, etc.) along the selected route. A failure to reserve resources along the selected route causes the source to give-up on the connection or to retry, i.e., look for another route and then try to reserve resources along it. The delay imposed by such a failure, especially for long haul ATM networks, might be too long for many bursty applications, e.g., queries to distributed databases. In this work we suggest a more efficient scheme where the search for the optimal route and the resource allocation along it are combined. We present (few members of) a family of algorithms that enables the application planner to sele..