摘要:
A method for orchestrating peer authentication during a call (e.g., a telephone call, a conference call between three or more parties, an instant messaging [IM] chat session, etc.) is disclosed. In particular, a user is first authenticated in order to participate in a call (e.g., via entering a password, etc.), and subsequently during the call the user may be peer authenticated. In accordance with the illustrative embodiment, a user who participates in a call might be prompted to authenticate another user on the call based on particular events or user behavior during the call.
摘要:
An apparatus and methods are disclosed for performing peer authentication without the assistance of a human “guard.” In accordance with the illustrative embodiments, a peer is selected from a non-empty set of candidates at authentication time based on one or more of the following dynamic properties: the current geo-location of the user to be authenticated; the current geo-locations of the candidates; the current time; the contents of one or more directories (e.g., a telephone directory, an organizational chart or directory, etc.), the contents of one or more call logs; and the candidates' schedules.
摘要:
A method is disclosed that enables the avoidance of a processor overload of a telecommunications endpoint device that is susceptible to traffic floods. An enhanced network switch sets the speed on one of its data ports as a specific function of the speeds of the devices that are connected to one or more of its other data ports. This behavior is different from that of network switches in the prior art, in which the data rate of a port in the prior art is auto-negotiated to the highest speed that can be supported by the network elements at either end of the port's connection, regardless of the other devices present. By considering the specific devices that are connected, the enhanced network switch is able to limit the amount of traffic that is directed by an upstream device, such as a router, towards a device with limited processor capability, such as a packet-based phone.
摘要:
An apparatus and methods are disclosed that enable load-balancing of routes in ad-hoc wireless networks. In accordance with the illustrative embodiment, when a candidate intermediate node receives a routing-protocol message, the node waits before it transmits a message in response to the received message, where the amount of time that the node waits is based on the value of a load metric at the node and is independent of any other nodes in the network. As a result, a node that has a larger load will wait longer to transmit its routing-protocol message, and consequently, it is less likely that this node will be selected for inclusion in the new route. The techniques of the illustrative embodiment are applicable to both proactive and on-demand routing protocols, and are also applicable to other kinds of networks.
摘要:
A contention-based network which allows real-time traffic to be exist as multiple independent linked-listed chains or under certain conditions to be assembled into multiple linked-list chains. A time separation is enforced between the various multiple chains, which are limited to a predetermined maximum number of stations that each can have in order to allow non-real-time stations to obtain timely access to the medium. Ones of the multiple chains may also be joined into a single chain. Blackburst contention is used to enable a chain to be reconstituted robustly from non-anticipated interruptions, such as the failure of one of its stations.
摘要:
A contention-based network which allows real-time traffic to exist as multiple independent linked-list chains or under certain conditions to be assembled into multiple linked-list chains. A time separation is enforced between the various multiple chains, which are limited to a predetermined maximum number of stations that each can have in order to allow non-real-time stations to obtain timely access to the medium. Ones of the multiple chains may also be joined into a single chain. Blackburst contention is used to enable a chain to be reconstituted robustly from non-anticipated interruptions, such as the failure of one of its stations.
摘要:
A facility having particular data to transmit over a transmission medium, contends for access to the medium by transmitting a jamming signal over the transmission medium for a particular duration of time that is a small fraction of the amount of time that the facility had to thus far wait to so contend. If the transmission medium is found to be idle at the expiration of that time, then the facility accesses the medium. Otherwise, the facility waits until the transmission medium again becomes idle and then re-contends for access.