Abstract: In some embodiments, computer systems, storage mediums, and methods are provided for controlling a connecting device's access to a plurality of computer networks. In other embodiments, the provided computer systems, storage mediums, and methods may provide for authentication, authorization, and accounting of connecting devices connecting to a plurality of computer networks. In other embodiments, the provided computer systems, storage mediums, and methods may provide for the distribution of authentication routing data and authorization policies among a plurality of computer networks. In yet other embodiments, the provided computer systems, storage mediums, and methods may provide for the distribution of accounting among a plurality of computer networks.

Abstract: A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.

Abstract: A commuter groups service (CGS) allows commuters to join commuter groups so that they are able to socialize while commuting. Through the commuter groups, the users may share commuting routes, traffic updates, road conditions, and other information. Group members may arrange car pools, short term riding arrangements, and may anonymously or directly contact each other. The CGS may collect group member position information, e.g. GPS information, to enable the CGS to calculate traffic conditions and to select location specific information for group members. The system may include an on-line service accessible through a computer or wireless networking device. The user may log into the CGS, create or modify a user profile, and join groups of their choosing. Groups may be associated with specific events or with getting to/from work. Commuter groups may be formed for commuters that use private vehicles and/or public transportation.

Abstract: To control allocation of a portion of a shared channel to use for control information, a base station determines an amount of resource elements of the shared channel to use for the control information in place of traffic data. The base station sends, to a mobile station, an indication relating to an offset parameter, where the indication is provided to allow the mobile station to compute a value for the offset parameter such that the mobile station can determine the amount of the resource elements of the shared channel to allocate for the control information.

Abstract: Documents written using a markup language such as XML may be decomposed into Path and Parent Associated Node (PPAN) elements, each of which is a linear data structure that includes the content of a node, the parent-child relationship of the node, and the path level of the node. A number of PPAN elements may be grouped together to form A PPAN chain. A PPAN matching process uses the PPAN elements/PPAN chain to search for structured documents that match the PPAN chain. The PPAN matching process is able to perform query and match at the same time to accelerate the PPAN matching process, and also enables complex services to be represented by generic structured documents. Optionally, the PPAN matching process may support wildcard requests so that services may be discovered without prior knowledge of the services.

Abstract: In one embodiment of the present invention, a web cookie or information provided in a web cookie is accessed by a first communication client and forwarded to a second communication client during an interactive communication session (ICS). The second communication client can use the web cookie or information provided in the web cookie to operate in a defined manner. The operation may include accessing the web server that originally created and provided the web cookie to a web browser associated with the first communication client to obtain information related to a web session. This information related to the web session can be used to provide customized operation during the interactive communication session based on the prior web session. In another embodiment, an interactive communication session cookie or information in the ICS cookie can be retrieved by an associated web browser and forwarded to a web server during a web session.

Abstract: In response to a network topology change, a clock root node calculates a new clock path for each affected node by building a clock source topology tree, and identifying from that tree a path to the network node from a clock source of higher or equal stratum relative to that network node. The root node then sends a network message to each node indicating the new path that the node should use. Each node receives the message and compares the new path with the existing path. If the paths are different then the node acquires the new path just received in the message. If the paths are the same then the node does nothing and discards the message.

Abstract: An improved method is described for providing Differentiated Services (Diffserv) traffic to a node in a network that implements a security method that discards duplicate packets received at the node. The method includes the step of identifying at least two service levels to be provided to received traffic and assigning different size look-back window counts to each of the service levels. The look-back window count indicates a number of packets that have been previously received at the node that should be compared against a received packet to determine whether a duplicate packet has been received. In one embodiment, a service level that has higher priority is assigned a lower look-back window count and thus examines fewer previously received packets than a service level having a lower priority. Such an arrangement reduces the possibility that traffic having higher priority is dropped as a security measure.

Abstract: The present invention is a method and apparatus for obtaining information transmitted between a source station and a destination station in a non broadcast multiple access network. A connection between the source station and a server for the destination station is established. The server has a cache containing the information. The source station transmits a request packet having parameters relating to the information to the server. The source station receives a reply packet containing the information from the server. The reply packet matches the parameters of the request packet.

Abstract: Systems and methods of operating a communication session control server. A first communication session initiation message is received from a first communication terminal, the first communication session initiation message indicating a second communication terminal with which the first communication terminal is requesting a communication session. A second communication session initiation message is sent to the second communication terminal, the second communication session initiation message indicating a delay to be used by the second communication terminal to determine when to initiate an alerting process.

Abstract: The present invention supports a scheduling protocol on a wireless communication network to transmit data packets stored in a queue from a user. Two performance metrics are generated and summed to provide a priority. The performance metrics are based on the delay for the data packets stored in the queue and the rate that the data packets can be transmitted on the network. The user with the higher calculated priority for the current time slot has its data packets transmitted.

