The present disclosure relates to modeling a network application based upon network policy objects and configuring a network control plane through network application model translation.
Hardware and software vendors offer platforms that allow a single physical machine to be partitioned into multiple independent network components (e.g., virtual machines). These platforms have become accepted in the industry market on a small business level and on an enterprise level. Network component connectivity may be defined according to application level networking requirements on a virtual basis and/or a physical basis. In some cases, the interconnection definitions may be complex, such as with a virtualized data center using virtualized networking technologies. Virtualized networking technologies bring about complex requirements related to connectivity policies (e.g., compression, quality of service, security, etc.) and managing and controlling the networks, such as managing a large number of endpoints (e.g., virtual machines) over multiple locations, multi-tenant isolation, and supporting dynamic endpoint movement across different physical hosts.
According to one embodiment of the present disclosure, an approach is provided in which a system creates a network application model that includes network policy objects and connection rules corresponding to sending data between the network policy objects. The system converts the network application model to network configuration information, which links the network policy objects to the connection rules. In turn, a network control plane is configured based upon the network configuration information to map the network application model to a physical infrastructure.
The foregoing is a summary and thus contains, by necessity, simplifications, generalizations, and omissions of detail; consequently, those skilled in the art will appreciate that the summary is illustrative only and is not intended to be in any way limiting. Other aspects, inventive features, and advantages of the present disclosure, as defined solely by the claims, will become apparent in the non-limiting detailed description set forth below.
The present disclosure may be better understood, and its numerous objects, features, and advantages made apparent to those skilled in the art by referencing the accompanying drawings, wherein:
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present disclosure has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the disclosure in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the disclosure. The embodiment was chosen and described in order to best explain the principles of the disclosure and the practical application, and to enable others of ordinary skill in the art to understand the disclosure for various embodiments with various modifications as are suited to the particular use contemplated.
As will be appreciated by one skilled in the art, aspects of the present disclosure may be embodied as a system, method or computer program product. Accordingly, aspects of the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present disclosure may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present disclosure are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The following detailed description will generally follow the summary of the disclosure, as set forth above, further explaining and expanding the definitions of the various aspects and embodiments of the disclosure as necessary.
Network virtualization is described herein as a service provided to communicating computing endpoints, where communication patterns are defined and governed by rules and actions formulated in terms and notions of a logical nature (as opposed to a network defined in terms of cables, ports and network intermediates). As such, a virtual network system may support a large amount of independent isolated tenants and a large amount of network clients in each tenant communicating under tenant specific policies, all the while achieving independence from a physical infrastructure topology implementation.
In one embodiment, a developer uses an object-oriented network modeling language that includes network policy object requirements and primitives. In turn, the developer may create a network application model with network policy objects (based upon the network application requirements) and use the object oriented language primitives to “extend” some of the network policy objects. In this embodiment, the object-oriented network modeling language may include primitives such as “extend,” “append,” and “override”, which an administrator may utilize in order for a network policy object to inherit the peers and add to or override the rules of the inherited network policy object (see
The example shown in
Referring to network policy object B 120, when an assigned endpoint sends data to an endpoint assigned to network policy object A 110, the network control plane provides control instructions that indicate the system should perform an action corresponding to rule W (rule W 160). And, when the assigned endpoint sends data to an endpoint assigned to network policy object C 130, the network control plane provides control instructions that indicate the system should perform an action corresponding to rule X (rule X 170).
Referring to network policy object C 130, when an assigned endpoint sends data to an endpoint assigned to network policy object A 110, the network control plane provides control instructions that indicate the system should perform an action corresponding to rule Y (rule Y 190). And, when the assigned endpoint sends data to an endpoint assigned to network policy object B 120, the network control plane provides control instructions that indicate the system should perform an action corresponding to rule Z (rule Z 180).
In one embodiment, the list of destination network policy objects may include entities that are not disjoint. For example, a policy domain and an endpoint within the policy domain may both appear as entities in the list of peers. In this example, when an entry specific to the endpoint is included in the list of connection rules, the endpoint specific rule overrides the rule of the containing network policy object when sending data to the endpoint. In other words, the most specific entry of a destination endpoint takes precedence over less specific entries (see
In addition, the developer may use primitives such as “override” in the child network policy object definition in order for a rule defined at the child network policy object level to override a rule defined at the parent network policy object level for the same peer (see
Each extended network policy object adds two additional rules (corresponds to an append primitive) to communicate with the other two extended policy objects. For example, network policy object database 250 adds two connection rules of DMZ:deny and Application: compress (e.g., using “append” primitives). In addition, network policy object DMZ 240 adds a rule “Forward” to external 200 that overrides network policy object domain 1 210's rule to network policy object external 210 of “Deny” (from
Network control plane 340 is configured according to configuration information 320 and, in turn, after endpoints are assigned to particular network policy objects and start sending data, the policy requests are initiated. In response to the policy requests, network control plane 340 provides policy resolutions based upon the requesting endpoint's assigned network policy object and the destination endpoint's assigned network policy object (see
Network policy object table 410 includes entries that define network policy objects. Each entry includes a unique network policy object identifier (column 412), a network policy object name (column 414), and member identifiers (e.g., endpoints) that are assigned to each particular network policy object.
In one embodiment, the network policy object identifier and network policy object name may be characterized by network policy objects from which they extend. For example, network policy object table 410 includes table entries corresponding to network policy objects “A,” “E/A,” and “G/E/A,” which have corresponding network policy object identifiers of P87, P873, and P8734. As those skilled in the art can appreciate, network policy object table 410 may have more or less columns than what is shown in
Rules tables 420 include a rules table for each individual network policy object.
Each of rules tables 420 includes the network policy object's unique identifier (column 422) and the identifier of the extended network policy object in case the network policy object is an extension of another network policy object (column 424) (e.g., the base/ancestor network policy object). As can be seen, network policy object E/A's unique identifier is “P873” (from table 410) and is an extension of network policy object A, whose unique identifier is “P87.” A distributed policy service uses the network policy object extension identifiers to search rules tables in an upward hierarchical manner to locate an entry that includes the correct destination network policy object, thus identifying a more recent, overriding rule for the desired destination if available (see
Actions table 430 includes connection rules (column 432) and corresponding actions (column 434). Processing access actions table 430 subsequent to identifying a rule from rules tables 420 in order to provide the action to a requesting entity. The action may include a connectivity service (IDS, compression, etc) and/or a connectivity policy (QoS, SSL, etc.). In one embodiment, actions table 430 may include an ordered set of policy actions, such as {SSL (Secure Socket Layer), QoS 1 ms latency}, or {IDS (intrusion detection system), Compression}.
Processing commences at 500, whereupon a developer defines network application model 300 through network policy objects, primitives, and connection rules according to an object-oriented network modeling language. In one embodiment, the network application model is a modeling/specification of the network policy objects and their corresponding connection rules/actions (step 510).
As such, processing converts network application model 300 to configuration information and stores the configuration information in various tables (pre-defined process block 520, see
During network operation, the network control plane resolves policy requests received on behalf of endpoints, based upon the configuration information included in tables store 330 (pre-defined process block 540, see
A determination is made as to whether to continue at 550 (e.g., whether the network is still valid). If processing should still continue, decision 550 branches to the “Yes” branch, whereupon processing continues to process policy requests and/or manage endpoints. This looping continues until processing should terminate, at which point decision 550 branches to the “No” branch, whereupon processing ends at 560.
In one embodiment, processing may perform other lifecycle events, which may be operational changes such as configuration updates, changes to existing endpoints, migration of endpoints, and/or removing endpoints during operation time.
A determination is made as to the type of the retrieved definition (decision 620). If the definition type is a network policy object definition, decision 620 branches to the “Network Policy Object” branch, whereupon processing creates a network policy object entry in a network policy object table (table 410 shown in
At step 630, processing creates a rules table for the new network policy object. The rules table includes the network policy object's peers (destination network policy objects, virtual machines, subnets, etc. discussed below) and corresponding connection rules that point to actions which to take when an endpoint assigned to the network policy object sends data to a destination endpoint assigned to a particular destination network policy object (e.g., rules table 420 shown in
A determination is made as to whether the network policy object is an extension of another network policy object (decision 635). For example, a developer may add a primitive to “extend” an existing network policy object and override or add rules corresponding to the existing network policy object. If the network policy object is an extension of another network policy object, decision 635 branches to the “Yes” branch, whereupon processing adds an extended network policy object identifier at step 640 (identifies the extended network policy object) to the rules table (e.g. column 424 in rules table 420). On the other hand, if the network policy object is not an extension of another network policy object, decision 635 branches to the “No” branch, bypassing step 640.
Referring back to decision 620, if the definition type is a rule definition corresponding to a network policy object, decision 620 branches to the “Rule” branch, whereupon processing identifies a rules table corresponding to the network policy object at step 650 (e.g., rules table E/A corresponds to network policy object E/A). At step 655, processing creates a rule entry in the identified rules table and includes a destination (e.g., a “destination” network policy object) and the rule, both of which may be provided in the rule definition (e.g., column 426 and 428 in rules table 420). This step may also be performed to override an existing rule.
Referring back to decision 620, if the definition type is a new action definition, decision 620 branches to the “Action” branch, whereupon processing creates an action entry in an actions table at step 660, which includes a connection rule and corresponding action. In one embodiment, the action may correspond to connectivity service actions or connectivity policies (e.g., action table 430 shown in
A determination is made as to whether network application model 300 includes more definitions to convert (decision 670). If so, decision 670 branches to the “Yes” branch, which loops back to retrieve and convert another definition. This looping continues until there are no more definitions to process, at which point decision 670 branches to the “No” branch, whereupon processing returns at 680.
Processing commences at 700, whereupon processing receives a request to assign an endpoint (e.g., virtual machine) to a network policy object (step 710). A determination is made as to whether the endpoint is currently assigned to a network policy object (decision 715). If the endpoint is currently assigned to a network policy object, decision 715 branches to the “Yes” branch, whereupon processing generates an error at step 718.
On the other hand, if the endpoint is not currently assigned to a network policy object, decision 715 branches to the “No” branch, whereupon processing adds the member's unique identifier to the assigned network policy object's table entry in network policy object table 410 at step 720 (see
At step 730, processing creates an endpoint entry in endpoint table 740 at step 720. The endpoint entry includes the endpoint's virtual address, physical address, assigned network policy object identifier, and a unique member identifier (see
A determination is made as to whether an administrator wishes to assign more endpoints to network policy objects (decision 750). If so, decision 750 branches to the “Yes” branch, which loops back to receive and process another endpoint assignment request. This looping continues until there are no more endpoint assignment requests to process, at which point decision 750 branches to the “No” branch, whereupon processing returns at 760.
Endpoint table 740 includes a list of endpoints (e.g., virtual machines) and their assigned network policy object. Endpoints may be referred to as “members” and have a unique member identifier (column 810) similar to that shown in column 416 of network policy object table 410. Each entry includes the endpoint's virtual IP address (column 820) and physical address (column 830). Column 840 shows the network policy object assigned to each particular endpoint. As such, when receiving a policy request, a policy service/controller accesses endpoint table 440 to match a destination endpoint (via virtual IP address in column 820) to their corresponding assigned network policy object in column 840 (see
Network control plane 850 utilizes configuration information stored in tables store 330 to provide resolution responses to endpoints 932-946 (or a corresponding virtual switch), which allow the endpoints to send data between each other over physical infrastructure 950. As can be seen, physical infrastructure 950 may include multiple servers (970, 976, 978, 982, and 986), multiple switches (974, 980), and multiple routers (972, 984) that create multiple subnets.
In one embodiment, virtual network abstractions support address independence between different virtual networks. For example, two different endpoints operating in two different virtual networks may have the same IP address. As another example, the virtual network abstractions support deploying endpoints, which belong to the same virtual networks, onto different hosts that are located in different physical subnets (includes switches and/or routers between the physical entities). In another embodiment, endpoints belonging to different virtual networks may be hosted on the same physical host. In yet another embodiment, the virtual network abstractions support endpoint migration anywhere in a data center without changing the endpoint's network address and losing its network connection.
Upon receipt of a resolution request initiated on behalf of the source endpoint 1010 (e.g., a virtual switch), policy service 1000 uses endpoint table 740 to identify destination endpoint 1060's assigned network policy object. Then, using the source network policy object identifier (most specific) extracted from the policy resolution request 1020, policy service 1000 accesses the source network policy object's rules table looks for an entry that includes the destination network policy object identifier. If this entry is not found, policy service 1000 selects a table corresponding to the next higher extension path (e.g., in the case of rules table of Web Service/DMZ/Domain1, the next rules table to search is DMZ/Domain1). As such, the rules table entry at the most specific level is located first (e.g., a rule that overrides a higher level extension).
In turn, policy service 1000 accesses actions table 430 to retrieve an action corresponding to the rule, and includes the action (configuration instruction) in policy resolution response 1030. Policy service 1000 sends policy resolution response 1030 to source endpoint 1010, which follows the action (e.g., SSL, compression, etc.) to send message 1040 over computer network 1050 to destination endpoint 1060.
Field 1110 includes a source virtual address that corresponds to the source endpoint, and field 1120 includes a source virtual network corresponding to the source endpoint. Field 1130 includes a network policy object identifier to which the source endpoint is assigned. The policy service uses this information to identify the source network policy object's rules table (see
Policy resolution response 1030 includes fields 1150-1170. As those skilled in the art can appreciate, a policy resolution response may include more or less fields than what is shown in
Field 1160 includes a destination physical address of the destination endpoint (identified by the policy service based upon the destination virtual address discussed above). Field 1170 includes an action (configuration instruction) that the source endpoint should invoke to send data to the destination endpoint, such as a connectivity service action and/or a policy associated with the connection).
At step 1220, processing accesses endpoint table 740 and locates an endpoint entry that includes the destination virtual address included in the policy resolution request. Processing extracts a destination physical address and a destination network policy object from the located endpoint entry, which identifies the destination endpoint's assigned network policy object.
Processing selects a rules table corresponding to the source network policy object at step 1230. In one embodiment, the selected rules table is a rules table specific to the source network policy object. For example, if the source network policy object is D/C/B, then processing first selects the “Rules Table D/C/B.” At step 1235, processing searches the selected rules table (included in rules tables 420) for a table entry that matches the destination network policy object. Using the example above and assuming the destination network policy object is Z/Y, processing searches for a Z/Y destination network policy object identifier in the network policy object D/C/B rules table (see
A determination is made as to whether a match is found in the selected rules table (decision 1240). If a match is not found, decision 1240 branches to the “No” branch, whereupon a determination is made as to whether the selected rules table is an extension of a higher level rules table (decision 1245). In one embodiment, processing access the selected rules table network policy object extension identifier field (column 424 in
If the selected table is not an extension, decision 1245 branches to the “Yes” branch, whereupon processing selects a rules table corresponding to the next higher source path extension, which is “Rules Table C/B” from the example above. This looping continues until processing has searched the highest level rules table and does not find a match, at which point decision 1245 branches to the “No” branch, whereupon processing denies the policy resolution request at step 1255 and processing returns at 1260.
However, when processing identifies a match in one of the selected rules tables, decision 1240 branches to the “Yes” branch, whereupon processing extracts the rule (or rule identifier) from the matched rules table entry (step 1270), and accesses actions table 430 to identify an action that corresponds to the extracted rule (step 1275). The action may be, for example, a specific policy associated with the connectivity (e.g. Quality of service policy). In turn, processing includes the action in a policy resolution response (e.g., policy resolution response 930 shown in
Northbridge 1315 and Southbridge 1335 connect to each other using bus 1319. In one embodiment, the bus is a Direct Media Interface (DMI) bus that transfers data at high speeds in each direction between Northbridge 1315 and Southbridge 1335. In another embodiment, a Peripheral Component Interconnect (PCI) bus connects the Northbridge and the Southbridge. Southbridge 1335, also known as the I/O Controller Hub (ICH) is a chip that generally implements capabilities that operate at slower speeds than the capabilities provided by the Northbridge. Southbridge 1335 typically provides various busses used to connect various components. These busses include, for example, PCI and PCI Express busses, an ISA bus, a System Management Bus (SMBus or SMB), and/or a Low Pin Count (LPC) bus. The LPC bus often connects low-bandwidth devices, such as boot ROM 1396 and “legacy” I/O devices (using a “super I/O” chip). The “legacy” I/O devices (1398) can include, for example, serial and parallel ports, keyboard, mouse, and/or a floppy disk controller. The LPC bus also connects Southbridge 1335 to Trusted Platform Module (TPM) 1395. Other components often included in Southbridge 1335 include a Direct Memory Access (DMA) controller, a Programmable Interrupt Controller (PIC), and a storage device controller, which connects Southbridge 1335 to nonvolatile storage device 1385, such as a hard disk drive, using bus 1384.
ExpressCard 1355 is a slot that connects hot-pluggable devices to the information handling system. ExpressCard 1355 supports both PCI Express and USB connectivity as it connects to Southbridge 1335 using both the Universal Serial Bus (USB) the PCI Express bus. Southbridge 1335 includes USB Controller 1340 that provides USB connectivity to devices that connect to the USB. These devices include webcam (camera) 1350, infrared (IR) receiver 1348, keyboard and trackpad 1344, and Bluetooth device 1346, which provides for wireless personal area networks (PANs). USB Controller 1340 also provides USB connectivity to other miscellaneous USB connected devices 1342, such as a mouse, removable nonvolatile storage device 1345, modems, network cards, ISDN connectors, fax, printers, USB hubs, and many other types of USB connected devices. While removable nonvolatile storage device 1345 is shown as a USB-connected device, removable nonvolatile storage device 1345 could be connected using a different interface, such as a Firewire interface, etcetera.
Wireless Local Area Network (LAN) device 1375 connects to Southbridge 1335 via the PCI or PCI Express bus 1372. LAN device 1375 typically implements one of the IEEE 802.11 standards of over-the-air modulation techniques that all use the same protocol to wireless communicate between information handling system 1300 and another computer system or device. Optical storage device 1390 connects to Southbridge 1335 using Serial ATA (SATA) bus 1388. Serial ATA adapters and devices communicate over a high-speed serial link. The Serial ATA bus also connects Southbridge 1335 to other forms of storage devices, such as hard disk drives. Audio circuitry 1360, such as a sound card, connects to Southbridge 1335 via bus 1358. Audio circuitry 1360 also provides functionality such as audio line-in and optical digital audio in port 1362, optical digital output and headphone jack 1364, internal speakers 1366, and internal microphone 1368. Ethernet controller 1370 connects to Southbridge 1335 using a bus, such as the PCI or PCI Express bus. Ethernet controller 1370 connects information handling system 1300 to a computer network, such as a Local Area Network (LAN), the Internet, and other public and private computer networks.
While
The Trusted Platform Module (TPM 1395) shown in
While particular embodiments of the present disclosure have been shown and described, it will be obvious to those skilled in the art that, based upon the teachings herein, that changes and modifications may be made without departing from this disclosure and its broader aspects. Therefore, the appended claims are to encompass within their scope all such changes and modifications as are within the true spirit and scope of this disclosure. Furthermore, it is to be understood that the disclosure is solely defined by the appended claims. It will be understood by those with skill in the art that if a specific number of an introduced claim element is intended, such intent will be explicitly recited in the claim, and in the absence of such recitation no such limitation is present. For non-limiting example, as an aid to understanding, the following appended claims contain usage of the introductory phrases “at least one” and “one or more” to introduce claim elements. However, the use of such phrases should not be construed to imply that the introduction of a claim element by the indefinite articles “a” or “an” limits any particular claim containing such introduced claim element to disclosures containing only one such element, even when the same claim includes the introductory phrases “one or more” or “at least one” and indefinite articles such as “a” or “an”; the same holds true for the use in the claims of definite articles.
Number | Name | Date | Kind |
---|---|---|---|
8213336 | Smith et al. | Jul 2012 | B2 |
8225313 | Esfahany et al. | Jul 2012 | B2 |
20110035494 | Pandey et al. | Feb 2011 | A1 |
20110103259 | Aybay et al. | May 2011 | A1 |
20110110268 | Panasyuk et al. | May 2011 | A1 |
20110110377 | Alkhatib et al. | May 2011 | A1 |
20120089707 | Baba et al. | Apr 2012 | A1 |
20120290695 | Barabash et al. | Nov 2012 | A1 |
20120290703 | Barabash et al. | Nov 2012 | A1 |
20120291024 | Barabash et al. | Nov 2012 | A1 |
20120297384 | Barabash et al. | Nov 2012 | A1 |
20130091261 | Barabash | Apr 2013 | A1 |
Entry |
---|
Peng Wang et al., “Control information description model and processing mechanism in the trustworthy and controllable network,” IFIP/IEEE International Symposium on Integrated Network Management, Jun. 2009, New York, NY, pp. 398-405. |
Yang Jian-ren et al., “A service-oriented framework of distributed QOS measurement based on multi-agent for overlay network,” International Conference on Communication Software and Networks, Feb. 2009, Chengdu, Sichuan, China, pp. 158-162. |
McKeown et al., “OpenFlow: Enabling Innovation in Campus Networks,” ACM SIGCOMM Computer Communication Review, vol. 38, No. 2, Apr. 2008, pp. 69-74. |
Foster et al., “Frenetic: A Network Programming Language,” ICFP '11, The 16th ACM SIGPLAN International Conference on Functional Programming, Sep. 2011, Tokyo, Japan, pp. 279-291. |
U.S. Appl. No. 13/253,338, filed Oct. 2011, Barabash et al. |
Number | Date | Country | |
---|---|---|---|
20140156811 A1 | Jun 2014 | US |