Abstract: Routing and connectivity in the Internet is largely governed by the dynamics and configuration of the Border Gateway Protocol (BGP). A configuration analysis toolkit enables network operators to discover, analyze and diagnose their BGP configuration, policies and peering relationships. Statistical variance analysis in such a toolkit exploits the recurrence of policies in large networks for analysis. In a large network, policies that have similar functions are examined, e.g. all inbound route maps associated with customer autonomous systems. For n occurrences of similar policy P, it is possible to flag k deviant configurations, and evaluate the probability that the deviant configurations are in error.

Abstract: A system for fall-duplex communication using a single transmitter is presented. The system comprises a base station with a signal and data processor, peripheral detectors each placed at a distance from the transmitting antenna, and a mobile device having at least a dipole antenna having a switch and a loop antenna having a switch, wherein the sending device modulates the shorting state, i.e., the electromagnetic configuration, of the wire and coil antennas using the switches, the modulating resulting in alteration in load at the base station. This alteration can be calculated based on input from the transmitting antenna and the detectors, each input having time coding. The input from the transmitting antenna can be magnitude of propagated signal and the input from each detector can comprise a quantified signal level and the quantified signal level time-delayed by propagation time. The detectors can be peripheral signal level detecting antennas.

Abstract: A staggered execution environment is provided to safely execute an application program against software failures. In an embodiment, the staggered execution environment includes one or more probe virtual machines that execute various portions of an application program and an execution virtual machine that executes the same application program within a time delay behind the probe virtual machines. A virtualization supervisor coordinates the execution of the application program on one or more probe virtual machines. The probe virtual machines are used to detect and correct software failures prior to the execution virtual machine encountering them. The virtualization supervisor embargos output data in order to ensure that erroneous data is not released which may adversely affect external processes.

Abstract: An inventive system and method for intrusion-tolerant group management for a network is presented. The method comprises a client broadcasting a message request to controllers and validating the rekey messages received from the controllers, and controllers validating the client's broadcast message request and broadcasting proposals, collecting proposals, constructing threshold-signed proofs, updating the view umber, performing the client's message request, generating the rekey based on the valid proposals and transmitting the rekey to the client. Simultaneously, controllers send reconciliation messages to all controllers, based on which the membership state is updated. The client updates a shared key when a predetermined number of valid rekey messages are received. The controllers can communicate via a byzantine fault-tolerant agreement. The client can use its public key to decrypt the rekey and perform validation. The client's message request can be a join or a leave.

Abstract: A method for high rate data delivery in a multi-hop vehicular network comprises at each source vehicle, initiating a packet having a flow tag, assigning an identifier of the content and the current location to the flow tag, and forwarding the packet; at each destination vehicle, setting a flow request and broadcasting at the current intersection; further on movement, setting the flow request at the new intersection, and at each intersection, selecting a header vehicle at the intersection, computing backlog and congestion indicators and listening for broadcasts with a matrix and the flow requests at the header vehicle, determining if the matrix is present, updating the matrix in accordance with the backlog and congestion indicators if the matrix is present, initializing the matrix and estimating the delay on the outgoing road segments if the matrix is not present, forwarding the packet flow, and broadcasting the matrix from the header vehicle.

Abstract: The present invention advantageously provides a system and method for management of cryptographic keys and certificates for a plurality of vehicles. Each vehicle of the plurality of vehicles generates public/private key pairs, requests multiple time-distributed certificates, creates an encrypted identity, and surrenders expired certificates. An assigning authority receives the public/private key pairs, the request for multiple time-distributed certificates, the encrypted identity, and the expired certificates from said vehicle. The assigning authority authorizes the vehicle with an authorizing authority, validates the expired certificates, proves ownership, and distributes the requested time-distributed certificates to said vehicle. Validation can comprise checking expired certificates against misused, compromised and/or previously surrendered certificates.

