Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems最新文献

A modular analysis of network transmission protocols 网络传输协议的模块化分析

Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595157

M. Adler, Y. Bartal, J. Byers, M. Luby, D. Raz

{"title":"A modular analysis of network transmission protocols","authors":"M. Adler, Y. Bartal, J. Byers, M. Luby, D. Raz","doi":"10.1109/ISTCS.1997.595157","DOIUrl":"https://doi.org/10.1109/ISTCS.1997.595157","url":null,"abstract":"We propose a new model for the analysis of data transmission protocols in lossy communication networks. The overall goal of a data transmission protocol is to successfully transmit a message from the sender to the receiver We study the performance of protocols in an adversarial setting where the loss pattern and latencies of packets are determined by an adversary. We advocate the modular decomposition of data transmission protocols into a time scheduling policy, which determines when packets are to be sent, and a data selection policy, which determines what data is to be placed in each sent packet. We concentrate on the data selection policy and require that the protocol will achieve high bandwidth utilization in transmitting any prefix of the transmitted message. The simple and universal data selection policy we introduce is provably close to optimal in the following sense: For any time scheduling policy and any network behavior in the worst case prefix measure our data selection policy performs as well as any other data selection policy up to a constant additive term. Our explicit modular decomposition of a transmission protocol into two policies should be contrasted with existing network protocols such as TCP/IP. Our result shows that the performance of the overall transmission protocol would not degrade in performance (and could improve dramatically) if it used our universal data selection policy in place of its own. We therefore reduce the problem of designing a data transmission protocol to the task of designing a time scheduling policy.","PeriodicalId":367160,"journal":{"name":"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116284710","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

Optimal point-to-point broadcast algorithms via lopsided trees 基于不平衡树的最佳点对点广播算法

Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595158

M. Golin, A. Schuster

引用次数: 17

Graph decompositions and factorizing permutations 图的分解和排列的分解

Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595165

C. Capelle, M. Habib

引用次数: 40

Optimal query bounds for reconstructing a Hamiltonian cycle in complete graphs 完全图中重构哈密顿循环的最优查询界

Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595169

Vladimir Grebinski, G. Kucherov

引用次数: 18

On-line load balancing of temporary tasks on identical machines 同一机器上临时任务的在线负载平衡

Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595163

Y. Azar, L. Epstein

引用次数: 24

Closure properties of GapP and #P GapP和#P的闭包特性

Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595166

R. Beigel

引用次数: 7

Private simultaneous messages protocols with applications 带有应用程序的私有同步消息协议

Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595170

Y. Ishai, E. Kushilevitz

{"title":"Private simultaneous messages protocols with applications","authors":"Y. Ishai, E. Kushilevitz","doi":"10.1109/ISTCS.1997.595170","DOIUrl":"https://doi.org/10.1109/ISTCS.1997.595170","url":null,"abstract":"We study the Private Simultaneous Messages (PSM) model which is a variant of the model proposed in Feige et. al., (1994). In the PSM model there are n players P/sub 1/, ..., P/sub n/, each player P/sub i/ holding a secret input x/sub i/ (say, a bit), and all having access to a common random string. Each player sends a single message to a special player, Carol, depending an its own input and the random string (and independently of all other messages). Based on these messages, Carol should be able to compute f(x/sub 1/, ..., x/sub n/) (for some predetermined function f) but should learn no additional information on the values of x/sub 1/, ..., x/sub n/. Our results go in two directions. First, we present efficient PSM protocols, which improve the efficiency of previous solutions, and extend their scope to several function classes for which no such solutions were known before. These classes include most of the important linear algebraic functions; as a result, we get efficient constant-round private protocols (in the standard model) for these classes. Second, we present reductions that allow transforming PSM protocols into solutions for some other problems, thereby demonstrating the power of this model. An interesting reduction of this sort shows how to construct, based on a standard (/sub 1//sup 2/)-OT (Oblivious Transfer) primitive, generalized-OT (GOT) primitives that, we believe, might be useful for the design of cryptographic protocols.","PeriodicalId":367160,"journal":{"name":"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129497801","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}

引用次数: 121

Faster subtree isomorphism 更快的子树同构

Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595164

R. Shamir, Dekel Tsur

引用次数: 146

Local stabilizer 当地的稳定剂

Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595159

Y. Afek, S. Dolev

引用次数: 110

Stereoscopic families of permutations, and their applications 立体排列族及其应用

Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595160

U. Feige, Robert Krauthgamer

{"title":"Stereoscopic families of permutations, and their applications","authors":"U. Feige, Robert Krauthgamer","doi":"10.1109/ISTCS.1997.595160","DOIUrl":"https://doi.org/10.1109/ISTCS.1997.595160","url":null,"abstract":"A stereoscopic family of permutations maps an m-dimensional mesh into several 1-dimensional lines, in a way that jointly preserves distance information. Specifically, consider any two points and denote their distance on the m-dimensional mesh by d. Then the distance between their images, on the line on which these images are closest together is O(d/sup m/). We initiate a systematic study of stereoscopic families of permutations. We show a construction of these families that involves the use of m+1 images. We also show that under some additional restrictions (namely adjacent points on the image lines originate at points which are not too far away on the mesh), three images are necessary in order to construct such a family for the 2-dimensional mesh. We present two applications for stereoscopic families of permutations. One application is an algorithm for routing on the mesh that guarantees delivery of each packet within a number of steps that depends upon the distance between this packet's source and destination, but is independent of the size of the mesh. Our algorithm is exceptionally simple, involves no queues, and can be used in dynamic settings in which packets are continuously generated. Another application is an extension of the construction of nonexpansive hash functions of Linial and Sasson (STOC 96) from the case of one dimensional metrics to arbitrary dimensions.","PeriodicalId":367160,"journal":{"name":"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems","volume":"243 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115017948","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