Abstract: A communication protocol includes one or more messages passed between Web routers over a reliable transmission protocol used for inter-Web router communication. These messages include information that allows the Web routers to dynamically update mappings of client addresses or address ranges to information object repository addresses based on client-to-server distance and server load. The mappings are preferably optimal mappings of the client addresses or address ranges to the information object repository addresses and the messages report updated distances from these information object repository addresses to the client addresses or address ranges. For example, the messages may report, for each updated distance, an associated client address or address range and/or an associated anchor address of a Web router co-located with an information object repository that is the subject of the message.

Abstract: A system and method is directed to enabling a collision-free transmission of a packet in a network by employing an access-point tree optimized MAC (ATOM) mechanism. The system enables a node in an ad hoc network to determine a collision-free transmission schedule based in part on information the node has about a distance to an access point along a routing tree rooted at the access point. The node may be assigned a time slot for collision-free transmission based in part on a bandwidth demand at the node, and traffic the node has to forward on behalf of a neighbor node.

Abstract: One embodiment of the present invention provides a system that facilitates loop-free ad-hoc routing in a wireless network. During operation, the system advertises a local sequence number associated with a local node for a destination node, and receives a first route request at the local node, wherein the route request specifies a source node, the destination node, and a first sequence number. The system further selectively maintains a record, which indicates the source node, the destination node, the first sequence number, and a node from which the route request is received. The system also selectively forwards a second route request based on the received route request, wherein the second route request specifies the source node, the destination node, and a second sequence number which is less than the first sequence number and less than or equal to the advertised local sequence number.

Abstract: Various information object repository selection procedures for determining which of a number of information object repositories should service a request for the information object include a direct cache selection process, a redirect cache selection process, a remote DNS cache selection process, or a local DNS cache selection process. Different combinations of these procedures may also be used. For example different combination may be used depending on the type of content being requested. The direct cache selection process may be used for information objects that will be immediately loaded without user action, while any of the redirect cache selection process, the remote DNS cache selection process and/or the local DNS cache selection process may be used for information objects that will be loaded only after some user action.

Abstract: One embodiment of the present invention provides a system that facilitates loop-free ad-hoc routing in a wireless network. During operation, the system advertises a local sequence number associated with a local node for a destination node, and receives a first route request at the local node, wherein the route request specifies a source node, the destination node, and a first sequence number. The system further selectively maintains a record, which indicates the source node, the destination node, the first sequence number, and a node from which the route request is received. The system also selectively forwards a second route request based on the received route request, wherein the second route request specifies the source node, the destination node, and a second sequence number which is less than the first sequence number and less than or equal to the advertised local sequence number.

Abstract: Multicast routing in ad-hoc networks by exchange of multicast group update information and routing tree information among neighboring routers is disclosed. A router propagates multicast group update information based on the update information and the routing tree information. A router also determines whether to forward multicast data packets based on control information in the multicast data packets and the routing tree information.

Abstract: A system and method is directed at providing collision-free transmission of packets into a channel, such that: an upper bound can be enforced for the time elapsed between two consecutive time slots assigned to the same node; no collision-avoidance handshake is required for each packet transmission, and no pre-assignment of transmission times (slots), channels, or codes are required. Time is divided into frames consisting of a known number of time slots, and frames can be further organized into epochs.

Abstract: A mask or reticle includes a focus test area having a pattern of opaque lines, naked lines, and phase shifting lines. A resulting pattern on a wafer exposed through the focus test area may have a first area of the pattern shifted with respect to a second area of the pattern if the lithography system is out of focus. In some implementations, an area of the pattern may contract or expand if the lithography system is out of focus. An out of focus condition may be determined using a registration tool, scanning electron microscope (SEM), or an interferometer tool (OCD). An out of focus condition may be improved using out of focus information.

Abstract: A method is described for distance vector routing of on-demand traffic between routers within an ad-hoc network maintaining multiple loop-free paths to destinations. Each router maintains routing table entries only for destinations associated with data flows through the router which reduce the amount of storage space and bandwidth required for routing table maintenance. Diffusing computations are utilized for establishing and maintaining the routes within the network. The sending of unnecessary flood searches and search-to-infinity problems are avoided, while the protocol decreases the vulnerability of the network to various service attacks along with router failures, fading, and drop outs.

Abstract: A method for collocated nodes communicating over a first interface to agree on a conflict-free transmission schedule among themselves, which they can then use to collaborate with neighbors accessed through a second interface, for example through wireless links in order to obtain collision-free transfers of unicast, multicast and broadcast packets over wireless channels, and channel access delay guarantees. The collocated nodes behave as a single virtual node for the purpose of establishing a consistent transmission schedule throughout the nodes of a multihop wireless network.

