G. H. G. Goldszmidt. Scaling internet services by dynamic allocation of connections. In Proceedings of the Sixth IFIP/IEEE International Symposium on Intergrated Network Management, pages 171--184, May 1999.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Kunz [14] has demonstrated that a single, one dimensional workload descriptor yields better results than more complex descriptors. In the networking domain, particular interest in load sharing has recently been raised in the areas of Web servers, Web caching and clustered digital libraries [3] [10], 17] 23] The CARP distributed caching scheme, which uses the highest random weight (HRW) algorithm [17] by Ross, is a popular choice for Web servers and is implemented in products offered by Microsoft [3] Although the algorithm provides load balancing over the request object space, it is not ....

....algorithm [17] by Ross, is a popular choice for Web servers and is implemented in products offered by Microsoft [3] Although the algorithm provides load balancing over the request object space, it is not adaptive and therefore potentially vulnerable to traffic locality. IBM Network Dispatcher [10] is a software tool that routes TCP connections to multiple servers that share their workload, based on a monitored load metric. The algorithm contains an adaptive control loop, but it is required to maintain state information where each TCP connection has been mapped. Other research ( 12] 20] ....

[Article contains additional citation context not shown here]

G. Goldszmidt and G. Hunt. Scaling Internet services by dynamic allocation of connections. Proceedings of the Sixth IFIP/IEEE International Symposium on Integrated Network Management, pp. 171-184, 24-28 May 1999.

....Kunz [14] has demonstrated that a single, one dimensional workload descriptor yields better results than more complex descriptors. In the networking domain, particular interest in load sharing has recently been raised in the areas of Web servers, Web caching and clustered digital libraries [3] [10], 17] 23] The CARP distributed caching scheme, which uses the highest random weight (HRW) algorithm [17] by Ross, is a popular choice for Web servers and is implemented in products offered by Microsoft [3] Although the algorithm provides load balancing over the request object space, it is not ....

....algorithm [17] by Ross, is a popular choice for Web servers and is implemented in products offered by Microsoft [3] Although the algorithm provides load balancing over the request object space, it is not adaptive and therefore potentially vulnerable to traffic locality. IBM Network Dispatcher [10] is a software tool that routes TCP connections to multiple servers that share their workload, based on a monitored load metric. The algorithm contains an adaptive control loop, but it is required to maintain state infor0 7803 7476 2 02 17.00 (c) 2002 IEEE. mation where each TCP connection has ....

[Article contains additional citation context not shown here]

G. Goldszmidt and G. Hunt. Scaling Internet services by dynamic allocation of connections. Proceedings of the Sixth IFIP/IEEE International Symposium on Integrated Network Management, pp. 171-184, 24-28 May 1999.

....like in systems that harvest idle workstations (e.g. 2, 24] or as a management technique for manually excluding a cluster node. We use load concentration as a first class technique for conserving power and energy in clusters. A few other projects deal with cluster reconfiguration (e.g. [14, 1, 31, 16]) Even though these projects do not consider power and energy issues, they lend themselves nicely to the powering down of unused systems. The technique that is closest in spirit to load concentration for power and energy is offloading computation from a battery operated device to a remote ....

G. Goldszmidt and G. Hunt. Scaling Internet Services by Dynamic Allocation of Connections. In Proceedings of the 6th IFIP/IEEE International Symposium on Integrated Network Management, pages 171--184, 1999.

....assigned to customers. In the second tier, many machines reply to generated requests. These machines can be shifted between customer domains dynamically to answer to higher loads. This work could easily be extended to include powering down unused systems. The Ensemble system [31] and the ND tool [15] can also adapt their node configurations. In fact, the ND tool was used to changethe 9 configuration of cluster based network servers. Even though these projects do not consider power and energy issues, they lend themselves naturally to our approach. 6 Conclusions and Future Work In this paper ....

G. Goldszmidt and G. Hunt. Scaling Internet Services by Dynamic Allocation of Connections. In Proceedings of the 6th IFIP/IEEE International Symposium on Integrated Network Management, pages 171--184, 1999.

