Jini is a Java-based technology for ’spontaneous’ distributed computing which enables programs to dynamically discover nearby services by means of a type-based lookup mechanism. However, this mechanism requires that all the parties involved first agree on a set of common wellknown interfaces for describing services which offer the same high-level functionalities. We believe that this mechanism ...

Example Consider a system consisting of several distributed objects implemented using CORBA. To access one of the distributed objects, a client typically needs to obtain a reference to the object. An object reference identifies the distributed object that will receive the request. Object references can be passed around in the system as parameters to operations as well as results of requests. A ...

Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or optimizing the required memory size. Many of these algorithms are suitable for IPv4 but cannot be used for IPv6. Nevertheless new efforts are going on to fit the available algorithms and techniques to the IPv6 128 bits a...

Various kinds of traffic traces, containing, e.g., packet headers, signaling messages, or authorization log-files, are needed to examine the status and performance of packet switching networks. In most cases, traces contain information that can be used identify subscribers and what kind of services they have been using. This kind of information can be usually handled only by network operator an...

To conceive the full potential of ubiquitous mobile computing, mobile nodes must be able to roam seamlessly across different networks. However, the location i.e. IP address, of a called mobile nodes must be determined within a certain amount of time, before the services are blocked. With the upcoming 3G, 4G and wireless LAN technologies, it is necessary to have an efficient location management ...

IP address lookups form a critical component of the internet routing infrastructure. Typically based on trie-based structures and related extensions, the problem has several similarities to other applications of dictionaries in data compression, information retrieval, etc. The extreme need for speed in IP lookups has prompted considerable research in development of appropriate data structures, ...

Peer-to-peer (P2P) networking has emerged as a promising technology that enables distributed systems to operate in decentralized manner. P2P networks are based on model where each node the network can act both client and server, thereby enabling data resource sharing without relying centralized servers. The gained considerable attention recent years due its potential provide scalable, fault-tol...

In contrast to the one-to-one model of IP unicast, in which data packets are sent from a single source to a single recipient, IP multicast provides a method of efficient many-to-many communication. This concept is becoming increasingly important, both in the Internet and in private networks, for providing services such as multimedia content delivery. IP packet Forwarding based on Partitioned Lo...

In this paper we describe a VLSI implementation and complete circuit design of a fast Ternary CAM (TCAM). TCAMs are commonly used to perform routing lookups in the backbone of IP networks and small gateways. Our TCAM is designed to have a greater capacity and speed than any commercial offering at this time. In contrast with existing TCAM approaches, our TCAM allows complete flexibility in the l...

Internet address lookup is a challenging problem because of the increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. Routing lookup involves computation of best matching prefix for which existing solutions scale poorly when increases traffic in the router or when employed for IPV6 address lookup. Our paper describes a novel approach...