Abstract: This invention involves a system and method to construct a visual representation of multidimensional data that works especially well for video. The system comprises an application on a mobile device having a screen, an assignment module assigning the media segments to the screen, a rendering module rendering the assigned media segments on the screen, a playback module playing the assigned media segments, a catalog module representing media metadata about the mobile content, a summarization module stewarding the media metadata, and a remote server storing the mobile content and the media metadata. The application retrieves the mobile content from the remote server and accesses the assignment, the rendering, the playback, the catalog, and the summarization modules. The system also comprises a method to log and analyze the browsing interactions of one or more users, and present a view of the media that reflects what is interesting to the user.

Abstract: An on-demand method of routing data between a plurality of local peer groups (LPG). Each LPG includes a plurality of moving nodes. The method comprises transmitting a route request message from a source node, relaying the route request message to a native boundary node; forwarding the route request message to a foreign boundary node, determining if the destination node is within an LPG for the foreign boundary node; relaying the route request message to another boundary node if the destination node is not within the LPG, relaying the route request message to the destination node if the destination node is within the LPG, receiving the routing request message at the destination node, transmitting a routing response to the source node, relaying the routing response to the source node through a path discovered by the route request, receiving the routing response at the source node, and transmitting the data, upon receipt of the routing response.

Abstract: A communications path is established among an ordered sequence of moving nodes, representing vehicles. Available channels may differ from one node to the next node and a node cannot use the same channel for both receiving and transmitting information. Three methods are described that provide an optimal sequence of channel assignments between the nodes. A sequence of channel assignments is called optimal if it establishes a communications path from the first node in the sequence to the last node in the sequence, or, if such a path does not exist, from the first node to the farthest node possible in the sequence. The first method uses a depth-first search starting from the first node in the sequence. The second method uses a “look ahead” scheme in the depth-first search method. The third method requires only a single pass through the sequence of nodes by identifying optimal channel assignments in subsequences of nodes without a need for backtracking.

Abstract: A method of controlling a wireless communication device that is installed in a moving vehicle. The method comprises receiving roadway topology information and vehicle traffic pattern information, receiving vehicle and wireless communication device performance information from a plurality of other moving vehicles, determining current position information for the moving vehicle; determining a first set of metrics for a performance of the wireless communication device installed in the moving vehicle, estimating at least one second metric related to the performance of the wireless communication device or an ad-hoc network which includes each wireless communication device and changing an operation or routing parameter for the wireless communication device based upon the estimation. The second metric is based upon at least a sub-set of the first set of metrics, the received information and the determined current position information for the moving vehicle.

Abstract: A system and method for self and group location and tracking based on ultra wide band ranging among members of the group is presented. The system comprises an anchored station, a plurality of nodes, each node having at least knowledge of where the node is facing and heading, knowledge of all pair wise distances among all of the plurality of nodes, and ability to exchange information among the nodes and with the anchored station via relays. The system and method find a new position estimate of the group in accordance with an adaptive search process based on constraints of the ultra wide band ranging, and the search process enables extracting directional information and adaptively stabilizing orientation of the group. In one embodiment, adaptively stabilizing the orientation of the group is performed using an orientation-correcting polygon matching process.

Abstract: A distributed quantum relay architecture is disclosed. In one embodiment of this architecture, time and wavelength division multiplexing are used to enable a laser pump pulse, already used to create an initial entangled photon pair, to be distributed to a remote relay site, on the same optical fiber as a photon from that initial pair. At that remote site, the pump pulse is amplified and used to locally create the second entangled photon pair that is required for quantum teleportation. This embodiment enables the placement of quantum repeater stations at remote locations without complicated dedicated channels to distribute the pump or electronics. In addition, as lasers are generally among the most expensive components, a significant cost savings is gained, in this embodiment, by using only one pump laser instead of two (or more) as in previous quantum teleportation efforts.

Abstract: A mechanism by which handoff delay can be minimized while not compromising the IMS/MMD security and also protecting the media if required by certain applications is presented. One proactive method includes proactive authentication. Another proactive method includes proactive security association, such as transferring SA keys from old proxy to new proxy, or transferring keys through serving signal entities. Reactive methods include transferring SA keys from old proxy to new proxy, using either push or pull technology. Other reactive methods include transferring keys through serving signal entities using either push or pull technology.

