Abstract: The present invention provides methods for efficient control message distribution in a VANET. Efficient flooding mechanisms are provided to fulfill the objective of flooding (delivering a message to every connected node) with a limited number of re-broadcasting by selected key nodes. A suppression-based efficient flooding mechanism utilizes a Light Suppression (LS) technique to reduce the number of flooding relays by giving up the broadcasting of a flooding message when a node observes downstream relay of the same flooding message. Additionally, a relay-node based efficient flooding mechanism selects Relay Nodes (RN) to form an efficient flooding tree for control message delivery. RNs are nodes that relay at least one control message, for instance a Membership Report (MR) to the upstream node in “k” previous control message cycles The upstream node may be the group header (GH) for the LPG.

Abstract: A method for multiscale sampling for wide dynamic range electro-optic receivers is presented. The method comprises obtaining a signal, reproducing the signal into first and second signals, scaling one signal with respect to the other, modulating both signals with the same modulation function, and utilizing the resulting vector response function to invert the response of the link over a greater dynamic range than would otherwise be possible with a single instance of the modulated signal. The sealed modulation response may be obtained by splitting the signal into two polarizations and utilizing a modulator having different response for the two polarizations, or by utilizing two modulators.

Abstract: A distributed method is presented for determining equitable bandwidth allocations in a content distribution tree network, where the root of the tree has a server that broadcasts multiple programs throughout the tree. The intensive computations in the distributed method are done at each of the nodes independently while only minimal information is exchanged among the nodes. Each network link has limited capacity. The allocation problem is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that provides equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree-like ordering constraints imposed on each of the programs. The distributed method converges to the equitable solution in a finite number of iterations. The distributed method can be applied to a network comprised of multiple trees.

Abstract: The inventive system and method for improving network security, availability, and regulatory compliance, and maximizing a network comprises a network configuration component, a network inventory component, a network monitoring component, and a network assessment component, wherein information is extracted from each of the configuration, inventory, and monitoring components, the extracted information is combined and assessed in the assessment component, and the maximized network is produced using the combined information. In one embodiment, the combined information is stored in a database. In one embodiment, an XML is produced from the extracted inventory information, and this XML is converted to a canonical form.

Abstract: A system and method provides a solution to the problem of applying end-to-end requirements of connectivity, security, reliability and performance to configure a network and ultimately assign network components to the network. All requirements are modeled as constraints and a constraint solver does the resolution. Not every constraint to be solved is solved by the model-finder. Instead, we “factor away” subsets of a constraint that can be efficiently solved via a special-purpose constraint solver, such as an SQL/Prolog engine, linear programming system, or even an algorithm, leaving behind a constraint that truly requires the power of model-finding, and that is often efficiently solvable by existing model-finders. Such constraints are compiled into quantifier-free constraints that are Boolean combinations of constraints of two forms x=y and x=c where x, y are variables and c is a constant. Such constraints can be efficiently solved by modern SAT-based model-finders.

Abstract: The design of optical telecommunication networks is such that there is provision of end-to-end path restoration to specified demands under up to two links or nodes failures. Restoration routes are provided on Path Protecting Preconfigured Cycles (PP-PCs), where each demand is assigned one or two restoration routes and restoration wavelengths on a segment of one cycle. Splitting of demand across multiple restoration routes is not allowed. All restoration routes and restoration wavelengths are predetermined where multiple demands may share restoration wavelengths without resorting to intermediate switching or wavelength conversions along restoration routes. First, numerous candidate PP-PCs are generated. Assignment of demands with common failure scenarios are allowed, under certain conditions, to the same PP-PC. Next, a set of PP-PCs is selected from among the candidates, while minimizing total reserved restoration wavelengths cost and ensuring that all demands are protected as required.

Abstract: Systems and methods for efficiently provisioning and assuring Quality of Service (QoS) between user networks communicating over a DiffServ-enabled network, with QoS management transparency to SIP user agents. The system comprises user networks communicating via a core network, each user network having a source and destination SIP user agent respectively, a SIP proxy server between the source SIP user agent and destination SIP user agent, a Bandwidth Manager to provision a pipe between the source user network and the destination user network, wherein the pipe has a specified bandwidth, and a QoS Agent for accepting and/or rejecting a SIP session based on availability of bandwidth in the pipe; wherein the SIP proxy server is configured to forward an incoming SIP request to the QoS Agent. The method comprises provisioning a pipe between the SIP user agents or their respective user networks, and allowing/rejecting incoming SIP sessions based on the available bandwidth in the pipe.

Abstract: A method and system for providing an attention hotspot in temporal media is provided and executes following explicit or implicit user actions. The method comprises identifying at least one event related to playback or browsing of the temporal media, deriving the significance of the identified event in accordance with one or more rules, assigning a signifier based on the derived significance of the event, and associating the signifier with a specific segment of the temporal media and user. The system comprises a server and a mobile device, wherein the server is operable to identify at least one event related to playback of the temporal media, derive the significance of the identified event in accordance with one or more rules, select a signifier based on the derived significance of the event, and associate the signifier with a specific segment of the temporal media. The server aggregates and averages the cumulative attention hotspots of a greater community for the purposes of improving user experience.

Abstract: A method for transmitting data in vehicular network comprising determining a communication window between at least two nodes, grouping a plurality of fragments of content together into an aggregate fragment block, forwarding the aggregate fragment block to a target node and assembling the plurality of fragments into the content. The content is divided into the plurality of fragments. A fragment signature is generated for the fragments that contain fragment index information regarding each fragment. Each fragment is unambiguously identified by its signature. A number of fragments grouped into the aggregate fragment block is dependent on the communication window.

