Data plane for processing function scalability

The present disclosure generally discloses a data plane configured for processing function scalability. The processing functions for which scalability is supported may include charging functions, monitoring functions, security functions, or the like.

Apparatus And Method For Protection In A Data Center

A manner of providing redundancy protection for a data center network that is both reliable and low-cost. In a data center network where the data traffic between numerous access nodes and a network core layer via primary aggregation nodes, an optical network device such as and OLT (optical line terminal) is provided as a backup aggregation node for one or more of the primary aggregation nodes. When a communication path through a primary aggregation node fails, traffic is routed through the optical network device. In a preferred embodiment, a communication link is formed from a plurality of access nodes to a single port of the OLT or other optical network device via an optical splitter that combines upstream transmissions and distributes downstream transmissions. The upstream transmissions from the plurality of access nodes may occur according to an allocation schedule generated when the backup aggregation node is needed. 1. A data center network access node comprising:at least one port comprising an optical module; andat least one non-optical port.2. The data center network access node of claim 1 , wherein the optical module is resident on an ONU (optical network unit) line card.3. The data center network access node of claim 1 , further comprising instructions executable by a processor and stored in a non-transitory memory device claim 1 , the instructions when executed generating a request for an optical transmission allocation.4. The data center network access node of claim 3 , wherein the request for an optical transmission allocation is generated for transmission from the at least one port comprising an optical module.5. The data center network access node of claim 1 , further comprising a table for storing an optical allocation schedule.6. The data center network access node of claim 1 , wherein the access node communicates with a primary aggregation node via the at least one non-optical port. The present application is a divisional application of U.S. patent ...

Apparatus and method for protection in a data center

A manner of providing redundancy protection for a data center network that is both reliable and low-cost. In a data center network where the data traffic between numerous access nodes and a network core layer via primary aggregation nodes, an optical network device such as and OLT (optical line terminal) is provided as a backup aggregation node for one or more of the primary aggregation nodes. When a communication path through a primary aggregation node fails, traffic is routed through the optical network device. In a preferred embodiment, a communication link is formed from a plurality of access nodes to a single port of the OLT or other optical network device via an optical splitter that combines upstream transmissions and distributes downstream transmissions. The upstream transmissions from the plurality of access nodes may occur according to an allocation schedule generated when the backup aggregation node is needed.

ANCHOR MOBILITY IN WIRELESS NETWORKS

This disclosure generally discloses an anchor mobility mechanism. The anchor mobility mechanism is configured to support migration of flows between mobility anchors within a wireless communication system. The anchor mobility mechanism may be configured to support migration of flows between mobility anchors within a wireless communication system in a highly seamless manner. The anchor mobility mechanism may be configured to support migration of a flow of a wireless device between mobility anchors within a wireless communication system using functions performed by a control element (CE) and one or more forwarding elements (FEs) within the data plane of the flow of the wireless device. The functions may include identifying a time at which to initiate migration of the flow, initiating migration of the flow based on identification of the time at which to initiate migration of the flow, or the like, as well as various combinations thereof.

DATA PLANE FOR PROCESSING FUNCTION SCALABILITY

The present disclosure generally discloses a data plane configured for processing function scalability. The processing functions for which scalability is supported may include charging functions, monitoring functions, security functions, or the like. 1. An apparatus configured to support a data plane portion of a processing function supported by a forwarding element and a control element in a communication network , the apparatus comprising:a first storage element configured to maintain a packet buffer data structure configured to store packet data for a set of data packets, wherein the packet buffer data structure comprises a packet queue configured to store packet data and a packet aggregation buffer configured to store packet data on a per-flow basis;a second storage element configured to store flow data for a set of data flows for which the forwarding element supports packet forwarding; and receive, from a hardware element of the forwarding element, a first packet header of a first packet and a second packet header of a second packet;', 'determine first packet data associated with the first packet;', 'store the first packet data in the packet queue of the packet buffer data structure, as individual packet data for the first packet, based on a determination that the packet queue is below a threshold;', 'determine second packet data associated with the second packet; and', 'store the second packet data in the packet aggregation buffer of the packet buffer data structure based on a determination that the packet queue exceeds the threshold., 'a processor element, communicatively connected to the first storage element and the second storage element, configured to2. The apparatus of claim 1 , wherein the processor element is configured to determine the first packet data associated with the first packet based on processing of the first packet header using processing logic associated with the processing function.3. The apparatus of claim 1 , wherein claim 1 , to store ...

JOINT SIGNAL-ROUTING AND POWER-CONTROL FOR AN OPTICAL NETWORK

We disclose a signal-routing method directed at improving the throughput of an optical network by taking into account the fiber nonlinearity in the process of solving a joint signal-routing and power-control problem for the optical network. Based on the obtained solution, a network controller may set the signal-routing configurations of the various network nodes and the optical gains of the various optical amplifiers to enable the optical network to carry the traffic in a manner that results in a higher throughput than that achievable with the use of conventional signal-routing and/or power-control methods.

Apparatus And Method For Protection In A Data Center

A manner of providing redundancy protection for a data center network that is both reliable and low-cost. In a data center network where the data traffic between numerous access nodes and a network core layer via primary aggregation nodes, an optical network device such as and OLT (optical line terminal) is provided as a backup aggregation node for one or more of the primary aggregation nodes. When a communication path through a primary aggregation node fails, traffic is routed through the optical network device. In a preferred embodiment, a communication link is formed from a plurality of access nodes to a single port of the OLT or other optical network device via an optical splitter that combines upstream transmissions and distributes downstream transmissions. The upstream transmissions from the plurality of access nodes may occur according to an allocation schedule generated when the backup aggregation node is needed. 1. A data center network comprising at least one OLT (optical line terminal).2. The data center network of claim 1 , wherein the at least one OLT forms a backup node in an aggregation layer.3. The data center network of claim 2 , wherein the at least one OLT is configured to perform layer 2 switching for aggregating data traffic between an access layer and a core layer of the data center network.4. The data center network of claim 3 , further comprising at least one optical splitter in communication with a port of the at least one OLT and at least one access node.5. The data center network of claim 4 , wherein the at least one access node comprises a plurality of access nodes in communication with the same optical splitter.6. The data center network of claim 5 , wherein at least two of the plurality of access nodes in communication with the same optical splitter are also in communication claim 5 , respectively claim 5 , with different primary aggregation nodes.7. A data center network access node comprising:at least one port comprising an optical ...

