Abstract: An open communication method between at least two sub-networks using a broker node. Each of the sub-networks has a different routable network addressing scheme. The method comprises receiving a packet for a specific application, the packet includes an application identifier, determining if the packet is to be relayed to another of the at least two sub-network based upon the application identifier, determining if a node receiving the packet is a broker node, relaying the packet to a broker node if not a broker node and forwarding, by the broker node, the packet to at least one node in another of the at least two sub-network. The node generating the packet is configured to communicate using a first of the at least two sub-networks. A broker node is configured for communicating using at least two of the at least two sub-network via a corresponding routable network addressing schemes for each of the sub-networks.

Abstract: A method of employing an encoding scheme for media independent handover, comprising: having at least some data type carry only required information to determine the end of data without a length value.

Abstract: Peer-to-peer mobility management in heterogeneous IP networks provides a peer-to-peer mobility module operable to intercept a data packet received at a communication protocol layer of an Internet Protocol communication stack. A translation table may be stored on memory device. The translation table stores real address of one or more network interfaces and a corresponding virtual address. The peer-to-peer mobility module may be further operable to modify the intercepted data packet using the real address and virtual address stored on the translation table.

Abstract: A multiple hop communications method among a plurality of moving vehicles. Each moving vehicles has a plurality of unidirectional radio. The method comprises receiving an incoming packet at one of the plurality of unidirectional radios, determining if there is an active link between each of the plurality of unidirectional radios and an unidirectional radio of a neighbor vehicle, relaying the incoming packet to the plurality of unidirectional radios having an active link and transmitting the incoming packet as an outgoing packet from at least one of the plurality of unidirectional radios. If more than one packet is received, the packets can be encoded using group coding before send the packets out as an outgoing packet.

Abstract: An apparatus and a method are operable to enable peer-to-peer communication between a first communication node having a first server application and an associated first client application and a second communication node having a second server application and an associated second client application in a wireless ad hoc network. In one embodiment, the apparatus includes memory including computer program code configured to, with a processor, cause the apparatus to determine an identity and service capability of the second communication node, initiate the first client application on the first communication node, enable the first server application with the first client application on the first communication node to communicate with the second client application via the second server application on the second communication node, and provide a service associated with the first client application and the second client application between the first server application and the second server application.

Abstract: A communication node operable to estimate faults in a mobile ad hoc network and method of performing the same. In one embodiment, the communication node includes a processor and memory including computer program code configured to, with the processor, cause the communication node to monitor a set of observable parameters at the communication node, produce a fault estimate at the communication node from the set of observable parameters, and provide the fault estimate to a global fault detector at another communication node.

Abstract: Mobile wireless devices may receive data streams from multiple remote sensors. The sensors may have limited power supplies and memory capacity. Aspects of the invention use statistical characteristics of the sensor data streams and the cost of acquiring a single element of each stream to determine what sequence the sensors should send their data streams in. The cost of acquiring the data may be modified dynamically, depending on parameters such as block size. Additional factors, such as a sensor's buffer capacity, may limit the amount of stream elements that may be cached and affect the sensors' stream transmit sequence. The evaluation order may be dynamically modified using an event processing engine, to reflect both changing statistics of underlying sensor stream tuples and time-varying acquisition costs associated with individual streams. This helps to increase in the operational lifetime of the sensors and associated monitoring applications.

Abstract: A method provides for the optimal location of servers and the optimal assignment of programs to the servers in a video-on-demand (VOD) network with a tree topology. Each node may have demands for multiple VOD programs. The central server at the root of the network stores all programs, and each of the other servers may store some of these programs. The cost considered include cost of servers, cost of assigning programs to servers, and cost of link bandwidths used for broadcasting programs from servers to demands at various nodes. The demand for a specific program is served by the closest server that has this program along the path that connects the requesting node to the root of the tree network. The invention consists of a dynamic programming method that determines optimal server locations and optimal program assignments for minimizing the costs.

Abstract: The OSS provides unique and automated provisioning, activation, fallout management and monitoring of SONET and WDM networks comprising control plane mesh and traditional SONET/WDM Rings/Chains. Resource discovery and dynamic provisioning provides for increased use of network bandwidth. It is possible both all control plane networks and mixed control plane and traditional networks. Network connections or the network topology may be accomplished in a hop-by-hop manner.

Abstract: This paper proposes a new method and architecture for populating, updating and managing the NAB. It also proposes user's Contact Information Discovery (CID). In context of populating the NAB; since the NAB of each individual subscriber will be stored in the network in future, the paper proposes CI to flow from one NAB to another NAB within the core network, instead of CI flowing from Device to Network. Thus with the user authorization, his CI would shoot from one NAB to another NAB within the core network instead of from LAB to NAB through air interface. It would reduce huge amount of data traffic on the air that otherwise would be generated in updating and populating the NAB by all the NAB users. In context of CID, the paper proposes a query-response mechanism and introduces a NAB Manager. The new architecture will provide several benefits for example it will eliminate the need of “Number Portability,” “United States National Do Not Call Registry” and “411 Directory Assistance.

