Abstract: In one implementation, a method for tap traffic redirection can include identification of a request protocol and a source network element, selection of a redirector protocol based on a list of device capabilities, instruction of the source network element to send a first copy of network traffic to an intermediary network element using the redirector protocol, and instruction of the intermediary network element to forward a second copy of the network traffic using the request protocol.

Abstract: Assigning a given computer to a computer group of a set of computer groups. Software components installed on the given computer are scanned, resulting in a list of discovered software components of the given computer. In addition, for each computer group of the set of computer groups, a list of software components most frequently installed on the computers of the computer group is obtained. For each computer group, the list is compared with the list of discovered software components and, based on the comparison, a likelihood that the given computer belongs to the computer group is computed. In case only one of the likelihoods exceeds a threshold, the given computer is assigned to the respective computer group for which the likelihood exceeds the threshold.

Abstract: A virtualized network function (VNF) provisioning system includes a plurality of computing device that are provided in a physical topology and that are coupled to a network. A management device is coupled to the computing device through the network. The management device receives VNF system information for a VNF system through the network. The VNF system includes a plurality of VNFs that are provided in a virtual topology. The management device then determines a plurality of physical groups from the physical topology that each identify at least one computing device. The management device then determines a plurality of virtual groups from the virtual topology based on a ratio of traffic that will leave each virtual group and a number of VNFs in each virtual group. The management device then provides the VNFs in a first virtual group on the at least one computing device in a first physical group.

Abstract: A non-transitory storage medium having stored therein a packet relay program for relaying a packet in a first sub-domain among a plurality of sub-domains in a service chain configured across the plurality of sub-domains is provided. The packet relay program causes a computer in the first sub-domain to perform a process. The process includes specifying a transmission destination on a basis of relay information with which identification information indicating a combination of a plurality of service functions included in the service chain, an index indicating an order for applying the service function, and the transmission destination are associated, changing the index included in the packet into a predetermined value when the specified transmission destination is a second sub-domain among the plurality of sub-domains, and transmitting the packet including the identification information included in the packet and the index of the predetermined value to the specified transmission destination.

Abstract: In some examples, method includes receiving, with a software-defined network (SDN) controller in an SDN containing a plurality of controlled network nodes, a dynamic network parameter for the SDN from a controlled network node in the SDN, selecting, with the SDN controller, an adjusted spanning tree protocol (STP) path cost value for a path cost along a datapath between a source network node and a destination network node in the SDN based on the received dynamic network parameter, and installing, with the SDN controller, the adjusted STP path cost value on controlled network nodes along the datapath.

Abstract: An example system in accordance with an aspect of the present disclosure includes an inspection engine and a forwarding engine. The inspection engine is to identify whether a tunneled network packet is associated with the multicast group address and a VNI that is contained in the mapping table. The forwarding engine is to forward or discard the packet in response to whether the VNI is contained in the mapping table.

Abstract: Systems, methods and transitory computer-readable storage media for constructing a loop free multicast tree. The methods include observing a network topology transition affecting a first path from the particular node to a root node, calculating a second path from the particular node to the root node and sending a message to an upstream node requesting that the upstream node be a root port in the calculated second path. If the upstream node agrees to be the root port in the calculated second path, the method further includes creating a new FTAG tree topology view that includes the upstream node as the root port in the second path.

Abstract: Techniques, devices, systems, and protocols are disclosed herein that relate to data transfer between communication nodes via multiple heterogeneous paths. In various embodiments, network coding may be used to improve data flow and reliability in a multiple path scenario. Transmission control protocol (TCP) may also be used within different paths to further enhance data transfer reliability. In some embodiments, multiple levels of network coding may be provided within a transmitter in a multiple path scenario, with one level being applied across all paths and another being applied within individual paths.

Abstract: Mechanisms are provided for tracing a route taken by a packet in a Software Defined Network (SDN). Each switch in the SDN is assigned a first color label, from a set of color labels, such that such that adjacent switches have different color labels. Rules are installed in each switch to forward a received data packet to the SDN controller in response to a second color label of the received data packet not matching the first color label assigned to the switch. A second color label, from the set of color labels, is assigned to a trace data packet. A route of the trace data packet is traced through the SDN based on the second color label and application of the one or more rules to the trace data packet at each of the switches in the SDN as the trace data packet is received by each of the switches in the SDN.

