Satellite networks, which provide high bandwidth but have high latency, suffer from performance degradation for secure web access (HTTPS). The use of multiple networks, which combines a satellite network with a low latency network, becomes an attractive method for a satellite Internet Service Provider (ISP) to provide better network services. We propose a novel and practical multiple networking system, called Accelerating Network Services by Adding a Short Path (ASAP). ASAP accelerates secure web page loading with a little help from a low latency network while exploiting the high bandwidth of a satellite network. By using a middlebox approach with a multipath tunneling mechanism, ASAP is deployable to the current Internet architecture without modifying core networks and protocols. Phase-based classification mechanism of ASAP enhances network services while minimizing and controlling the data usage of the auxiliary, low latency network to reduce the operation cost for a satellite ISP, which leases the auxiliary network. Our performance evaluation shows that ASAP is an effective solution to reduce secure web page load time while reducing and controlling the data usage of networks. Our real-world testbed shows that ASAP works with the current Internet infrastructure.

Article Joint broadcast scheduling and user's cache management for efficient information delivery Share on Authors: Chi-Jiun Su Hughes Network Systems, 11717 Exploration Lane, Germantown MD Hughes Network Systems, 11717 Exploration Lane, Germantown MDView Profile , Leandros Tassiulas Electrical Engineering Department, University of Maryland, College Park MD Electrical Engineering Department, University of Maryland, College Park MDView Profile Authors Info & Claims MobiCom '98: Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networkingOctober 1998 Pages 33–42https://doi.org/10.1145/288235.288246Online:25 October 1998Publication History 17citation338DownloadsMetricsTotal Citations17Total Downloads338Last 12 Months1Last 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

Broadcast data delivery is encountered in many applications where there is a need to disseminate information to a large user community in a wireless asymmetric communication environment. We consider the problem of scheduling the data broadcast such that the access latency experienced by the users is low. In a push-based system, where the users cannot place requests directly to the server and the broadcast schedule should be determined based solely on the access probabilities, we formulate a deterministic dynamic optimization problem, the solution of which provides the optimal broadcast schedule. Properties of the optimal solution are obtained and then we propose a suboptimal dynamic policy which achieves mean access latency close to the lower bound. The policy has low complexity, it is adaptive to changing access statistics, and is easily generalized to multiple broadcast channels. In a pull-based system where the users may place requests about information items directly to the server, the scheduling can be based on the number of pending requests for each item. Suboptimal policies with good performance are obtained in this case as well. Finally, it is demonstrated by a numerical study that as the request generation rate increases, the achievable performance of the pull- and push-based systems becomes almost identical.

Data broadcasting has been considered as a promising way of disseminating information to a massive number of users in a wireless communication environment. In a broadcast data delivery system, there is a server which is broadcasting data to a user community. Due to the lack of communication from the users to the server, the server cannot know what a user needs. In order to access a certain item, a user has to wait until the item appears in the broadcast. The waiting time will be considerably long if the server's broadcast schedule does not match the user's access needs. If a user has a local memory, it can alleviate its access latency by selectively prefetching the items from the broadcast and storing them in the memory. A good memory management strategy can substantially reduce the user's access latency, which is a major concern in a broadcast data delivery system. An optimal memory management policy is identified that minimizes the expected aggregate latency. We present optimal memory update strategies with limited look ahead as implementable approximations of the optimal policy. Some interesting special cases are given for which the limited look-ahead policies are optimal. We also show that the same formulation can be used to find the optimal memory management policy which minimizes the number of deadline misses when users generate information requests which have to be satisfied within some given deadlines.