International Conference on Information and Computation Economies最新文献_第8页

Symbolic Implementation of Connectors in BIP BIP中连接器的符号实现

International Conference on Information and Computation Economies Pub Date : 2009-11-28 DOI: 10.4204/EPTCS.12.3

Mohamad Jaber, A. Basu, S. Bliudze

{"title":"Symbolic Implementation of Connectors in BIP","authors":"Mohamad Jaber, A. Basu, S. Bliudze","doi":"10.4204/EPTCS.12.3","DOIUrl":"https://doi.org/10.4204/EPTCS.12.3","url":null,"abstract":"BIP is a component framework for constructing systems by superposing three layers of modeling: Behavior, Interaction, and Priority. Behavior is represented by labeled transition systems communicating through ports. Interactions are sets of ports. A synchronization between components is possible through the interactions specified by a set of connectors. When several interactions are possible, priorities allow to restrict the non-determinism by choosing an interaction, which is maximal according to some given strict partial order. The BIP component framework has been implemented in a language and a tool-set. The execution of a BIP program is driven by a dedicated engine, which has access to the set of connectors and priority model of the program. A key performance issue is the computation of the set of possible interactions of the BIP program from a given state. Currently, the choice of the interaction to be executed involves a costly exploration of enumerative representations for connectors. This leads to a considerable overhead in execution times. In this paper, we propose a symbolic implementation of the execution model of BIP, which drastically reduces this overhead. The symbolic implementation is based on computing boolean representation for components, connectors, and priorities with an existing BDD package.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115308708","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

Integrated Structure and Semantics for Reo Connectors and Petri Nets Reo连接器和Petri网的集成结构和语义

International Conference on Information and Computation Economies Pub Date : 2009-11-28 DOI: 10.4204/EPTCS.12.4

Christian Krause

引用次数: 9

Choreographies with Secure Boxes and Compromised Principals 带有安全盒和受损主体的编排

International Conference on Information and Computation Economies Pub Date : 2009-11-28 DOI: 10.4204/EPTCS.12.1

Marco Carbone, J. Guttman

{"title":"Choreographies with Secure Boxes and Compromised Principals","authors":"Marco Carbone, J. Guttman","doi":"10.4204/EPTCS.12.1","DOIUrl":"https://doi.org/10.4204/EPTCS.12.1","url":null,"abstract":"Strand spaces provide a semantics for these choreographies, in which some roles may be played by compromised principals. A skeleton is a partially ordered structure containing local behaviors (strands) executed by regular (non-compromised) principals. A skeleton is realized if it contains enough regular strands so that it could actually occur, in combination with any possible activity of compromised principals. It is delivery guaranteed (DG) realized if, in addition, every message transmitted to a regular participant is also delivered. We define a novel transition system on skeletons, in which the steps add regular strands. These steps solve tests, i.e. parts of the skeleton that could not occur without additional regular behavior. We prove three main results about the transition system. First, each minimal DG realized skeleton is reachable, using the transition system, from any skeleton it embeds. Second, if no step is possible from a skeleton A, then A is DG realized. Finally, if a DG realized A 0 is accessible from A, then A 0 is minimal. Thus, the transition system provides a systematic way to construct the possible behaviors of the choreography, in the presence of compromised principals.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121781886","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

Network control and usage-based charging: is charging for volume adequate? 网络控制和基于使用的收费:按容量收费是否足够?

International Conference on Information and Computation Economies Pub Date : 1998-10-28 DOI: 10.1145/288994.289012

C. Courcoubetis, V. Siris, G. Stamoulis

{"title":"Network control and usage-based charging: is charging for volume adequate?","authors":"C. Courcoubetis, V. Siris, G. Stamoulis","doi":"10.1145/288994.289012","DOIUrl":"https://doi.org/10.1145/288994.289012","url":null,"abstract":"There has been extensive research on the applierdion of the efFective bandwidth concept for quantifying resource usage in order to create simple yet eRective usag~based charging schemes with desirable incentive properties. This research has shown that simple charging schemes which involve two measurements, time and volume, can serve their purpose well by producing adequate approximations of the effective usage of a lmrsty trailic stream. An issne that has not been addressed in detail is the relation between the type of admission control meehanism the network uses and the definition of efective usage. b particular, the above charging schemes assume “static” Connection Admission Control (C.4C). Ii contrast to static C..4C, “dynamic” C.4C strategies utilize on-line measurements of the actual load, hence can achieve mnrihhigher utilization. We argue that under such dynamic strategies the efective usage concept mnst be redefined, and that when control actions occur at faster time scales than the burstiness of the sources, the eifective usage approaches the mean rate of the sonrces. In addition to jnstifjing the potential use of simple ~olnrm+based tarii%, the above justifies the deployment of sophisticated dynamic admission control mechanism s, since these result in more competitive prices.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126501835","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}

引用次数: 5

Surfing as a real option 冲浪是一个真正的选择

International Conference on Information and Computation Economies Pub Date : 1998-10-28 DOI: 10.1145/288994.289003

R. Lukose, B. Huberman

引用次数: 25

A simulation study of competitive Internet pricing: AOL flat rates versus GSW usage prices 竞争性互联网定价的模拟研究:AOL统一费率与GSW使用价格

International Conference on Information and Computation Economies Pub Date : 1998-10-28 DOI: 10.1145/288994.289010

D. Stahl, Andrew Whinston, Keqiang Zhang

引用次数: 10

Foresight-based pricing algorithms in an economy of software agents 软件代理经济中基于预见的定价算法

International Conference on Information and Computation Economies Pub Date : 1998-10-28 DOI: 10.1145/288994.289002

G. Tesauro, J. Kephart

引用次数: 36

The POPCORN market—an online market for computational resources POPCORN市场——计算资源的在线市场

International Conference on Information and Computation Economies Pub Date : 1998-10-28 DOI: 10.1145/288994.289027

O. Regev, N. Nisan

{"title":"The POPCORN market—an online market for computational resources","authors":"O. Regev, N. Nisan","doi":"10.1145/288994.289027","DOIUrl":"https://doi.org/10.1145/288994.289027","url":null,"abstract":"The POPCORN project provides an infrastructure for globally distributed computation over the whole Internet. It provides any programmer connected to the Internet with a single huge virtual parallel computer composed of all processors on the Internet, which care to participate at any given moment. POPCORN provides a marketbased mechanism for trade in CPU time to motivate processors to provide their CPU cycles for other peoples’ computations. “Selling” CPU time is as easy as visiting a certain web site with a Java-enabled browser. “Buying” CPU time is done by writing a parallel program using the POPCORN paradigm. A third entity in the POPCORN system is a “market” for CPU time, which is where buyers and sellers meet and trade. The POPCORN system may be visited on our website: http://www.cs.huji.ac.il/~popcorn. This paper concentrates on the POPCORN market. The market is a trusted intermediary that is responsible for matching buyers and sellers according to economic criteria. Our design emphasizes minimal communication requirements and minimal strategic considerations on the part of both buyers and sellers. We implemented several market mechanisms of the single-sided and double-sided auction types. We analyze the economic efficiency of these mechanisms using analytical and simulation methods. Our findings support the use of these mechanisms in the Internet environment.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123592286","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}

引用次数: 171

A cost-benefit framework for online management of a metacomputing system 元计算系统在线管理的成本效益框架

International Conference on Information and Computation Economies Pub Date : 1998-10-28 DOI: 10.1145/288994.289026

Y. Amir, B. Awerbuch, R. Borgstrom

引用次数: 58

Market based bandwidth allocation policies for QoS control in broadband networks 基于市场的宽带网络QoS控制带宽分配策略

International Conference on Information and Computation Economies Pub Date : 1998-10-28 DOI: 10.1145/288994.289018

D. Reininger, D. Raychaudhuri, M. Ott

引用次数: 16