PRIVACY-PRESERVING ADVERTISEMENT TARGETING USING RANDOMIZED PROFILE PERTURBATION

A distribution and scheduling system for advertisements that targets ads to users and maximizes service-provider revenue without having full knowledge of user-profile information. Each user device stores a user profile and is pre-loaded with a set of ads that could possibly be shown during a timeslot. Each user device selects and displays an ad based on the user profile but does not identify the selected ad to the service provider. Instead, the user devices provide perturbed user-profile information in the form of Boolean vectors, which the service provider uses in conjunction with a guaranteed-approximation online algorithm to estimate the number of users that saw a particular ad. Thus, the service provider can charge advertisers for the number of times their ads are viewed, without knowing the users' profiles or which ads were viewed by individual users, and users can view the targeted ads while maintaining privacy from the service provider. 1. A computer-implemented method for estimating the number of user devices , from among a set of user devices , showing a target advertisement from among a plurality of candidate advertisements during a timeslot , the method comprising:(a) the computer sending, to each of the user devices in the set, identification of the plurality of candidate advertisements capable of being shown during the timeslot by the user device; (i) the number of user devices showing the target advertisement from among the plurality of candidate advertisements during the timeslot is capable of being estimated based on the data received from the plurality of user devices; and', '(ii) the identity of the user devices showing the target advertisement during the timeslot is incapable of being determined based on the data received from the plurality of user devices; and, '(b) the computer receiving data from a plurality of the user devices, wherein(c) the computer estimating, based on the data received from the plurality of user devices, the number of user ...

Method And Apparatus For Energy Efficient Distributed And Elastic Load Balancing

Various embodiments provide a method and apparatus of providing a load balancing configuration that adapts to the overall load and scales the power consumption with the load to improve energy efficiency and scalability. The energy efficient distributed and elastic load balancing architecture includes a collection of multi-tiered servers organized as a tree structure. The handling of incoming service requests is distributed amongst a number of the servers. Each server in the virtual load distribution tree accepts handles incoming service requests based on its own load. Once a predetermined loading on the receiving server has been reached, the receiving server passes the incoming requests to one or more of its children servers. 1. A method for providing energy efficient and elastic load balancing at a parent server , comprising:at a processor communicatively coupled to a data storage, receiving a plurality of service requests instantiated by one or more clients;determining, by the processor in cooperation with the data storage, a plurality of service handling decisions based on the service requests, the plurality of service handling decisions corresponding to at least a portion of the plurality of service requests;selecting, by the processor in cooperation with the data storage, a child server based on a first of the service handling decisions and transmitting a first propagated service request based on a first service request, the first service request corresponding to the first service handling decision; andselecting, by the processor in cooperation with the data storage, the parent server based on a second of the service handling decisions and handling a second service request, the second service request corresponding to the second service handling decision.2. The method of claim 1 , wherein the act of handling the second service request comprises: responding directly to the instantiating client of the second service request.3. The method of claim 1 , further ...

PROBABILISTIC FINGERPRINT CHECKING FOR PREVENTING DATA LEAKAGE

A data-leakage prevention capability is presented herein. The data-leakage prevention capability prevents leakage of data, of a file set having a plurality of files, from a secure network using online fingerprint checking of data flows at a boundary of the secure network. The online fingerprint checking is performed using a set of data structures configured for the file set. The data structures for the file set are configured based on file set characteristics information of the file set and a target detection lag indicative of a maximum number of bits within which a data leakage event for the file set is to be determined. The data structure configuration is computed for a plurality of data structures configured for use in monitoring the files of the file set. The data structure configuration includes a plurality of data structure locations and data structure sizes for the respective plurality of data structures. 1. An apparatus , comprising: receive file set characteristics information of a file set comprising a plurality of files;', 'receive a target detection lag indicative of a maximum number of bits within which a data leakage event for the file set is to be determined; and', 'compute, based on the file set characteristics information and the target detection lag, a data structure configuration for a plurality of data structures configured for use in monitoring the files of the file set, wherein the data structure configuration comprises a plurality of data structure locations for the respective plurality of data structures and a plurality of data structure sizes for the respective plurality of data structures., 'a processor and a memory communicatively coupled to the processor, the processor configured to2. The apparatus of claim 1 , wherein the data leakage event comprises allowing at least a portion of one of the files of the file set to pass from a secure network to an unsecured network.3. The apparatus of claim 1 , wherein the file set characteristics ...

Method And Apparatus For A Distributed File System In A Cloud Network

Various embodiments provide a method and apparatus of providing a distributed network file system in a cloud network that provides performance guarantees in cloud storage that are independent of the accessed files and the access locations. A client's file system is provisioned using a file placement strategy that is based on client's access locations and determined maximum access bandwidths and does not require knowledge of file access patterns. 1. An apparatus for providing a distributed file system , the apparatus comprising:a data storage; anda processor communicatively connected to the data storage, the processor being configured to:determine a plurality of client locations, associated with a client, a plurality of files and communicatively connected to a plurality of edge nodes within a storage network via a plurality of associated communication channels, the plurality of files stored within a plurality of storage nodes within the storage network;determine a plurality of access bandwidths of the plurality of associated communication channels; andprovision storage of the plurality of files within the storage nodes based on the plurality of client locations and the plurality of access bandwidths.2. The apparatus of claim 1 , wherein the provision of the storage of the plurality of files comprises configuring the processor to:apply file chunking and file replication storage mechanisms to the plurality of files based on the plurality of client locations and the plurality of access bandwidths, wherein the file chunking and file replication storage mechanisms specify storing the plurality of files as a plurality of file chunks;determine placement of the plurality of file chunks within the storage nodes based on the plurality of client locations and the plurality of access bandwidths; anddetermine for each of a select portion of the plurality of edge nodes at least one of the plurality of storage nodes to be accessed in response to a file access request received from ...

SECURING SOFTWARE DEFINED NETWORKS VIA FLOW DEFLECTION