....n tunnel termination capabilities for extracting packets coming through an IP tunnel. The tunneling abstraction may be realized in number of ways, most simply using an IP in IP encapsulation, but could also be realized as a lower level connection (ATM, MPLS or WDM) In particular, as proposed in [GOL99] if the SLR at the hosting site and the servers communicate over a fast ethernet or FDDI, the SLR can tunnel packets to a server host by using directly the server host MAC address. Packets in the reverse direction obtain the address of the original virtual host and thus maintain transparency ....

....preventing the implementation of customized routing policies. 3. Packets flowing in the reverse direction can not be easily aggregated for scheduling purposes, something which is straightforward in the SLR scheme where packets in the return path contain the virtual host as their source address. GOL99] describes a scheme similar to ours that uses a special router (the network director ND) to distribute connections to a set of servers. The ND is located on the same ethernet with the servers. Every server has configured a number of virtual IP interfaces. Packets for a virtual host are first ....

G. Goldszmidt and G. Hunt, "Scaling Internet Services by Dynamic Allocation of Connections", in Proceedings of the 6th IFIP/IEEE Integrated Management, Boston MA, May 1999.

..... tunnel termination capabilities for extracting packets coming through an IP tunnel. The tunneling abstraction may be realized in number of ways, most simply using an IP in IP encapsulation, but could also be realized as a lower level connection (ATM, MPLS or WDM) In particular, as proposed in [GOL99] if the SLR at the hosting site and the servers communicate over a fast ethernet or FDDI, the SLR can tunnel packets to a server host by using directly the server host MAC address. Packets in the reverse direction obtain the address of the original virtual host and thus maintain transparency ....

....work well for a single site with many servers but have scalability problems when it comes to supporting groups of servers in different locations. By allowing redirection of traffic to a remote server farm, we introduce routing inefficiencies, the same problems encountered in mobile IP solutions. GOL99] describes a scheme similar to ours that uses a special router (the network director ND) to distribute connections to a set of servers. The ND is located on the same ethernet with the servers. Every server has configured a number of virtual IP interfaces. Packets for a virtual host are first ....

G. Goldszmidt and G. Hunt, "Scaling Internet Services by Dynamic Allocation of Connections", in Proceedings of the 6th IFIP/IEEE Integrated Management, Boston MA, May 1999.

....service interruption. GulfStream is the underlying technology of Oceano that provides topology discovery, failure detection and topology reconfiguration functions. Figure 1 shows the logical view of an Oceano server farm. Requests flowing into the farm go through request dispatchers, for example [8], which distribute them to the appropriate servers within each of the domains. All the domains within the farm are able to communicate with the dispatchers, but are isolated from each other using private virtual LANs [5] on a switched fast Ethernet network. All domains are similarly attached to an ....

G. Goldszmidt and G. Hunt. Scaling internet services by dynamic allocation of connections. In Proc. of the 
IFIP/IEEE Intl. Symp. on Integrated Network Management (IM 1999.

....Application models determine the logical configuration (single tier or multi tier) of the server nodes, and range from simple Web serving to complex multi tier e commerce applications. An Oceano farm consists of 3 tiers: front end IP sprayers for load balancers (e.g. Network Dispatchers [7]) large pools of front end servers, and static back end servers, all interconnected by switches. A freepool of servers is available to be leased to customers. When the load on a customer drops below some level, one of its servers is quiesced, scrubbed of any residual customer data, and ....

....database server (number 47) and three front end web servers (numbers 11, 12, and 13) The front end servers and back end server are connected through VLAN [22] 462 using network adapters 36, 39, 42, and 144 respectively. Front end servers receive requests from a load balancer (Network Dispatcher [7]) via VLAN 461 using network adapters 35, 38, and 41. Front end Server 12 Front end Server 11 Front end Server 13 Back end Server 47 VLAN 461 NIC 35 NIC 38 NIC 39 NIC 42 NIC 41 NIC 144 PORT 2 23 PORT 2 25 PORT 2 27 PORT 4 7 PORT 2 24 PORT 2 26 PORT 2 28 Network dispatcher Figure ....

G. Goldszmidt and G. Hunt. Scaling Internet services by dynamic allocation of connections. In M. Sloman, S. Mazumdar, and E. Lupu, editors, Integrated Network Management VI, pages 171--184, Boston, MA, May 1999.

No context found.

G. H. G. Goldszmidt. Scaling internet services by dynamic allocation of connections. In Proceedings of the Sixth IFIP/IEEE International Symposium on Intergrated Network Management, pages 171--184, May 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC