Abstract: A method for the efficient routing of data packets across a plurality of routers when a link is unavailable which includes connecting a plurality of nodes in a network using a plurality of routers having a plurality of links between the routers, informing the routers in the network when one or more of the links in the network will be unavailable at a specified time in the future, recalculating the routing tables to determine the most efficient routing paths when the links in the network become unavailable and, when the time in the future arrives, switching the routers in the network to the new routing tables at the same time.

Abstract: A method for the efficient routing of data packets across a plurality of routers when a link is unavailable which includes connecting a plurality of nodes in a network using a plurality of routers having a plurality of links between the routers, informing the routers in the network when one or more of the links in the network will be unavailable at a specified time in the future, recalculating the routing tables to determine the most efficient routing paths when the links in the network become unavailable and, when the time in the future arrives, switching the routers in the network to the new routing tables at the same time.

Abstract: The present invention comprises a device and method for provider initiated transfer of data from a local network of a user, at a rate and time designated by the provider in order for a provider to balance local network traffic loads or due to another need of a service provider and allow a user to more quickly copy data to be placed at a location on a wide area network. Further, the provider may be notified when data is stored at the designated location or based on provider-initiated request for changed data. The provider may evaluate data traffic on its network to determine when and at what speed a transfer of data should be initiated from the designated location to the provider's network for storage at a second location on, for example, the wide area network.

Abstract: The present invention permits a network service provider to detect an operational condition—such as congestion—in a packet-switched network and to alleviate such congestion by providing customer incentives to avoid use of the network. The detection mechanism triggers an incentive such as the modification of the user's access charges and the customer can be immediately notified of either the occurrence of the congestion or of information regarding the incentive. Usage of the network during congested periods can be deterred by imposing additional access charges during such periods—similarly, customers can be given a discount to encourage usage during period of low congestion. An incentive schedule can be tailored to dynamically change the usage patterns of the customers of the network to accommodate the operational conditions in the network.

Abstract: A method and apparatus for implementing a distributed firewall is described. A packet filter processor receives a packet sent from a first device to a second device. The packet filter processor authenticates an identifier for the packet. For example, authentication could be performed using a cryptographically-verifiable identifier. The packet filter processor determines whether to send the packet to the second device, based on the authentication and a set of policy rules.

Abstract: Encryption with keys that form an Abelian group are used in combination with a semi-trusted party that converts queries that are encrypted with the key of a querier to queries that are encrypted with the key of the encrypted database, without knowing the actual keys. In an illustrative embodiment, encryption is done with Bloom filters that employ Pohlig-Hellman encryption. Since the querier's key is not divulged, neither the semi-trusted party nor the publisher of the database can see the original queries. Provision can be made for fourth party “warrant servers”, as well as “censorship sets” that limit the data to be shared.

Abstract: A method for the efficient routing of data packets across a plurality of routers when a link is unavailable which includes connecting a plurality of nodes in a network using a plurality of routers having a plurality of links between the routers, informing the routers in the network when one or more of the links in the network will be unavailable at a specified time in the future, recalculating the routing tables to determine the most efficient routing paths when the links in the network become unavailable and, when the time in the future arrives, switching the routers in the network to the new routing tables at the same time.

Abstract: A system and method for providing telephony and high-speed data access over a broadband access network, comprising a network interface unit (NIU) coupled to a backup local exchange carrier (LEC) line, the broadband access network coupled to the NIU, an intermediate point-of-presence (IPOP) coupled to the broadband access network, and at least one external access network coupled to the IPOP. The system also provides for a fail-safe mode in which the NIU supports the LEC line for lifeline services.