Patent application number | Description | Published |
20090279444 | Method and apparatus for discovering, negotiating, and provisioning end-to-end SLAs between multiple service provider domains - Domains (multiple collaborating service providers) create service offerings between pairs of edge nodes that interconnect with other domains in the network. The service offerings may specify the available bandwidth, quality of service, reliability, available security, price, subscriber and service contextual specific and other SLA information. When a new service is to be created, the service definition is used along with information about the available service offerings to determine a set of networks to implement the service. Information associated with the service offerings may be flooded to all other networks. Alternatively, the service offering information may be provided to a trusted third party (SLA broker) which may provide SLA services on the network to select sets of domains to implement inter-domain services, and may also proxy to set up the service for the SLA requesting party. A hybrid approach may also be used wherein some SLA information is flooded and other information is retained in secret and provided only to the SLA broker. | 11-12-2009 |
20100322244 | Utilizing Betweenness to Determine Forwarding State in a Routed Network - A set of critical nodes or links is identified on the network through which most of the shortest paths on the network occur. Each node compares their distance to end points on the network with a distance between the end points and each of the distinct critical nodes. Where the distance between the end points and the critical nodes is shorter than the distance between the end points and the node, the node is not on the shortest path and does not install forwarding state. Where the distance between the end points and the critical node is larger than or equal to the distance between the end points and the node, the node may be on the shortest path between the pair of end nodes and installs forwarding state. Installation of forwarding state may cause packet duplication, but determining forwarding state is dramatically simplified. The level of duplication may be reduced by selecting a larger number of critical nodes on the network. | 12-23-2010 |
20110161526 | Method and Apparatus for Discovering, Negotiating, and Provisioning End-to-End SLAS Between Multiple Service Provider Domains - Domains (multiple collaborating service providers) create service offerings between pairs of edge nodes that interconnect with other domains in the network. The service offerings may specify the available bandwidth, quality of service, reliability, available security, price, subscriber and service contextual specific and other SLA information. When a new service is to be created, the service definition is used along with information about the available service offerings to determine a set of networks to implement the service. Information associated with the service offerings may be flooded to all other networks. Alternatively, the service offering information may be provided to a trusted third party (SLA broker) which may provide SLA services on the network to select sets of domains to implement inter-domain services, and may also proxy to set up the service for the SLA requesting party. A hybrid approach may also be used wherein some SLA information is flooded and other information is retained in secret and provided only to the SLA broker. | 06-30-2011 |
20110320596 | Method and Apparatus for Protecting Networks from Unauthorized Applications - A traffic controller is provided which integrates black-box tests of unauthorized applications to extract application characteristics from associated Internet traffic, exploits the networking information learned by host clients, actively scans and controls hosts on the corporate network, and dynamically configures a corporate firewall to block traffic to and from critical application network elements. As a result, the traffic controller effectively manages unauthorized applications and their associated traffic in a corporate environment. | 12-29-2011 |
20120033552 | Utilizing Betweenness to Determine Forwarding State in a Routed Network - A set of critical nodes or links is identified on the network through which most of the shortest paths on the network occur. Each node compares their distance to end points on the network with a distance between the end points and each of the distinct critical nodes. Where the distance between the end points and the critical nodes is shorter than the distance between the end points and the node, the node is not on the shortest path and does not install forwarding state. Where the distance between the end points and the critical node is larger than or equal to the distance between the end points and the node, the node may be on the shortest path between the pair of end nodes and installs forwarding state. Installation of forwarding state may cause packet duplication, but determining forwarding state is dramatically simplified. | 02-09-2012 |
20140064273 | Utilizing Betweenness to Determine Forwarding State in a Routed Network - A set of critical nodes or links is identified on the network through which most of the shortest paths on the network occur. Each node compares their distance to end points on the network with a distance between the end points and each of the distinct critical nodes. Where the distance between the end points and the critical nodes is shorter than the distance between the end points and the node, the node is not on the shortest path and does not install forwarding state. Where the distance between the end points and the critical node is larger than or equal to the distance between the end points and the node, the node may be on the shortest path between the pair of end nodes and installs forwarding state. Installation of forwarding state may cause packet duplication, but determining forwarding state is dramatically simplified. | 03-06-2014 |
20150089057 | METHOD AND APPARATUS FOR DISCOVERING, NEGOTIATING, AND PROVISIONING END-TO-END SLAS BETWEEN MULTIPLE SERVICE PROVIDER DOMAINS - Domains (multiple collaborating service providers) create service offerings between pairs of edge nodes that interconnect with other domains in the network. The service offerings may specify the available bandwidth, quality of service, reliability, available security, price, subscriber and service contextual specific and other SLA information. When a new service is to be created, the service definition is used along with information about the available service offerings to determine a set of networks to implement the service. Information associated with the service offerings may be flooded to all other networks. Alternatively, the service offering information may be provided to a trusted third party (SLA broker) which may provide SLA services on the network to select sets of domains to implement inter-domain services, and may also proxy to set up the service for the SLA requesting party. A hybrid approach may also be used. | 03-26-2015 |
Patent application number | Description | Published |
20080231511 | Beacon-Assisted Precision Location of Untethered Client in Packet Networks - A novel beacon-based position location technique for efficient location discovery of untethered clients in packet networks is disclosed. The position location technique utilizes the time-difference-of-arrival (“TDOA”) of a first signal transmitted by a beacon of known location and a second signal transmitted by an untethered client. The TDOA of these two signals is measured locally by at least three non-collinear signal receivers. For each of the receivers, the TDOA is used to calculate a perceived distance to the client. A circle is then calculated for each receiver, centered on the receiver and having a radius equal to the perceived distance. At least two lines defined by points of intersection of the calculated circles are then calculated. The point of intersection of the lines represents the location of the client. To facilitate operation, the signal receivers may be arranged on vertices which define a convex polygon as viewed from above. The location system requires no time (time-of-day) synchronization of the signal receivers, and only the coarse frequency synchronization, on the order of, tens of parts-per-million (ppm). The technique even works for the case where the signal receivers are run asynchronously, provided the frequency accuracies of the signal receivers are on the order of about 50ppm or better. The technique introduces no communication overhead for the beacon, client and signal receivers. Further, the computation overhead at the signal receivers is relatively low because the location detection algorithm involves only simple algebraic operations over scalar values. | 09-25-2008 |
20100118894 | DIFFERENTIAL TIMING TRANSFER OVER SYNCHRONOUS ETHERNET USING DIGITAL FREQUENCY GENERATORS AND CONTROL WORD SIGNALING - A method, system and master service interface transfer differential timing over a packet network. The transmitting service interface receives a service clock and is coupled to a receiving service interface through a network backplane. A primary reference clock is provided to time the network backplane. The primary reference clock and the service clock are used to synthesize a copy of the service clock connected to the transmitting service interface. A first control word containing an error differential between the service clock and the synthesized copy of the service clock is generated and transmitted through the network backplane via a packet. The first control word, together with the primary reference clock, is used to recreate the service clock for timing the receiving service interface. | 05-13-2010 |
20120182863 | PROTOCOL FOR CLOCK DISTRIBUTION AND LOOP RESOLUTION - In response to a network topology change, a clock root node calculates a new clock path for each affected node by building a clock source topology tree, and identifying from that tree a path to the network node from a clock source of higher or equal stratum relative to that network node. The root node then sends a network message to each node indicating the new path that the node should use. Each node receives the message and compares the new path with the existing path. If the paths are different then the node acquires the new path just received in the message. If the paths are the same then the node does nothing and discards the message. | 07-19-2012 |
20120290650 | System and Method for Peer to Peer Communications in Cellular Communications Systems - A system and method for peer-to-peer communications in cellular communications systems are provided. A method for communications device operations includes receiving a peer list at a communications device, where the peer list includes a list of reachable communications devices and device-to-device (D2D) capability information of the reachable communications devices, selecting a peer from the peer list, sending a content request comprising an indication of a content to a communications controller serving the communications device, and receiving the content from the peer over a channel established by the communications controller. | 11-15-2012 |
20130088355 | THREE DIMENSIONAL RF SIGNATURES - Method and systems to detect tampering in a physical article are described herein. A method includes receiving, at a first point in time, at least two response signals from at least one RF tag in a set of RF tags associated with the physical article; forming a first response signature for the physical article based on the received response signals; receiving a second response signal from at least one other RF tag in the set of RF tags associated with the physical article at a second point in time; assessing a relative spacing between the RF tags associated with the physical article has changed from the first point in time to the second point in time; and determining tampering of the physical article as a result of the spacing assessment. | 04-11-2013 |
20130235889 | DIFFERENTIAL TIMING TRANSFER OVER SYNCHRONOUS ETHERNET USING DIGITAL FREQUENCY GENERATORS AND CONTROL WORD SIGNALING - Transfer of differential timing over a packet network is provided. A transmitting service interface receives a service clock and is coupled to a receiving service interface through a network backplane. A primary reference clock is provided to time the network backplane. The primary reference clock and the service clock are used to synthesize a copy of the service clock connected to the transmitting service interface. A first control word containing an error differential between the service clock and the synthesized copy of the service clock is generated and transmitted through the network backplane via a packet. The first control word, together with the primary reference clock, is used to recreate the service clock for timing the receiving service interface. | 09-12-2013 |