A flow deflection capability is provided for deflecting data flows within a Software Defined Network (SDN) in order to provide security for the SDN. A flow forwarding rule is generated for a first network element of the SDN based on detection of a condition (e.g., TCAM utilization condition, CPU utilization condition, or the like) associated with the first network element. The flow forwarding rule is generated by a control element of the SDN or the first network element of the SDN. The flow forwarding rule is indicative that at least a portion of new flow requests received at the first network element are to be forwarded from the first network element to a second network element of the SDN. The flow forwarding rule may specify full flow deflection or selective flow deflection. 1. An apparatus , comprising: 'generate, based on detection of a resource utilization condition associated with a first network element of a software defined network, a flow forwarding rule indicative that at least a portion of new flow requests received at the first network element are to be forwarded from the first network element to a second network element of the software defined network.', 'a processor and a memory communicatively connected to the processor, the processor configured to2. The apparatus of claim 1 , wherein the resource utilization condition comprises a Ternary Content-Addressable Memory (TCAM) utilization condition or a Central Processing Unit (CPU) utilization condition.3. The apparatus of claim 1 , wherein the processor is configured to:select the second network element from a set of candidate network elements.4. The apparatus of claim 3 , wherein the resource utilization condition is associated with a resource type claim 3 , wherein the second network element is one of the candidate network elements having a lowest resource utilization level for the resource type.5. The apparatus of claim 3 , wherein the set of candidate network elements comprises at least one of:one or ...

JOINT ALLOCATION OF CLOUD AND NETWORK RESOURCES IN A DISTRIBUTED CLOUD SYSTEM

A capability is provided for allocating cloud and network resources in a distributed cloud system including a plurality of data centers. A request for resources is received. The request for resources includes a request for cloud resources and an indication of an amount of cloud resources requested. The request for resources also may include a request for network resources or one or more constraints. A set of feasible resource mappings is determined based on the request for resources and information associated with the distributed cloud system. A resource mapping to use for the request for resources is selected from the set of feasible resource mappings. The selected resource mapping includes a mapping of the requested cloud resources to cloud resources of one or more of the data centers and an identification of network resources configured to support communications for the cloud resources of the one or more data centers. 1. An apparatus for processing a request for resources of a distributed cloud system including a plurality of data centers , comprising: receive a request for resources of the distributed cloud system, wherein the request for resources comprises a request for cloud resources and an indication of an amount of cloud resources requested; and', 'determine a resource mapping for the resource request based on the request for resources and information associated with the distributed cloud system, the resource mapping comprising a mapping of the requested cloud resources to cloud resources of one or more of the data centers and an identification of network resources configured to support communications for the cloud resources of the one or more data centers., 'a processor and a memory communicatively connected to the processor, the processor configured to2. The apparatus of claim 1 , wherein the request for resources comprises an indication of one or more geographic locations for the requested cloud resources.3. The apparatus of claim 1 , wherein the ...

METHOD AND APPARATUS FOR PROVIDING ALLOCATING RESOURCES

Various embodiments provide a method and apparatus for allocating resources to processes by using statistical allocation based on the determined maximum average resource demand at any time across all applications (“ ”), and the determined maximum resource demand at any time by any application (“C”). In particular, resource allocation includes an auto-scaling scheme based on and C. 1. An apparatus for providing resource allocation , the apparatus comprising:a data storage; and determine a worst case average requirement;', 'determine a maximum resource requirement; and', 'determine a resource allocation scheme for a set of allocation steps based on the worst case average requirement and the maximum resource requirement., 'a processor communicatively connected to the data storage, the processor being configured to2. The apparatus of claim 1 , wherein the processor is further configured to:determine a number of allocation steps;wherein the set of allocation steps includes the determined number of allocation steps.3. The apparatus of claim 1 , wherein the processor is further configured to:collect a set of historical data;wherein the worst case average requirement and the maximum resource requirement are based on at least a portion of the set of historical data.4. The apparatus of claim 3 , wherein the processor is further configured to:trigger determination of the resource allocation scheme based on a trigger event.5. The apparatus of claim 4 , wherein the trigger event is based on resource utilization.6. The apparatus of claim 1 , wherein the worst case average requirement=maxμ(t); where μ(t) is the average amount of resources requested by an application at time t.7. The apparatus of claim 6 , wherein the maximum resource requirement=maxh(t); where h(t) is the historical resource requirement for each application I at time t.8. The apparatus of claim 1 , wherein the resource allocation scheme is based on a Markov inequality.9. The apparatus of claim 8 , wherein the ...

UNICAST BRANCHING BASED MULTICAST

The present disclosure generally discloses multicast communication support capabilities configured to support multicast communications of a multicast group using a multicast tree. The multicast communication support capabilities may include a unicast branching based multicast capability. The unicast branching based multicast capability may be configured to support determination and establishment of, as well as communication via, a multicast tree that is composed of unicast branches. The unicast branching based multicast capability may be configured to preserve the multicast information of multicast transmissions transported via the multicast tree even though the multicast transmissions are transported via unicast branches of the multicast tree. The unicast branching based multicast capability may be configured to preserve the multicast information of multicast transmissions transported via unicast branches of the multicast tree based on encoding of the multicast information within the packets of the multicast transmission being transported via the unicast branches of the multicast tree. 1. An apparatus , comprising: receive, at a first switch of a multicast tree of a multicast group, a multicast packet comprising a header and a payload, the header comprising a destination address field including a multicast destination address of the multicast group;', 'modify the multicast packet at the first switch of the multicast tree, to form thereby a modified packet, by updating the destination address field of the header to include a unicast destination address of a second switch of the multicast tree and adding the multicast destination address of the multicast group to the header; and', 'send the modified packet toward the second switch of the multicast tree., 'a processor and a memory communicatively connected to the processor, the processor configured to2. The apparatus of claim 1 , wherein the processor is configured to add the multicast destination address of the ...

Generalized packet processing offload in a datacenter

The present disclosure generally discloses packet processing offload support capabilities for supporting packet processing offload. The packet processing offload support capabilities may be configured to support general and flexible packet processing offload at an end host by leveraging a processing device (e.g., a smart network interface card (sNIC) or other suitable processing device) added to the end host to support offloading of various packet processing functions from the hypervisor of the end host to the processing device added to the end host. The packet processing offload support capabilities may be configured to support packet processing offload by including, within the end host, a virtualization switch and a packet processing offload agent which may be configured to cooperate to transparently offload at least a portion of the packet processing functions of the end host from the hypervisor of the end host to an sNIC of the end host while keeping the existing management plane and control plane interfaces of the datacenter unmodified.

DATA PLANE FOR PROCESSING FUNCTION SCALABILITY

