메뉴 건너뛰기




Volumn 1, Issue , 2003, Pages 229-239

Improving web performance in broadcast-unicast networks

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BROADCASTING; MODEMS; TELECOMMUNICATION LINKS; PARABOLIC ANTENNAS;

EID: 0042976111     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (14)

References (37)
  • 1
    • 0043127537 scopus 로고    scopus 로고
    • [Online]
    • Hughes Network Systems. [Online]. Available: http://www.direcpc.com
  • 2
    • 0043127536 scopus 로고    scopus 로고
    • [Online]
    • Starband Communications. [Online]. Available: http://www.starband.com
  • 3
    • 0042626700 scopus 로고    scopus 로고
    • July. [Online]
    • DSLReports.com. (2002, July) Satellite forum FAQ. [Online]. Available: http:/wwvv.dslreports.com/faq/sattellite/all#2058
    • (2002) Satellite Forum FAQ
  • 4
    • 0042125680 scopus 로고    scopus 로고
    • Hughes Network Systems. [Online]
    • Hughes Network Systems. Directv: TiVo. [Online]. Available: http://www.directv.com/DTVAPP/imagline/TIVO.jsp
    • Directv: TiVo
  • 5
    • 0032670943 scopus 로고    scopus 로고
    • Web caching and zipf-like distributions: Evidence and implications
    • New York, NY, March
    • L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, "Web caching and zipf-like distributions: Evidence and implications," in Proceedings of IEEE INFOCOM 1999, New York, NY, March 1999, pp. 126-134.
    • (1999) Proceedings of IEEE INFOCOM 1999 , pp. 126-134
    • Breslau, L.1    Cao, P.2    Fan, L.3    Phillips, G.4    Shenker, S.5
  • 6
    • 0000696568 scopus 로고    scopus 로고
    • Speed is as powerful as clairvoyance
    • B. Kalyanasundaram and K. Pruhs, "Speed is as powerful as clairvoyance," Journal of the ACM, vol. 47, no. 4, pp. 617-643, 2000.
    • (2000) Journal of the ACM , vol.47 , Issue.4 , pp. 617-643
    • Kalyanasundaram, B.1    Pruhs, K.2
  • 10
    • 77957077792 scopus 로고
    • A pseudo-polynomial algorithm for sequencing jobs to minimize total tardiness
    • E. L. Lawler, "A pseudo-polynomial algorithm for sequencing jobs to minimize total tardiness," Annals of Discrete Mathematics, vol. 1, pp. 331-342, 1977.
    • (1977) Annals of Discrete Mathematics , vol.1 , pp. 331-342
    • Lawler, E.L.1
  • 11
    • 0000474126 scopus 로고
    • Minimizing total tardiness on one machine is NP-hard
    • J. Du and J.-T. Leung, "Minimizing total tardiness on one machine is NP-Hard," Mathematics of Operations Research, vol. 15, pp. 483-495, 1990.
    • (1990) Mathematics of Operations Research , vol.15 , pp. 483-495
    • Du, J.1    Leung, J.-T.2
  • 12
    • 0038384295 scopus 로고    scopus 로고
    • Algorithms for weighted flow time
    • C. Chekuri, S. Khanna, and A. Zhu, "Algorithms for weighted flow time," in STOC, 2001.
    • (2001) STOC
    • Chekuri, C.1    Khanna, S.2    Zhu, A.3
  • 14
    • 0042125678 scopus 로고    scopus 로고
    • [Online]
    • The Measurement Factory. Polygraph. [Online]. Available: http://www.web-polygraph.org/
    • Polygraph
  • 15
    • 0041624660 scopus 로고    scopus 로고
    • [Online]
    • Polyteam. [Online]. Available: http://cacheoff.ircache.net/
  • 16
    • 0042125679 scopus 로고    scopus 로고
    • Forecast for broadband satellite services - Part 2
    • Feb 15
    • R. Rusch, "Forecast for broadband satellite services - part 2, " SKYBroadband Newsletter, Feb 15 2002.
    • (2002) SKYBroadband Newsletter
    • Rusch, R.1
  • 18
    • 77958029309 scopus 로고    scopus 로고
    • Scheduling on-demand broadcasts: New metrics and algorithms
    • Dallas, TX, Oct
    • S. Acharya and S. Muthukrishnan, "Scheduling on-demand broadcasts: new metrics and algorithms," in MOBICOM, Dallas, TX, Oct 1998.
    • (1998) MOBICOM
    • Acharya, S.1    Muthukrishnan, S.2
  • 19
    • 0033903568 scopus 로고    scopus 로고
    • Minimizing maximum response time in scheduling broadcasts
    • Y. Bartal and S. Muthukrishnan, "Minimizing maximum response time in scheduling broadcasts," in SODA, 2000.
    • (2000) SODA
    • Bartal, Y.1    Muthukrishnan, S.2
  • 20
    • 84968764938 scopus 로고    scopus 로고
    • NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
    • T. Erlebach and A. Hall, "NP-Hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow," in SODA, 2002.
    • (2002) SODA
    • Erlebach, T.1    Hall, A.2
  • 22
    • 0041624658 scopus 로고    scopus 로고
    • Algorithms for minimizing response time in broadcast scheduling
    • R. Gandhi, S. Khuller, Y.-A. Kim, and Y.-C. Wan, "Algorithms for minimizing response time in broadcast scheduling," in IPCO, 2002.
    • (2002) IPCO
    • Gandhi, R.1    Khuller, S.2    Kim, Y.-A.3    Wan, Y.-C.4
  • 24
    • 84968747434 scopus 로고    scopus 로고
    • Broadcast scheduling: When fairness is fine
    • J. Edmonds and K. Pruhs, "Broadcast scheduling: when fairness is fine," in SODA, 2002.
    • (2002) SODA
    • Edmonds, J.1    Pruhs, K.2
  • 25
    • 0031234097 scopus 로고    scopus 로고
    • Optimal memory management strategies for a mobile user in a broadcast data delivery system
    • September
    • L. Tassiulas and C.-J. Su, "Optimal memory management strategies for a mobile user in a broadcast data delivery system," IEEE Journal on Selected Areas in Communications, vol. 15, no. 7, September 1997.
    • (1997) IEEE Journal on Selected Areas in Communications , vol.15 , Issue.7
    • Tassiulas, L.1    Su, C.-J.2
  • 26
    • 0031698904 scopus 로고    scopus 로고
    • Scalable delivery of web pages using cyclic best-effort multicast
    • San Francisco, CA, March
    • K. C. Almeroth, M. H. Ammar, and Z. Fei, "Scalable delivery of web pages using cyclic best-effort multicast," in Proceedings of IEEE INFOCOM'98, San Francisco, CA, March 1998.
    • (1998) Proceedings of IEEE INFOCOM'98
    • Almeroth, K.C.1    Ammar, M.H.2    Fei, Z.3
  • 28
    • 84976840503 scopus 로고
    • Broadcast disks: Data management for asymmetric communication environments
    • San Jose, CA: ACM, May
    • S. Acharya, R. Alonso, M. Franklin, and S. Zdonik, "Broadcast disks: data management for asymmetric communication environments," in Proceedings of SIGMOD 95. San Jose, CA: ACM, May 1995, pp. 199-210.
    • (1995) Proceedings of SIGMOD 95 , pp. 199-210
    • Acharya, S.1    Alonso, R.2    Franklin, M.3    Zdonik, S.4
  • 31
    • 0031672788 scopus 로고    scopus 로고
    • Scheduling for large-scale on-demand broadcasting
    • San Francisco, CA, March
    • D. Aksoy and M. J. Franklin, "Scheduling for large-scale on-demand broadcasting," in Proceedings of IEEE INFOCOM'98, San Francisco, CA, March 1998.
    • (1998) Proceedings of IEEE INFOCOM'98
    • Aksoy, D.1    Franklin, M.J.2
  • 32
    • 0036343639 scopus 로고    scopus 로고
    • Multicast scheduling for list requests
    • New York, NY, June
    • V. Liberatore, "Multicast scheduling for list requests," in Proceedings of IEEE INFOCOM'02, New York, NY, June 2002.
    • (2002) Proceedings of IEEE INFOCOM'02
    • Liberatore, V.1
  • 33
    • 0003161412 scopus 로고    scopus 로고
    • Performance evaluation of a wireless hierarchical data dissemination system
    • Seattle, WA, August
    • Q. Hu, D. L. Lee, and W.-C. Lee, "Performance evaluation of a wireless hierarchical data dissemination system," in MOBICOM, Seattle, WA, August 1999, pp. 163-173.
    • (1999) MOBICOM , pp. 163-173
    • Hu, Q.1    Lee, D.L.2    Lee, W.-C.3
  • 36
    • 0042125677 scopus 로고    scopus 로고
    • [Online]
    • Hughes Network Systems. (2000) Introducing webcast. [Online]. Available: http/www2.direcpc.com/helpfiles/webcast/webcast_overview.htm
    • (2000) Introducing Webcast
  • 37
    • 0033889570 scopus 로고    scopus 로고
    • Adaptive leases: A strong consistency mechanism for the World Wide Web
    • Tel Aviv, Israel, Mar
    • V. Duvvuri, P. Shenoy, and R. Tewari, "Adaptive leases: A strong consistency mechanism for the world wide web," in Proceedings of IEEE INFOCOM 2000, Tel Aviv, Israel, Mar 2000, pp. 834-843.
    • (2000) Proceedings of IEEE INFOCOM 2000 , pp. 834-843
    • Duvvuri, V.1    Shenoy, P.2    Tewari, R.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.