Search

In mobile IPv6 network, AAA mechanism is necessary for administration and security because roaming nodes are permitted and become majority. However, disharmonies are exposed when MIPv6 meets AAA. On one hand, AAA procedures increase the latency of MIPv6 handover by inserting several message round trips before mobile registration. Thus the handover performance is reduced. On the other hand, AAA does nothing to help MIPv6 with its security problem. The fact is that MIPv6 has to struggle with those problems by itself. The result is that MIPv6 become complicated and inefficient. The crux of the matter is that AAA and MIPv6 are separately designed from their own viewpoints without mutual reinforcement. In this study, a Topologically-Aware AAA Overlay Network (TA4ON) is used for compatibly combining together resources and capacities from both sides. All connected AAA participators construct an overlay network which is naturally topology-aware. MIPv6 security issues, for example key generating and peer identifying, are handled by AAA. Secret materials and even MIPv6 signals can be delivered through TA4ON. As shown in this paper, at little additional cost all things serve their proper purposes and finally performance and security of MIPv6 are improved. Keywords: Mobile IPv6, AAA, Overlay Network, Performance, Security. [ABSTRACT FROM AUTHOR]

The design and construction of navigation menus for websites have traditionally been performed manually according to the intuition of a web developer. This paper introduces a new approach, FcAWN (pronounced "fawn") - Formal concept Analysis for Web Navigation - to assist in the design and generation of a coherent and logical navigation hierarchy for a set of web documents. We provide an algorithmic process for generating multi-layered menu models using FcAWN and demonstrate its feasibility with an experimental case study. Our study reveals a fundamental difference between the traditional tree-based menu structure and the lattice-based menu structure by FcAWN: a FcAWN-generated lattice structure is more general than a tree structure and yet is mathematically sound and uniquely suited for menu design and construction. FcAWN is the first mathematical principle for menu design and generation, providing a practical basis for human-computer interaction. [ABSTRACT FROM AUTHOR]

Multi-dimensional range query is an important query type and especially useful when the user doesn't know exactly what he is looking for. However, due to improper indexing method and high routing latency, existing schemes cannot perform well under high-dimensional situations. In this paper, we propose Roogle, a decentralized non-flooding P2P search engine that can efficiently support high-dimensional range queries in P2P systems. Roogle makes improvements on both indexing and routing. The high-dimensional data is indexed based on the maximum or minimum value among all dimensions. This simple indexing method performs rather well under high-dimensional situations and tolerates data points with missing values or different dimensionality. To speed query routing, Roogle is built on top of our proposed structured overlay - Aurelia, which has better routing performance by exploiting node heterogeneity. Aurelia also guarantees the data locality and efficiently support range queries. Experimental results from simulation validate the scalability and efficiency of Roogle. [ABSTRACT FROM AUTHOR]

Traditional DHT-based overlays destroy data locality and make it hard to support complex queries (e.g., range query, similarity query, etc) in P2P systems. Additionally, the node heterogeneity is widely ignored in most existing overlay designs. In this paper, we propose a locality-preserving overlay design, called Aurelia, which can adapt to the heterogeneous P2P environment and exploit node heterogeneity to realize efficient routing and robust indexing. Aurelia preserves the data locality by abandoning the use of hashing for data placement and each peer is responsible for a continuous range of value. In Aurelia, the routing table size and index range are proportional to the node capacity, and multicasting is adopted for scalable routing table maintenance. [ABSTRACT FROM AUTHOR]