Mécanismes de fiabilisation pro-actifs - ISAE

More documents

Recommendations

Info

122 Bibliographie[44] L.-E. Jonsson and G. Pelletier, RObust Header Compression (ROHC) :A Compression Prole for IP, RFC 3843 (Proposed Standard), InternetEngineering Task Force, Jun. 2004, updated by RFC 4815. [Online]. Available :http://www.ietf.org/rfc/rfc3843.txt 37[45] G. Pelletier, RObust Header Compression (ROHC) : Proles for UserDatagram Protocol (UDP) Lite, RFC 4019 (Proposed Standard), InternetEngineering Task Force, Apr. 2005, updated by RFC 4815. [Online]. Available :http://www.ietf.org/rfc/rfc4019.txt 37[46] G. Pelletier, K. Sandlund, L.-E. Jonsson, and M. West, RObust HeaderCompression (ROHC) : A Prole for TCP/IP (ROHC-TCP), RFC 4996(Proposed Standard), Internet Engineering Task Force, Jul. 2007. [Online].Available : http://www.ietf.org/rfc/rfc4996.txt 37[47] L.-E. Jonsson, K. Sandlund, G. Pelletier, and P. Kremer, RObust HeaderCompression (ROHC) : Corrections and Clarications to RFC 3095, RFC 4815(Proposed Standard), Internet Engineering Task Force, Feb. 2007. [Online].Available : http://www.ietf.org/rfc/rfc4815.txt 37[48] L.-E. Jonsson, G. Pelletier, and K. Sandlund, The RObust Header Compression(ROHC) Framework, RFC 4995 (Proposed Standard), Internet EngineeringTask Force, Jul. 2007, obsoleted by RFC 5795. [Online]. Available :http://www.ietf.org/rfc/rfc4995.txt 37[49] G. Pelletier and K. Sandlund, RObust Header Compression Version 2(ROHCv2) : Proles for RTP, UDP, IP, ESP and UDP-Lite, RFC 5225(Proposed Standard), Internet Engineering Task Force, Apr. 2008. [Online].Available : http://www.ietf.org/rfc/rfc5225.txt 37[50] K. Sandlund, G. Pelletier, and L.-E. Jonsson, The RObust Header Compression(ROHC) Framework, RFC 5795 (Proposed Standard), Internet EngineeringTask Force, Mar. 2010. [Online]. Available : http://www.ietf.org/rfc/rfc5795.txt37[51] C. Y. Cho, W. K. G. Seah, and Y. H. Chew, A framework and source model fordesign and evaluation of robust header compression, Comput. Netw., vol. 50,no. 15, pp. 26762712, 2006. 42[52] C. Y. Cho, Y. H. Chew, and W. K. G. Seah, Modeling and analysis of robustheader compression performance, in WOWMOM '05 : Proceedings of the SixthIEEE International Symposium on World of Wireless Mobile and Multimedia Networks.Washington, DC, USA : IEEE Computer Society, 2005, pp. 192197.42[53] A. Minaburo, Compression des en-têtes dans les réseaux haut-débit, Ph.D.dissertation, Université de Rennes I, December 2003. 42[54] A. Couvreur, L.-M. Le Ny, A. Minaburo, G. Rubino, B. Sericola, andL. Toutain, Performance analysis of an header compression protocol : Therohc unidirectional mode, INRIA, Research Report RR-5300, 2004. [Online].Available : http://hal.inria.fr/inria-00070700/PDF/RR-5300.pdf 42
Bibliographie 123[55] E. N. Gilbert, Capacity of a burst-noise channel, The Bell System TechnicalJournal, vol. 39, pp. 12531265, Sep. 1960. 46[56] E. O. Elliott, Estimates of error rates for codes on burst-noise channels, TheBell System Technical Journal, vol. 42, pp. 19771997, Sep. 1963. 46[57] ETSI "Digital Video Broadcasting (DVB) ; Framing structure, channel codingand modulation for 11/12 GHz satellite services" European Standard EN 300421 V1.1.2, ETSI, 1997. 46[58] ETSI "Digital Video Broadcasting (DVB) ; Second generation framing structure,channel coding and modulation systems for Broadcasting, Interactive Services,News Gathering and other broadband satellite applications (DVB-S2)" EN 302307 V1.2.1, ETSI, 2009. 46[59] M. Yajnik, S. Moon, J. Kurose, and D. Towsley, Measurement and modeling ofthe temporal dependence in packet loss, in INFOCOM, 1999, pp. 345352. 46[60] J.-C. Bolot, S. Fosse-Parisis, and D. Towsley, Adaptive fec-based error controlfor internet telephony, INFOCOM '99. Eighteenth Annual Joint Conference ofthe IEEE Computer and Communications Societies. Proceedings. IEEE, vol. 3,pp. 14531460 vol.3, Mar 1999. 46[61] M. Degermark, M. Engan, B. Nordgren, and S. Pink, Low-loss tcp/ip headercompression for wireless networks, In Proceedings from MobiCom, 1996. 65[62] J. Aikat, J. Kaur, F. Donelson, and S. K. Jeay, Variability in tcp round-triptimes, 3rd ACM SIGCOMM conference on Internet measurement, 2003. 68[63] F. Vacirca, F. Ricciato, and R. Pilz, Large-scale RTT measurements from anoperational umts/gprs network, First International Conference on Wireless Internet,pp. 190197, 2005. 69[64] G. Sawar, E. Lochin, and R. Boreli, Experimental performance of dccp over livesatellite and long range wireless links, International Symposium on Communicationsand Information Technologies (ISCIT07), pp. 689694, Oct. 2007. 69[65] J. A. Perez, B. Donnet, and O. Bonaventure, Preliminary analysis of the tcpbehavior in 802.16 networks, 1st WEIRD Workshop on WiMAX, Wireless andMobility, May 2007. 69[66] C. Studholme and I. Blake, Windowed erasure codes, Information Theory, 2006IEEE International Symposium on, pp. 509513, July 2006. 72[67] , Random matrices and codes for the erasure channel, Algorithmica, April2008. 72[68] T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, Design of capacityapproachingirregular low-density parity-check codes, IEEE Trans. Inform.Theory, vol. 47, pp. 619637, 2001. 79[69] G. H. Golub and C. F. van Loan, Matrix Computations, 3rd ed. Johns HopkinsUniversity Press, 1996. 80
Page 1 and 2:
THÈSEEn vue de l'obtention duDOCTO
Page 4 and 5:
iiannée de thèse : Julien, Paul,
Page 6 and 7:
ivTable des matières4.3 Analyse th
Page 8 and 9:
viTable des gures4.2 Matrice de par
Page 11 and 12:
Chapitre 1IntroductionLes thèses l
Page 13:
1.2. Organisation du document 3une
Page 16 and 17:
6 Chapitre 2. Etat de l'art et prin
Page 18 and 19:
8 Chapitre 2. Etat de l'art et prin
Page 20 and 21:
10 Chapitre 2. Etat de l'art et pri
Page 22 and 23:
Page 24 and 25:
Page 26 and 27:
Page 28 and 29:
Page 30 and 31:
Page 32 and 33:
Page 34 and 35:
Page 36 and 37:
Page 38 and 39:
Page 40 and 41:
Page 42 and 43:
Page 44 and 45:
Page 46 and 47:
Page 48 and 49:
Page 50 and 51:
Page 52 and 53:
Page 54 and 55:
44 Chapitre 3. Modélisation d'un p
Page 56 and 57:
Page 58 and 59:
Page 60 and 61:
Page 62 and 63:
Page 64 and 65:
Page 66 and 67:
Page 68 and 69:
Page 70 and 71:
Page 72 and 73:
Page 74 and 75:
Page 76 and 77:
Page 78 and 79:
Page 81 and 82: Chapitre 4Codes à eacements à dé
Page 83 and 84: 4.2. Construction des codes à matr
Page 89 and 90: 4.3. Analyse théorique 79décalage
Page 91 and 92: 4.4. Résultats obtenus 81 Les code
Page 93 and 94: 4.5. Conclusion 83véritable comple
Page 95 and 96: Chapitre 5Codes de Reed-Muller pour
Page 97 and 98: 5.2. Présentation du code 87Une m
Page 99 and 100: 5.2. Présentation du code 89Figure
Page 101 and 102: 5.2. Présentation du code 91invers
Page 103 and 104: 5.3. Résultats de simulation 93Fig
Page 105: 5.4. Conclusion 955.4 ConclusionNou
Page 108 and 109: 98 Chapitre 6. Codes à eacements M
Page 110 and 111: 100 Chapitre 6. Codes à eacements
Page 126 and 127: 116 Chapitre 7. Conclusion et persp
Page 129 and 130: Bibliographie[1] C. E. Shannon, A m
Page 131: Bibliographie 121[32] ETSI IP Datac
Page 135: Bibliographie 125[87] S. Li and J.
show all

Mécanismes de fiabilisation pro-actifs - ISAE

Create successful ePaper yourself

Delete template?

Save as template?