ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)最新文献

筛选

英文中文

Mean Field Games in Nudge Systems for Societal Networks 社会网络助推系统中的平均场游戏

ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS) Pub Date : 2015-03-10 DOI: 10.1145/3232076

Jian Li, Bainan Xia, Xinbo Geng, Hao Ming, S. Shakkottai, V. Subramanian, Le Xie

{"title":"Mean Field Games in Nudge Systems for Societal Networks","authors":"Jian Li, Bainan Xia, Xinbo Geng, Hao Ming, S. Shakkottai, V. Subramanian, Le Xie","doi":"10.1145/3232076","DOIUrl":"https://doi.org/10.1145/3232076","url":null,"abstract":"We consider the general problem of resource sharing in societal networks, consisting of interconnected communication, transportation, energy, and other networks important to the functioning of society. Participants in such network need to take decisions daily, both on the quantity of resources to use as well as the periods of usage. With this in mind, we discuss the problem of incentivizing users to behave in such a way that society as a whole benefits. To perceive societal level impact, such incentives may take the form of rewarding users with lottery tickets based on good behavior and periodically conducting a lottery to translate these tickets into real rewards. We will pose the user decision problem as a mean field game and the incentives question as one of trying to select a good mean field equilibrium (MFE). In such a framework, each agent (a participant in the societal network) takes a decision based on an assumed distribution of actions of his/her competitors and the incentives provided by the social planner. The system is said to be at MFE if the agent’s action is a sample drawn from the assumed distribution. We will show the existence of such an MFE under general settings, and also illustrate how to choose an attractive equilibrium using as an example demand-response in the (smart) electricity network.","PeriodicalId":105474,"journal":{"name":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127147603","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}

引用次数: 12

Scheduling Storms and Streams in the Cloud 在云中调度风暴和流

ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS) Pub Date : 2015-02-20 DOI: 10.1145/2904080

Javad Ghaderi, S. Shakkottai

{"title":"Scheduling Storms and Streams in the Cloud","authors":"Javad Ghaderi, S. Shakkottai","doi":"10.1145/2904080","DOIUrl":"https://doi.org/10.1145/2904080","url":null,"abstract":"Motivated by emerging big streaming data processing paradigms (e.g., Twitter Storm, Streaming MapReduce), we investigate the problem of scheduling graphs over a large cluster of servers. Each graph is a job, where nodes represent compute tasks and edges indicate data flows between these compute tasks. Jobs (graphs) arrive randomly over time and, upon completion, leave the system. When a job arrives, the scheduler needs to partition the graph and distribute it over the servers to satisfy load balancing and cost considerations. Specifically, neighboring compute tasks in the graph that are mapped to different servers incur load on the network; thus a mapping of the jobs among the servers incurs a cost that is proportional to the number of “broken edges.” We propose a low-complexity randomized scheduling algorithm that, without service preemptions, stabilizes the system with graph arrivals/departures; more importantly, it allows a smooth tradeoff between minimizing average partitioning cost and average queue lengths. Interestingly, to avoid service preemptions, our approach does not rely on a Gibbs sampler; instead, we show that the corresponding limiting invariant measure has an interpretation stemming from a loss system.","PeriodicalId":105474,"journal":{"name":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131189667","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}

引用次数: 52

EQ 情商

ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS) Pub Date : 2009-09-15 DOI: 10.1145/3170430

C. Chu, Shannon Chen, Yu-Chuan Yen, Su-Ling Yeh, Hao-Hua Chu, Polly Huang

{"title":"EQ","authors":"C. Chu, Shannon Chen, Yu-Chuan Yen, Su-Ling Yeh, Hao-Hua Chu, Polly Huang","doi":"10.1145/3170430","DOIUrl":"https://doi.org/10.1145/3170430","url":null,"abstract":"The rising popularity of data calls and the slowed global economy have posed a challenge to voice data networking—how to satisfy the growing user demand for VoIP calls under limited network resources. In a bandwidth-constrained network in particular, raising the bitrate for one call implies a lowered bitrate for another. Therefore, knowing whether it is worthwhile to raise one call's bitrate while other users might complain is crucial to the design of a user-centric rate control mechanism. To this end, previous work (Chen et al. 2012) has reported a log-like relationship between bitrate and user experience (i.e., QoE) in Skype calls. To show that the relationship extends to more general VoIP calls, we conduct a 60-participant user study via the Amazon Mechanical Turk crowdsourcing platform and reaffirm the log-like relationship between the call bitrate and user experience in widely used AMR-WB. The relationship gives rise to a simple and practical rate control scheme that exponentially quantizes the steps of rate change, therefore the name—exponential quantization (EQ). To support that EQ is effective in addressing the challenge, we show through a formal analysis that the resulting bandwidth allocation is optimal in both the overall QoE and the number of calls served. To relate EQ to existing rate control mechanisms, we show in a simulation study that the bitrates of calls administered by EQ converge over time and outperform those controlled by a (naïve) greedy mechanism and the mechanism implemented in Skype.","PeriodicalId":105474,"journal":{"name":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128069628","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}

引用次数: 4

首页上一页