Abstract: A recursive method based on three rules by which tree structures representing data, e.g., XML, is transformed into a table-based format so as to be more easily read and understood by a human being without requiring customization based on the particular application and/or the nature of the data contained within the XML representation.

Abstract: A method for the configuration of network elements includes initially configuring a network element via a controller. The controller characterizes (learns) the configuration steps as a series of menu driven screen commands associated with the network element and processes subsequent substantially similar configuration requests for the network element and other network elements of the network using the characterized series of menu driven screen commands to execute the subsequent configuration requests. As such, the configuration and set-up of new network element(s) or the subsequent modifications to the configuration of existing network element(s), are vastly simplified processes. The present invention advantageously reduces the number of needed manually input parameters, thus making the configuration of network elements more reliable.

Abstract: The invention comprises a method and apparatus for enabling missed call information to be accessed from a remote device via a packet network. Specifically, the method comprises receiving missed call information associated with a called party, storing the missed call information and transmitting the missed call information towards a remote device associated with the called party via a packet network.

Abstract: A gateway for mobile communications comprises a cache for storing network data recently downloaded from a network, a foreign agent, and a packet filter that directs requests for the network data from a mobile node to the cache. The packet filter directs the requested network data from the cache to the mobile node by way of the foreign agent, without forwarding the requested network data to a home agent of the mobile node.

Abstract: To manage resource allocation between users of a wireless or wireline network, recent resource usage by each user is determined and priorities are assigned accordingly. Then, the network resources are allocated according to the assigned priorities. A respective priority of a user may be inversely proportional to the recent resource usage by that user. To facilitate continuous fair distribution of the network resources, the users may be re-prioritized and resources are re-allocated accordingly. Information about recent resource usages by the users is continuously accumulated, including about users moving from one access point of the network to another. When resource allocation for a particular access point is determined, recent resource usage for a user that has joined the access point from another access point in the network may include prior resource usage by that user at the other access point.

Abstract: The invention includes a method and apparatus for configuring logical connectivity for a network comprising a plurality of nodes. A method includes determining a physical topology of the network, determining a set of LSP paths based on the physical topology of the network, and determining a set of LSPs using the set of LSP paths, where the set of LSPs includes a plurality of LSPs adapted for providing full logical connectivity between the nodes of the network. The physical topology is determined using information indicative of physical connectivity between nodes of the network. The set of LSP paths includes, for each pair of nodes in the network, at least two logical paths between the nodes of the node pair. The set of LSPs includes a plurality of LSPs adapted for providing full logical connectivity between the nodes of the network.

Abstract: The invention includes a method and apparatus for establishing DIAMETER associations between nodes of a network. The invention uses a DIAMETER application server disposed between DIAMETER nodes in order to establish DIAMETER associations between nodes and, further, to provide DIAMETER traffic load balancing using established associations. A method includes receiving a DIAMETER connection establishment request from an originating node requesting an association with a destination node, terminating the DIAMETER connection establishment request, obtaining respective DIAMETER associations for the originating node and the destination node, linking the obtained DIAMETER associations, and storing the linked DIAMETER associations.

Abstract: The invention includes a method and apparatus for upgrading software represented as a graph, where the graph has a plurality of states and a plurality of state transitions and tokens traverse the graph executing functions. A method includes identifying a target region of the graph, obtaining a new region for the graph, determining a correspondence between states of the target region of the graph and states of the new region for the graph, and replacing the target region of the graph with the new region for the graph using the correspondence between states of the target region of the graph and states of the new region for the graph. The target region of the graph may be replaced by suspending the operation of the target region of the graph, or while the target region of the graph continues running.

Abstract: A scheme for authentication, dynamic key generation and exchange provides means for authentication of mobile nodes and networks, and for generation of per session, per node, security association and encryption keys for encrypting/decrypting communications between a mobile node and an access point in wireless local area networks. The scheme utilizes the same infrastructure and authentication information for both data link layers (layer 2) and network layers (layer 3). This scheme is particularly applicable to networks adhering to the IEEE 802 LAN family of standards.

Abstract: The invention includes a method and apparatus for dynamically defining and instantiating an undefined portion of a graph, where the graph has a plurality of states and a plurality of state transitions. A method includes executing the graph where the graph comprises a defined portion and an undefined portion and a plurality of tokens traverse the graph executing functions, suspending the one of the tokens in response to the one of the tokens detecting the undefined portion of the graph, generating a new portion of the graph for the undefined portion of the graph, replacing the undefined portion of the graph with the new portion of the graph, and releasing the suspended token. The new portion of the graph is generated by generating at least one definition file for the undefined portion of the graph and executing the at least one definition file to form thereby the new portion of the graph.

