{"title":"LAWIN:一种延迟感知的互联网架构,用于在尽力而为的网络上支持延迟","authors":"Katsushi Kobayashi","doi":"10.1109/HPSR.2015.7483104","DOIUrl":null,"url":null,"abstract":"While strict latency restrictions are imposed on network applications, current best-effort Internet architecture entirely lacks this support. In this paper, we propose a “Latency AWare InterNet” (LAWIN) architecture that supports various latency requirements while retaining the best-effort service model. In the LAWIN architecture, applications specify their desired network latency limits, or deadlines, into all packets, and routers schedule these packets according to their deadlines. To this end, we propose two earliest-deadline-first (EDF)-based packet schedulers. The first imposes the same packet loss rate on all applications regardless of the latency specified by each, and provides rough flow-rate fairness. The second scheduler imposes a biased packet loss probability. The biased scheduler also provides an efficient latency and bandwidth trading mechanism for application settings, which motivates applications to set optimal latencies in order to improve efficiency.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"LAWIN: A Latency-AWare InterNet architecture for latency support on best-effort networks\",\"authors\":\"Katsushi Kobayashi\",\"doi\":\"10.1109/HPSR.2015.7483104\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"While strict latency restrictions are imposed on network applications, current best-effort Internet architecture entirely lacks this support. In this paper, we propose a “Latency AWare InterNet” (LAWIN) architecture that supports various latency requirements while retaining the best-effort service model. In the LAWIN architecture, applications specify their desired network latency limits, or deadlines, into all packets, and routers schedule these packets according to their deadlines. To this end, we propose two earliest-deadline-first (EDF)-based packet schedulers. The first imposes the same packet loss rate on all applications regardless of the latency specified by each, and provides rough flow-rate fairness. The second scheduler imposes a biased packet loss probability. The biased scheduler also provides an efficient latency and bandwidth trading mechanism for application settings, which motivates applications to set optimal latencies in order to improve efficiency.\",\"PeriodicalId\":360703,\"journal\":{\"name\":\"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)\",\"volume\":\"86 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR.2015.7483104\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2015.7483104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
LAWIN: A Latency-AWare InterNet architecture for latency support on best-effort networks
While strict latency restrictions are imposed on network applications, current best-effort Internet architecture entirely lacks this support. In this paper, we propose a “Latency AWare InterNet” (LAWIN) architecture that supports various latency requirements while retaining the best-effort service model. In the LAWIN architecture, applications specify their desired network latency limits, or deadlines, into all packets, and routers schedule these packets according to their deadlines. To this end, we propose two earliest-deadline-first (EDF)-based packet schedulers. The first imposes the same packet loss rate on all applications regardless of the latency specified by each, and provides rough flow-rate fairness. The second scheduler imposes a biased packet loss probability. The biased scheduler also provides an efficient latency and bandwidth trading mechanism for application settings, which motivates applications to set optimal latencies in order to improve efficiency.