Efficient policies for carrying Web traffic over flow-switched networks
IEEE/ACM Transactions on Networking (TON)
Exploiting regularities in Web traffic patterns for cache replacement
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Experimental studies of access graph based heuristics: beating the LRU standard?
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Adaptive Disk Spin-down Policies for Mobile Computers
MLICS '95 Proceedings of the 2nd Symposium on Mobile and Location-Independent Computing
Proactive caching of DNS records: addressing a performance bottleneck
Computer Networks: The International Journal of Computer and Telecommunications Networking
Maintaining time-decaying stream aggregates
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Online strategies for dynamic power management in systems with multiple power-saving states
ACM Transactions on Embedded Computing Systems (TECS)
Connection caching: model and algorithms
Journal of Computer and System Sciences
Formal Methods for Dynamic Power Management
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Adaptive modem connection lifetimes
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
ACM Transactions on Algorithms (TALG)
Maintaining time-decaying stream aggregates
Journal of Algorithms
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Improved algorithms for polynomial-time decay and time-decay with additive error
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
| Hi-index | 0.07 |
When carrying Internet protocol (IP) traffic over an asynchronous transfer mode (ATM) network, the ATM adaptation layer must determine how long to hold a virtual circuit opened to carry an IP datagram. We present a formal statement of the problem and carry out a detailed empirical examination of various holding time policies taking into account the issue of network pricing. We offer solutions for two natural pricing models, the first being a likely pricing model of future ATM networks, while the second is based on characteristics of current networks. For each pricing model, we study a variety of simple nonadaptive policies as well as easy to implement policies that adapt to the characteristics of the IP traffic. We simulate our policies on actual network traffic, and find that policies based on least recently used (LRU) perform well, although the best adaptive policies provide a significant improvement over LRU