{"title":"随机切换系统的最小交叉熵控制","authors":"A. Murgu","doi":"10.1109/ISIT.2001.936068","DOIUrl":null,"url":null,"abstract":"We consider a mathematical framework for switching systems of traffic streams based on the minimum cross entropy (MCE) approach. Linear models of traffic buffering processes are providing the control means through traffic splitting/merging and input-output connectivity patterns. The probabilistic description of general queueing systems deals with the stochastic flows in the switching nodes.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimum cross entropy control in stochastic switching systems\",\"authors\":\"A. Murgu\",\"doi\":\"10.1109/ISIT.2001.936068\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a mathematical framework for switching systems of traffic streams based on the minimum cross entropy (MCE) approach. Linear models of traffic buffering processes are providing the control means through traffic splitting/merging and input-output connectivity patterns. The probabilistic description of general queueing systems deals with the stochastic flows in the switching nodes.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2001.936068\",\"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. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.936068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Minimum cross entropy control in stochastic switching systems
We consider a mathematical framework for switching systems of traffic streams based on the minimum cross entropy (MCE) approach. Linear models of traffic buffering processes are providing the control means through traffic splitting/merging and input-output connectivity patterns. The probabilistic description of general queueing systems deals with the stochastic flows in the switching nodes.