Abstract:
A method and apparatus for alerting nodes of a malicious node in a mobile ad-hoc communication system is provided herein. Particularly, a method and apparatus for distributing an alert message to nodes surrounding a recently discovered malicious node is provided. This alert technique further leverages mobility to distribute the alert message to a large majority of nodes in the ad hoc wireless network within a reasonable amount of time.
Abstract:
A system (100) and method (300) for mesh/ad hoc participation is provided. The method can include providing (310) an incentive to a user operating a device in an ad hoc network and determining (320) network resources associated with providing the incentive. The method can establish a credit system for devices within the ad hoc network, evaluate a supply and demand for the network resources, and allocate credits to the devices for forwarding packets in the ad hoc network. The method can determine a delivery capacity for the devices and negotiate an optimal packet route through the devices in the ad hoc network based on the supply and demand.
Abstract:
A method and device are useful for enabling a trust relationship using an unexpired public key infrastructure (PKI) certificate, where a current status of the PKI certificate is unavailable. The method includes determining at a relying party that a certificate status update for the PKI certificate is unavailable (step 905). Next, in response to the certificate status update being unavailable, a tolerable certificate status age (TCSA) for the PKI certificate is determined at the relying party based on one or more attributes associated with a certificate holder of the PKI certificate (step 910). Using the PKI certificate, a trust relationship is enabled between the relying party and the certificate holder after determining the TCSA and before an expiration of the TCSA (step 915).
Abstract:
A method and apparatus for efficient management of hierarchically administered spectrum resources in a communications network are disclosed. The method may include receiving a request for a policy decision from a policy enforcement point at a current policy decision point level in a hierarchy of policy decision points, determining whether the request can be satisfied at the current policy decision point level, wherein if the request cannot be satisfied at the current policy decision point level, forwarding the request to a policy decision point at a policy decision point level that is higher in the hierarchy, otherwise retrieving policy information from a policy database, determining a policy decision, wherein if the request was received from the policy enforcement point at the current policy decision point hierarchy level, sending the policy decision to the policy enforcement point at the current policy decision point level in the hierarchy, otherwise, sending the policy decision to a policy decision point level lower in the hierarchy.
Abstract:
A system (100) and method (300) for mesh/ad hoc participation is provided. The method can include providing (310) an incentive to a user operating a device in an ad hoc network and determining (320) network resources associated with providing the incentive. The method can establish a credit system for devices within the ad hoc network, evaluate a supply and demand for the network resources, and allocate credits to the devices for forwarding packets in the ad hoc network. The method can determine a delivery capacity for the devices and negotiate an optimal packet route through the devices in the ad hoc network based on the supply and demand.
Abstract:
A method and apparatus in a multicast transmission system for routing packets including a scalable architecture that supports QoS. Redundant state information is minimized in the MOSPF multicast forwarding cache of each router in the communications system, thereby rendering MOSPF considerably more scalable. In a particular embodiment, cache redundancy is minimized by using a class of graph compression algorithms to solve a graph compression problem. In another embodiment, the forwarding cache is further consolidated by separating state information pertaining to individual source routers in a multicast group from state information pertaining to the entire multicast group.
Abstract:
Bridges (10, 12, 14) are used to interconnect local area networks transparently. In the IEEE 802.1D standard for bridges, a spanning tree is built among the bridges for loop-free frame forwarding (FIG. 10). Although this approach is simple, it does not support all-pair shortest paths. A novel bridge protocol is employed that attempts to find and forward frames over alternate paths that are shorter than their corresponding tree paths on the standard spanning tree, and makes use of the standard spanning tree for default forwarding. The proposed protocol, referred to as the Spanning Tree Alternate Routing (STAR) Bridge Protocol, is backward compatible with the IEEE 802.1D standard and has a complexity that is comparable to that of the standard and other existing protocols.
Abstract:
A technique for controlling outliers in offered load estimation in a shared medium communication network is achieved by partitioning the set of all possible sample value combinations, according to some predetermined partitioning scheme, based on a measure of proximity to a locus of expected sample values into a set of “trusted” sample value combinations and “untrusted” sample value combinations.
Abstract:
The problem of allocating bandwidth on the upstream channel of an HFC cable network for contention-based transmission of requests that are used to reserve upstream bandwidth for transmission of user data is solved by a method of allocation which dynamically adapts to the prevailing offered load of reservation requests. In one embodiment this is done by determining an appropriate size for a contention interval in each upstream transmission frame by attempting to balance the rates of flow of user data into and out of a virtual global data queue using a fluid approximation method that is based on a solution to a balanced equation relating the demand and supply of slots for data transmission within each frame.
Abstract:
A method and device are useful for enabling a trust relationship using an expired public key infrastructure (PKI) certificate. The method includes determining at a relying party a maximum permissible grace period during which the PKI certificate can be conditionally granted a valid status (step 905). Next, at the relying party an uncertainty interval is determined, during which the relying party is unable to detect a revocation of the PKI certificate (step 910). A certificate grace period is then determined at the relying party from a function of the maximum permissible grace period, the uncertainty interval and at least one attribute defined in the PKI certificate (step 915). Using the PKI certificate, a trust relationship is then enabled between the relying party and a certificate holder of the PKI certificate, after determining the grace period and before an expiration of the grace period (step 920).