Abstract: A system and method for determining an efficient assignment of information categories to multicast addresses is described. In one embodiment, the assignment takes into account the overlapping info cation needs of the subscriber nodes and the network bandwidth that will be consumed in the dissemination of each information category based on its size and the frequency of dissemination. In another embodiment, the assignment takes into consideration the additional constraint of a quality of service network having different prioritizations associated with the information categories.

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: A high data rate optical signal is inverse multiplexed into a multitude of lower-rate tributaries, each of which is coded by its unique OCDM code, and the combined coded tributaries are injected into a common phase scrambler. Coherent summation of these optically encoded tributaries pass through a shared phase or phase and frequency scrambler before exiting the secure location. The setting of the scrambler acts as the key. The authorized recipient with the correct key retrieves the ones and zeros of the several decoded signals.

Abstract: A method for distributed computations for fault-diagnosis in a system whose fault propagation model has deterministic couplings between faults and symptoms includes creating a ‘relation graph’ in which the nodes correspond to the potential faults, with two nodes connected by a ‘relational link’ if their corresponding faults have an observed symptom in common. Each relational link is assigned a weight equal to the sum, taken over the symptoms represented by the relational link, of the reciprocal of the number of distinct fault-pairs that produce each such symptom. The relation graph is then partitioned into several domains, while minimizing the number of cross-domain relational links, which correspond to cross-domain symptoms.

Abstract: A system and method for improving quality of experience (QoE) of using a mobile device can comprise utilization of stored information relating to RANs of service providers and QoE ratings, receiving an event related to the RANs or to mobile Web browsing actions, receiving requests for QoE metrics based on the event, parsing and interpreting results of the QoE metrics; preparing and beginning an emulation session of the RANs, choosing a presentation style, rendering QoE in accordance with the browser actions and the presentation style which can be purely quantitative comparison, pre-recorded session, limited interaction-emulated session, live interactive session and live automatically controlled non-interactive session, and enabling user input according to the presentation style.

Abstract: A method and apparatus for detecting spoofed IP network traffic is presented. A mapping table is created to indicate correlations between IP address prefixes and AS numbers, based on routing information collected from a plurality of data sources. At each interface of a target network, IP address prefixes from a training traffic flow are acquired and further converted into AS numbers based on the mapping table. An EAS (Expected Autonomous System) table is populated by the AS numbers collected for each interface. The EAS table is used to determine if an operation traffic flow is allowed to enter the network.

Abstract: A method and system for determining a size of a local peer group (LPG) network in a dynamic roadway (mobile) environment is provided. In one embodiment, the method comprises measuring a roundtrip time between a first node and a second node, and utilizing the measured roundtrip time to select the size of the local peer group network from a lookup table. In another embodiment, the method comprises determining when the roundtrip time exceeds a time interval of the heartbeat signal, and when the roundtrip time exceeds the time interval of the heartbeat signal adjusting the size of the local peer group network.

Abstract: The design of telecommunication networks is such that there is provision of end-to-end path protection to multiple demands under a single link or node failure in the networks. Restoration routes are provided on Preconfigured Virtual Cycles (PVC's), where each demand is assigned one restoration route and specific restoration wavelengths on a segment of one cycle. Multiple demands may share restoration wavelengths, and the number of restoration wavelengths may vary among the PVC links. First, a plurality of candidate PVC's are generated where each demand may be assigned to multiple candidates. Assignment of demands with common failure scenarios are allowed, under certain conditions, to the same PVC. Next, a set of PVC's is selected from among the candidates, while minimizing total reserved restoration capacity and ensuring that all demands are protected. Next duplicate assignments are eliminated. Finally, conflicts of wavelength assignments are resolved. The invention focuses primarily on optical networks.

Abstract: A system and method for intelligent, context-sensitive enhancement of transactions among a plurality of mobile hosts, each having a local coordinator, engaging in services comprising an actual coordinator and an intelligence coordinator that determines context regarding the mobile hosts, and leverages the context to enhance the transactions between the local coordinators and the actual coordinator. The context can be leveraged by reducing the number and/or the amount of data of the transactions. The context can comprise a physical location, temporal data, and a network load near and at a network location of the mobile host. The system can also have an application operating on the services, in which the intelligence coordinator can improve performance of the application. The intelligence coordinator can receive and parse a meta-expression piggy-backed on a transaction message to enhance transactions.

Abstract: A method for establishing and maintaining the network and a corresponding ad-hoc moving-device to moving-device network having a plurality of moving-devices grouped into a Local Peer Group (LPG) is disclosed. A group header node (GH) is selected from the plurality of moving wireless devices in the LPG. The GH controls and manages the LPG by broadcasting a plurality of control messages, including a heartbeat message at a fixed interval. The LPG also includes at least one group node (GN). The at least one GN can communicate with the GH via a network link created between the at least one GN and the GH. The GNs join the LPG via the GH. If there is more then one GH in an LPG, header resolution occurs to select only one GH.

Abstract: A system and method for network fault diagnosis in a network having network elements is presented. The method comprises creating a network causality model, generating Boolean expressions from the network causality model, converting the Boolean expressions into SAT sets, receiving network monitoring results, correlating these monitoring results with the SAT sets, and enumerating all possible diagnostic explanations of potential faults, properly annotated. Creating a network causality model can comprise creating, for each network element, an element-specific causality model, stitching together all network elements using the element-specific causality models and a network topology, retrieving monitoring state and propagation information, and generating the network causality model using the stitched together network elements and the monitoring state and propagation information.