Scheduling Subset Tests: One-Time, Continuous, and How They Relate
暂无分享,去创建一个
[1] Wushow Chou,et al. Queueing Systems, Volume II: Computer Applications - Leonard Kleinrock , 1977, IEEE Transactions on Communications.
[2] Renata Teixeira,et al. Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis , 2009, IEEE INFOCOM 2009.
[3] Randeep Bhatia,et al. Minimizing service and operation costs of periodic scheduling , 2002, SODA '98.
[4] Rafael Alonso,et al. Broadcast Disks: Data Management for Asymmetric Communication Environments , 1994, Mobidata.
[5] Qiang Zheng,et al. Minimizing Probing Cost and Achieving Identifiability in Probe-Based Network Link Monitoring , 2013, IEEE Transactions on Computers.
[6] Edith Cohen,et al. Efficient sequences of trials , 2003, SODA '03.
[7] Edith Cohen,et al. Probe scheduling for efficient detection of silent failures , 2013, Perform. Evaluation.
[8] László Lovász,et al. Approximating Min-sum Set Cover , 2002, APPROX.
[9] Boaz Patt-Shamir,et al. Efficient algorithms for periodic scheduling , 2004, Comput. Networks.
[10] Edith Cohen,et al. Replication strategies in unstructured peer-to-peer networks , 2002, SIGCOMM.
[11] Jonathan Chan,et al. Computer applications , 1986 .
[12] Nitin H. Vaidya,et al. Log-time algorithms for scheduling single and multiple channel data broadcast , 1997, MobiCom '97.
[13] George Varghese,et al. Automatic Test Packet Generation , 2012, IEEE/ACM Transactions on Networking.
[14] Robert B. Cooper,et al. Queueing systems, volume II: computer applications : By Leonard Kleinrock. Wiley-Interscience, New York, 1976, xx + 549 pp. , 1977 .
[15] Mostafa H. Ammar,et al. On the optimality of cyclic transmission in teletext systems , 1985, 1985 24th IEEE Conference on Decision and Control.
[16] Klaus Jansen,et al. Approximation Algorithms for Combinatorial Optimization , 2000 .