The present disclosure generally discloses a data plane configured for processing function scalability. The processing functions for which scalability is supported may include charging functions, monitoring functions, security functions, or the like. 1. An apparatus , comprising: receive, by a first forwarding element (FE) from a control element (CE), a set of credits for a wireless device (WD);', 'send, by the first FE toward a second FE, traffic intended for the WD;', 'perform, by the first FE based on the set of credits for the WD and the traffic intended for the WD, charging processing for the WD;', 'stop, by the first FE, charging processing for the WD; and', 'send, by the first FE toward the CE, a set of leftover credits of the WD, from the set of credits for the WD, not used by the WD., 'a processor and a memory communicatively connected to the processor, the processor configured to2. The apparatus of claim 1 , wherein the processor is configured to:send, by the first FE toward the CE, a request for the set of credits for the WD.3. The apparatus of claim 2 , wherein the processor is configured to send the request for the set of credits for the WD from the first FE toward the CE responsive to receipt by the first FE of a first packet intended for the WD.4. The apparatus of claim 1 , wherein the processor is configured to send the traffic intended for the WD from the first FE toward the second FE via a tunnel between the first FE and the second FE.5. The apparatus of claim 1 , wherein the processor is configured to stop the charging processing for the WD based on a timeout condition.6. The apparatus of claim 5 , wherein the timeout condition is based on a determination that traffic for the WD has not been received by the first FE for a threshold length of time.7. The apparatus of claim 1 , wherein the processor is configured to:perform, by the first FE, uplink charging processing for the WD based on traffic received from the WD.8. The apparatus of claim 1 , ...

Apparatus and method for matching offers and requests for sharing of resources

A resource assignment capability is presented. A resource specification associated with a plurality of elements is received. The resource specification includes, for each of the elements, a resource request including an indication of a quantity of resources requested by the element and a resource offer including an indication of a quantity of resources offered by the element for use by one or more other elements. A resource assignment, including an indication of an association between the resources requests and the resource offers, is determined using a resource assignment process. The resource assignment process may be a greedy assignment process or a maximum flow resource assignment process. The maximum flow resource assignment process includes constructing a maximum flow resource graph based on the one or more resource specifications and applying a maximum flow process to the maximum flow resource graph to determine thereby the resource assignment.

ALLOCATION AND MIGRATION OF CLOUD RESOURCES IN A DISTRIBUTED CLOUD SYSTEM

A capability is provided for allocating and migrating cloud resources in a distributed cloud system. A cloud resource request is received and an associated cloud resource allocation is determined. The cloud resource request includes cloud resource request information. The cloud resource request information includes a cloud resource allocation parameter associated with allocation of requested cloud resources responsive to the cloud resource request and a cloud resource migration parameter associated with migration of cloud resources allocated responsive to the cloud resource request. The cloud resource allocation includes cloud resource allocation information specifying allocation of cloud resources within the cloud system responsive to the cloud resource request and cloud resource migration information specifying migration of cloud resources allocated within the cloud system responsive to the cloud resource request. 1. An apparatus for allocating cloud resources within a cloud system , the apparatus comprising: receive a cloud resource request comprising cloud resource request information, the cloud resource request information comprising a cloud resource allocation parameter associated with allocation of requested cloud resources responsive to the cloud resource request and a cloud resource migration parameter associated with migration of cloud resources allocated responsive to the cloud resource request; and', 'determine, based on the cloud resource allocation parameter and the cloud resource migration parameter, a cloud resource allocation comprising cloud resource allocation information specifying allocation of cloud resources within the cloud system responsive to the cloud resource request and cloud resource migration information specifying migration of cloud resources allocated within the cloud system responsive to the cloud resource request., 'a processor and a memory communicatively connected to the processor, the processor configured to2. The apparatus of ...

SCALE-UP OF SDN CONTROL PLANE USING VIRTUAL SWITCH BASED OVERLAY

A capability for scale-up of a control plane of a Software Defined Network (SDN) using a virtual switch based overlay is presented. A central controller (CC) of the SDN that is providing control functions for a physical switch (pSwitch) of the SDN, based on a determination that the control plane between the CC and the pSwitch is congested, modifies the default flow forwarding rule on the pSwitch from a rule indicating that new traffic flows are to be forwarded to the central controller to a rule indicating that new traffic flows are to be forwarded to a virtual switch (vSwitch). Upon receipt of a first packet of a new traffic flow at the pSwitch, the pSwitch provides the first packet of the new traffic flow to the vSwitch, which in turn provides an indication of the first packet of the new traffic flow to the CC for processing by the CC. 1. An apparatus for use in a software defined network , comprising: 'propagate, toward a physical switch of the software defined network, a default flow forwarding rule indicative that, for new traffic flows received at the physical switch, associated indications of the new traffic flows are to be directed to a virtual switch.', 'a processor and a memory communicatively connected to the processor, the processor configured to2. The apparatus of claim 1 , wherein the processor is configured to propagate the default flow forwarding rule toward the physical switch based on detection of a condition associated with a control plane path between the apparatus and the switch.3. The apparatus of claim 2 , wherein the processor is configured to:monitor the control plane path between the apparatus and the physical switch for detection of the condition.4. The apparatus of claim 2 , wherein the processor is configured to: 'propagate, toward the physical switch, a new default flow forwarding rule indicative that, for subsequent new traffic flows received by the physical switch, associated indications of the subsequent new traffic flows are to be ...

SECURING SOFTWARE DEFINED NETWORKS VIA FLOW DEFLECTION

A flow deflection capability is provided for deflecting data flows within a Software Defined Network (SDN) in order to provide security for the SDN. A flow forwarding rule is generated for a first network element of the SDN based on detection of a condition (e.g., TCAM utilization condition, CPU utilization condition, or the like) associated with the first network element. The flow forwarding rule is generated by a control element of the SDN or the first network element of the SDN. The flow forwarding rule is indicative that at least a portion of new flow requests received at the first network element are to be forwarded from the first network element to a second network element of the SDN. The flow forwarding rule may specify full flow deflection or selective flow deflection. 1. An apparatus , comprising: receive, at a first network element of a software defined network from a second network element of the software defined network, a new flow request; and', 'propagate the new flow request from the first network element of toward a control element of the software defined network., 'a processor and a memory communicatively connected to the processor, the processor configured to2. The apparatus of claim 1 , wherein the processor is configured to:receive, at the first network element from the control element, a flow forwarding rule for a data flow associated with the new flow request.3. The apparatus of claim 2 , wherein the processor is configured to:receive, at the first network element from the control element, an indication that the flow forwarding rule for the data flow associated with the new flow request is to be removed from the first network element.4. The apparatus of claim 1 , wherein the new flow request has a flow identifier associated therewith claim 1 , wherein the processor is configured to:distinguish, based on the flow identifier, between a data flow associated with the new flow request and local data flows associated with data flow requests received ...

