Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797665
Yuxing Han, Jiangtao Wen, J. Villasenor
We present a simple source coding algorithm for independent and identically distributed (i.i.d.) sources that gives coding efficiency performance close to that of arithmetic coding, but with much lower computational complexity and much higher robustness to mismatches between the assumed and actual symbol probabilities. The method is based on the principle that the probability of occurrence of a symbol sequence is determined by the total number of occurrences of each member of the symbol alphabet, but not by the order of occurrences. Thus, the coding of a string of symbols can be accomplished in three steps. First, the sequence length M is encoded using an exp-Golomb code. Second, the symbol occurrences frequencies are coded using exp-Golomb codes. Third, a set of fixed length codes are used to select among the equiprobable candidate sequences. In contrast with arithmetic coding, which involves significant computation during the process of encoding and decoding, in the method described here the actual encoding and decoding are extremely simple. Furthermore, the proposed algorithm is robust to mismatches between the assumed and actual symbol probabilities.
{"title":"Entropy coding using equiprobable partitioning","authors":"Yuxing Han, Jiangtao Wen, J. Villasenor","doi":"10.1109/ALLERTON.2008.4797665","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797665","url":null,"abstract":"We present a simple source coding algorithm for independent and identically distributed (i.i.d.) sources that gives coding efficiency performance close to that of arithmetic coding, but with much lower computational complexity and much higher robustness to mismatches between the assumed and actual symbol probabilities. The method is based on the principle that the probability of occurrence of a symbol sequence is determined by the total number of occurrences of each member of the symbol alphabet, but not by the order of occurrences. Thus, the coding of a string of symbols can be accomplished in three steps. First, the sequence length M is encoded using an exp-Golomb code. Second, the symbol occurrences frequencies are coded using exp-Golomb codes. Third, a set of fixed length codes are used to select among the equiprobable candidate sequences. In contrast with arithmetic coding, which involves significant computation during the process of encoding and decoding, in the method described here the actual encoding and decoding are extremely simple. Furthermore, the proposed algorithm is robust to mismatches between the assumed and actual symbol probabilities.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134463862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797635
P. Marbach, A. Eryilmaz
We propose and analyze a distributed backlog-based CSMA policy to achieve fairness and throughput-optimality in wireless multihop networks. The analysis is based on a CSMA fixed point approximation that is accurate for large networks with many small flows and a small sensing period.
{"title":"A backlog-based CSMA mechanism to achieve fairness and throughput-optimality in multihop wireless networks","authors":"P. Marbach, A. Eryilmaz","doi":"10.1109/ALLERTON.2008.4797635","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797635","url":null,"abstract":"We propose and analyze a distributed backlog-based CSMA policy to achieve fairness and throughput-optimality in wireless multihop networks. The analysis is based on a CSMA fixed point approximation that is accurate for large networks with many small flows and a small sensing period.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"341 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134077115","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797673
Changho Suh, David Tse
In this paper, we propose a new way of interference management for cellular networks. We develop the scheme that approaches to interference-free degree-of-freedom (dof) as the number K of users in each cell increases. Also we find the corresponding bandwidth scaling conditions for typical wireless channels: multi-path channels and single-path channels with propagation delay. The scheme is based on interference alignment. Especially for more-than-two-cell cases where there are multiple non-intended BSs, we propose a new version of interference alignment, namely subspace interference alignment. The idea is to align interferences into multi-dimensional subspace (instead of one dimension) for simultaneous alignments at multiple non-intended BSs. The proposed scheme requires finite dimensions growing linearly with K, i.e., ~O(K).
{"title":"Interference Alignment for Cellular Networks","authors":"Changho Suh, David Tse","doi":"10.1109/ALLERTON.2008.4797673","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797673","url":null,"abstract":"In this paper, we propose a new way of interference management for cellular networks. We develop the scheme that approaches to interference-free degree-of-freedom (dof) as the number K of users in each cell increases. Also we find the corresponding bandwidth scaling conditions for typical wireless channels: multi-path channels and single-path channels with propagation delay. The scheme is based on interference alignment. Especially for more-than-two-cell cases where there are multiple non-intended BSs, we propose a new version of interference alignment, namely subspace interference alignment. The idea is to align interferences into multi-dimensional subspace (instead of one dimension) for simultaneous alignments at multiple non-intended BSs. The proposed scheme requires finite dimensions growing linearly with K, i.e., ~O(K).","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124738666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797721
P. Venkitasubramaniam, V. Anantharam
The analysis of a multi-source single-destination network of mixes is considered under strict latency constraints at each mix. Mixes are relay nodes that accept packets arriving from multiple sources and release them after variable delays to prevent an eavesdropper from perfectly identifying the sources of outgoing packets (also, the contents of the packets are encrypted to prevent these from being used to correlate the arrivals to the mix with its departures). Using an entropy-based measure to quantify anonymity, the anonymity provided by such a single-destination network of mixes is analyzed, with the focus on light traffic conditions. A general upper bound is presented that bounds the anonymity of a single-destination mix network in terms of a linear combination of the anonymity of two-stage networks. By using a specific mixing strategy, a lower bound is provided on the light traffic derivative of the anonymity of single-destination mix networks. The light traffic derivative of the upper bound coincides with the lower bound for the case of mix-cascades (linear single-destination mix networks). Thus, the optimal light traffic derivative of the anonymity is characterized for mix cascades.
{"title":"Anonymity under light traffic conditions using a network of mixes","authors":"P. Venkitasubramaniam, V. Anantharam","doi":"10.1109/ALLERTON.2008.4797721","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797721","url":null,"abstract":"The analysis of a multi-source single-destination network of mixes is considered under strict latency constraints at each mix. Mixes are relay nodes that accept packets arriving from multiple sources and release them after variable delays to prevent an eavesdropper from perfectly identifying the sources of outgoing packets (also, the contents of the packets are encrypted to prevent these from being used to correlate the arrivals to the mix with its departures). Using an entropy-based measure to quantify anonymity, the anonymity provided by such a single-destination network of mixes is analyzed, with the focus on light traffic conditions. A general upper bound is presented that bounds the anonymity of a single-destination mix network in terms of a linear combination of the anonymity of two-stage networks. By using a specific mixing strategy, a lower bound is provided on the light traffic derivative of the anonymity of single-destination mix networks. The light traffic derivative of the upper bound coincides with the lower bound for the case of mix-cascades (linear single-destination mix networks). Thus, the optimal light traffic derivative of the anonymity is characterized for mix cascades.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132114014","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797714
S. Puducheri, T. Fuja
This paper considers two simple wireless network configurations in which the links making up the network do not interfere with one another and the assumed link loss mechanisms are erasures. The first configuration is the M-source multiple access relay channel (MARC), in which M different sources convey information to a single destination with the help of a single relay. The second configuration is the two-fold multi-relay channel (MRC), in which a pair of relays help a single source convey information to a single destination. Cut set bounds are established for these configurations, and linear programming is then employed to formulate closed-form solutions for the capacity regions as a function of the link parameters; moreover, it is shown that easily-implemented capacity-approaching codes such as LDPC or Tornado codes can be used at the link level to achieve any point in the capacity region. For the erasure MARC, the results indicate that the relay should help only those sources that have a weaker direct channel to the destination than the relay itself does - regardless of the quality of the source-to-relay channels. For the erasure MRC, the solution is not as intuitive, but it displays a structure in which the relative quality of the various links determine which relays are used - and, when both are used, which relay is ldquoprimaryrdquo and which is ldquosecondaryrdquo.
{"title":"Capacity results for certain wireless relay networks with erasure links","authors":"S. Puducheri, T. Fuja","doi":"10.1109/ALLERTON.2008.4797714","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797714","url":null,"abstract":"This paper considers two simple wireless network configurations in which the links making up the network do not interfere with one another and the assumed link loss mechanisms are erasures. The first configuration is the M-source multiple access relay channel (MARC), in which M different sources convey information to a single destination with the help of a single relay. The second configuration is the two-fold multi-relay channel (MRC), in which a pair of relays help a single source convey information to a single destination. Cut set bounds are established for these configurations, and linear programming is then employed to formulate closed-form solutions for the capacity regions as a function of the link parameters; moreover, it is shown that easily-implemented capacity-approaching codes such as LDPC or Tornado codes can be used at the link level to achieve any point in the capacity region. For the erasure MARC, the results indicate that the relay should help only those sources that have a weaker direct channel to the destination than the relay itself does - regardless of the quality of the source-to-relay channels. For the erasure MRC, the solution is not as intuitive, but it displays a structure in which the relative quality of the various links determine which relays are used - and, when both are used, which relay is ldquoprimaryrdquo and which is ldquosecondaryrdquo.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133443788","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797630
G. Caire, S. Ramprashad, H. Papadopoulos, C. Pépin, C. Sundberg
We consider a realistic albeit simplified scenario for wireless cellular systems of the next generation (4G and beyond), where MIMO-OFDM, opportunistic scheduling, channel state information at the transmitter and limited base-station cooperation are envisaged. We propose two strategies with limited base-station cooperation that can be easily implemented with today's technology and achieve an approximate form of inter-cell interference alignment. The first strategy consists of imposing a ldquopower maskrdquo in frequency such that adjacent cooperative clusters of base stations generate different interference levels in different frequency subchannels. The second strategy consists of switching between different cooperative clusters such that no user is in a permanently disadvantaged location.We compare single-user and multiuser MIMO systems in terms of average throughput as a function of the user location.
{"title":"Multiuser MIMO downlink with limited inter-cell cooperation: Approximate interference alignment in time, frequency and space","authors":"G. Caire, S. Ramprashad, H. Papadopoulos, C. Pépin, C. Sundberg","doi":"10.1109/ALLERTON.2008.4797630","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797630","url":null,"abstract":"We consider a realistic albeit simplified scenario for wireless cellular systems of the next generation (4G and beyond), where MIMO-OFDM, opportunistic scheduling, channel state information at the transmitter and limited base-station cooperation are envisaged. We propose two strategies with limited base-station cooperation that can be easily implemented with today's technology and achieve an approximate form of inter-cell interference alignment. The first strategy consists of imposing a ldquopower maskrdquo in frequency such that adjacent cooperative clusters of base stations generate different interference levels in different frequency subchannels. The second strategy consists of switching between different cooperative clusters such that no user is in a permanently disadvantaged location.We compare single-user and multiuser MIMO systems in terms of average throughput as a function of the user location.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133879883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797662
Yongzhi Wang, T. Fu, D. Chiu
In unstructured P2P content distribution systems, the most important algorithms to ensure optimal flow of content along multiple dynamically created distribution trees are piece selection algorithms and load balancing algorithms. This paper models practical load balancing algorithms and derives a number of insights.
{"title":"Analysis of load balancing algorithms in P2P streaming","authors":"Yongzhi Wang, T. Fu, D. Chiu","doi":"10.1109/ALLERTON.2008.4797662","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797662","url":null,"abstract":"In unstructured P2P content distribution systems, the most important algorithms to ensure optimal flow of content along multiple dynamically created distribution trees are piece selection algorithms and load balancing algorithms. This paper models practical load balancing algorithms and derives a number of insights.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132664132","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797684
Zhaohui Zheng, H. Zha, Gordon Sun
Ranking functions determine the relevance of search results of search engines, and learning ranking functions has become an active research area at the interface between Web search, information retrieval and machine learning. Generally, the training data for learning to rank come in two different forms: (1) absolute relevance judgments assessing the degree of relevance of a document with respect to a query. This type of judgments is also called labeled data and are usually obtained through human editorial efforts; and (2) relative relevance judgments indicating that a document is more relevant than another with respect to a query. This type of judgments is also called preference data and can usually be extracted from the abundantly available user click-through data recording users' interactions with the search results. Most existing learning to rank methods ignore the query boundaries, treating the labeled data or preference data equally across queries. In this paper, we propose a minimum effort optimization method that takes into account the entire training data within a query at each iteration. We tackle this optimization problem using functional iterative methods where the update at each iteration is computed by solving an isotonic regression problem. This more global approach results in faster convergency and signficantly improved performance of the learned ranking functions over existing state-of-the-art methods. We demonstrate the effectiveness of the proposed method using data sets obtained from a commercial search engine as well as publicly available data.
{"title":"Query-level learning to rank using isotonic regression","authors":"Zhaohui Zheng, H. Zha, Gordon Sun","doi":"10.1109/ALLERTON.2008.4797684","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797684","url":null,"abstract":"Ranking functions determine the relevance of search results of search engines, and learning ranking functions has become an active research area at the interface between Web search, information retrieval and machine learning. Generally, the training data for learning to rank come in two different forms: (1) absolute relevance judgments assessing the degree of relevance of a document with respect to a query. This type of judgments is also called labeled data and are usually obtained through human editorial efforts; and (2) relative relevance judgments indicating that a document is more relevant than another with respect to a query. This type of judgments is also called preference data and can usually be extracted from the abundantly available user click-through data recording users' interactions with the search results. Most existing learning to rank methods ignore the query boundaries, treating the labeled data or preference data equally across queries. In this paper, we propose a minimum effort optimization method that takes into account the entire training data within a query at each iteration. We tackle this optimization problem using functional iterative methods where the update at each iteration is computed by solving an isotonic regression problem. This more global approach results in faster convergency and signficantly improved performance of the learned ranking functions over existing state-of-the-art methods. We demonstrate the effectiveness of the proposed method using data sets obtained from a commercial search engine as well as publicly available data.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"6 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133768573","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797569
M. Raginsky
This paper deals with information capacities of Gaussian channels under small (but nonvanishing) peak power constraints. We prove that, when the peak amplitude is below 1.05, the capacity of the scalar Gaussian channel is achieved by symmetric equiprobable signaling and is equal to at least 80% of the corresponding average-power capacity. The proof uses the identity of Guo, Shamai and Verdu that relates mutual information and minimum mean square error in Gaussian channels, together with several results on the minimax estimation of a bounded parameter in white Gaussian noise. We also give upper and lower bounds on peak-power capacities of vector Gaussian channels whose inputs are constrained to lie in suitably small ellipsoids and show that we can achieve at least 80% of the average-power capacity by having the transmitters use symmetric equiprobable signaling at amplitudes determined from the usual water-filling policy. The 80% figure comes from an upper bound on the ratio of the nonlinear and the linear minimax risks of estimating a bounded parameter in white Gaussian noise.
{"title":"On the information capacity of Gaussian channels under small peak power constraints","authors":"M. Raginsky","doi":"10.1109/ALLERTON.2008.4797569","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797569","url":null,"abstract":"This paper deals with information capacities of Gaussian channels under small (but nonvanishing) peak power constraints. We prove that, when the peak amplitude is below 1.05, the capacity of the scalar Gaussian channel is achieved by symmetric equiprobable signaling and is equal to at least 80% of the corresponding average-power capacity. The proof uses the identity of Guo, Shamai and Verdu that relates mutual information and minimum mean square error in Gaussian channels, together with several results on the minimax estimation of a bounded parameter in white Gaussian noise. We also give upper and lower bounds on peak-power capacities of vector Gaussian channels whose inputs are constrained to lie in suitably small ellipsoids and show that we can achieve at least 80% of the average-power capacity by having the transmitters use symmetric equiprobable signaling at amplitudes determined from the usual water-filling policy. The 80% figure comes from an upper bound on the ratio of the nonlinear and the linear minimax risks of estimating a bounded parameter in white Gaussian noise.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117257313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-09-01DOI: 10.1109/ALLERTON.2008.4797565
G. Theodorakopoulos, J. Baras, J. Le Boudec
A network user's decision to start and continue using security products is based on economic considerations. The cost of a security compromise (e.g., worm infection) is compared against the cost of deploying and maintaining a sufficient level of security. These costs are not necessarily the real ones, but rather the perceived costs, which depend on the amount of information available to a user at each time. Moreover, the costs (whether real or perceived) depend on the decisions of other users, too: The probability of a user getting infected depends on the security deployed by all the other users. In this paper, we combine an epidemic model for malware propagation in a network with a game theoretic model of the users' decisions to deploy security or not. Users can dynamically change their decision in order to maximize their currently perceived utility. We study the equilibrium points, and their dependence on the speed of the learning process through which the users learn the state of the network. We find that the faster the learning process, the higher the total network cost.
{"title":"Dynamic network security deployment under partial information","authors":"G. Theodorakopoulos, J. Baras, J. Le Boudec","doi":"10.1109/ALLERTON.2008.4797565","DOIUrl":"https://doi.org/10.1109/ALLERTON.2008.4797565","url":null,"abstract":"A network user's decision to start and continue using security products is based on economic considerations. The cost of a security compromise (e.g., worm infection) is compared against the cost of deploying and maintaining a sufficient level of security. These costs are not necessarily the real ones, but rather the perceived costs, which depend on the amount of information available to a user at each time. Moreover, the costs (whether real or perceived) depend on the decisions of other users, too: The probability of a user getting infected depends on the security deployed by all the other users. In this paper, we combine an epidemic model for malware propagation in a network with a game theoretic model of the users' decisions to deploy security or not. Users can dynamically change their decision in order to maximize their currently perceived utility. We study the equilibrium points, and their dependence on the speed of the learning process through which the users learn the state of the network. We find that the faster the learning process, the higher the total network cost.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115131483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：