Network Routing Algorithm

Because of its great efficiency and graceful architecture, the Client/Server model has been prevalent for decades. At the same time, some disadvantages also have been recognized. It is not suitable for the Next Generation Network (NGN), which will provide a high-speed communication platform. Especially, the service bottleneck of Client/Server model will become more and more serious in such high-speed networking environment. Some approaches have been proposed to solve such kind of disadvantages. Among these, distributed computing is an important solution for Client/Server model.Nowadays, file share software such as Napster and Gnutella has become the most popular applications in Internet. This kind of system which was composed of many peer nodes was named peer-to-peer network. As system scale increasing, scalability has become urgent problem need to solve and hot research area.And, today's exponential growth in network bandwidth and storage capacity has inspired a whole new class of distributed, peer-to-peer storage infrastructures. Systems such as Farsite, Freenet, OceanStore, CFS, and PAST seek to capitalize on the rapid growth of resources to provide inexpensive, highly-available storage without centralized servers. The designers of these systems propose to achieve high availability and long-term durability in the face of individual component failures through replication and coding techniques.Although wide-scale replication has the potential to increase availability and durability, it introduces two important challenges to system architects. First, if replicas may be placed anywhere in the system, how should we locate them? Second, once we have located one or more replicas, how should we route queries to them? We can formulate the combination of these two operations as a single location and routing problem that efficiently routes queries from a client to the closest replica adhering to certain properties, such as the replica with the shortest network path to the client or the replica residing on the least loaded server. In many cases, combining location and routing into a single, compound operation yields the greatest flexibility to route queries quickly with minimal network overhead. The importance of such location-independent routing techniques is well recognized in the community, and several proposals such as CAN , Chord, Pastry and Tapestry are currently under study.A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. The space efficiency is achieved at the cost of a small probability of false positives, but often this is a convenient trade-off. Although Bloom filters were invented in the 1970's and have been heavily used in database applications, they have only recently received widespread attention in the networking literature. Peer-to-peer applications are a natural place to use Bloom filters, as collaborating peers may need to send each other lists of URLs, packets, or object identifiers. We introduce the conception of distance-weighted Bloom Filter(dwBF) here. A distance-weighted Bloom filter is a cluster of integers instead of a cluster of bits in standardized Bloom filter. To test the effectiveness of the routing algorithm, we conducted simulation experiments. It preliminary demonstrate the potential of our approach. We use Transit-Stub model of GT-ITM to generate a network topology. According to the simulation testing, the route failure in distance-weighted Bloom Filters is lower than the expected rate (2%) of false positives in standard Bloom Filters. In this way, dwBF can be used in any topology network while standard Bloom Filter can be used in tree topology only.We can add some extra bits into slots to control accessing. Only authorized user can access certain resources. In this way, the publishers can strengthen their control on the resources, which are effective in nominating and preventing pirating.By setting dwBF, it is easy to deal with replica. For each replica, dwBF can be set in accordance with the ways discussed in this dissertation. Router process chooses a nearer replication.