Abstract: One or more system and/or method of dynamically setting values of Channel Access Parameters employing a Load Supervision Manager entity, a Quality of Service Parameters Manager entity, and an Access Point. The entities work with the Access Point and continuously monitors network loading conditions and setting Channel Access Parameters values in response to network loading conditions. The Load Supervision Manager is a controlling and/or supervisory entity that sits at a network level receives information from the QoS Parameters Manager which sits at a subnet level, and judges prevailing loading conditions. The prevailing loading conditions include such factors as the number of Mobile Nodes and the applications or ACs they are running on in each subnet. The QoS Parameters Manager assesses the possible near future loading condition in each subnet including monitoring the hand-off Mobile Nodes and issues directives to QoS Parameters Managers.

Abstract: The inventive system for providing strong security for UDP communications in networks comprises a server, a client, and a secure communication protocol wherein authentication of client and server, either unilaterally or mutually, is performed using identity based encryption, the secure communication protocol preserves privacy of the client, achieves significant bandwidth savings, and eliminates overheads associated with certificate management. VDTLS also enables session mobility across multiple IP domains through its session resumption capability.

Abstract: Network architecture configured for open communication between a plurality of sub-networks. Each of the plurality of sub-networks has a different routable network addressing scheme. The architecture includes at least one broker node adapted to communicate using at least two different routable network addressing schemes. The broker node comprises an identification management module configured to collect peer-application addresses for nodes currently accessing a specific application, the peer-application addresses being associated with a specific application, an address resolution module configured to map each of the peer-application addresses to a sub-network specific routable network address and a network coordination module configured to monitor and coordinate sub-network communication capabilities between the broker node and at least one other broker node and elect a primary broker node for each sub-network which the broker node and at least one other broker node is capable of communication.

Abstract: A system and method for modeling and evaluating resource requirements of services is disclosed. The system and method in one aspect enable describing an application session in a software model, for example, as a sequence of events in a sequence diagram, annotating the sequence diagram with information and using the sequence diagram and the information to create a mathematical model such as a Markov model that represents the application session. Once in Markov form the service can be analyzed. The system may include a user interface for allowing a user to enter annotations to the sequence diagram.

Abstract: A system and method for locating a wireless client using trusted wireless detectors is described. Sniffers may sense signal strength information and transmit the information to a database. The database may store signal strength-based location information. Information from the database may then be used to determine the location of a wireless client based on new signal strength information from one or more sniffers.

Abstract: An apparatus, system and method are introduced for preserving privacy of data in a dataset in a database with a number n of entries. In one embodiment, the apparatus includes memory including computer program code configured to, with a processor, cause the apparatus to form a random matrix of dimension m by n, wherein m is less than n, operate on the dataset with the random matrix to produce a compressed dataset, form a pseudoinverse of the random matrix, and operate on the dataset with the pseudoinverse of the random matrix to produce a decompressed dataset.

Abstract: A distributed method and system are presented for determining the largest Signal-to-Interference-and-Noise Ratio (SINR) that can be achieved by a plurality of small wireless cells, such as femtocells or picocells, while satisfying a specified SINR value for multiple large cells, referred to as macrocells. The method also determines the minimum power levels at each of the femtocells that achieve the maximum SINR for the femtocells. The distributed synchronous algorithm executes all intensive computations independently, locally at each of the femtocells. The computations are synchronized in time and executed simultaneously at all cells where after each of the iterations information of interim power selections at the multiple cells is exchanged among the femtocells. Eventually, the computations converge to the maximum SINR value and the corresponding minimum-power solution.

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. Methods for mitigating delay during SA re-association and mitigating the IPSec tunnel overhead for signaling and media at the Mobile Node are given. In one embodiment, SA keys can be transferred from the old P-CSCF to new P-CSCF, enabling the establishment of SAs before Mobile Node physically moves to the new subnet in a network. Proactive handover is used. In another embodiment, SA keys are transferred from S-CSCF to new P-CSCF. In this case, the SA keys are transferred to the new P-CSCF by S-CSCF through a context transfer mechanism well in advance so that SAs may be established before Mobile Node physically moves to new subnet. In another embodiment, methods for mitigating IPSec tunnel overhead are presented.

Abstract: A set of certificate management methods designed to significantly reduce or eliminate reliance on infrastructure network connectivity after vehicles are sold uses techniques to support certificate management operations in order to reduce the frequency which vehicles need to communicate with the Certificate Authorities (CAs) and the amount of data that needs to be exchanged between vehicles and the CA. These methods include, for example, approaches to use one-way communications and vehicle-to-vehicle (V2V) communications to replace expired certificates, approaches to use one-way communications and V2V communications to replace revoked certificates, and use of a small subset of vehicles as proxies to help retrieve and distribute Certificate Revocation Lists (CRLs) and replacement certificates. The combination of these techniques leads to solutions that can eliminate the need for roadside infrastructure networks completely.

Abstract: Method, User equipment, system and program for limiting an amount of information transmitted between a plurality of user equipments and a server. The method comprising establishing communication links between a plurality of user equipments based upon a proximity of the plurality of user equipments, determining a tactical common mission group selected from the linked plurality of user equipments using a mission profile stored in each of the plurality of user equipments; and selecting a proxy for the tactical common mission group. The proxy communicates with a server on behalf of the tactical common mission group. A proxy is selected based upon a ranking.