Abstract: Examples relate to fast failover recovery in software defined networks. In some examples, a failure in a first primary tree is detected during data transmission of a data packet, where the primary tree is associated with a first group entry that is configured to direct each of the data packets to one of a first set of destination devices. A notification of the failure is sent to a remote controller device, where the remote controller device identifies backup trees of the route trees that does not include the failure. After the remote controller device updates the first group entry to be associated with a first backup tree that minimizes congestion, each of the data packets are sent to one of a second set of destination devices that are associated with the first backup tree.

Abstract: A software defined network (SDN) controller may configure a Layer-three gateway for a network segment in a hybrid network device within a SDN network, receive a Packet-in message encapsulated with a Layer-three data packet from a SDN network device, calculate an optimum path from source media access control (MAC) address of the data packet to destination MAC address of the data packet, and issue a flow entry to each network device in the optimum path. Subsequently, each network device may forward the data packet based on the flow entry.

Abstract: Solutions to packet forwarding along a service function path (SFP) by using packet-based transport are provided, where the destination address field in the transport tunnel packet header designates the SFP and the source address field contains the service context. Forwarding of packet flows in different SFPs is simplified by using conventional packet routing and forwarding mechanisms and commercial off-the-shelf routers and switches. For example, route aggregation, load balancing, equal cost multipath routing, and fast path restoration can be applied to service function paths.

Abstract: A method and a system is disclosed herein for co-operative on-path and off-path caching policy for information centric networks (ICN). In an embodiment, a computer implemented method and system is provided for cooperative on-path and off-path caching policy for information centric networks in which the edge routers or on-path routers optimally store the requested ICN contents and are supported by a strategically placed central off-path cache router for additional level of caching. A heuristic mechanism has also been provided to offload and to optimally store the contents from the on-path routers to off-path central cache router. The present scheme optimally stores the requested ICN contents either in the on-path edge routers or in strategically located off-path central cache router. The present scheme also ensures optimal formulation resulting in reduced cache duplication, delay and network usage.

Abstract: A controller assigns variable length addresses to addressable elements that are connected to a network. The variable length addresses are determined based on probabilities that packets are addressed to the corresponding addressable element. The controller transmits, to the addressable elements via the network, a routing table indicating the variable length addresses assigned to the addressable elements. Routers or addressable elements receive the routing table and route one or more packets over the network to an addressable element using variable length addresses included in a header of the one or more packets.

Abstract: Method, apparatus, and systems for reliably transferring Ethernet packet data over a link layer and facilitating fabric-to-Ethernet and Ethernet-to-fabric gateway operations at matching wire speed and packet data rate. Ethernet header and payload data is extracted from Ethernet frames received at the gateway and encapsulated in fabric packets to be forwarded to a fabric endpoint hosting an entity to which the Ethernet packet is addressed. The fabric packets are divided into flits, which are bundled in groups to form link packets that are transferred over the fabric at the Link layer using a reliable transmission scheme employing implicit ACKnowledgements. At the endpoint, the fabric packet is regenerated, and the Ethernet packet data is de-encapsulated. The Ethernet frames received from and transmitted to an Ethernet network are encoded using 64b/66b encoding, having an overhead-to-data bit ratio of 1:32.

Abstract: Procedures, methods and architectures for anchoring communication between IP-based devices in an ICN network or across an IP peer network are disclosed. Embodiments may enable the communication between two IP-based devices connected to an ICN, or one IP-based device connected to an ICN network while another IP-based device is connected either to an ICN network or IP network. In an embodiment, IP packets originating from an IP-based device may be encapsulated into ICN packets and forwarded via an ICN network. In an embodiment, IP packets received via an ICN network may be encapsulated in ICN packets and forwarded to an IP-based device. In an embodiment, IP packets originating from an IP-based device may be forwarded and received via an ICN network towards another IP network. In an embodiment, IP packets received by an ICN network may be forwarded towards an IP-based device via the ICN network.