Abstract: Connection constraints are flooded using an extension to a routing protocol being used to control forwarding on network. Nodes maintain topology and connection database and calculate routes for connections based on the constraints. If a node is on a calculated route for a connection it will install forwarding state for the connection. Since each node has a consistent view of the network topology and has been provided with the constraints associated with the connection, each node on the network will calculate the same route for the connection. When a failure occurs, the nodes will calculate restoration paths for the connections on a network-wide priority basis to enable restoration paths to be created for the affected connections without requiring the restoration paths to be signaled. Time-stamps are used to allow events to be applied by nodes in a consistent order regardless of the order in which they arrive.

Abstract: Each equal cost path is assigned a path ID created by concatenating an ordered set of link IDs which form the path through the network. The link IDs are created from the node IDs on either set of the link. The link IDs are sorted from lowest to highest to facilitate ranking of the paths. The low and high ranked paths are selected from this ranked list as the first set of diverse paths through the network. Each of the link IDs on each of the paths is then renamed, for example by inverting either all of the high node IDs or low node IDs. After re-naming the links, new path IDs are created by concatenating an ordered set of renamed link IDs. The paths are then re-ranked and the low and high re-ranked paths are selected from this re-ranked list as the second set of diverse paths.

Abstract: An optical communication device comprises an input/output configured to be coupled to an optical communications line, and a passive optical loopback module coupled to the input and configured to receive optical signals from the input/output, the loopback module being further configured to reflect incoming signals of a test wavelength to the input/output.

Abstract: A ring control protocol is used to establish a separate control plane for a plurality of physically dual homed devices to enable collections of dual homed devices to be represented by a single pair of addresses into the attached routed Ethernet network. The gateway devices analyze the passing ring control packets to create direct mappings for data packets to the routed Ethernet network. Thus, although the dual homed devices are treated as a ring from a control perspective, the data path is implemented to be direct so that data packets continue to flow directly from the dual homed devices to each of the attached gateway devices. In one embodiment, each of the gateway devices implements a virtual switch and advertises the MAC address of the virtual switch into the routed Ethernet network rather than the MAC addresses of each of the attached Ethernet Switch Units.

Abstract: A distributed hash table is implemented to store routing information on a network. Node IDs exchanged in connection with implementation of a link state routing protocol are used as keys in the distributed hash table, and routes are stored at one or more nodes on the network. When a route is learned, the route is processed against the set of keys to determine which nodes should store the route. When a route is needed, the route is processed against the set of keys to determine which nodes should have the route information. The manner in which the route is processed against the set of keys is the same in both instances, so that the DHT may be used to store and retrieve route information on the network. The DHT may be implemented to store MAC addresses, IP addresses, MPLS labels, or other information.

Abstract: Described are a network, computer program product, and method of distributing routing information for a virtual private network (VPN) application through a packet-switched network (PSN) having fully meshed provider edge (PE) routers through Provider Backbone Bridge (PBB) tunnels. A PE router is configured to participate in a VPN and to run a BGP (Border Gateway Protocol) as an auto-discovery process for finding one or more other PE routers participating in the VPN. The VPN is associated with a PBB tunnel. A service instance identifier (I-SID) is assigned to the VPN. The PE router advertises membership in the VPN by including the I-SID assigned to the VPN in a BGP message issued during the auto-discovery process.

Abstract: The present invention provides a technique to define objects and object instances in a dynamically modifiable table within the confines of a management information base definition. With the invention, new objects and object instances may be added to the table without changing the management information base definition at a managed device or network management system. The managed device can change the table, yet allow the network management system to access the table using an associated object identifier. The network management system can systematically step through the various objects or object instances, which may correspond to rows and columns of the table, to detect additions or modifications to the table. The various objects and object instances in the table may be individually accessed, once identified, using a unique object identifier.

Abstract: A method and system for maintaining quality of service parameters for transmissions as a native Ethernet service between a first network having a first communication protocol and a second network having a second communication protocol. The interworking device includes a first network interface operable to communicate with the first communication network using the first communication protocol, a second network interface operable to communicate with the second communication network using second communication protocol and a processing unit in communication with the first network interface and the second network interface. The processing unit receives a frame from the first network in the first communication protocol, maps parameters corresponding to quality of service parameters in the first communication protocol to quality of service parameters in the second communication protocol and assembles a data packet in the second communication protocol.

Abstract: The present invention allows communicating devices to control the amount of compression used in packet sessions for transmitting streaming media to and from each other. When a communicating device detects a decrease in performance or quality of service indicative of a limited bandwidth condition, the amount of compression for the current or subsequent sessions is temporarily increased to allow the currently available bandwidth to support the session or subsequent sessions. After a set period of time, or when the limited bandwidth condition is removed, communications associated with the sessions can revert back to transporting uncompressed data or reducing the amount of compression for the sessions, thus using more of the available bandwidth.