Abstract: A method for routing a multicast message comprising the steps of receiving a multicast message including at least a message, a source identifier, a sequence number, a time-to-live value and a multicast group destination, determining if the multicast group destination is in a multicast forwarding table, determining if the message has been previously received, adding the multicast message to the multicast forwarding table if it is determined that the multicast message has not been previously received, determining if a node that received the multicast message is a forwarding node; randomly setting a wait time for forwarding the multicast message; and forwarding the multicast message at the expiration of the wait time.

Abstract: The present invention offers systems and methods for effective multiple-hop routing, multicasting and media access control for vehicle group communications that employ directional wireless radio technology. Multi-beam optic-wireless media and streamlined operations provide low-overhead communications among vehicles. Systems and methods are provided to maintain a quasi-stationary group of neighboring vehicles, enable high-throughput on-demand switching among multiple vehicles, enable group coding in the vehicle group to achieve higher throughput, and enable dynamic adjustment of link to maintain desirable vehicle group. The proposed solution builds upon the conception of a MAC-free wireless operation and quasi-stationary vehicular switched network to achieve ultra-low-overhead and high-throughput vehicle communications.

Abstract: Aspects of the invention pertain to user session management in load balanced clusters. Multiple application servers communicate with a central data server to ensure there is a single session per user ID. The central data server maintains a user session index and a parameter table. Each time a network access is attempted using a given user ID, a load balancer assigns the session to one of the application servers. The assigned application server queries the central data server to determine whether a session status for the user's login ID is inactive or active. If inactive, a new, unique value is assigned as the session number. If active, the session number is evaluated to determine whether multiple sessions exist. In this case, one of the sessions is terminated to ensure a single session per user ID. Preferably, the terminated session is the earlier session.

Abstract: A MOAF algorithm is used to resize cells for balancing capacity. The MOAF algorithm bases its decision on a cell and all other cells which the algorithm decides are sufficiently close in a propagation sense to affect the results. The MOAF algorithm also automatically determines those cells in an area which are most heavily loaded and those cells which are lightly loaded. The MOAF algorithm will only decrease the size of a cell if it determines specific adjacent cells that are willing and able to accept the load, and the MOAF algorithm will increase the size of a cell only if there is a nearby heavily loaded cell that requires the removal of load. Moreover, the MOAF algorithm can be tuned (via the threshold parameter T) to shift the focus of the optimization from avoidance of coverage holes to the avoidance of creation of excessive handover legs.

Abstract: The present invention is directed to an in-passband signaling method. The method includes the steps of extracting a control component and a data component from an optical signal. The control component may be used to determine the state of an optical switch in either a packet-switched network or circuit-switched network. The state of the optical switch is switched based on the extracted control signal. The control component may also be used to provide other network functions such as network operations, administration, and management (OA&M), network monitoring, and network control and management (NC&M). The control component is erased by polarization realignment of the optical signal. The control component is updated by remodulating the polarization state of the data component.

Abstract: A channel buffering method is for dynamically altering a number of channels for an Internet protocol television (IPTV). The method is applicable for a home gateway (HG) having a channel section used for channel buffering. After the HG has received two consecutive channel-switching requests, the HG compares whether the two requests are similarly directed to switching a channel towards the same direction or not; if yes, a cumulative switching frequency is set, and two trimming numerical values are set through the cumulative switching frequency, and thus, the channel section for buffering the channels can be dynamically adjusted through the two trimming numerical values.

Abstract: A method for distributing a packet to a plurality of moving nodes comprising receiving a packet containing at least a message, a sender identifier, a location of a sender, an identifier for a relay node and distance from the sender and the relay node, determining if a node receiving the packet is the relay node and immediately distributing the packet to a plurality of moving nodes if the receiving node is the relay node. If the receiving node is not the relay node, the method further comprises steps of waiting a set period of time, determining if a packet is received from a different sender containing the same message, within the period of time and distributing the packet to a plurality of moving nodes if a packet containing the same message is not received within the period of time. The distributed packet includes an identifier for a successive relay node.