High-throughput routing in an optical network having a mesh topology

An optical routing scheme in which an optical network having a mesh topology is configured to route optical packets through an optical routing layout superimposable with the mesh topology, but having a star-like topology. Using this routing layout, the optical network can be configured to transport optical packets from respective ingress nodes, through the hub node located at the star center, to respective egress nodes in a manner that enables a data throughput that approaches the theoretical capacity. No special hardware is required for implementing the hub functionality, and any node of the optical network can be configured to serve as the hub node. The latter feature enables relatively straightforward optimization of the optical routing layout and transmission schedule, e.g., by changing the identity of the hub node and adjusting the transmission schedule at the ingress nodes to synchronize packet arrivals to the hub node.

Apparatus And Method For Protection In A Data Center

A manner of providing redundancy protection for a data center network that is both reliable and low-cost. In a data center network where the data traffic between numerous access nodes and a network core layer via primary aggregation nodes, an optical network device such as and OLT (optical line terminal) is provided as a backup aggregation node for one or more of the primary aggregation nodes. When a communication path through a primary aggregation node fails, traffic is routed through the optical network device. In a preferred embodiment, a communication link is formed from a plurality of access nodes to a single port of the OLT or other optical network device via an optical splitter that combines upstream transmissions and distributes downstream transmissions. The upstream transmissions from the plurality of access nodes may occur according to an allocation schedule generated when the backup aggregation node is needed.

PROXY FOR SERVING INTERNET-OF-THINGS (IOT) DEVICES

An Internet-of-Things (IOT) proxy includes storage hardware configured to store first and second state information. The first state information defines first contexts for flows associated with a plurality of IoT devices. The plurality of electronic devices have established a corresponding plurality of first sessions that are terminated by the IoT proxy. The second state information defines second contexts for the flows associated with the plurality of IoT devices. The second state information is associated with a second session that has been established between the proxy and a server or an other electronic device. The IoT proxy also includes computing hardware configured to modify headers of packets associated with the IoT devices based on at least one of the first state information or the second state information. In some cases, the IoT proxy is implemented as a virtual network slice in a network function virtualization (NFV) architecture. 1. A method comprising:storing, at a proxy, first state information that defines first contexts for flows associated with a plurality of electronic devices, wherein the plurality of electronic devices have established a corresponding plurality of first sessions that are terminated by the proxy;storing, at the proxy, second state information that defines second contexts for the flows associated with the plurality of electronic devices, wherein the second state information is associated with a second session that has been established between the proxy and a server or an other electronic device; andmodifying, at the proxy, headers of packets associated with the electronic devices based on at least one of the first state information or the second state information.2. The method of claim 1 , further comprising:establishing a logical link between the proxy and a base station that serves the plurality of electronic devices prior to the base station receiving the packets, wherein the logical link is configured to provide connectionless ...

INTERNET SECURITY

The present disclosure generally discloses an Internet security mechanism configured to provide security for Internet resources of the Internet using an Internet blockchain. The Internet blockchain may be configured to provide security for Internet resources of the Internet by supporting various types of verification related to Internet resources of the Internet, which may include verification of Internet resource ownership, verification of Internet resource transactions, and so forth. The Internet blockchain may be configured to enable Internet participants (e.g., Internet registries, Domain Name Service (DNS) entities, Autonomous Systems (ASes), or the like) to verify Internet resource ownership of Internet resources (e.g., Internet Protocol (IP) addresses, AS numbers, IP prefixes, DNS domain names, or the like) by Internet participants, to verify Internet resource transactions (e.g., allocation of IP addresses, allocation of AS numbers, advertisements of IP prefixes, allocation of DNS domain names, or the like) attempted by Internet participants, and so forth. 1. An apparatus , comprising: generate an Internet resource transaction for an Internet resource, the Internet resource transaction indicating an allocation of the Internet resource from a first Internet participant to a second Internet participant;', 'broadcast the Internet resource transaction via a peer-to-peer system;', 'receive, via the peer-to-peer system, an Internet resource block including the Internet resource transaction; and', 'associate the Internet resource block with an Internet blockchain., 'a processor and a memory communicatively connected to the processor, the processor configured to2. The apparatus of claim 1 , wherein the Internet resource transaction comprises a transaction input comprising a reference to a previous Internet resource transaction for the Internet resource and a digital signature based on a private key of the first Internet participant claim 1 , wherein the Internet ...

WEIGHT SETTING USING INVERSE OPTIMIZATION

The present disclosure generally discloses improvements in computer performance for supporting use of shortest path routing in a communication network. The shortest path routing capability may be configured to support setting of link weights for use in shortest path routing. The shortest path routing capability may be configured to support setting of link weights for use in shortest path routing based on inverse optimization. The shortest path routing capability may be configured to support setting of link weights for use in shortest path routing based on distance between traffic matrices (e.g., distance between a requested traffic matrix and a routed traffic matrix). The shortest path routing capability may be configured to determine, based on the distance between a requested traffic matrix and a routed traffic matrix, whether to accept or reject a set of link weights for a network. 1. An apparatus , comprising: receive a requested traffic matrix indicative of traffic to be routed through a network including a set of nodes and a set of links, a set of link weights associated with the respective links, and a performance metric;', 'determine, based on the requested traffic matrix and the set of link weights, a routed traffic matrix indicative of routing of the traffic of the requested traffic matrix in the network using the set of link weights;', 'determine, based on the performance metric, a distance between the requested traffic matrix and the routed traffic matrix; and', 'determine, based on the distance between the requested traffic matrix and the routed traffic matrix, whether to accept or reject the set of link weights for the network., 'a processor and a memory communicatively connected to the processor, the processor configured to2. The apparatus of claim 1 , wherein the performance metric comprises a maximum link utilization for the network.3. The apparatus of claim 1 , wherein the processor is configured to:accept the set of link weights for the network ...

PROVIDING DATA PLANE SERVICES FOR APPLICATIONS

