Patent application number | Description | Published |
20090132400 | DATA METERING - A charging factor is determined applicable to each time interval in a period of time during which at least one data transfer was conducted. An amount of data transferred during each time interval is determined. A total charge applicable to the at least one data transfer is computed based at least in part on the charging factor applicable to each time interval and the amount of data transferred. Alternatively or additionally, a plurality of potential start times and an amount of data for a data transfer are identified. A set of time intervals associated with each of the potential start times are determined. For each of the potential start times, an estimated charge applicable to the data transfer is computed based at least in part on a charging factor applicable to each of one or more time intervals associated with the potential start time and the amount of data estimated to be transferred. | 05-21-2009 |
20090157371 | Multi-layered Model for Survivability Analysis of Network Services - A system and method of using a multi-layered network model for analyzing the survivability of network services. The model is defined in terms of layers, connections, entities, physical processing elements, physical network elements, and physical infrastructure elements. Network services are modeled by sets of communicating entities at the application layer that are connected by connections at the underlying layers. The generality of the model constructs enable the construction of models of complex networks and services that can involve multiple layers of communication protocols, network elements, processing elements, and failover/backup mechanisms. The service survivability of a network is analyzed by projecting the failure of a set of physical elements onto the model and then determining the proportion of service affected at the application layer. | 06-18-2009 |
20090248854 | METHOD AND SYSTEM FOR ENERGY EFFICIENT ROUTING AND NETWORK SERVICES - A method and system of an embodiment may include identifying a power source used by a network element, determining a carbon footprint of a unit of power usage from the power source, identifying one or more components associated with the network element used for a network operation performed by the network element, determining the power usage of the one or more identified components during the process, and calculating the carbon footprint of the process performed by the network element. | 10-01-2009 |
20100030787 | NETWORK CODING WITH LAST MODIFIED DATES FOR P2P WEB CACHING - A method may include obtaining a source file at a node in peer-to-peer network and dividing the source file into a plurality of pieces. The pieces of the source file may be encoded using network coding principles. A last-modified-date (LMD) value may be appended to each of the encoded pieces, the LMD value being the same for each of the encoded pieces of the source file. The encoded pieces with the LMD values may be sent to one or more other nodes in the peer-to-peer network. | 02-04-2010 |
20100232299 | SIMULATION OF COMMUNICATION NETWORKS - A computer-implemented method may include receiving transition information indicative of transition rates associated with a plurality of communication links in a network, wherein the network includes a plurality of nodes, the plurality of communication links, and a communication path between a first node and a second node of the plurality of nodes. In one embodiment, the communication path uses at least two of the plurality of communication links. The method may include generating biased transition information indicative of biased transition rates, wherein the biased transition rates are greater or less than the indicated transition rates and simulating the network, based on the biased transition information, until a transition associated with one of the communication links causes the communication path to transition to a different state. A network reliability parameter may be determined based on the simulation of the network. | 09-16-2010 |
20110106945 | METHOD AND SYSTEM FOR ENERGY EFFICIENT ROUTING AND NETWORK SERVICES - A method and system of an embodiment may include identifying a power source used by a network element, determining a carbon footprint of a unit of power usage from the power source, identifying one or more components associated with the network element used for a network operation performed by the network element, determining the power usage of the one or more identified components during the process, and calculating the carbon footprint of the process performed by the network element. | 05-05-2011 |
20110288765 | REAL-TIME ROUTE AND RECHARGE PLANNING - A system may include a processing device and a routing application included on the processing device. The routing application may be configured to receive a destination location for a vehicle; determine a fuel efficiency of the vehicle; and determine a route for the vehicle from a current location to the destination location, the route being based on the fuel efficiency of the vehicle, a fuel capacity of the vehicle, an amount of fuel remaining for the vehicle, and navigation information including the location of at least one charging station. | 11-24-2011 |
20120047142 | NETWORK CODING WITH LAST MODIFIED DATES FOR P2P WEB CACHING - A method may include obtaining a source file at a node in peer-to-peer network and dividing the source file into a plurality of pieces. The pieces of the source file may be encoded using network coding principles. A last-modified-date (LMD) value may be appended to each of the encoded pieces, the LMD value being the same for each of the encoded pieces of the source file. The encoded pieces with the LMD values may be sent to one or more other nodes in the peer-to-peer network. | 02-23-2012 |
20120213079 | TRAP-FREE SHORTEST LINK-DISJOINT PATHS - A method including receiving information corresponding to a network graph of a network; determining a maximum flow value of the network based on the network graph; selecting a value for a number of trap-free shortest link-disjoint paths to find between a source node and a destination node based on the maximum flow value; selecting a value for a minimum remaining flow value based on the value for the number of trap-free shortest link-disjoint paths; and selecting a trap-free shortest link-disjoint path in which a complementary part of the network supports at least the remaining minimum flow value. | 08-23-2012 |
20120213080 | TRAP-FREE SHORTEST LINK-AND-SHARED RISK LINK GROUP-DISJOINT PATHS - A method including receiving network graph information of a network, wherein the network graph information includes shared risk link group (SRLG) information; determining a maximum link-and-SRLG-disjoint flow value of the network based on the network graph information; selecting a value for a number of trap-free shortest link-and-SRLG-disjoint paths to find between a source node and a destination node based on the maximum link-and-SRLG-disjoint flow value; selecting a minimum remaining link-and-SRLG-disjoint flow value based on the value for the number of trap-free shortest link-and-SRLG-disjoint paths; and selecting a trap-free shortest link-and-SRLG-disjoint path in which a complementary part of the network supports at least the minimum remaining link-and-SRLG-disjoint-flow value. | 08-23-2012 |
20120253772 | PATH FAILURE IMPORTANCE SAMPLING - A method including receiving a network model including paths having dynamic path restoration capabilities; receiving network simulation information including a failure rate that indicates a rate of failure, a repair rate that indicates a rate of repair, a number of repair personnel assigned to each failure equivalence group, and a regeneration value indicating a number of regenerations to occur for each designated path during a network simulation, biasing the failure rate; determining whether one of the designated paths enters a failure state; unbiasing the failure rate when it is determined that the designated path enters the failure state; identifying when the network model returns to an operative state; ceasing an execution of the network simulation when it is determined no other designated paths are to be simulated; calculating an average time of path unavailability for each designated path simulated; and calculating path unavailability for each designated path simulated. | 10-04-2012 |
20140172439 | ORGANIZED HEALTHCARE FRAUD DETECTION - A fraud detection system receives information that identifies healthcare claims associated with providers and beneficiaries, and determines, based on the healthcare claims, first fraud sets associated with postulated classes of fraud. The fraud detection system determines, based on the healthcare claims, second fraud sets using one or more data mining techniques, and calculates probabilities that the first fraud sets and the second fraud sets are similar to no fraud observations. The fraud detection system ranks the first fraud sets and the second fraud sets based on the calculated probabilities, and outputs a ranked list of suspected fraud cases, associated with the healthcare claims, based on the ranking of the first fraud sets and the second fraud sets. | 06-19-2014 |
20140198643 | WIRESPEED TCP SESSION OPTIMIZATION FOR NETWORKS HAVING RADIO SEGMENTS - TCP sessions passing through a network, such as a wireless network, may be optimized based on conditions corresponding to the radio interface of the wireless network. In one implementation, a method may include monitoring, by a base station, performance parameters relating to a radio access network (RAN); determining, based on the performance parameters, one or more protocol data units (PDUs) to retransmit; determining one or more Transmission Control Protocol (TCP) sessions and packet sequence numbers corresponding to the one or more PDUs; and transmitting, to a network device, an indication to retransmit packets corresponding to the one or more TCP sessions and packet sequence numbers. | 07-17-2014 |
20140315564 | NETWORK RESOURCE PRE-BOOKING - A base station associated with a cellular network may receive a request for a service from a user device. The base station may determine a current location of the user device. The base station may determine, based on the current location, a set of future locations for the user device. The base station may generate a set of schedules for the current location and the set of future locations. The set of schedules may allocate network resources to the user device at the current location and at each future location of the set of future locations. The base station may transmit the set of schedules to the user device. | 10-23-2014 |