Abstract: A mask or reticle includes a focus test area having a pattern of opaque lines, naked lines, and phase shifting lines. A resulting pattern on a wafer exposed through the focus test area may have a first area of the pattern shifted with respect to a second area of the pattern if the lithography system is out of focus. In some implementations, an area of the pattern may contract or expand if the lithography system is out of focus. An out of focus condition may be determined using a registration tool, scanning electron microscope (SEM), or an interferometer tool (OCD). An out of focus condition may be improved using out of focus information.

Abstract: The present invention provides a medium access control (MAC) protocol for the collision-free transmission of packets into a channel, such that nodes are assigned time slots for collision-free transmission based on the knowledge that they acquire regarding the constituency of their local neighborhoods and the advertisements of the time slots when nodes in local neighborhoods will attempt to transmit again. The scheduling procedure may utilize an age of the network together with the unique identifiers of nodes. The candidate transmission times for each node are determined using a list of the subsequent transmission times advertised by other nodes. The node discards the advertised transmission times from the list of potential transmission times, and computes its candidate transmission times using a function that provides a varying (pseudorandom) distribution of outputs for a varying sample of inputs. This function ay be a hash function, an encryption function, or a table lookup function.

Abstract: A system and method is directed to enabling a collision-free transmission of a packet in a network by employing an access-point tree optimized MAC (ATOM) mechanism. The system enables a node in an ad hoc network to determine a collision-free transmission schedule based in part on information the node has about a distance to an access point along a routing tree rooted at the access point. The node may be assigned a time slot for collision-free transmission based in part on a bandwidth demand at the node, and traffic the node has to forward on behalf of a neighbor node.

Abstract: A method for determining the cost of routing data is described herein, where a communication cost for routing data from a current node to a successor node over a communication channel is computed, and then a processing node cost for processing data at the current node is computed, where the processing node cost represents a ratio of data input rates to data output rates at the current node. The two computations are combined to formulate a link cost for the current node, or the cost of routing data through that node. The link cost can then be used in a routing algorithm for routing data.

Abstract: The present invention provides a medium access control (MAC) protocol for the collision-free transmission of packets into a channel, such that nodes are assigned time slots for collision-free transmission based on the knowledge they acquire regarding the constituency of their local neighborhoods and the advertisements of the time slots when nodes in local neighborhoods will attempt to transmit again.

Abstract: A system and method is directed at providing collision-free transmission of packets into a channel, such that: an upper bound can be enforced for the time elapsed between two consecutive time slots assigned to the same node; no collision-avoidance handshake is required for each packet transmission, and no pre-assignment of transmission times (slots), channels, or codes are required. Time is divided into frames consisting of a known number of time slots, and frames can be further organized into epochs.

Abstract: Embodiments of a new press section for paper manufacturing are disclosed, each having a combination of rolls which form at least two press nips, with one roll of each combination being common to two press nips. Also, said embodiments further include two continuous-loop belts, one made of absorbent felt material, the other of plastic sheet, both disposed in a manner to enhance the evacuation of water from a web of wet paper fiber.

Abstract: A tubular element for a heat-exchanger comprises a tubular core composed of a first aluminum alloy comprising up to 0.3 wt % maximum of silicon, up to 0.5 wt % maximum of iron, from 0.50 to 0.70 wt % of copper, from 0.65 to 1.0 wt % of manganese, from 0.1 to 0.30 wt % of magnesium, up to 0.05 wt % maximum of zinc, from 0.08 to 0.10 wt % of titanium, and the balance aluminum and unavoidable impurities; an inner layer of a second aluminum alloy on the tubular core; and an outer brazable layer of a third aluminum alloy on the tubular core. The tubular core and the inner layer may be selected to have a corrosion potential difference of from 170 to 200 mV verses a saturated calomel electrode. The tubular core may have a grain size falling within the range about ASTM 5 to about ASTM 6 and the grains having a morphology which is elongated in the axial direction of the tubular core.

Abstract: A programmable multiple parameter process controller is disclosed, which comprises a plurality of programmable units, and functions to monitor the relationship between a pre-selected parameter and a pre-selected value for that parameter and produces a pre-selected output upon the occurrence of the pre-selected condition. The process controller is programmed by the use of at least one keyboard or other input device which initiates at least one pulse generator and a sequence of pulse counters to generate and store a digital signal indicative of the desired programmed value.