Abstract: The present invention is a stationary pool skimming apparatus that uses the flow of water in a pool to collect free flowing debris from the water in the pool. In one embodiment, a pool skimming apparatus for collecting debris from water in a pool includes a frame having a net attached thereto. A first end of the frame includes a compression mechanism. The compression mechanism is adapted for being connected to a skimmer port of the pool such that the frame and net extend into the pool in a manner enabling the net of the pool skimming apparatus to collect debris from the water in the pool. The compression mechanism operates in either of an inverted position and a non-inverted position.

Abstract: Method and apparatus for calculating warranty cost includes determining values for a plurality of parameters that characterize a corresponding plurality of physical conditions of a product that is returned under warranty, determining values for a plurality of variables that characterize a customer profile for the product and evaluating an expression that calculates warranty cost based on said determined parameter and variable values. The plurality of physical conditions of the product includes the conditions of no-trouble-found (NTF), repaired, junked, and subject to further failure mode analysis (FMA). The plurality of parameters further comprises probabilities and costs that correspond to each of the physical conditions. Evaluating the above expression includes evaluating a first expression that calculates repair, product conformance and Dead-On-Arrival cost and evaluating a second expression that calculates Change Notice cost. Subsequently, the two costs are summed to arrive at the total warranty cost.

Abstract: A method and apparatus for frame synchronization in digital communication systems using multiple modulation formats, including the Differential Phase Shift Keying (DPSK), Duobinary Signaling (DBS), and ON/OFF Keying (OOK) modulation formats, perform a search for both a frame alignment sequence (FAS) and the inverted FAS and determine the polarity of the received digital stream.

Abstract: The invention includes a method and apparatus for preventing phishing attacks. A first method, for informing a user that a remote server is valid, includes receiving a request for information available from the remote server where the request includes an identifier, obtaining a dynamic personal attribute associated with the user using the identifier, and propagating the dynamic personal attribute toward the user, wherein the dynamic personal attribute is adapted for use by the user in validating the remote server. The remote server may be a web server, an authentication server, or any other remote device with which the user may desire to authenticate.

Abstract: The need to monitor real time network services has prompted service providers to use new measurement technologies, such as service-specific probes. A service-specific probe is an active probe that closely mimics the service traffic so that it receives the same treatment from the network as the actual service traffic. Service-specific probes are end-to-end and their deployment depends on solutions that address questions such as minimizing probe traffic, while still obtaining maximum coverage of all the links in the network. A polynomial-time probe-path computation algorithm is provided as well as a 2-approximate solution for merging probe paths when the number of probes exceeds a required bound k. The algorithms are evaluated using ISP topologies generated via Rocketfuel. For most topologies, it is possible to cover more than about 98% of the edges using just about 5% of the nodes as terminals.

Abstract: The invention includes a method and apparatus for generating virtual clock signals for differing hierarchies in a communication system conveying data frames of differing hierarchies. Specifically, a method according to one embodiment of the invention includes receiving data frames of a first hierarchy, receiving at least one input clock signal, and generating a virtual clock signal using the at least one input clock signal and a clock enable signal. The clock enable signal is generated using at least one of a data rate ratio and a clock rate ratio. The virtual clock signal is adapted for converting at least a portion of the data frames of the first hierarchy to data frames of a second hierarchy. The frequency of the virtual clock signal is determined by applying the clock enable signal to a common clock signal.

Abstract: A method and apparatus for controllably delivering a multicast broadcast stream to a client via a VLAN channel and, in response to the detection of a splice point, delivering a unicast stream to the client via a sub-VLAN channel.

Abstract: The invention comprises a method and apparatus for managing a multicast tree using SIP, SOAP, HTTP, or similar signaling between a multicast receiver (e.g., user device) and a third party system (e.g., a content provider system). The method includes receiving at least one request for modifying the multicast tree, determining at least one multicast tree change in response to the at least one request for modifying the multicast tree (where the at least one multicast tree change is operable for modifying the multicast tree according to the at least one request), and generating at least one message operable for implementing the at least one multicast tree change. The at least one request and the at least one message are implemented in a manner tending to minimize consumption of network resources.

Abstract: A method and apparatus providing clock and data recovery within an optical receiver using three CMA FIR filters with different group delays where filter coefficients are adapted to provide for a filter exhibiting a group delay of one sample period from which symbols for further processing are provided.

Abstract: A method for creating imagery on a surface by establishing a visual boundary between two surface color regions and applying a dry transfer object proximate the visual boundary such that when the dry transfer object is substantially the same color as one of the surface regions, a negative space effect is created within the second surface color region to define thereby a desired image.