{"title":"隐蔽存储信道的带宽计算模型及其应用","authors":"Chii-Ren Tsai, V. Gligor","doi":"10.1109/SECPRI.1988.8103","DOIUrl":null,"url":null,"abstract":"A Markov model for bandwidth computation and its application to Secure Xenix are presented. The model can be used for computing the bandwidth of both individual channels and aggregated channels (i.e. serial and parallel aggregation). Using this model, a tool has been built and experiments conducted to determine the factors that affect the bandwidth of covert storage channels (noise, scheduling delays, load, etc.). The tool can be used to compute the minimum delays for each channel under various loads and program behavior. Thus, it allows the placement of dynamically adjustable delays in multiprogrammed systems, which guarantees minimum performance impact. >","PeriodicalId":131674,"journal":{"name":"Proceedings. 1988 IEEE Symposium on Security and Privacy","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"50","resultStr":"{\"title\":\"A bandwidth computation model for covert storage channels and its applications\",\"authors\":\"Chii-Ren Tsai, V. Gligor\",\"doi\":\"10.1109/SECPRI.1988.8103\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A Markov model for bandwidth computation and its application to Secure Xenix are presented. The model can be used for computing the bandwidth of both individual channels and aggregated channels (i.e. serial and parallel aggregation). Using this model, a tool has been built and experiments conducted to determine the factors that affect the bandwidth of covert storage channels (noise, scheduling delays, load, etc.). The tool can be used to compute the minimum delays for each channel under various loads and program behavior. Thus, it allows the placement of dynamically adjustable delays in multiprogrammed systems, which guarantees minimum performance impact. >\",\"PeriodicalId\":131674,\"journal\":{\"name\":\"Proceedings. 1988 IEEE Symposium on Security and Privacy\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-04-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"50\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 1988 IEEE Symposium on Security and Privacy\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECPRI.1988.8103\",\"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. 1988 IEEE Symposium on Security and Privacy","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECPRI.1988.8103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A bandwidth computation model for covert storage channels and its applications
A Markov model for bandwidth computation and its application to Secure Xenix are presented. The model can be used for computing the bandwidth of both individual channels and aggregated channels (i.e. serial and parallel aggregation). Using this model, a tool has been built and experiments conducted to determine the factors that affect the bandwidth of covert storage channels (noise, scheduling delays, load, etc.). The tool can be used to compute the minimum delays for each channel under various loads and program behavior. Thus, it allows the placement of dynamically adjustable delays in multiprogrammed systems, which guarantees minimum performance impact. >
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