Abstract: A method and apparatus for performing a lookup in a switching device of a packet switched network where the lookup includes a plurality of distinct operations each of which returns a result that includes a pointer to a next operation in a sequence of operations for the lookup. The method includes determining a first lookup operation to be executed, executing the first lookup operation including returning a result and determining if the result includes a pointer to another lookup operation in the sequence of operations. If the result includes a pointer to another lookup operation, the lookup operation indicated by the result is executed. Else, the lookup is terminated.

Abstract: A method and apparatus of a device that determines a match for a destination address using an exact match table and a longest prefix match table of a network element is described. In an exemplary embodiment, the network element receives a data packet that includes a destination address. The network element generates a key for the destination address, wherein the key represents more addresses than the destination address. The network element further performs an address lookup using the key in an exact match table. Furthermore, a match in the address lookup indicates a first transmitting interface of the network element. The network element additionally performs an address lookup using the destination address with a longest prefix match table, wherein a match in the address lookup indicates a second transmitting interface of the network element.

Abstract: A method and apparatus of a device that determines a match for a destination address using an exact match table and a longest prefix match table of a network element is described. In an exemplary embodiment, the network element receives a data packet that includes a destination address. The network element generates a key for the destination address, wherein the key represents more addresses than the destination address. The network element further performs an address lookup using the key in an exact match table. Furthermore, a match in the address lookup indicates a first transmitting interface of the network element. The network element additionally performs an address lookup using the destination address with a longest prefix match table, wherein a match in the address lookup indicates a second transmitting interface of the network element.

Abstract: Some embodiments provide a method for a forwarding element that forwards packets. The method receives a packet. The method performs a first stage lookup of a hash table for a first hash of a first set of header fields and un-wildcards bits of a wildcard mask that corresponds to the first set of header fields. If a matching hash is found in the first stage lookup, the method performs a second stage lookup of the hash table for a second hash of a second set of header fields and un-wildcards bits of the wildcard mask that corresponds to the second set of header fields. The method identifies a matching rule for the packet. The method generates a flow based on the matching rule and the wildcard mask, wherein the flow is used to process each other packets that match each bit which is un-wildcarded.

Abstract: A packet processing method executed by a system including a first apparatus and a second apparatus, the first apparatus having a first processor and a plurality of interfaces and a second apparatus having a second processor and a plurality of third processors, the packet processing method includes receiving, by the first processor, a packet via an interface in the plurality of interfaces; storing identification information of the interface into the packet; transmitting the packet to the second apparatus; receiving, by the second processor, the packet transmitted from the first apparatus; selecting a processor from the plurality of third processors based on the identification information included in the received packet; and executing processing of the packet using the selected processor.

Abstract: In order to achieve the dispersion of a processing load between communication devices that perform information transmission, an information communication system according to an exemplary aspect of the present invention includes a first transmission system configured to transmit information in a direction from a first communication device to a second communication device; and a second transmission system configured to transmit information in a direction opposite to the direction of the first transmission system, wherein part of transmission information is received as received information in each of the first transmission system and the second transmission system.

Abstract: A software-defined network-based method and system for implementing a content distribution network. An application function, control function, and network entity resource of a CDN are added respectively to an application layer, control layer, and data forwarding layer of an SDN. When a request for a CDN application is received, the SDN application layer generates resource requirement and service scheduling information based on the request, and transmits a reservation request for a resource required by the CDN application to an SDN control layer. The SDN control layer allocates a resource required by the CDN application to combine network load balancing and path policies and to generate a content routing table for data transmission, generating and transmitting L2 and L3 forwarding tables to the SDN data forwarding layer. When it receives content distribution and content delivery requests, the SDN data forwarding layer executes a CDN service-related operation based on the forwarding tables.

Abstract: A method for accelerating TCP/UDP packet switching. The method involves determining whether exception processing is necessary; if not, the packet is forwarded to a special stack for expedited processing. Packets requiring exception processing are forwarded to the conventional stack.

Abstract: In one embodiment, data packet messages are received in a Field Area Router (FAR) sent from one or more sources toward one or more destination devices in a Low-Power Lossy Network (LLN). An LLN routing topology for the data packet messages is interpolated in the FAR. An expected time for the data packet messages to reach a destination device in the LLN is determined based upon the routing topology interpolation. Traffic shaping is applied by the FAR for the data packet messages based upon the determined expected time for the data packet messages to reach destination devices in the LLN.

Abstract: Example implementations relate to end-to-end quality of service in storage area networks. For example, a method includes receiving input at a target from a user, the input to assign a priority level to a logical unit. This may include registering the logical unit priority level at a switch using an in-band communication in response to the priority level being assigned to the logical unit. This can also include instructing a host to implement the priority level using the in-band communication in response to the priority level being assigned to the logical unit. Further, the methods and systems may enforce the priority level with the host, the switch, and the target.

Abstract: Method, apparatus, and systems for implementing Quality of Service (QoS) within high performance fabrics. A multi-level QoS scheme is implemented including virtual fabrics, Traffic Classes, Service Levels (SLs), Service Channels (SCs) and Virtual Lanes (VLs). SLs are implemented for Layer 4 (Transport Layer) end-to-end transfer of fabric packets, while SCs are used to differentiate fabric packets at the Link Layer. Fabric packets are divided into flits, with fabric packet data transmitted via fabric links as flits streams. Fabric switch input ports and device receive ports detect SC IDs for received fabric packets and implement SC-to-VL mappings to determine VL buffers to buffer fabric packet flits in. An SL may have multiple SCs, and SC-to-SC mapping may be implemented to change the SC for a fabric packet as it is forwarded through the fabric, while maintaining its SL. A Traffic Class may include multiple SLs, enabling request and response traffic for an application to employ separate SLs.

Abstract: A server system can include a switching tier configured to receive network packets and enable network connections between a plurality of servers and a middle tier comprising first servers of the plurality of servers. Each first server can include at least one host processor, at least one network interface device, and at least one hardware accelerator module physically mounted in the first server. Each hardware accelerator module can include at least one field programmable gate array (FPGA) device coupled to receive network packet data from the switching tier over a first data path, and coupled to the at least one host processor by a second data path, each hardware accelerator module configurable to execute network packet data processing tasks independent from the at least one host processor of the server.

Abstract: The present disclosure is directed generally to systems and methods for dynamically selecting a retransmission rate for communication between two devices. The retransmission rate may be selected after a transmission has failed between the devices. In some embodiments, the retransmission rate may be selected based on relative velocity of the devices. In some embodiments, the retransmission rate may be selected based on transmission channel characteristics. The retransmission rate may be selected such that the retransmission will be less than an allowable transmission rate based on a distance between the two devices.

Abstract: Systems and methods of site traffic control are disclosed. In some example embodiments, a first request for an online service to perform an operation is received from a first user on a first client device, and at least one overload condition for the online service is detected, or otherwise determined, with the overload condition(s) corresponding to a first request time of the first request. A first token and a first return time parameter for the first user are determined based on the determination of the overload condition. The first token and the first return time parameter are transmitted to the first client device.

Abstract: This application describes client devices that control network transmission based on a power state. The client device determines a power state of the computing device and a priority of an application executing on the computing device. The client device determines whether to permit the application to communicate with a remote network accessible device via the network communication hardware based at least on the priority of the application and the power state of the computing device. Also described is a power state service that selects a client device to be provided with a notification based on power states of the client devices.

Abstract: Method and system for storing packets received from a bonded communication links according to latency of the communication link that has the largest latency among all communication links of the bonded communication links. Embodiments of present inventions can be applied to bonded communication links, including wireless connection, Ethernet connection, Internet Protocol connection, asynchronous transfer mode, virtual private network, WiFi, high-speed downlink packet access, GPRS, LTE, and X.25. The present invention presents methods comprising the steps of estimating storage size of a queue, wherein the queue is for storage the one or more packets received from the bonded communication links.

Abstract: Disclosed is a data caching method, comprising: according to an input port number of a cell, storing the cell in a corresponding first-in first-out queue; determining that a cell to be dequeued can be dequeued in the current Ktth cycle, scheduling for the cell to be dequeued to be dequeued, acquiring the actual value of the number of splicing units occupied by the cell to be dequeued, and storing the cell to be dequeued in a register the same number of bits wide as a bus in a cell splicing manner, wherein determining that the cell to be dequeued can be dequeued is conducted in accordance with the fact that a first back pressure count value of the (K?1)th cycle is less than or equal to a first preset threshold value, and the first back pressure count value of the (K?1)th cycle is obtained in accordance with an estimated value of the number of the splicing units occupied when the previous cell to be dequeued is dequeued, the number of splicing units capable of being transmitted by the bus in each cycle, and a f

Abstract: A work conserving scheduler can be implemented based on a ranking system to provide the scalability of time stamps while avoiding the fast search associated with a traditional time stamp implementation. Each queue can be assigned a time stamp that is initially set to zero. The time stamp for a queue can be incremented each time a data packet from the queue is processed. To provide varying weights to the different queues, the time stamp for the queues can be incremented at varying rates. The data packets can be processed from the queues based on the tier rank order of the queues as determined from the time stamp associated with each queue. To increase the speed at which the ranking is determined, the ranking can be calculate from a subset of the bits defining the time stamp rather than the entire bit set.

Abstract: In one implementation, a cloud resource system includes a resource engine and configuration engine. The resource engine can identify a cloud resource based on a template and assign the cloud resource based on a subscription and the template. The configuration engine can maintain a pool of cloud resource object instances.

Abstract: Disclosed are an apparatus and method for reconstructing a transmitted file with high performance in real time, which select analysis target packets for reconstruction by first checking using hardware whether data file-related information is present in packets transmitted via large-capacity traffic over a broadband network, and which reconstruct a file in real time only from the selected analysis target packets. The file reconstruction apparatus for reconstructing a data file from packets on a network includes a packet monitoring unit for extracting packets on the network, a collected packet selection unit for determining whether, for the extracted packets, each packet is a reconstruction target based on flow information, and selecting a reconstruction target packet, and a file reconstruction unit for performing file reconstruction by extracting data from the reconstruction target packet and by storing the extracted data as data of a reconstructed file in a relevant flow.

Abstract: Technologies for contention-aware cloud compute scheduling include a number of compute nodes in a cloud computing cluster and a cloud controller. Each compute node collects performance data indicative of cache contention on the compute node, for example, cache misses per thousand instructions. Each compute node determines a contention score as a function of the performance data and stores the contention score in a cloud state database. In response to a request for a new virtual machine, the cloud controller receives contention scores for the compute nodes and selects a compute node based on the contention score. The cloud controller schedules the new virtual machine on the selected compute node. The contention score may include a contention metric and a contention score level indicative of the contention metric. The contention score level may be determined by comparing the contention metric to a number of thresholds. Other embodiments are described and claimed.

Abstract: A system and method for addressing the impact of tenant/user customizations on various operations in a multi-tenant computing platform. In one embodiment, the system uses an operating system process (e.g., a parent process) to handle incoming operation requests to the platform from one or more tenants. If an incoming request specifies that a user customization should be executed, then the parent process coordinates execution of a separate operating system process (e.g., a child process) to execute the customization operation and return the result of the child process execution. In this manner, a single parent process may create several child processes to execute different customizations that each may be monitored and managed separately for resource use and consumption.

Abstract: A system of dynamically-instantiated data server components provides access to a data repository. Different data server components are assigned to different data collections in the repository. A distribution component receives messages and, based on data collection identifiers associated with the messages, routes the messages to corresponding data server components. Based on the messages, the data server components perform data operations with respect to their corresponding data collections. Data server components may be terminated when their assigned data collections are not in use. When an incoming message is associated with a data collection for which no data server component exists, the distribution component dynamically instantiates a new data server component for the data collection. In an embodiment, data server components make working copies of their respectively assigned data collections in a high-speed memory.

Abstract: The disclosure is directed to routing service requests over a network (50). Service requests may be routed over a network (50) based upon deriving optimized weights for each of a plurality of service providers (130) within a service provider set (135), receiving a plurality of service requests at a broker (110) within the network (50), and routing each of the plurality of service requests from the broker (110) to the plurality of service providers (130) on the network (50). In some implementations, the optimized weights for each of the plurality of service providers (130) may be derived using a non-linear function. In some implementations, the optimized weights for the plurality of service providers (130) associated with a broker (110) may collectively define a weighted distribution. The plurality of service requests may be routed by a broker (110) using its corresponding weighted distribution.

Abstract: A communication portal management system is provided. The communication portal management system includes a geographical address website management unit assigning a management authority of a geographical address website to at least one website operator, a server communication unit receiving a contents upload request from at least one website operator terminal, and a server management unit storing contents information corresponding to the contents upload request in a database unit. The geographical address website corresponds to a geographical address of the at least one website operator. The contents information and the geographical address website are matched in response to the contents upload request. Each of the at least one website operator terminal corresponds to each of the at least one website operator, respectively and communicates with a communication portal server to upload contents according to a predetermined conditions of the management authority.

Abstract: A system and method for implementing a CDN based on SDN are provided. The method includes: a complete service logic function of the CDN is added on an application layer of the SDN, and an application unit sends a resource requirement request and service orchestration request to an orchestration unit when receiving a CDN application request; the orchestration unit performs service orchestration in combination with related information of the SDN, sends a reservation request to a control unit to obtain a required resource, and then determines content distribution and content delivery paths in combination with network load balancing and routing condition; an L2 and L3 forwarding table is created and transmitted to a data forwarding unit according to related forwarding policy of an SDN control plane; and the application unit executes a related operation according to a content distribution or media access request, and the data forwarding unit forwards data.

Abstract: Techniques for management controllers are provided. In one aspect, a processor of a resource registration service of a management controller may receive, from a resource provider, a resource registration request to allocate a resource object in a data model. The resource registration request may include an indication that the resource object is to be joined to a public resource tree. The processor may then allocate the resource object within the data model. In allocating the resource object, the processor may update the public resource tree to link to the resource object based on the indication.

Abstract: A method and system include compatibly interfacing a suitably adapted central switch in a computer network virtualization environment to one or more user-end peripheral device(s) to dispense with a need for a user-end thin client. The method and system also include appropriately routing a data associated with a direct and exclusive communication between a virtual machine on a host server including a number of virtual machines and the one or more user-end peripheral device(s) using the central switch.

Abstract: In some embodiments, a data packet may be received at a leaf switch. A port-channel associated with a destination port for the data packet may be identified, and the data packet may be transmitted to the destination port via the identified port-channel.

Abstract: A communication device includes a plurality of controllers, a plurality of buses that transmit transmission information, and a gateway to which the plurality of buses are collectively connected. Each of the plurality of controllers has a pattern table that defines, for each piece of the transmission information, a transmission bus pattern, and controls the input and output of the transmission information according to the pattern table. Each of the plurality of controllers is connected to at least two buses, and outputs, to the gateway via all of the connected buses, check information for a confirmation of connections to the connected buses. The gateway determines an interrupted bus from which no check information is input, and outputs, to each of the plurality of controllers, a route switch instruction instructing use of a pattern table that does not include the interrupted bus(es).

Abstract: A network switch to support multiple virtual switch instances comprises a control CPU configured to run a plurality of network switch control stacks, wherein each of the network switch control stacks is configured to manage and control operations of one or more virtual switch instances of a switching logic circuitry of the network switch. The network switch further includes said switching logic circuitry partitioned into a plurality of said virtual switch instances, wherein each of the virtual switch instances is provisioned and controlled by one of the network switch control stacks and is dedicated to serve and route data packets for a specific client of the network switch.

Abstract: Disclosed is a method and system for structured chat messaging between user devices and bots. The method comprises creating a structured chat message by a bot of a user group, wherein the user group consist of one or more user devices and one or more bots, wherein the structured chat message comprises one or more data fields, and wherein the structured chat message comprises layout metadata defining a representation of the structured chat message; sending the structured chat message to the user group, by the bot; and facilitation to display the structured chat message on the user devices using the layout metadata; defining a message handler for the structured chat message; accepting inputs for the one or more data fields from users present in the user group; updating the structured chat message using the message handler based on the inputs of the users.

Abstract: A method of processing an incoming electronic message destined to an application associated with a user, the user being associated with a first electronic device and a second electronic device, both the first electronic device and the second electronic device executing an instance of the application.

Abstract: In one embodiment, a method for generating a message to a friend of a user is provided, comprising: processing activity data of a first user measured by an activity monitoring device to update a value of an activity metric for the first user; identifying a change in an inequality relationship between the value of the activity metric for the first user and a value of the activity metric for a second user; in response to identifying the change in the inequality relationship, prompting the first user to generate a message to the second user.