The present disclosure generally discloses a data plane services support mechanism. The data plane services support mechanism may be configured to provide a data plane service for an application. The data plane services support mechanism may be configured to instantiate a virtual resource for the data plane service to be provided for the application, configure the data plane service on the virtual resource, and configure flow connectivity for the data plane service to support delivery of application traffic of the application to the data plane service. The data plane services support mechanism may be configured to support automatic scalability. The data plane services support mechanism may be configured to support improved communication of application traffic associated with providing the data plane service for the application. The improved communication of application traffic may be provided based on configuration of a virtual switch to support a network interface card (NIC) offloading capability. 1. A non-transitory computer-readable storage medium storing instruction which , when executed by a computer , cause the computer to perform a method , the method comprising:initiating instantiation of a first virtual resource on a server, wherein the first virtual resource is associated with a second virtual resource configured to run an application;initiating configuration of the first virtual resource to provide a data plane service for the application; andinitiating configuration of flow connectivity for the data plane service.2. The non-transitory computer-readable storage medium of claim 1 , wherein initiating instantiation of the first virtual resource on the server is performed responsive to a request from a virtual resource management system.3. The non-transitory computer-readable storage medium of claim 1 , wherein initiating instantiation of the first virtual resource on the server comprises:sending, toward a virtual resource manager of the server, a request ...

High-speed traffic measurement and analysis methodologies and protocols

In one embodiment, a node-implemented method for performing analysis of traffic within a packet communications network. First, the node measures a traffic aggregate at specified nodes within the network with regard to a packet set of interest. Each traffic aggregate (i) is a set of packets, observed at one of the specified nodes, having a common characteristic and (ii) is measured at one of the specified nodes by creating a digest for the packets having the common characteristic. The digest characterizes the traffic aggregate without containing the actual packets themselves. Next, the node formulates an intersection set cardinality determination for a network traffic-characterizing parameter to be measured in the network utilizing the digests characterizing the traffic aggregates. Next, the node solves the set cardinality determination for the network traffic-characterizing parameter to be measured.

Advertisement scheduling in a packet-based media-delivery system

In one embodiment, a scheme for the display of targeted and personalized advertisements in a packet-based media-delivery system, such as an Internet Protocol Television (IPTV) service. An Internet keyword-based advertisement-bidding model is used to place the most-appropriate IPTV advertisements for viewers depending on their interests as determined through the users' Internet activities, while maximizing advertising revenue for the IPTV service provider. One method for scheduling an advertisement for rendering in one or more time slots in packet-based media programming comprises: (a) obtaining at least one keyword from one or more Internet sessions corresponding to at least one user; (b) receiving a plurality of bid amounts corresponding to a plurality of available advertisements for the one or more time slots; and (c) scheduling, based on the at least one keyword and at least one of the bid amounts, the advertisement to be rendered to the at least one user in the one or more time slots.

Efficient and robust routing of potentially-variable traffic with local restoration against link failures

In one embodiment, a method for supporting recovery from failure of a link in a network of nodes interconnected by links. An intermediate node between an ingress point and an egress point of the network is selected to minimize the sum of (i) a capacity constraint between the ingress point and the intermediate node and (ii) a capacity constraint between the intermediate node and the egress point. The selection identifies two path structures, each comprising a primary path and one or more link backup detours protecting each link on the primary path, with a first path structure between the ingress point and the intermediate node, and a second path structure between the intermediate node and the egress point. To maximize network throughput, packets are routed in two phases, first to the intermediate node via the first path structure in predetermined proportions, and then from the intermediate node to the final destination via the second path structure.

Effective and robust routing independent of traffic changes

Packet filter system using BITMAP vector of filter rules for routing packet through network

A filter method for designating one of a plurality of packet filter rules contained in a router for routing a packet of information through a network, each packet characterized as having parameters, the method comprising: generating one or more partitioned sets, each partitioned set associated with a different packet parameter with each partition of a set having zero or more associated filter rules; generating a vector corresponding to each of the parameters, the vector defining structure indicating one or more potential filter rules to be applied; comparing each parameter of the received packet with each partition of a corresponding partitioned set and determining one or more potential filter rules to be applied to the packet for each parameter; and determining from each of the vectors one or more identical potential filter rules associated with each vector, one of the identical filter rules capable of being applied to the received packet, with the rule to be applied being the rule of greatest priority.

Method for routing traffic using traffic weighting factors

Packet processing using braided tries

Packets are processed (e.g., routed or classified) in accordance with a braided trie, which represents the combination of two or more different original tries (e.g., representing different forwarding/classification tables). The different tries are combined by twisting the mappings for specific trie nodes to make the shapes of the different tries more similar. Each node in the braided trie contains a braiding bit for at least one original trie indicating the mapping for that trie's node. Trie braiding can significantly reduce the number of nodes used to represent the different original tries, thereby reducing memory usage and improving scalability. Braided tries can be used for such applications as virtual routers and packet classification in which different forwarding/classification tables are represented by a single braided trie stored in shared memory.

Efficient and robust routing of potentially-variable traffic in IP-over-optical networks with resiliency against router failures

In one embodiment, a method for supporting recovery from failure of a node in a network of nodes interconnected by links A set of two or more intermediate nodes (excluding the failed node) between an ingress point and an egress point is selected. Next, based on available bandwidth of the network, a non-zero fraction of the service level to route from the ingress point to each intermediate node is determined. Packets are then routed in two phases by: (1) determining one or more paths from the ingress point to each intermediate node for routing the corresponding fraction of the service level, and (2) determining one or more paths from each intermediate node to the egress point for routing the corresponding fraction of the service level.

Smoothing delay-sensitive traffic offered to asynchronous transfer mode networks

A methodology and concomitant circuitry for smoothing delay sensitive traffic utilizes short term traffic forecasts and guarantees meeting a prespecified delay constraint. The pattern of incoming traffic is used to forecast estimates of future incoming data from the present and past incoming data. Corresponding to the estimate is a data rate for propagating stored data to produce a smoothed outgoing data rate, and the interval of time over which such a rate is used so as to satisfy the delay constraint. The estimation procedure is then re-invoked at the end to the time interval, which takes into account data arriving during the time interval, so as to determine the next succeeding data rate and a new time interval for propagating stored data.

Scheduler for multicast cell transmission

