Paul F. Tsuchiya. Landmark routing: Architecture, algorithms and issues. Technical Report MTR-87W00174, MITRE Corporation, September 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....that they may have the object (can degenerate to ooding in the worst case) 2 . We refer to the second indirection based approach as SCOUT MAP. In this approach, sensors use a hash function to map an object name to a sensor address (similar to the name resolution scheme in Landmark routing [11, 12, 13, 14]) that becomes the locator sensor for the object. The address of the sensor monitoring the object 2 An optimization would be to maintain query state at sensors at intermediate levels so that queries are forwarded up the hierarchy only if the object is not available in the sensor s sub tree. ....

....of a sensor changes, the child sensor sends an update message with its aggregates to the new parent. 2.2 SCOUT MAP scheme We next describe the various components of the SCOUT MAP scheme. We begin with a description of the hierarchical addressing and routing scheme (based on Landmark routing [11, 12, 13, 14]) used in SCOUT MAP followed by a description of the process by which objects are mapped to their locator sensors. We then describe how queries are processed using the above mapped information. We later describe techniques to handle mobility of objects as well as network dynamics. 7 A(9) ....

[Article contains additional citation context not shown here]

Paul F. Tsuchiya. Landmark routing: Architecture, algorithms and issues. Technical Report MTR-87W00174, MITRE Corporation, September 1987.

....call the MASC BGMP architecture relies on significant configuration and hence is not applicable as such to sensor networks. But some aspects of the above scheme may still be relevant as we point out below. Our second scheme uses a self configuring architecture based on the LandMark (LM) Hierarchy [16, 17, 18, 19] to distribute the above information. We first describe the MASC BGMP approach in the next section. 1.2.1 MASC BGMP approach The Multicast Address Set Claim (MASC) protocol forms the basis for a hierarchical address allocation architecture. The domains running MASC are configured to form a ....

....Self configuring hierarchy based approach for multicast routing We now briefly describe our self configuring approach to distribute the mapping of multicast address ranges to their root domains. We present more details in Section 4. This approach is based on the self configuring LM hierarchy [16, 17, 18, 19]. Each domain chooses a host or router in its domain to be the LM for the domain. The LMs then organize themselves into an hierarchy using a distributed algorithm that we discuss in Section 4. The constructed hierarchy is used by LMs to self configure multicast address ranges for use by multicast ....

[Article contains additional citation context not shown here]

Paul F. Tsuchiya. Landmark routing: Architecture, algorithms and issues. Technical Report MTR-87W00174, MITRE Corporation, September 1987.

....a node s level in the hierarchy, being larger at higher levels. Based on such advertisements, peers elect parents such that the maximum number of children per parent is bounded. As we will show in Section 4, the use of broadcast (or multicast) advertisements can result in significant overhead. In [9], Tsuchiya describes a policy scheme for Landmark routing which requires configuring each node on the boundary of an administrative area. This allows broadcast scopes to be constrained by boundaries at various levels, so that a single subtree is built within a given boundary. While this technique ....

Paul F. Tsuchiya. Landmark routing: Architecture, algorithms, and issues. Technical Report MTR-87W00174, MITRE Corporation, Sep. 1987.

....that they may have the object (can degenerate to flooding in the worst case) 1 . We refer to the second indirection based approach as SCOUT MAP. In this approach, sensors use a hash function to map an object name to a sensor address (similar to the name resolution scheme in Landmark routing [9, 10, 11, 12]) that becomes the locator sensor for the object. The address of the sensor monitoring the object and the object location is stored at the locator sensor for the object. A querier performs the same algorithmic mapping to the object name and derives the address of the locator sensor. The locator ....

....of a sensor changes, the child sensor sends an update message with its aggregates to the new parent. 2.2 SCOUT MAP scheme We next describe the various components of the SCOUTMAP scheme. We begin with a description of the hierarchical addressing and routing scheme (based on Landmark routing [9, 10, 11, 12]) used in SCOUT MAP followed by a description of the process by which objects are mapped to their locator sensors. We then describe how queries are processed using the above mapped information. We later describe techniques to handle mobility of objects as well as network dynamics. 2.2.1 ....

[Article contains additional citation context not shown here]

Paul F. Tsuchiya. Landmark routing: Architecture, algorithms and issues. Technical Report MTR-87W00174, MITRE Corporation, September 1987.

....allowing other nodes to build complete position databases. LAR nodes reactively flood position queries over the entire network when they wish to find the position of a destination. Because they both involve global flooding, neither system seems suited to large networks. The Landmark system [17, 18] actively maintains a hierarchy to provide routing in a changing network. Nodes in a Landmark network have unique permanent IDs that are not directly useful for routing. Each node also has a changeable Landmark address, which consists of a list of IDs of nodes along the path from a well known root ....

Paul F. Tsuchiya. Landmark routing: Architecture, algorithms, and issues. MTR-87W00174, MITRE, May 1988.

....a probabilistic bootstrapping mechanism of a nature that, to our knowledge, is not found in network routing algorithms. Some recent routing research comes closer to our approach, in that messages are routed between nodes according to a mechanism somewhat like the knows about relation we consider [Tsuchiya 1987]. 7. Summary The goal of the Networked Resource Discovery Project is to explore a set of mechanisms that could provide an administratively decentralized means for users to navigate through an enormous resource space without imposing an inflexible hierarchical naming structure on that space. The ....

P. F. Tsuchiya. Landmark Routing: Architecture, Algorithms, and Issues. Tech. Rep. MTR-87W00174, Mitre Corp., Sep. 1987.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC