نتایج جستجو برای: locating routing
تعداد نتایج: 66239 فیلتر نتایج به سال:
This paper focuses on how to model grid resource and locate grid resource using efficient and scaleable protocol under a grid environment. A mathematic model of grid physical resource space and logical resource space is built based concept of virtual organization. Then, a mathematical method based the binary equivalent relation is presented to divide grid physical resource space. Then, this pap...
This thesis presents a new architecture for information discovery based on a hierarchy of content routers that provide both browsing and search services to end users. Content routers catalog information servers, which may in turn be other content routers. The resulting hierarchy of content routers and leaf servers provides a rich set of services to end users for locating information, including ...
در این پایان نامه دو مقاله زیر بررسی شده اند، که اولی در مورد رنگ آمیزی موقعیت یاب و عدد رنگی موقعیت یاب گراف ها است و دیگری همه ی درخت های با عدد رنگی موقعیت یابی 3 را مشخص می کند. همچنین در این پایان نامه عدد رنگی موقعیت یاب گراف های مسیر، دور، کامل، دوبخشی، ستاره ها، درخت های دو ستاره و کاترپیلارها را مشخص می کند.
A major challenge faced in mobile ad hoc networks (MANETs) is locating devices for communication, especially in the case of high node mobility and sparse node density. Present solutions provided by the ad hoc routing protocols range from flooding the entire network with route requests, to deploying a separate location management scheme to maintain a device location database. Many applications a...
Peer-to-peer overlay networks provide a useful infrastructure for building distributed applications. These networks provide efficient and fault-tolerant routing and object locating within a self-organizing overlay network. This paper presents a multi-dimensional overlay network called RAQNet which is based on RAQ. RAQ supports exact match queries and range queries over multi-dimensional data ef...
This paper considers the problem of locating and forwarding network traffic to any one of a set of distributed servers or service points—primarily in the context of mobile ad hoc networks. The advantages of providing such a capability through the use of anycast routing techniques at the network layer are discussed. We then illustrate how several different classes of unicast routing protocols ca...
Resource location in structured P2P system has a critical influence on the system performance. Existing analytical studies of Chord protocol have shown some potential improvements in performance. In this paper a splay tree-based new Chord structure called SChord is proposed to improve the efficiency of locating resources. We consider a novel implementation of the Chord finger table (routing tab...
Locating objects with topology-independent identifiers has emerged as a key functionality in recent content networking approaches. Numerous designs have been proposed to address the obvious scalability and efficiency challenges such systems face in Internetscale deployments. These designs have often been based on implicit assumptions of full deployment and a homogeneous autonomous system struct...
As shown in recent researches, the costs in distribution systems may be excessive if routes are ignored when locating depots. The location routing problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. This paper presents a new metaheuristic to solve the LRP with capacitated routes and depots. A first phase executes a GRASP, based on an extended and ran...
Locating entities in peer-to-peer environments is a fundamental operation. Recent studies show that the concept of distributed hash table can be used to design scalable lookup schemes with good performance (i.e. small routing table and lookup length). In this paper, we propose a simple framework for deriving decentralized lookup algorithms. The proposed framework is simple in that it is based o...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید