{"title":"探索HTTP/2报头压缩","authors":"Kazuhiko Yamamoto, T. Tsujikawa, Kazuho Oku","doi":"10.1145/3095786.3095787","DOIUrl":null,"url":null,"abstract":"For every HTTP/1.1 request and response, almost the same set of headers is transferred. This wastes bandwidth, the most expensive resource of the browser-server communication. To solve this issue, header compression for HTTP/2 was standardized. During the standardization, we found that one element of the compression technology, the so called reference set, contributes little to the compression ratio while its mechanism is complicated. With our proposal, the reference set was removed and the specification and implementations were drastically simplified. For high performance implementation of header compression, we devised token-based reverse indices, length guessing for Huffman encoding, and pre-calculated state transitions for Huffman decoding.","PeriodicalId":209819,"journal":{"name":"Proceedings of the 12th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Exploring HTTP/2 Header Compression\",\"authors\":\"Kazuhiko Yamamoto, T. Tsujikawa, Kazuho Oku\",\"doi\":\"10.1145/3095786.3095787\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For every HTTP/1.1 request and response, almost the same set of headers is transferred. This wastes bandwidth, the most expensive resource of the browser-server communication. To solve this issue, header compression for HTTP/2 was standardized. During the standardization, we found that one element of the compression technology, the so called reference set, contributes little to the compression ratio while its mechanism is complicated. With our proposal, the reference set was removed and the specification and implementations were drastically simplified. For high performance implementation of header compression, we devised token-based reverse indices, length guessing for Huffman encoding, and pre-calculated state transitions for Huffman decoding.\",\"PeriodicalId\":209819,\"journal\":{\"name\":\"Proceedings of the 12th International Conference on Future Internet Technologies\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 12th International Conference on Future Internet Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3095786.3095787\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 12th International Conference on Future Internet Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3095786.3095787","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
For every HTTP/1.1 request and response, almost the same set of headers is transferred. This wastes bandwidth, the most expensive resource of the browser-server communication. To solve this issue, header compression for HTTP/2 was standardized. During the standardization, we found that one element of the compression technology, the so called reference set, contributes little to the compression ratio while its mechanism is complicated. With our proposal, the reference set was removed and the specification and implementations were drastically simplified. For high performance implementation of header compression, we devised token-based reverse indices, length guessing for Huffman encoding, and pre-calculated state transitions for Huffman decoding.