|
PgmReference
http://www.ietf.org/rfc/rfc3208.txt
http://www.ietf.org/rfc/rfc1112.txt
http://www.ietf.org/rfc/rfc2113.txt
http://www.ietf.org/rfc/rfc1321.txt
http://www.ietf.org/rfc/rfc3678.txt
http://www.ietf.org/rfc/rfc3246.txt
http://www.ietf.org/rfc/rfc3168.txt
http://www.ietf.org/rfc/rfc1700.txt
http://www.ietf.org/rfc/rfc4654.txt
http://www.ietf.org/internet-drafts/draft-ietf-rmt-bb-fec-rs-05.txt
http://tools.ietf.org/html/draft-ietf-rmt-gra-arch-02
http://www.ietf.org/proceedings/03jul/I-D/draft-ietf-rmt-bb-pgmcc-02.txt http://www.potaroo.net/ietf/old-ids/draft-ietf-rmt-bb-pgmcc-03.txt http://info.iet.unipi.it/~luigi/pgmcc.000608.ps.gz
http://www.cs.purdue.edu/research/ugrad/TektronixReport-Chinwang.pdf
http://www.ee.iitb.ac.in/~karandi/pubs_dir/UCLA-WINMEC-2003-609-Multicast-sent.pdf
http://www.rfc-editor.org/internet-drafts/draft-irtf-iccrg-cc-rfcs-07.txt
http://www.cs.utexas.edu/~vin/pub/pdf/ngc02.pdf
http://tools.ietf.org/html/draft-miller-mftp-spec-03
http://www.potaroo.net/ietf/old-ids/draft-petrova-nwg-pgmmib-00.txt
http://msdn.microsoft.com/en-us/library/ms740125.aspx
http://www.cisco.com/en/US/docs/ios/12_0t/12_0t5/feature/guide/pgmscale.html
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBP-IJPR04.pdf
http://hal.archives-ouvertes.fr/docs/00/11/02/52/PDF/main.pdf
http://research.microsoft.com/pubs/69547/tr-97-17.doc
http://research.microsoft.com/pubs/68230/icccn97.doc
http://research.microsoft.com/pubs/68888/pgm_ieee_network.doc
http://www.cs.cornell.edu/projects/quicksilver/public_pdfs/Optimizing%20Buffer.pdf
http://www.isi.edu/div7/publication_files/multicast_transport.pdf
http://books.google.com.hk/books?id=k-zlMWKVbNAC
http://www.whetten.net/documents/Dagstuhl%20RMP%20Paper.pdf
http://www-nrg.ee.lbl.gov/papers/srm_ton.pdf
https://eprints.kfupm.edu.sa/62747/1/62747.pdf
http://books.google.com.hk/books?id=GUZGHzL-bM4C
http://www.csc.ncsu.edu/faculty/rhee/export/papers/nonnenmacher97paritybased.pdf
http://ee.lbl.gov/papers/congavoid.pdf
ftp://ftp-sop.inria.fr/rodeo/bolot/94.Video_feedback.ps.gz
http://www.ecse.rpi.edu/Homepages/shivkuma/research/papers/jiangthesis.ppt
http://www.cs.ucl.ac.uk/staff/m.lad/rpgm/
http://info.iet.unipi.it/~luigi/pgm.html
http://info.iet.unipi.it/~luigi/fec_ccr.ps.gz
http://info.iet.unipi.it/~luigi/mccr6.ps.gz
http://info.iet.unipi.it/~luigi/hpcs97.ps.gz
http://info.iet.unipi.it/~luigi/softfec.ps.gz
http://www.cs.ucl.ac.uk/research/darpa/pgm/PGM_FINAL.html
ftp://gaia.cs.umass.edu/pub/Shapiro01_atdp.pdf
http://www.research.ibm.com/distributedmessaging/papers/GDdsn02.ps
http://www.acm.org/sigcomm/ccr/archive/2000/april00/bcfs_ccr.ps
This paper refers to an early version of the PGM draft specification which was subsequently updated with off-tree DLR support to address the issues raised.
http://www.cs.cornell.edu/Projects/Quicksilver/public_pdfs/scalability%20throughout.pdf
http://web.univ-pau.fr/~cpham/Paper/AMS02.ps.gz
https://eprints.kfupm.edu.sa/63407/1/63407.pdf
http://pages.cs.wisc.edu/~suman/pubs/cs-tr-4252.ps.gz
http://www.isoc.org/isoc/conferences/ndss/2000/proceedings/028.pdf http://www.isoc.org/isoc/conferences/ndss/2000/proceedings/slides/04.ppt
http://www.cs.purdue.edu/research/technical_reports/2003/TR%2003-019.pdf
http://ala.isti.cnr.it/atti/ISWCS05/iwssc05/pdf/FS3-3.pdf
http://lara.inist.fr/bitstream/2332/822/1/LIP-RR2003-05.pdf
http://web.archive.org/web/20060812013021/http://www.ntu.edu.sg/home5/ZHOU0022/papers/YLiu04.pdf Proposes an enhanced congestion control scheme called EPGMCC (Enhanced PGMCC).
ftp://ftp.csc.ncsu.edu/pub/tech/98/TR-98-01.ps.Z
http://eeca2.sogang.ac.kr/publications/international/PGMCC.pdf Discusses alternative ACKer selection timeout algorithms
http://www.cs.ucl.ac.uk/staff/m.handley/papers/tfmcc-sigcomm.pdf Introduction to TFMCC (RFC4654)
http://airex.tksc.jaxa.jp/pl/dr/19980019497/en
http://web.ics.purdue.edu/~dkoutson/publications/pacifier.pdf
http://www.cost280.rl.ac.uk/documents/WS2%20Proceedings/documents/pm-5-068.pdf
http://os.korea.ac.kr/publication_papers/inter_journal/ssbyun_IJCS_2009.pdf makespan is the time that is required to fully and successfully transmit a packet from the sender to all receivers. |