Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,971
Site Selection for Real-Time Client Request Handling
"... In a conventional client-server database system (CSDBS) , a transaction and its requisite data have to be colocated at a single site for the operation to proceed. This has traditionally been achieved by moving either the data or the transaction. Today, the availability of powerful workstations and h ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
In a conventional client-server database system (CSDBS) , a transaction and its requisite data have to be colocated at a single site for the operation to proceed. This has traditionally been achieved by moving either the data or the transaction. Today, the availability of powerful workstations
Adaptive Batching of Client Requests for Continuous Media Playback
"... In this paper, we investigate the buffer requirement to support a set of continuous media playbacks and develop an algorithm which dynamically changes the service mode of the playback to minimize the total buffer requirement. A certain amount of memory buffer is required in continuous media playback ..."
Abstract
- Add to MetaCart
blocks loaded by the preceding playback for the same file, and thus achieving less buffer requirement. We have developed an efficient algorithm to determine the service mode of each request.
Oriented Overlays For Clustering Client Requests To Data-Centric Network Services
"... Abstract — Many of the data-centric network services deployed today hold massive volumes of data at their origin websites, accessing the data to dynamically generate responses. Such dynamic responses are poorly supported by traditional caching infrastructures and result in poor performance and scala ..."
Abstract
- Add to MetaCart
network locations. Key to building such infrastructures is the ability to cluster and inspect client requests, at various points across a wide-area network. This paper presents a zone-based scheme for constructing oriented overlays, which provide such an ability. Oriented overlays differ from previously
Detecting timed-out client requests for avoiding livelock and improving web server performance
- Proc. of 5th IEEE Symposium on Computers and Communications
, 2000
"... Web servers, overloaded conditions, DTOC strategy, performance analysis, optimization, timed-out client requests A Web server's listen queue capacity is often set to a large value to accommodate bursts of traffic and to accept as many client requests as possible. We show that, under certain ove ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
Web servers, overloaded conditions, DTOC strategy, performance analysis, optimization, timed-out client requests A Web server's listen queue capacity is often set to a large value to accommodate bursts of traffic and to accept as many client requests as possible. We show that, under certain
Detecting Timed-Out Client Requests for Avoiding Livelock and Improving Web Server Performance
, 2000
"... A Web server's listen queue capacity is often set to a large value to accommodate bursts of traffic and to accept as many client requests as possible. We show that, under certain overload conditions, this results in a significant loss of server performance due to the processing of so-called &qu ..."
Abstract
- Add to MetaCart
A Web server's listen queue capacity is often set to a large value to accommodate bursts of traffic and to accept as many client requests as possible. We show that, under certain overload conditions, this results in a significant loss of server performance due to the processing of so
Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
, 2001
"... This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for wide-area peer-to-peer applications. Pastry provides application-level routing and object location in a potentially very large overlay network of nodes connected via the Internet. ..."
Abstract
-
Cited by 2075 (49 self)
- Add to MetaCart
object if one exists. Moreover, a lookup is usually routed to the node nearest the client issuing the lookup (by some measure of proximity), among the nodes storing the requested object. Pastry is completely decentralized, scalable, and self-configuring; it automatically adapts to the arrival, departure
The design and implementation of an intentional naming system
- 17TH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES (SOSP '99) PUBLISHED AS OPERATING SYSTEMS REVIEW, 34(5):186--201, DEC. 1999
, 1999
"... This paper presents the design and implementation of the Intentional Naming System (INS), a resource discovery and service location system for dynamic and mobile networks of devices and computers. Such environments require a naming system that is (i) expressive, to describe and make requests based o ..."
Abstract
-
Cited by 518 (14 self)
- Add to MetaCart
This paper presents the design and implementation of the Intentional Naming System (INS), a resource discovery and service location system for dynamic and mobile networks of devices and computers. Such environments require a naming system that is (i) expressive, to describe and make requests based
Adaptive Run-time Performance Optimization Through Scalable Client Request Rate Control
"... Today’s Internet-scale computing systems often run at a low average load with only occasional peak performance demands. Consequently, computing resources are often overdimensioned, leading to high costs. While load control techniques between clients and servers can help to better utilize a given sys ..."
Abstract
- Add to MetaCart
system, these techniques can place a significant communication and computation load on servers. To improve on these issues, we contribute with scalable techniques for client-request rate control, achieved through integration of (i) a scalable distributed feedback channel to transmit control information
A Hierarchical Internet Object Cache
- IN PROCEEDINGS OF THE 1996 USENIX TECHNICAL CONFERENCE
, 1995
"... This paper discusses the design andperformance of a hierarchical proxy-cache designed to make Internet information systems scale better. The design was motivated by our earlier trace-driven simulation study of Internet traffic. We believe that the conventional wisdom, that the benefits of hierarch ..."
Abstract
-
Cited by 496 (6 self)
- Add to MetaCart
of hierarchical file caching do not merit the costs, warrants reconsideration in the Internet environment. The cache implementation supports a highly concurrent stream of requests. We present performance measurements that show that the cache outperforms other popular Internet cache implementations by an order
Results 1 - 10
of
3,971
