{"title":"确定性服务时间队列中第一个缓冲区溢出时间的分布","authors":"A. Chydzinski, Ryszard Winiarczyk","doi":"10.1109/ISCC.2005.54","DOIUrl":null,"url":null,"abstract":"It has been argued recently that steady-state parameters (like cell loss probability) have important drawbacks when used as quality of service criteria of telecommunication networks. Therefore the first buffer overflow time has been proposed as an alternative, transient characteristic. In this paper the first buffer overflow time in a constant service rate queue is studied. In particular, the formulas for Laplace transform and expected value of its distribution for any initial queue size are proven. Moreover, numerical illustrations of analytical results are presented.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Distribution of the first buffer overflow time in a deterministic service time queue\",\"authors\":\"A. Chydzinski, Ryszard Winiarczyk\",\"doi\":\"10.1109/ISCC.2005.54\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It has been argued recently that steady-state parameters (like cell loss probability) have important drawbacks when used as quality of service criteria of telecommunication networks. Therefore the first buffer overflow time has been proposed as an alternative, transient characteristic. In this paper the first buffer overflow time in a constant service rate queue is studied. In particular, the formulas for Laplace transform and expected value of its distribution for any initial queue size are proven. Moreover, numerical illustrations of analytical results are presented.\",\"PeriodicalId\":315855,\"journal\":{\"name\":\"10th IEEE Symposium on Computers and Communications (ISCC'05)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"10th IEEE Symposium on Computers and Communications (ISCC'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCC.2005.54\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"10th IEEE Symposium on Computers and Communications (ISCC'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC.2005.54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distribution of the first buffer overflow time in a deterministic service time queue
It has been argued recently that steady-state parameters (like cell loss probability) have important drawbacks when used as quality of service criteria of telecommunication networks. Therefore the first buffer overflow time has been proposed as an alternative, transient characteristic. In this paper the first buffer overflow time in a constant service rate queue is studied. In particular, the formulas for Laplace transform and expected value of its distribution for any initial queue size are proven. Moreover, numerical illustrations of analytical results are presented.