A scheduler for a packet switch capable of atomic multicasts, that is, allowing one packet at an input port to be simultaneously transmitted to multiple output ports. The scheduling algorithm sequentially polls each of the input ports to determine to which output ports it desires connection for the next transmission slot. If those output ports are available, that input port assigns itself to the slot, and subsequent input ports are blocked from those output ports. The scheduling algorithm does not poll these blocked input ports for the current slot. The scheduler can be advantageously implemented in an optical system having one optical path for indexing control and multiple optical paths corresponding to each of the output ports. Sub-schedulers are arranged serially along all the optical paths. When a sub-scheduler is notified by the indexing control path that its turn to assign has arrived, it checks all of the optical paths corresponding to the output ports to which it desires connection. If those output ports are available, it assigns itself to the current slot, indicates on the output port optical paths that those desired output ports are no longer available, and indicates on the indexing control path that its assigning turn is over. If those output ports are not available, it nonetheless indicates on the indexing control path that its assigning turn is over and waits till the next assigning period.

soft router

Methodology and protocols for high-speed traffic measurement and analysis

Routing of bandwidth guaranteed paths with restoration in an information network

Restorable paths in an information network are established in response to arriving traffic requests. Requests are received at a first node of the network for transmission of traffic to a second node of the network, and each request specifies a desired transmission bandwidth for an active and a backup path to be established between the nodes. Potential active links for an active path are identified in response to a given request, and potential backup links to form a backup path for restoring the active path, are also identified in response to the given request. An active and a backup path are then formulated for each given request from among the potential active links and the potential backup links that were identified in response to the given request.

Method and apparatus for energy efficient distributed and elastic load balancing

Various embodiments provide a method and apparatus of providing a load balancing configuration that adapts to the overall load and scales the power consumption with the load to improve energy efficiency and scalability. The energy efficient distributed and elastic load balancing architecture includes a collection of multi-tiered servers organized as a tree structure. The handling of incoming service requests is distributed amongst a number of the servers. Each server in the virtual load distribution tree accepts handles incoming service requests based on its own load. Once a predetermined loading on the receiving server has been reached, the receiving server passes the incoming requests to one or more of its children servers.

Apparatus and method for matching offers and requests for sharing of resources

A resource assignment capability is presented. A resource specification associated with a plurality of elements is received. The resource specification includes, for each of the elements, a resource request including an indication of a quantity of resources requested by the element and a resource offer including an indication of a quantity of resources offered by the element for use by one or more other elements. A resource assignment, including an indication of an association between the resources requests and the resource offers, is determined using a resource assignment process. The resource assignment process may be a greedy assignment process or a maximum flow resource assignment process. The maximum flow resource assignment process includes constructing a maximum flow resource graph based on the one or more resource specifications and applying a maximum flow process to the maximum flow resource graph to determine thereby the resource assignment.

Providing data plane services for applications

The present disclosure generally discloses a data plane services support mechanism. The data plane services support mechanism may be configured to provide a data plane service for an application. The data plane services support mechanism may be configured to instantiate a virtual resource for the data plane service to be provided for the application, configure the data plane service on the virtual resource, and configure flow connectivity for the data plane service to support delivery of application traffic of the application to the data plane service. The data plane services support mechanism may be configured to support automatic scalability. The data plane services support mechanism may be configured to support improved communication of application traffic associated with providing the data plane service for the application. The improved communication of application traffic may be provided based on configuration of a virtual switch to support a network interface card (NIC) offloading capability.

Scheduling deterministic flows in time synchronized networks

Various example embodiments for supporting scheduling of deterministic flows in time synchronized networks are presented. Various example embodiments for supporting scheduling of deterministic flows in a time synchronized network may be configured to support scheduling of deterministic flows in the time synchronized network based on assignment of transmission start times to data flows of communication devices such that the communication devices may transmit data of the data flows at the transmission start times in a manner tending to reduce or eliminate collisions in the time synchronized network.

Scheduling in mapreduce-like systems for fast completion time

A method and system for scheduling tasks is provided. A plurality of lower bound completion times is determined, using one or more computer processors and memory, for each of a plurality of jobs, each of the plurality of jobs including a respective subset plurality of tasks. A task schedule is determined for each of the plurality of processors based on the lower bound completion times.

Providing data plane services for applications

The present disclosure generally discloses a data plane services support mechanism. The data plane services support mechanism may be configured to provide a data plane service for an application. The data plane services support mechanism may be configured to instantiate a virtual resource for the data plane service to be provided for the application, configure the data plane service on the virtual resource, and configure flow connectivity for the data plane service to support delivery of application traffic of the application to the data plane service. The data plane services support mechanism may be configured to support automatic scalability. The data plane services support mechanism may be configured to support improved communication of application traffic associated with providing the data plane service for the application. The improved communication of application traffic may be provided based on configuration of a virtual switch to support a network interface card (NIC) offloading capability.

Localization systems and methods

A system and method for providing localization of a mobile electronic device within an environment includes at least one server in communication with the mobile electronic device. The at least one server is adapted to receive at least one picture and at least one accelerometer measurement from the mobile electronic device. The at least one server includes a localization module that provides localization to the mobile electronic device based on the at least one picture, the at least one accelerometer measurement and on at least one 3-dimensional map of the environment.

Variable-stride stream segmentation and multi-pattern matching

A variable-stride multi-pattern matching apparatus segments patterns and input streams into variable-size blocks according to a modified winnowing algorithm. The variable-stride pattern segments are used to determine the block-symbol alphabet for a variable-stride discrete finite automaton (VS-DFA) that is used for detecting the patterns in the input streams. Applications include network-intrusion detection and protection systems, genome matching, and forensics. The modification of the winnowing algorithm includes using special hash values to determine the position of delimiters of the patterns and input streams. The delimiters mark the beginnings and ends of the segments. In various embodiments, the patterns are segmented into head, core, and tail blocks. The approach provides for memory, memory-bandwidth, and processor-cycle efficient, deterministic, high-speed, line-rate pattern matching.

加速されたフロー単位トラフィック推定

【課題】処理リソースおよび処理時間が短縮された、サンプル・サイズで、メモリ要件の小さいトラフィック推定方法を提供する。 【解決手段】リンクによって相互接続されたノードのネットワークにおけるフロー単位トラフィックを推定する方法は、ノードへの着信トラフィック・ストリームをハッシュ関数を用いたフロー割当てによって多数の平行なサブストリームに分割する。 着信トラフィック・ストリームのフローの各々はそのサブストリームにおいてトラフィックの大きな断片を構成しているので、２個のランを取得する確率は高くなる。次に、フロー当たりの２個のランの数を用いてフローのトラフィックの推定値が生成される。 【選択図】図３

Apparatus and method for protection in a data center

