Class / Patent application number | Description | Number of patent applications / Date published |
709240000 | Prioritized data routing | 53 |
20080235396 | Method and system for processing a service request associated with a particular priority level of service in a network data processing system using parallel proxies - A proxy server is provided with a plurality of prioritized proxies configured in parallel. The proxy server can include 1-to-n proxy subunits, where “n” can vary depending on the total priority levels available for any given system. Each service (e.g., document-handling) request made to the proxy server is prioritized according to the prioritized proxy subunit that is configured to service the request, which increases the request handling response times for the higher priority requests, and thus, improves the overall performance of the proxy server involved. | 09-25-2008 |
20080256260 | Lightweight Mrrm with Radio Agnostic Access Selection in the Core Network - A method and arrangement for making a handover decision in a multi-access communication network is disclosed. A first set of criteria is determined for when a handover between at least two access paths should be performed and a report is sent when at least one criterion of a first set of criteria is fulfilled. A second set of criteria is determined for when a handover between said at least two access paths should be performed and a report is sent when at least one criterion of said second set of criteria is fulfilled. One or more data sessions of at least one user terminal network are determined to be handed over based on the sent reports and a core network anchor and a terminal anchor are directed to execute a handover by re-routing said determined data sessions from one access path to an alternative access path. | 10-16-2008 |
20080313350 | METHOD AND SYSTEM OF CACHE DISCOVERY IN A PEER-TO-PEER ENVIRONMENT - An approach is provided for cache discovery in a peer-to-peer system. A request is received from a peer node based on a network address assigned to a plurality of network caches, wherein the peer node is configured to operate in a peer-to-peer environment. In response to the request, a closest one of the network caches is determined based on a closest instance of a network address. | 12-18-2008 |
20090063703 | Device profile-based media management - A server configured to provide media to devices remote from the server is configured to provide different media to different devices at substantially a same time. The is server configured to recognize a device that requests media. The server is configured to automatically set a resolution at which a media is provided to the device based on the recognition of the device. | 03-05-2009 |
20090089451 | System and Apparatus for Pre-Routing Network Events - A pre-routing software system for treating incoming network events according to event importance prior to agent-level routing in a communication center network is disclosed. The system includes at least one network interface for receiving incoming events, a parsing engine for parsing electronic messages and documents, at least one communication interface for enabling communication with connected routing, queuing, and automated response systems, and a determination module for determining pre-treatment of received events. In preferred application, incoming network events are parsed according to a rules set and determination of pre-treatment is made for each event according to the rules set. In some embodiments, the system is used in conjunction with one or more virtual, priority-based queuing systems. | 04-02-2009 |
20090094381 | Modem prioritization and registration - In one embodiment, a flow control logic facilitates controlling modem prioritization and registration. The flow control logic controls an order in which stored DHCP requests are provided to a DHCP server. The DHCP requests may be stored in a plurality of groups in a data store. DHCP requests may be distinguishable based, at least in part, on priorities associated with cable modems from which DHCP requests are received. The priority may be determined by a value in the DHCP request. The flow control logic may control the rate and order at which stored DHCP requests are provided to the DHCP server. | 04-09-2009 |
20090193144 | Method and systems for resource bundling in a communications network - A method for resource bundling comprises receiving at a network policer ( | 07-30-2009 |
20090193145 | METHOD, APPARATUS AND SYSTEM TO DYNAMICALLY MANAGE LOGICAL PATH RESOURCES - A system, apparatus, and method dynamically manages logical path resources by adding, removing, and establishing logic paths based on specified priority schemes associated with the logical path resources. Information associated with the logical path resources is updated in a logical path resource table. | 07-30-2009 |
20090216902 | STORAGE CONTROLLER AND METHOD FOR DETERMINING CLIENT APPROPRIATENESS - A packet priority level is set for a packet configuring a file access request, and a file importance level is set for a file. A storage controller manages, for each client, the amount of information (total amount) in the packets sent and received for each packet priority level, and the amount of information (total amount) in the access-targeted files for each file importance level. The storage controller computes an assessment value for assessing whether a target client is appropriate or inappropriate based on one or more amounts of information corresponding to the target client and one or more packet priority levels, and one or more amounts of information corresponding to one or more file importance levels respectively corresponding to one or more packet priority levels and the target client, and determines whether the target client is appropriate or inappropriate in accordance with whether or not the computed assessment value conforms to a prescribed condition. | 08-27-2009 |
20090222580 | SYSTEM AND METHOD FOR OPTIMIZING DISTRIBUTION OF MEDIA FILES - There is disclosed a media file distribution system and method. An asset management and delivery system and method for the distribution of digital files and data is provided. There are two major functions, with sub-functions within each. The system first serves as a fully automated management system for a company involved in video/file distribution, such as in video on demand (VOD) or other digital file industries. The system can ingest, prepare, schedule, transmit, track and report on any aspect of the business chain. Secondly, it also serves as a product for both content providers and recipients to be able to view, manage and run their entire content offering remotely from anywhere through the Internet. | 09-03-2009 |
20090276539 | Conversational Asyncronous Multichannel Communication through an Inter-Modality Bridge - A communications apparatus is configured to bridge modalities and different communications formats. The apparatus may include a bridge to receive an input through a modality gateway and to deliver an output through an output channel, a communication engine configured to manipulate the input into the output, a router configured to route the configured output to a respective output channel, and a controller configured to control the bridge. The controller may determine a new modality depending on a context of the communications apparatus. | 11-05-2009 |
20090319685 | Routing in a communications network using contextual information - A generic address resolution system facilitates communications among multiple network applications with heterogeneous addressing mechanisms, thereby allowing the network applications to interoperate with each other and/or with modules for providing enhanced functionalities. The address resolution system includes a resource mapping module that modularizes the components needed for address resolution and abstracts content from the underlying address types and content used by the network applications. The address resolution system includes a context engine that analyzes the addressing data to be resolved, selects one or more appropriate destination network applications based on contextual rules, and creates the application mapping template for the end-end routing of the communications among the network applications. | 12-24-2009 |
20090319686 | COMMUNICATION ROUTE SELECTING METHOD AND APPARATUS - A computer readable storage medium contains instructions that, when executed by a computer, cause the computer to perform: measuring a transmission time period taken to transmit a message for each of a plurality of communication routes by exchanging a control message via the plurality of communication routes; determining a priority of each of the plurality of communication routes based on the measured transmission time period; and if a priority has been set to a message to be exchanged between communication apparatuses connected via the plurality of communication routes, selecting one of the plurality of communication routes, as a route to transmit the message based on the set priority and the determined priority. | 12-24-2009 |
20090327520 | METHOD AND APPARATUS FOR MAPPING UNKNOWN INFORMATION IN REAL OR VIRTUAL WORLDS - A method and apparatus are given for providing a suggested path on the Internet to a topic of interest for a user. In one example, the method includes receiving the topic of interest, receiving a map of the Internet, receiving a map of information known to the user, calculating a map of information unknown to the user based on the map of the Internet and the map of information known to the user, and calculating a path to the topic of interest based on at least the map of information unknown to the user. | 12-31-2009 |
20090327521 | AUTOMATIC MAPPING OF HUMAN-MEANINGFUL PARAMETERS TO NETWORK-MEANINGFUL PARAMETERS FOR TRAFFIC IMPORTANCE IN HOME NETWORK - A method of automatically discovering home network device capabilities, ranking devices using the capabilities in accordance with ranking heuristics, and implementing traffic policy in accordance with the ranking. | 12-31-2009 |
20100011123 | Method and Apparatus for Hierarchical Selective Personalization - A technique for delivering content in a client-server system based on a request received at a computing device from a client includes determining a current load on a next-level computing device of a hierarchy. When this current load is such that a response time for delivery of the request from the next-level computing device would increase above a given threshold, a client type associated with the request is checked and, when the client type indicates that the client is below a given priority level, content to be delivered to the client in response to the request is personalized at the receiving computing device. When the current load is such that the response time would not increase above a given threshold, the request is sent from the receiving computing device to the next-level computing device and the content to be delivered is personalized at the next-level computing device. | 01-14-2010 |
20100057934 | INTELLIGENT SERVER ROUTING - The present application relates to methods and systems for intelligently routing requests to one of a plurality of redundant servers. The methods and systems route the requests to a most highly ranked redundant server. The redundant servers are dynamically rank according to ranking information, wherein the ranking information may include server performance information, server response information, next step performance information, next step response information, historic information and other like information. Next step response information and next step performance information corresponds to information pertaining to servers the plurality of redundant servers depend upon. The methods and systems may further randomly re-rank the plurality of redundant servers. The methods and systems may further re-route unprocessed requests meeting non-performance criteria. | 03-04-2010 |
20100077102 | METHOD AND SYSTEM FOR BYPASSING 3GPP PACKET SWITCHED CORE NETWORK WHEN ACCESSING INTERNET FROM 3GPP UES USING IP-BTS, FEMTO CELL, OR LTE ACCESS NETWORK - A type of network traffic associated with a packet received from a remote node of an access network is determined. A first interface logic routes the packet to a radio network controller (RNC) if the packet is received from an Internet protocol-basestation (IP-BTS) access network and destined to a packet core network. The RNC forwards the packet to a component of the packet core network. A second interface logic routes the packet to the component of the packet core network, including aggregating other packets of the same type received from other remote nodes, if the packet is received from a femto cell and destined to the packet core network. A breakout logic routes the packet to a destination of the Internet directly to enable the packet to reach the Internet without having to route the packet to the component of the packet core network, if the packet is destined to the Internet. | 03-25-2010 |
20100125674 | SELECTIVE A PRIORI REACTIVE ROUTING - In one embodiment, a more capable device (MCD) in a computer network may determine one or more a critical destinations (CDs), and may transmit an unsolicited reactive routing route request (RREQ) message to each CD. The MCD may then receive a route reply (RREP) message from the CDs having a route from the MCD to the CD, and may store the route at the MCD. Subsequently, the MCD may transmit a RREP message of its own to one or more less capable devices (LCDs) to provide the route from each respective LCD to the CD via the MCD. | 05-20-2010 |
20100191862 | SYSTEM AND METHOD FOR PRIORITY DELIVERY OF LOAD MANAGEMENT MESSAGES ON IP-BASED NETWORKS - Methods for prioritizing load management messages on IP-based networks utilizing an Active Load Directory and IP capable two-way gateway. The messages being received from, or sent to, the ISP through the gateway contain a blend of regulated and unregulated data. The regulated data is high-priority utility load management data such as, equipment status and load control instructions. The unregulated data consists of Internet messages such as email and web site data. These methods process all regulatory data before unregulated data within strict time limits, providing the greatest possible load management control and energy savings. The methods emulate dedicated network processor memory in a manner that permits the rules for prioritizing, scheduling, and routing to remain the same across both hardware and software implementations. | 07-29-2010 |
20110125921 | SYSTEM AND METHOD FOR PROVIDING QUALITY OF SERVICE IN WIDE AREA MESSAGING FABRIC - Techniques for transmitting data according to at least one quality of service requirement. A message path is calculated specifying a sequence of broker computers selected from a network of interconnected broker computers. The message path is statistically estimated to fulfill the at least one quality of service requirement. Quality of service metrics are received about the network of interconnected broker computers. If the message path is determined not to fulfill the quality of service requirement, a new message path is calculated specifying a new sequence of broker computers selected from the network of interconnected broker computers. The new message path is statistically estimated to fulfill the at least one quality of service requirement. | 05-26-2011 |
20110179188 | STORAGE SYSTEM AND STORAGE SYSTEM COMMUNICATION PATH MANAGEMENT METHOD - The present invention makes it possible to reassess respective host paths and reset priorities in accordance with the current state of a storage system. A management computer | 07-21-2011 |
20110196984 | DISTRIBUTED PARALLEL DISCOVERY - A system and method for parallel discovery includes grouping a set of nodes including redundant information. After a first discovery stage, a portion of the set of nodes is selected to perform an additional discovery stage. The additional discovery stage is performed with the portion of the set of nodes where each node makes a decision whether to perform the additional stage or not. | 08-11-2011 |
20110202681 | DISTRIBUTED MEANS OF ORGANIZING AN ARBITRARILY LARGE NUMBER OF COMPUTERS - A technique for organizing a plurality of computers such that message broadcast, content searching, and computer identification of the entire collection or a subset of the entire collection may be performed quickly without the use of a controlling computer. The technique describes the creation, operation, and maintenance of a connection scheme by which each computer in the collection appears to be the top level of a hierarchical array. The maintenance of this hierarchical connection scheme allows one to many communications throughout the collection of computers to scale geometrically rather than linearly. | 08-18-2011 |
20110238863 | SYSTEM AND METHOD FOR DATA EXCHANGE IN MULTIPROCESSOR COMPUTER SYSTEMS - A system for data exchange in multiprocessor computer system is disclosed. The system includes at least one processing module adapted to communicate with at least one of a plurality of routing modules or a plurality of buffer modules or both and at least one communicating interfaces to facilitate data exchange in multiprocessor computer system. | 09-29-2011 |
20110246671 | For acceleration of pathway selection, application, and ranking in a hybrid network - Methods, systems and computer-readable medium are provided for selecting and ordering pathways identified between two selected nodes of a hybrid network. Nodes within the network have named relationships that may have 1:1, 1:many, many:1 or many:many cardinality. An algorithm is applied to predetermine the optional search path for finding relationships between any two rows of any of one or more tables of one or more relational databases, including relationships defined between other tables. The schemas of one or more target relational databases, either derived or input, is converted into an object-oriented schema that explicitly defines relationships between columns in the tables of the relational database and represents the tables as object classes. The schemas are analyzed and optimal search paths are derived and stored for subsequent use. A query engine accesses the predefined search paths in order to execute queries | 10-06-2011 |
20110296052 | Virtual Data Center Allocation with Bandwidth Guarantees - A virtual data center allocation architecture with bandwidth guarantees that provides for the creation of multiple virtual data centers from a single physical infrastructure. The virtual data center allocation is accomplished in three steps. First, clusters are created from the servers in the physical infrastructure. Second, a bipartite graph is built to map the virtual machines to the servers located in a particular cluster and finally a path is calculated between two virtual machines. The virtual data centers may be dynamically expanded or contracted based on changing bandwidth guarantees. | 12-01-2011 |
20120144063 | TECHNIQUE FOR MANAGING TRAFFIC AT A ROUTER - A router of a network is configured to manage routing of packets based on executing applications. The network communicates packets of information between endpoints coupled to the network. Each packet is assigned to a traffic class based on the application associated with the packet. The router manages routing of received packets based on the traffic classes associated with the received packets. Accordingly, the router can determine routing priority, bandwidth, acknowledgment policy, and other routing management information based on the applications associated with received packets. | 06-07-2012 |
20120278503 | ENERGY MANAGEMENT SYSTEM FOR A DATA CENTER NETWORK - An energy management system for a data center network may include a central computer to establish an energy use policy for the computer data center network. The system may also include computer nodes in the computer data center network to receive a packet which is a query that obtains energy information from the nodes and/or a transmission reservation that provides instructions for the energy use policy to be implemented at the computer nodes. The computer nodes may reallocate data traffic on the computer data center network based on the energy use policy to improve energy consumption of the computer data center network. | 11-01-2012 |
20130019027 | EFFICIENT DATA ACCESS ON A SHARED DATA NETWORKAANM Kazan; WissamAACI BellevueAAST WAAACO USAAGP Kazan; Wissam Bellevue WA USAANM Przysucha; MarcinAACI RedmondAAST WAAACO USAAGP Przysucha; Marcin Redmond WA USAANM Ponnuru; HemanthaAACI BellevueAAST WAAACO USAAGP Ponnuru; Hemantha Bellevue WA US - One or more techniques and/or systems are disclosed for providing efficient synchronized data access. A request to access data on a first data provider is received. The requested data on the first data provider is synchronized with a second data provider, such that the first and second data providers respectively comprise a same version of the requested data. A provider score can respectively be determined for the first data provider and for the second data provider, where the provider score utilizes heuristic data that may indicate a data access rate and/or a cost of data access, for the respective first data provider and second data provider. The request for data access can be routed to the data provider that comprises a desired provider score, where a desired provider score may indicate a desired rate of data access and/or cost of data access. | 01-17-2013 |
20130073744 | INTELLIGENT SERVER ROUTING - The present application relates to methods and systems for intelligently routing requests to one of a plurality of redundant servers. The methods and systems route the requests to a most highly ranked redundant server. The redundant servers are dynamically rank according to ranking information, wherein the ranking information may include server performance information, server response information, next step performance information, next step response information, historic information and other like information. Next step response information and next step performance information corresponds to information pertaining to servers the plurality of redundant servers depend upon. The methods and systems may further randomly re-rank the plurality of redundant servers. The methods and systems may further re-route unprocessed requests meeting non-performance criteria. | 03-21-2013 |
20130138833 | METHOD, APPARATUS AND SYSTEM TO DYNAMICALLY MANAGE LOGICAL PATH RESOURCES - System, apparatus, and methods for dynamically managing logical path resources are provided. The logical path resources are managed by adding, removing, and establishing logic paths based on specified priority schemes associated with the logical path resources. Information associated with the logical path resources is updated in a logical path resource table. | 05-30-2013 |
20130166774 | DYNAMIC NETWORK PROVISIONING SYSTEMS AND METHODS - Methods and systems for dynamically provisioning a network are disclosed. A network may be dynamically provisioned by detecting network congestion due to data on the network, identifying a transmission from a source computer to a destination computer for distinct routing based on at least one packet of the transmission, directing at least one other packet of the identified transmission to be marked for distinct routing, and instructing a router to distinctively route the other marked packets in response to the detection of network congestion. A controller and a monitoring device may be used to implement dynamic network provisioning. | 06-27-2013 |
20130173823 | DIAMETER ROUTE LEARNING - Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving a message at the network device; constructing a route key based on the message, wherein the route key comprises at least one value carried by the message; determining whether the network device stores a previous route record associated with the route key; and if the network device does not store a previous route record associated with the route key, generating a new route record based on the route key, and provisioning a new route based on the new route record into a routing table of the network device. | 07-04-2013 |
20130238814 | Routing in a Communications Network Using Contextual Information - A generic address resolution system facilitates communications among multiple network applications with heterogeneous addressing mechanisms, thereby allowing the network applications to interoperate with each other and/or with modules for providing enhanced functionalities. The address resolution system includes a resource mapping module that modularizes the components needed for address resolution and abstracts content from the underlying address types and content used by the network applications. The address resolution system includes a context engine that analyzes the addressing data to be resolved, selects one or more appropriate destination network applications based on contextual rules, and creates the application mapping template for the end-end routing of the communications among the network applications. | 09-12-2013 |
20130339545 | NETWORK-BASED HYPERSPEED COMMUNICATION AND DEFENSE - This invention relates to the use of optimal (hyperspeed) paths for command and control (and other high priority) traffic and suboptimal (slower) paths for all other traffic in order to implement sophisticated network service differentiation and defensive techniques. A reaction time window is created to ensure that packets sent along hyperspeed paths can arrive sufficiently in advance of malicious traffic in order to alert network devices and initiate defensive actions. Assortments of defensive options are available to networks employing the invention and the inventive algorithms. | 12-19-2013 |
20140013005 | METHOD AND APPARATUS FOR LOAD SHARING - A load sharing method comprises: receiving a message and determining an outbound interface that is configured to forward the message; obtaining bandwidth usage parameters of the outbound interfaces when a number of the outbound interfaces is greater than 1; selecting one of the outbound interfaces as a forwarding outbound interface for forwarding the message, according to the bandwidth usage parameters of the outbound interfaces and a content of the message. | 01-09-2014 |
20140082214 | REDUCING NETWORK USAGE OF COMPUTING DEVICE - Methods and systems for reducing network usage of a computing device are provided herein. The method includes receiving a network call relating to a network transfer from an application at an application programming interface of the computing device. The method also includes determining whether the network transfer is relevant to a current state of the application and procrastinating the network transfer if it is not relevant to the current state of the application. | 03-20-2014 |
20140082215 | ARBITRATING BETWEEN DATA PATHS IN A BUFFERLESS FREE FLOWING INTERCONNECT - An interconnect comprising paths configured to transmit data packets between nodes on a network. The nodes comprise ports for inputting and outputting the data packets to the interconnect. At least two of the paths each have at least a portion configured such that a data packet addressed for output at one of the nodes on one of the paths and not being accepted at the node will continue along the path and on travelling further will return to the node. The at least two paths are balanced paths such that a data packet not accepted at the one of the nodes will return to the node a same predetermined number of clock cycles later whichever of the balanced paths the data packet is traveling along. The one of the nodes comprises an arbiter that is configured to prioritise one of the balanced data paths for output, the arbiter being configured to ensure that a priority changes after the predetermined number of clock cycles, such that a data packet on any of the balanced paths not being accepted for output at the node on a first attempt is guaranteed to have priority on a subsequent return to the node. | 03-20-2014 |
20140101335 | Identifying, Translating and Filtering Shared Risk Groups in Communications Networks - A method, apparatus, and computer-readable storage medium for processing shared risk group (SRG) information in communications networks are disclosed. The method includes receiving network information comprising SRG information from a second domain at a first domain, obtaining at least one SRG identifier by processing the SRG information, and processing the at least one SRG identifier, the processing using processing criteria. The apparatus includes a network interface adapted to receive network information comprising shared risk group information, a processor coupled to the network interface and configured to execute one or more processes, and a memory coupled to the processor and adapted to obtain at least one SRG identifier by processing the SRG information and to process the at least one SRG identifier using processing criteria. The computer-readable storage medium is configured to store program instructions that when executed are configured to cause the processor to perform the method. | 04-10-2014 |
20140164644 | ENERGY MANAGEMENT SYSTEM FOR A DATA CENTER NETWORK - An energy management system for a data center network may include a central computer to establish an energy use policy for the computer data center network. The system may also include computer nodes in the computer data center network to receive a packet which is a query that obtains energy information from the nodes and/or a transmission reservation that provides instructions for the energy use policy to be implemented at the computer nodes. The computer nodes may reallocate data traffic on the computer data center network based on the energy use policy to improve energy consumption of the computer data center network. | 06-12-2014 |
20140173131 | RESPONSIBILITY-BASED REQUEST PROCESSING - A method is operable in a network comprising multiple service endpoints, the service endpoints running on a plurality of devices, wherein the multiple service endpoints form one or more sub-clusters. The method includes defining a group from an arbitrary set of nodes comprising service instances across the machines of the one or more sub-clusters, wherein each node in the group assumes one or more discrete responsibilities involved in processing of a request across the group. In response to a request made at a node the group, the service type of the request is dynamically determined; and, based on the type of the request, one or more nodes in the group are selected to be responsible for processing the request. | 06-19-2014 |
20140173132 | Responsibility-based Cache Peering - A computer-implemented method, operable in a network comprising multiple delivery service endpoints running on a plurality of devices. Each delivery service endpoint delivers resources. A plurality of the multiple delivery service endpoints comprise a group, each node in the group having at least one kind of responsibility relating to delivery of resources. The method includes receiving, at the node, a request relating to a particular resource. The kind of responsibility the node has for the request is determined based on at least one kind responsibility assigned to the node for requests relating to the particular resource. Based on the determining, an attempt is made to process the request in accordance with kind responsibility assigned to the node for requests relating to the particular resource. | 06-19-2014 |
20140258556 | INTELLIGENT SERVER ROUTING - The present application relates to methods and systems for intelligently routing requests to one of a plurality of redundant servers. The methods and systems route the requests to a most highly ranked redundant server. The redundant servers are dynamically rank according to ranking information, wherein the ranking information may include server performance information, server response information, next step performance information, next step response information, historic information and other like information. Next step response information and next step performance information corresponds to information pertaining to servers the plurality of redundant servers depend upon. The methods and systems may further randomly re-rank the plurality of redundant servers. The methods and systems may further re-route unprocessed requests meeting non-performance criteria. | 09-11-2014 |
20140297887 | METHOD FOR TRANSMITTING INFORMATION ON PRIORITY BASIS TO ONE OR MORE NODES IN DISTRIBUTED NETWORK - The present disclosure is related to a method for transmitting information on priority basis to one or more nodes in distributed network. The routing server at source node generates one or more set of nodes from plurality of nodes based on reputation value. The routing server identifies first set of nodes with highest reputation value, determines predicted action to be perforrmed by each node. The routing server transmits information to each node in first set. Each node performs an action. The routing server computes the difference between the predicted action and action performed by each node in the first set and updates the reputation value of each node in the first set. Thereafter, routing server transmits the information the second set, third set and so on. | 10-02-2014 |
20140379937 | Communications Scheduler - A system for providing communications over a communications network includes a communications interface and a processor. The communications interface communicates over the communications network. The processor directs a communications scheduler to determine at least one metric for a path within the communications network. The processor also selects a data flow for the path and determines whether to transmit a packet in the selected data flow based on the at least one metric. The processor then directs a communications protocol handler to generate the packet for the selected data flow. | 12-25-2014 |
20150039784 | Scalable Name-Based Centralized Content Routing - A network element (NE) comprising a receiver configured to receive a content request message from a client node via a network, wherein the content request message comprises an identifier of a data object, a memory configured to store a content routing table comprising local routing entries for popular data objects, and a content indicator indicating less popular data objects that are not associated with the local routing entries, a processor coupled to the memory and configured to check the content routing table for an entry associated with the requested data object, and check the content indicator for a match between the requested data object and the less popular data objects when the content routing table does not comprise the entry, and a transmitter coupled to the processor and configured to send a route request message to a network controller when the content indicator check returns a positive match. | 02-05-2015 |
20150074286 | Providing Differentiated Service To Traffic Flows Obscured By Content Distribution Systems - A system for providing differentiated services to traffic flows of a content distribution network is disclosed. In particular, the system may include determining if a first portion of an internet protocol address associated with a traffic flow includes an identifier for a node in the content distribution network by comparing the identifier to a set of prefixes for the content distribution network. Additionally, the system may include determining if a second portion of the internet protocol address matches a unique host address specified by the content distribution network for a customer of the content distribution network. If a rule for providing a differentiated service exists for the customer, the first portion is in the set of prefixes, and the second portion matches the unique host address specified for the customer, the system may provide the differentiated service for the traffic flow. | 03-12-2015 |
20150095513 | PRIORITY BASED ANYCAST ROUTING - A technique for selecting a network node from a plurality of nodes employing anycast addressing based on a priority. The plurality of nodes is configured with an anycast address. At each node, the anycast address is associated with a unique priority value that represents a priority associated with the node. Traffic destined for the anycast address is forwarded to the node whose priority value indicates the highest priority. If the node becomes unavailable, traffic destined for the anycast address is forwarded to a node whose priority value indicates the next highest priority, and so on. | 04-02-2015 |
20150120961 | Dynamic Content Packaging - To be accessed on different media players, requested content must be delivered in a format that is supported by the requesting device. A dynamic content packager for encrypting and packaging requested content for different requesting devices at the time of consumption is disclosed. | 04-30-2015 |
20160094433 | APPLICATIONS OF PROCESSING PACKETS WHICH CONTAIN GEOGRAPHIC LOCATION INFORMATION OF THE PACKET SENDER - A method for routing Internet traffic is disclosed. The method comprises receiving an IPv6 packet. Further, the method comprises determining if the IPv6 packet comprises an extension header with geo-location information. Finally, responsive to a determination that the IPv6 packet comprises an extension header with geo-location information, the method comprises performing an action based on the geo-location information, wherein the action is selected from the group consisting of: authenticating the IPv6 packet, prioritizing the IPv6 packet relative to other packets, routing the IPv6 packet, and monitoring of the IPv6 packet. | 03-31-2016 |
20160142331 | PACKET SCHEDULING USING HIERARCHICAL SCHEDULING PROCESS WITH PRIORITY PROPAGATION - System and method of data routing according to a hierarchical scheduling process. Incoming data traffic is allocated to various queues of a buffer. A scheduling tree has a top level for queues, a bottom level for egress ports, and a plurality of intermediate levels corresponding to different granularities with respect to service categories. Each queue is assigned to a particular node in each intermediate level of the scheduling tree. The scheduling tree traverses through multiple scheduling stages from the bottom to the top level to select a winner node in each level based on a variety of fairness and differentiating variables. A queue associated with the winner nodes in various levels is selected for outgoing transmission at the selected egress port. Priority information is dynamically propagated from upper nodes to lower nodes such that a subsequent scheduling process uses the updated priority information. | 05-19-2016 |
20160381175 | METHOD AND APPARATUS FOR CONTROLLING SERVICE CHAIN OF SERVICE FLOW - Embodiments of the present invention provide a method and apparatus for controlling a service chain of a service flow. The method includes: receiving a service processing customization request message sent by a content provider server/service provider server; generating, according to a service processing customization condition carried in the service processing customization request message, service chain information of a service flow corresponding to the content provider server/service provider server; and constructing, based on the service chain information, service chain control information corresponding to a service chain, so that a controller acquires the service chain control information and sends flow forwarding policy information corresponding to the service chain to a switch based on the service chain control information, so that the switch processes, according to the flow forwarding policy information, a received service flow. | 12-29-2016 |