[Show abstract][Hide abstract] ABSTRACT: Interface adapters allow applications written for one interface to be reused
with another interface without having to rewrite application code, and chaining
interface adapters can significantly reduce the development effort required to
create the adapters. However, interface adapters will often be unable to
convert interfaces perfectly, so there must be a way to analyze the loss from
interface adapter chains in order to improve the quality of interface
adaptation. This paper describes a probabilistic approach to analyzing loss in
interface adapter chains, which not only models whether a method can be adapted
but also how well methods can be adapted. We also show that probabilistic
optimal adapter chaining is an NP-complete problem, so we describe a greedy
algorithm which can construct an optimal interface adapter chain with
exponential time in the worst case.
[Show abstract][Hide abstract] ABSTRACT: To understand the factors that encourage the deployment of a new networking
technology, we must be able to model how such technology gets deployed. We
investigate how network structure influences deployment with a simple
deployment model and different network models through computer simulations. The
results indicate that a realistic model of networking technology deployment
should take network structure into account.
[Show abstract][Hide abstract] ABSTRACT: Distributed denial of service attacks are often considered a security
problem. While this may be the way to view the problem with today's Internet,
new network architectures attempting to address the issue should view it as a
scalability problem. In addition, they need to address the problem based on a
Preview · Article · Mar 2011 · ACM SIGCOMM Computer Communication Review
[Show abstract][Hide abstract] ABSTRACT: By using different interface adapters for different methods, it is possible to construct a maximally covering web of interface adapters which incurs minimum loss during interface adaptation. We introduce a polynomial-time algorithm that can achieve this. However, we also show that minimizing the number of adapters included in a maximally covering web of interface adapters is an NP-complete problem.
[Show abstract][Hide abstract] ABSTRACT: Resources in a distributed system can be identified using identifiers based
on random numbers. When using a distributed hash table to resolve such
identifiers to network locations, the straightforward approach is to store the
network location directly in the hash table entry associated with an
identifier. When a mobile host contains a large number of resources, this
requires that all of the associated hash table entries must be updated when its
network address changes.
We propose an alternative approach where we store a host identifier in the
entry associated with a resource identifier and the actual network address of
the host in a separate host entry. This can drastically reduce the time
required for updating the distributed hash table when a mobile host changes its
network address. We also investigate under which circumstances our approach
should or should not be used. We evaluate and confirm the usefulness of our
approach with experiments run on top of OpenDHT.
[Show abstract][Hide abstract] ABSTRACT: The Echo protocol tries to do secure location verification using physical limits imposed by the speeds of light and sound. While the protocol is able to guarantee that a certain object is within a certain region, it cannot ensure the authenticity of further messages from the object without using cryptography. This paper describes an impersonation attack against the protocol based on this weakness. It also describes a couple of approaches which can be used to defend against the attack.