Blog

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
In some embodiments, a hypervisor executes on a server executing an operating system. In some embodiments, a client may communicate to a server via one or more of the first appliances and one or more second appliances
 
 

AWS Lambda | AWS Compute Blog

 
Migrate VMware workloads to the IBM Cloud while using existing tools, technologies and skills from your on-premises environment. The integration and automation. Resource policies. AWS Lambda now allows you grant cross-account access and to specify access to a Lambda function based on resources, such as.

 

[Windows 10 pro download free softlayer serverless

 

We’ve updated our privacy policy. Click here to review the details. Tap here to review the details. Activate your 30 day free trial to unlock unlimited reading.

The SlideShare family just got bigger. Enjoy access to millions of ebooks, audiobooks, magazines, and more from Scribd. You also get free access to Scribd! Instant access to millions of ebooks, audiobooks, magazines, podcasts and more. It windows 10 pro download free softlayer serverless that you have an ad-blocker running. By sofltayer SlideShare on your ad-blocker, you are supporting our community of content creators.

Successfully reported this slideshow. Your SlideShare is downloading. Going Serverless with OpenWhisk. Alex Glikson. Next SlideShares. You are reading a preview. Activate your 30 day free trial to continue reading. Continue for Free. Upcoming SlideShare.

Http://replace.me/16176.txt in production O’Reilly Software Architecture. Embed Size px. Start on. Show related SlideShares at end. WordPress Shortcode.

Share Email. Top clipped slide. Going Serverless with OpenWhisk Feb. Download Now Download Download to read offline.

Alex Glikson Follow. OpenWhisk Deep Dive: the action container model. OpenWhisk – A platform for cloud native, serverless, event driven apps. More Related Content Slideshows for you Wjndows a cloud native app dowjload OpenWhisk. Serverless architectures built on an open source softlayef. Building serverless applications with Apache OpenWhisk.

Containers vs sofglayer – Navigating application deployment options. Viewers also liked Service rfee like a pro presented at reversimX. Similar to Going Serverless with OpenWhisk Apache OpenWhisk Serverless Computing. Open stack ocata summit enabling aws lambda-like functionality with openstac Microservices and Serverless Computing – OpenWhisk. Red Hat and kubernetes: awesome stuff coming your way. Oscon Build your own container-based system with the Windows 10 pro download free softlayer serverless prp.

New and smart windows 10 pro download free softlayer serverless to develop microservice for istio with micro profile. More from Alex Glikson 7. Serverless Compute Platforms on Kubernetes. Cloud-Native Application and Kubernetes. Mixing bare-metal and virtualized workloads on OpenStack – Container-Based Platforms and Kubernetes.

Recently uploaded Softlaer Data Pump Enhancements in Oracle 21c. Going Serverless with OpenWhisk 1. Outline 1. Overview of Serverless 2. Challenges of Serverless 1 3. Serverless: Why Now? Watch for new comments in a given github. Save github. What is serverless good for? OpenWhisk CLI: Create and test action Create the Action that analyzes IoT readings, then stores in the database wsk action create analyze-service-event analyze-service-event.

You just clipped your first slide! Clipping is a handy way to collect important slides you want to go wlndows to later. Now customize the name of a clipboard to store your clips. Visibility Others can see my Clipboard. Serverleess Save. Get SlideShare without ads Enjoy access перейти millions of presentations, documents, ebooks, audiobooks, magazines, and more download activator office bagas. Read free for 60 days.

Zvi Avraham Feb. Windows 10 pro download free softlayer serverless views. Unlimited Reading Learn faster and smarter from top experts. Unlimited Downloading Download to take your learnings offline and on the go. Read and listen offline with any device.

Free access http://replace.me/1911.txt premium services like Tuneln, Mubi and more. Help us keep SlideShare free It appears that you have an ad-blocker running. Whitelist SlideShare Continue without Whitelisting.

Hate ads? Get Sogtlayer without ads. You can read the details below. By accepting, you agree to the updated privacy policy. Thank you! Accept and continue View updated privacy policy.

 
 

[Windows 10 pro download free softlayer serverless

 
 

Going Serverless with OpenWhisk. Alex Glikson. Next SlideShares. You are reading a preview. Activate your 30 day free trial to continue reading. Continue for Free. Upcoming SlideShare. Serverless in production O’Reilly Software Architecture. Embed Size px. Start on. Show related SlideShares at end.

WordPress Shortcode. Share Email. Top clipped slide. Going Serverless with OpenWhisk Feb. Download Now Download Download to read offline. Alex Glikson Follow. OpenWhisk Deep Dive: the action container model. OpenWhisk – A platform for cloud native, serverless, event driven apps. More Related Content Slideshows for you Build a cloud native app with OpenWhisk.

Serverless architectures built on an open source platform. Building serverless applications with Apache OpenWhisk. Containers vs serverless – Navigating application deployment options.

Viewers also liked Service discovery like a pro presented at reversimX. Similar to Going Serverless with OpenWhisk The one thing I have to do up front was write this massive big cheque to this big database company and the moment they had taken this cheque they would walk away. Amazon went on to reference a stream of enterprise customers using its software, after UK MD, Gavin Jackson, recognised that many in the audience were not serious AWS users, but people interested in hearing more of what the company has to offer their businesses.

While AWS claims to have more than one million customers worldwide, and the largest number of start-ups including behemoths like Spotify and Netflix on its books, it wants more enterprise customers to start using its platform. Almost all media companies make use of cloud. AWS has made moves to open up its offering to hybrid cloud users — introducing Snowball, a piece of hardware that can transfer data in and out of the cloud, for instance.

It also introduced hybrid and cross-cloud management for its EC2 cloud less than a fortnight ago , making its Run Command tool work for on-premise server workloads as well as for EC2 instances.

In order to address this very common use case, we are now opening up Run Command to servers running outside of EC2. Can’t choose between public and private cloud? You don’t have to with IaaS. In one embodiment, the network stack s has one or more buffers for queuing one or more network packets for transmission by the appliance The network stack includes any type and form of software, or hardware, or any combinations thereof, for providing connectivity to and communications with a network.

In one embodiment, the network stack includes a software implementation for a network protocol suite. The network stack may have one or more network layers, such as any networks layers of the Open Systems Interconnection OSI communications model as those skilled in the art recognize and appreciate.

As such, the network stack may have any type and form of protocols for any of the following layers of the OSI model: 1 physical link layer, 2 data link layer, 3 network layer, 4 transport layer, 5 session layer, 6 presentation layer, and 7 application layer. In some embodiments, the network stack has any type and form of a wireless protocol, such as IEEE In other embodiments, any type and form of user datagram protocol UDP , such as UDP over IP, may be used by the network stack , such as for voice communications or real-time data communications.

Furthermore, the network stack may include one or more network drivers supporting the one or more layers, such as a TCP driver or a network layer driver. The network drivers may be included as part of the operating system of the computing device or as part of any network interface cards or other network access components of the computing device In some embodiments, any of the network drivers of the network stack may be customized, modified or adapted to provide a custom or modified portion of the network stack in support of any of the techniques described herein.

In one embodiment, the appliance provides for or maintains a transport layer connection between a client and server using a single network stack In some embodiments, the appliance effectively terminates the transport layer connection by changing, managing or controlling the behavior of the transport control protocol connection between the client and the server. In these embodiments, the appliance may use a single network stack In other embodiments, the appliance terminates a first transport layer connection, such as a TCP connection of a client , and establishes a second transport layer connection to a server for use by or on behalf of the client , e.

The first and second transport layer connections may be established via a single network stack In other embodiments, the appliance may use multiple network stacks, for example A and N. In these embodiments, the first transport layer connection may be established or terminated at one network stack A, and the second transport layer connection may be established or terminated on the second network stack N.

For example, one network stack may be for receiving and transmitting network packets on a first network, and another network stack for receiving and transmitting network packets on a second network.

The network optimization engine , or any portion thereof, may include software, hardware or any combination of software and hardware. Furthermore, any software of, provisioned for or used by the network optimization engine may run in either kernel space or user space. For example, in one embodiment, the network optimization engine may run in kernel space.

In another embodiment, the network optimization engine may run in user space. In yet another embodiment, a first portion of the network optimization engine runs in kernel space while a second portion of the network optimization engine runs in user space.

The network packet engine , also generally referred to as a packet processing engine or packet engine, is responsible for controlling and managing the processing of packets received and transmitted by appliance via network ports and network stack s The network packet engine may operate at any layer of the network stack In one embodiment, the network packet engine operates at layer 2 or layer 3 of the network stack In another embodiment, the packet engine operates at layer 4 of the network stack In other embodiments, the packet engine operates at any session or application layer above layer 4.

For example, in one embodiment, the packet engine intercepts or otherwise receives network packets above the transport layer protocol layer, such as the payload of a TCP packet in a TCP embodiment. The packet engine may include a buffer for queuing one or more network packets during processing, such as for receipt of a network packet or transmission of a network packet.

Additionally, the packet engine is in communication with one or more network stacks to send and receive network packets via network ports The packet engine may include a packet processing timer.

In one embodiment, the packet processing timer provides one or more time intervals to trigger the processing of incoming, i. In some embodiments, the packet engine processes network packets responsive to the timer. The packet processing timer provides any type and form of signal to the packet engine to notify, trigger, or communicate a time related event, interval or occurrence.

In many embodiments, the packet processing timer operates in the order of milliseconds, such as for example ms, 50ms, 25ms, 10ms, 5ms or lms. In some embodiments, any of the logic, functions, or operations of the encryption engine , cache manager , policy engine and multi-protocol compression logic may be performed at the granularity of time intervals provided via the packet processing timer, for example, at a time interval of less than or equal to 10ms.

In another embodiment, the expiry or invalidation time of a cached object can be set to the same order of granularity as the time interval of the packet processing timer, such as at every 10 ms. The cache manager may include software, hardware or any combination of software and hardware to store data, information and objects to a cache in memory or storage, provide cache access, and control and manage the cache.

The data, objects or content processed and stored by the cache manager may include data in any format, such as a markup language, or any type of data communicated via any protocol.

In some embodiments, the cache manager duplicates original data stored elsewhere or data previously computed, generated or transmitted, in which the original data may require longer access time to fetch, compute or otherwise obtain relative to reading a cache memory or storage element. Once the data is stored in the cache, future use can be made by accessing the cached copy rather than refetching or recomputing the original data, thereby reducing the access time. In some embodiments, the cache may comprise a data object in memory of the appliance In another embodiment, the cache may comprise any type and form of storage element of the appliance , such as a portion of a hard disk.

In some embodiments, the processing unit of the device may provide cache memory for use by the cache manager In yet further embodiments, the cache manager may use any portion and combination of memory, storage, or the processing unit for caching data, objects, and other content.

Furthermore, the cache manager includes any logic, functions, rules, or operations to perform any caching techniques of the appliance In some embodiments, the cache manager may operate as an application, library, program, service, process, thread or task. The policy engine ‘ includes any logic, function or operations for providing and applying one or more policies or rules to the function, operation or configuration of any portion of the appliance The policy engine ‘ may include, for example, an intelligent statistical engine or other programmable application s.

In one embodiment, the policy engine provides a configuration mechanism to allow a user to identify, specify, define or configure a policy for the network optimization engine , or any portion thereof. For example, the policy engine may provide policies for what data to cache, when to cache the data, for whom to cache the data, when to expire an object in cache or refresh the cache. In other embodiments, the policy engine may include any logic, rules, functions or operations to determine and provide access, control and management of objects, data or content being cached by the appliance in addition to access, control and management of security, network traffic, network access, compression or any other function or operation performed by the appliance In some embodiments, the policy engine ‘ provides and applies one or more policies based on any one or more of the following: a user, identification of the client, identification of the server, the type of connection, the time of the connection, the type of network, or the contents of the network traffic.

In one embodiment, the policy engine ‘ provides and applies a policy based on any field or header at any protocol layer of a network packet. In another embodiment, the policy engine ‘ provides and applies a policy based on any payload of a network packet. For example, in one embodiment, the policy engine. In another example, the policy engine ‘ applies a policy based on any information identified by a client, server or user certificate. In yet another embodiment, the policy engine ‘ applies a policy based on any attributes or characteristics obtained about a client , such as via any type and form of endpoint detection see for example the collection agent of the client agent discussed below.

In one embodiment, the policy engine ‘ works in conjunction or cooperation with the policy engine of the application delivery system In some embodiments, the policy engine ‘ is a distributed portion of the policy engine of the application delivery system In another embodiment, the policy engine of the application delivery system is deployed on or executed on the appliance In some embodiments, the policy engines , ‘ both operate on the appliance In yet another embodiment, the policy engine ‘, or a portion thereof, of the appliance operates on a server The compression engine includes any logic, business rules, function or operations for compressing one or more protocols of a network packet, such as any of the protocols used by the network stack of the appliance The compression engine may also be referred to as a multi-protocol compression engine in that it may be designed, constructed or capable of compressing a plurality of protocols.

In one embodiment, the compression engine applies context insensitive compression, which is compression applied to data without knowledge of the type of data. In another embodiment, the compression engine applies context-sensitive compression.

In this embodiment, the compression engine utilizes knowledge of the data type to select a specific compression algorithm from a suite of suitable algorithms. In some embodiments, knowledge of the specific protocol is used to perform context-sensitive compression. In one embodiment, the appliance or compression engine can use port numbers e.

Some protocols use only a single type of data, requiring only a single compression algorithm that can be selected when the connection is established.

Other protocols contain different types of data at different times. In one embodiment, the compression engine uses a delta-type compression algorithm. In another embodiment, the compression engine uses first site compression as well as searching for repeated patterns among data stored in cache, memory or disk.

In some embodiments, the compression engine uses a lossless compression algorithm. In other embodiments, the compression engine uses a lossy compression algorithm.

In some cases, knowledge of the data type and, sometimes, permission from the user are required to use a lossy compression algorithm. Compression is not limited to the protocol payload. The control fields of the protocol itself may be compressed. In some embodiments, the compression engine uses a different algorithm than that used for the payload.

In some embodiments, the compression engine compresses at one or more layers of the network stack In one embodiment, the compression engine compresses at a transport layer protocol. In another embodiment, the compression engine compresses at an application layer protocol. In some embodiments, the compression engine compresses at a layer protocol. In other embodiments, the compression engine compresses at a layer protocol. In yet another embodiment, the compression engine compresses a transport layer protocol and an application layer protocol.

In some embodiments, the compression engine compresses a layer protocol and a layer protocol. In some embodiments, the compression engine uses memory-based compression, cache-based compression or disk-based compression or any combination thereof. As such, the compression engine may be referred to as a multi-layer compression engine. In one embodiment, the compression engine uses a history of data stored in memory, such as RAM. In another embodiment, the compression engine uses a history of data stored in a cache, such as L2 cache of the processor.

In other embodiments, the compression engine uses a history of data stored to a disk or storage location. In some embodiments, the compression engine uses a hierarchy of cache-based, memory-based and disk-based data history. The compression engine may first use the cache-based data to determine one or more data matches for compression, and then may check the memory-based data to determine one or more data matches for compression.

In one embodiment, the multi-protocol compression engine provides compression of any high-performance protocol, such as any protocol designed for appliance to appliance communications. As such, the multi-protocol compression engine accelerates performance for users accessing applications via desktop clients, e. In some embodiments, the multi-protocol compression engine by integrating with packet processing engine accessing the network stack is able to compress any of the protocols carried by a transport layer protocol, such as any application layer protocol.

The synchronization packet identifies a type or speed of the network traffic. The appliance then configures itself to operate the identified port on which the tagged synchronization packet arrived so that the speed on that port is set to be the speed associated with the network connected to that port.

The other port is then set to the speed associated with the network connected to that port. For ease of discussion herein, reference to “fast” side will be made with respect to connection with a wide area network WAN , e. Likewise, reference to “slow” side will be made with respect to connection with a local area network LAN and operating at a network speed the LAN. However, it is noted that “fast” and “slow” sides in a network can change on a per-connection basis and are relative terms to the speed of the network connections or to the type of network topology.

Such configurations are useful in complex network topologies, where a network is “fast” or “slow” only when compared to adjacent networks and not in any absolute sense.

For example, an auto-discovery mechanism in operation in accordance with FIG. IA functions as follows: appliance and ‘ are placed in line with the connection linking client and server The appliances and ‘ are at the ends of a low-speed link, e.

In one example embodiment, appliances and ‘ each include two ports—one to connect with the “lower” speed link and the other to connect with a “higher” speed link, e. Any packet arriving at one port is copied to the other port. Thus, appliance and ‘ are each configured to function as a bridge between the two networks When an end node, such as the client , opens a new TCP connection with another end node, such as the server , the client sends a TCP packet with a synchronization SYN header bit set, or a SYN packet, to the server In the present example, client opens a transport layer connection to server When the SYN packet passes through appliance , the appliance inserts, attaches or otherwise provides a characteristic TCP header option to the packet, which announces its presence.

If the packet passes through a second appliance, in this example appliance ‘ the second appliance notes the header option on the SYN packet. When appliance receives this packet, both appliances , ‘ are now aware of each other and the connection can be appropriately accelerated. In one embodiment, the appliance optionally removes the ACK tag from the packet before copying the packet to the other port. If the SYN packet was not tagged, the appliance copied the packet to the other port.

The appliance , ‘ may add, insert, modify, attach or otherwise provide any information or data in the TCP option header to provide any information, data or characteristics about the network connection, network traffic flow, or the configuration or operation of the appliance In this manner, not only does an appliance announce its presence to another appliance ‘ or tag a higher or lower speed connection, the appliance provides additional information and data via the TCP option headers about the appliance or the connection.

The TCP option header information may be useful to or used by an appliance in controlling, managing, optimizing, acceleration or improving the network traffic flow traversing the appliance , or to otherwise configure itself or operation of a network port. The flow controller includes any logic, business rules, function or operations for optimizing, accelerating or otherwise improving the performance, operation or quality of service of transport layer communications of network packets or the delivery of packets at the transport layer.

A flow controller, also sometimes referred to as a flow control module, regulates, manages and controls data transfer rates. In some embodiments, the flow controller is deployed at or connected at a bandwidth bottleneck in the network In one embodiment, the flow controller effectively regulates, manages and controls bandwidth usage or utilization. In other embodiments, the flow control modules may also be deployed at points on the network of latency transitions low latency to high latency and on links with media losses such as wireless or satellite links.

In some embodiments, a flow controller may include a receiver-side flow control module for controlling the rate of receipt of network transmissions and a sender-side flow control module for the controlling the rate of transmissions of network packets.

In other embodiments, a first flow controller includes a receiver-side flow control module and a second flow controller ‘ includes a sender- side flow control module. In some embodiments, a first flow controller is deployed on a first appliance and a second flow controller ‘ is deployed on a second appliance ‘. As such, in some embodiments, a first appliance controls the flow of data on the receiver side and a second appliance ‘ controls the data flow from the sender side.

In yet another embodiment, a single appliance includes flow control for both the receiver- side and sender- side of network communications traversing the appliance In one embodiment, a flow control module is configured to allow bandwidth at the bottleneck to be more fully utilized, and in some embodiments, not overutilized.

In some embodiments, the flow control module transparently buffers or rebuffers data already buffered by, for example, the sender network sessions that pass between nodes having associated flow control modules When a session passes through two or more flow control modules , one or more of the flow control modules controls a rate of the session s.

In one embodiment, the flow control module is configured with predetermined data relating to bottleneck bandwidth. In another embodiment, the flow control module may be configured to detect the bottleneck bandwidth or data associated therewith. Unlike conventional network protocols such as TCP, a receiver-side flow control module controls the data transmission rate. The receiver-side flow control module controls the sender-side flow control module, e.

In one embodiment, the receiver-side flow control module piggybacks these transmission rate limits on acknowledgement ACK packets or signals sent to the sender, e. The receiver-side flow control module does this in response to rate control requests that are sent by the sender side flow control module ‘. The requests from the sender-side flow control module ‘ may be “piggybacked” on data packets sent by the sender The flow controller may implement a plurality of data flow control techniques at the transport layer, including but not limited to 1 pre-acknowledgements, 2 window virtualization, 3 recongestion techniques, 3 local retransmission techniques, 4 wavefront detection and disambiguation, 5 transport control protocol selective acknowledgements, 6 transaction boundary detection techniques and 7 repacketization.

Although a sender may be generally described herein as a client and a receiver as a server , a sender may be any end point such as a server or any computing device on the network Likewise, a receiver may be a client or any other computing device on the network In brief overview of a pre-acknowledgement flow control technique, the flow controller , in some embodiments, handles the acknowledgements and retransmits for a sender, effectively terminating the sender’s connection with the downstream portion of a network connection.

In reference to FIG. IB, one possible deployment of an appliance into a network architecture to implement this feature is depicted. In this example environment, a sending computer or client transmits data on network , for example, via a switch, which determines that the data is destined for VPN appliance Because of the chosen network topology, all data destined for VPN appliance traverses appliance , so the appliance can apply any necessary algorithms to this data.

Continuing further with the example, the client transmits a packet, which is received by the appliance When the appliance receives the packet, which is transmitted from the client to a recipient via the VPN appliance the appliance retains a copy of the packet and forwards the packet downstream to the VPN appliance The appliance then generates an acknowledgement packet ACK and sends the ACK packet back to the client or sending endpoint.

This ACK, a pre-acknowledgment, causes the sender to believe that the packet has been delivered successfully, freeing the sender’s resources for subsequent processing. The appliance retains the copy of the packet data in the event that a retransmission of the packet is required, so that the sender does not have to handle retransmissions of the data.

This early generation of acknowledgements may be called “preacking. If a retransmission of the packet is required, the appliance retransmits the packet to the sender. The appliance may determine whether retransmission is required as a sender would in a traditional system, for example, determining that a packet is lost if an acknowledgement has not been received for the packet after a predetermined amount of time. To this end, the appliance monitors acknowledgements generated by the receiving endpoint, e.

If the appliance determines that the packet has been successfully delivered, the appliance is free to discard the saved packet data. The appliance may also inhibit forwarding acknowledgements for packets that have already been received by the sending endpoint.

In the embodiment described above, the appliance via the flow controller controls the sender through the delivery of pre-acknowledgements, also referred to as “preacks”, as though the appliance was a receiving endpoint itself. Since the appliance is not an endpoint and does not actually consume the data, the appliance includes a mechanism for providing overflow control to the sending endpoint. Without overflow control, the appliance could run out of memory because the appliance stores packets that have been preacked to the sending endpoint but not yet acknowledged as received by the receiving endpoint.

Therefore, in a situation in which the sender transmits packets to the appliance faster than the appliance can forward the packets downstream, the memory available in the appliance to store unacknowledged packet data can quickly fill.

A mechanism for overflow control allows the appliance to control transmission of the packets from the sender to avoid this problem. In one embodiment, the appliance or flow controller includes an inherent “self-clocking” overflow control mechanism. This self-clocking is due to the order in which the appliance may be designed to transmit packets downstream and send ACKs to the sender or In some embodiments, the appliance does not preack the packet until after it transmits the packet downstream.

In this way, the sender will receive the ACKs at the rate at which the appliance is able to transmit packets rather than the rate at which the appliance receives packets from the sender This helps to regulate the transmission of packets from a sender Another overflow control mechanism that the appliance may implement is to use the TCP window size parameter, which tells a sender how much buffer the receiver is permitting the sender to fill up. A nonzero window size e. Accordingly, the appliance may regulate the flow of packets from the sender, for example when the appliance’s buffer is becoming full, by appropriately setting the TCP window size in each preack.

Another technique to reduce this additional overhead is to apply hysteresis. When the appliance delivers data to the slower side, the overflow control mechanism in the appliance can require that a minimum amount of space be available before sending a nonzero window advertisement to the sender. In one embodiment, the appliance waits until there is a minimum of a predetermined number of packets, such as four packets, of space available before sending a nonzero window packet, such as a window size of four packets.

This reduces the overhead by approximately a factor four, since only two ACK packets are sent for each group of four data packets, instead of eight ACK packets for four data packets. This mechanism alone can result in cutting the overhead in half; moreover, by increasing the numbers of packets above two, additional overhead reduction is realized. But merely delaying the ACK itself may be insufficient to control overflow, and the appliance may also use the advertised window mechanism on the ACKs to control the sender.

When doing this, the appliance in one embodiment avoids triggering the timeout mechanism of the sender by delaying the ACK too long. In one embodiment, the flow controller does not preack the last packet of a group of packets. By not preacking the last packet, or at least one of the packets in the group, the appliance avoids a false acknowledgement for a group of packets.

For example, if the appliance were to send a preack for a last packet and the packet were subsequently lost, the sender would have been tricked into thinking that the packet is delivered when it was not. Thinking that the packet had been delivered, the sender could discard that data. If the appliance also lost the packet, there would be no way to retransmit the packet to the recipient.

By not preacking the last packet of a group of packets, the sender will not discard the packet until it has been delivered. In another embodiment, the flow controller may use a window virtualization technique to control the rate of flow or bandwidth utilization of a network connection.

Though it may not immediately be apparent from examining conventional literature such as RFC , there is effectively a send window for transport layer protocols such as TCP. The send window is similar to the receive window, in that it consumes buffer space though on the sender. The sender’s send window consists of all data sent by the application that has not been acknowledged by the receiver.

This data must be retained in memory in case retransmission is required. Since memory is a shared resource, some TCP stack implementations limit the size of this data. When the send window is full, an attempt by an application program to send more data results in blocking the application program until space is available.

Subsequent reception of acknowledgements will free send- window memory and unblock the application program. In some embodiments, this window size is known as the socket buffer size in some TCP implementations. In one embodiment, the flow control module is configured to provide access to increased window or buffer sizes.

This configuration may also be referenced to as window virtualization. In the embodiment of TCP as the transport layer protocol, the TCP header includes a bit string corresponding to a window scale. In one embodiment, “window” may be referenced in a context of send, receive, or both. One embodiment of window virtualization is to insert a preacking appliance into a TCP session. In reference to any of the environments of FIG.

ID or IE, initiation of a data communication session between a source node, e. For TCP communications, the source node initially transmits a synchronization signal “SYN” through its local area network to first flow control module The first flow control module inserts a configuration identifier into the TCP header options area. The configuration identifier identifies this point in the data path as a flow control module. The appliances via a flow control module provide window or buffer to allow increasing data buffering capabilities within a session despite having end nodes with small buffer sizes, e.

Moreover, the window scaling corresponds to the lowest common denominator in the data path, often an end node with small buffer size. This window scale often is a scale of 0 or 1, which corresponds to a buffer size of up to 64 k or k bytes. Note that because the window size is defined as the window field in each packet shifted over by the window scale, the window scale establishes an upper limit for the buffer, but does not guarantee the buffer is actually that large.

Each packet indicates the current available buffer space at the receiver in the window field. In one embodiment of scaling using the window virtualization technique, during connection establishment i. The first flow control module also modifies the scale, e. When the second flow control module receives the SYN signal, it stores the increased scale from the first flow control signal and resets the scale in the SYN signal back to the source node scale value for transmission to the destination node When the second flow controller receives the SYN-ACK signal from the destination node , it stores the scale from the destination node scale, e.

The first flow control node receives and notes the received window scale and revises the windows scale sent back to the source node back down to the original scale, e. Based on the above window shift conversation during connection establishment, the window field in every subsequent packet, e.

The window scale, as described above, expresses buffer sizes of over 64 k and may not be required for window virtualization. Thus, shifts for window scale may be used to express increased buffer capacity in each flow control module This increase in buffer capacity in may be referenced as window or buffer virtualization.

The increase in buffer size allows greater packet through put from and to the respective end nodes and Note that buffer sizes in TCP are typically expressed in terms of bytes, but for ease of discussion “packets” may be used in the description herein as it relates to virtualization.

By way of example, a window or buffer virtualization performed by the flow controller is described. In this example, the source node and the destination node are configured similar to conventional end nodes having a limited buffer capacity of 16 k bytes, which equals approximately 10 packets of data. Typically, an end node , must wait until the packet is transmitted and confirmation is received before a next group of packets can be transmitted.