Abstract. We study the algorithmic complexity of fair division problems with a focus on minimizing the number of queries needed to find an approximate solution with desired accuracy. We show for several classes of fair division problems that under certain natural conditions on sets of preferences, a logarithmic number of queries with respect to accuracy is sufficient.

Digital rights management (DRM) and video quality are two important issues for content providers. DRM plays a critical role in enforcing monetization policies while video quality is key for protecting brand integrity. For stitched media file-based (SMF) rate adaptation schemes which rely on low latency seek operations, a seek friendly DRM encryption scheme is required. This paper describes our stream cipher-based DRM encryption scheme which enables secure SMF rate adaptation. We provide a model for and discuss the trade-offs involved in optimizing rate adaptation latency within our scheme. Our SMF scheme is one of a number of HTTP video delivery implementations that we have commercially deployed on the AndroidTM and Blackberry®mobile platforms and that use our DRM. Though the DRM scheme works with both SMF and segment-based approaches, this paper focuses on SMF considerations. We include cipher performance results from actual device tests, as well as rate adaptation latency results from our production implementation.

In this work, we propose a novel methodology that can be used to assess the relative popularity for any Internet application based on the data servers it uses. The basic idea is to infer popularity of data servers by periodically "poking" at local Domain Name servers (LDNSs) that service Domain Name System requests from a set of users running Internet applications and determining if LDNSs have cached resource records for the data servers. This approach allows us to measure the relative percentage of pokes that result in a cache hit as a coarse measure of the relative popularity of a particular data server among the users of a given LDNS. In addition, the time-to-live (TTL) of cached DNS resource records can be used to measure the gaps in time when a resource record for a data server is not cached. The cache gaps can be used to infer request interarrivals for more popular data servers.The methodology can be applied to any Internet application that uses distinguished server names and performs DNS lookups on these names as part of application use. The methodology can be used to collect usage information from any LDNS that accepts DNS queries. As example applications of the methodology, we evaluate the relative popularity of selected Web sites and the relative popularity of different Web servers serving content at a given Web site. We also apply the methodology to servers providing multimedia content, data servers for grid computing, and network game servers. We use data gathered from LDNSs of commercial and educational sites as well as Internet Service Providers serving both commercial and home customers.

The problem of Web cache consistency continues to be an important one. Current Web caches use heuristic-based policies for determining the freshness of cached objects, often forcing content providers to unnecessarily mark their content as uncacheable simply to retain control over it. Server-driven invalidation has been proposed as a mechanism for providing strong cache consistency for Web objects, but it requires servers to maintain per-client state even for infrequently changing objects. We propose an alternative approach to strong cache consistency, called MONARCH, which does not require servers to maintain per-client state. In this work we focus on a new approach for evaluation of MONARCH in comparison with current practice and other cache consistency policies. This approach uses snapshots of content collected from real Web sites as input to a simulator. Results of the evaluation show MONARCH generates little more request traffic than an optimal cache coherency policy.

Article Share on N for the price of 1: bundling web objects for more efficient content delivery Authors: Craig E. Wills Computer Science Dept., Worcester Polytechnic Institute, Worcester, MA Computer Science Dept., Worcester Polytechnic Institute, Worcester, MAView Profile , Mikhail Mikhailov Computer Science Dept., Worcester Polytechnic Institute, Worcester, MA Computer Science Dept., Worcester Polytechnic Institute, Worcester, MAView Profile , Hao Shang Computer Science Dept., Worcester Polytechnic Institute, Worcester, MA Computer Science Dept., Worcester Polytechnic Institute, Worcester, MAView Profile Authors Info & Claims WWW '01: Proceedings of the 10th international conference on World Wide WebMay 2001 Pages 257–265https://doi.org/10.1145/371920.372061Published:01 April 2001Publication History 19citation478DownloadsMetricsTotal Citations19Total Downloads478Last 12 Months3Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access