A manner of providing redundancy protection for a data center network that is both reliable and low-cost, hi a data center network where the data traffic between numerous access nodes and a network core layer via primary aggregation nodes, an optical network device such as and OLT (optical line terminal) is provided as a backup aggregation node for one or more of the primary aggregation nodes. When a communication path through a primary aggregation node fails, traffic is routed through the optical network device. In a preferred embodiment, a communication link is formed from a plurality of access nodes to a single port of the OLT or other optical network device via an optical splitter that combines upstream transmissions and distributes downstream transmissions. The upstream transmissions from the plurality of access nodes may occur according to an allocation schedule generated when the backup aggregation node is needed.

Apparatus and method for protection in a data center

A manner of providing redundancy protection for a data center network that is both reliable and low-cost, hi a data center network where the data traffic between numerous access nodes and a network core layer via primary aggregation nodes, an optical network device such as and OLT (optical line terminal) is provided as a backup aggregation node for one or more of the primary aggregation nodes. When a communication path through a primary aggregation node fails, traffic is routed through the optical network device. In a preferred embodiment, a communication link is formed from a plurality of access nodes to a single port of the OLT or other optical network device via an optical splitter that combines upstream transmissions and distributes downstream transmissions. The upstream transmissions from the plurality of access nodes may occur according to an allocation schedule generated when the backup aggregation node is needed.

System and method for fail-safe operation of a virtual home agent for mobile ip

The present invention provides a method and apparatus for a distributed virtual home agent. One embodiment of the method includes implementing a first primary home agent on a first portion of a plurality of hardware elements that operate according to a mobile Internet Protocol (IP) and a second primary home agent on a second portion of the plurality of hardware elements. A first backup home agent is implemented on the second portion of the plurality of hardware elements and a second backup home agent is implemented on the first portion of the plurality of hardware elements. Packets addressed to the first or second primary home agent can be directed to both the first and second portions of the plurality of hardware elements so that states of the first and second backup home agents mirror states of the first and second primary home agents, respectively. When the primary home agent has failed, users associated with this home agent may then be handed off to the associated backup home agent.

Variable-stride stream segmentation and multi-pattern matching

A variable-stride multi-pattern matching apparatus segments patterns and input streams into variable-size blocks according to a modified winnowing algorithm. The variable-stride pattern segments are used to determine the block-symbol alphabet for a variable-stride discrete finite automaton (VS-DFA) that is used for detecting the patterns in the input streams. Applications include network-intrusion detection and protection systems, genome matching, and forensics. The modification of the winnowing algorithm includes using special hash values to determine the position of delimiters of the patterns and input streams. The delimiters mark the beginnings and ends of the segments. In various embodiments, the patterns are segmented into head, core, and tail blocks. The approach provides for memory, memory-bandwidth, and processor-cycle efficient, deterministic, high-speed, line-rate pattern matching.

Variable-stride stream segmentation and multi-pattern matching

A variable-stride multi-pattern matching apparatus segments patterns and input streams into variable-size blocks according to a modified winnowing algorithm. The variable-stride pattern segments are used to determine the block-symbol alphabet for a variable-stride discrete finite automaton (VS-DFA) that is used for detecting the patterns in the input streams. Applications include network-intrusion detection and protection systems, genome matching, and forensics. The modification of the winnowing algorithm includes using special hash values to determine the position of delimiters of the patterns and input streams. The delimiters mark the beginnings and ends of the segments. In various embodiments, the patterns are segmented into head, core, and tail blocks. The approach provides for memory, memory-bandwidth, and processor-cycle efficient, deterministic, high-speed, line-rate pattern matching.

Method and apparatus for improved routing in connectionless networks

The invention includes a method and apparatus for determining a routing table for use in a network comprising a plurality of type-one nodes and a plurality of type-two nodes where the type-two nodes use respective type- two routing tables having one next-hop node associated with each of a plurality of destination nodes of the network. The method includes obtaining, from the type-one nodes and the type-two nodes, link status information associated with each of a plurality of links of the network, obtaining traffic measurement information from the type-one nodes and the type-two nodes, and determining, using the link status and traffic measurement information, type-one routing tables for the respective type-one nodes. The type-one routing tables are determined as a group in a substantially coordinated manner, and each type one routing table includes a plurality of next-hop nodes associated with each of the destination nodes.

Joint signal-routing and power-control for an optical network

We disclose a signal-routing method directed at improving the throughput of an optical network by taking into account the fiber nonlinearity in the process of solving a joint signal-routing and power-control problem for the optical network. Based on the obtained solution, a network controller may set the signal-routing configurations of the various network nodes and the optical gains of the various optical amplifiers to enable the optical network to carry the traffic in a manner that results in a higher throughput than that achievable with the use of conventional signal-routing and/or power-control methods.

Routing for networks with content filtering

コンテンツ・フィルタリングによるネットワークのルーティング

【課題】リンクによって相互接続されたノードのネットワークは、一定のノードでコンテンツ・フィルタリングを指定しており、ネットワーク内のパケット接続のルーティングは指定されたコンテンツ・フィルタリング・ノードに基いて生成される。 【解決手段】前記ネットワークはコンテンツ・フィルタリング・ノード配置方法とネットワーク機能最大化方法とによって指定され、ネットワークによって搬送されるほぼすべてのトラヒック（パケット・ストリーム）のパケットにコンテンツ・フィルタリングを適用する。 【選択図】図１

ＳｏｆｔＲｏｕｔｅｒフィーチャ・サーバ

【課題】転送要素を含むデータ・プレーンから論理的に隔てられている制御プレーン内にフィーチャ・サーバおよび制御サーバを備えるネットワーク・アーキテクチャを提供すること。 【解決手段】フィーチャ・サーバ５０４を使用すると、従来のルータ・アーキテクチャに比べてスケーラビリティに優れる集中方式でネットワーク・ベースの機能を簡単に追加できる。フィーチャ・サーバは、機能を追加するためのアプリケーション・プログラミング・インターフェイスを備える。フィーチャ・サーバ間の関係は、ピアツーピアまたはマスタ／スレーブとすることができ、フィーチャ・サーバはドメインにまたがって動作可能である。フィーチャ・サーバ５０４を使用することにより、ルータの複雑さが取り除かれ、市販の標準サーバ・プラットフォームにいくつもの機能を実装することができ、付加価値機能を容易に導入することができ、スケーリングも楽に行える。 【選択図】図１