Israel Cidon | Technion Israel Institute of Technology (original) (raw)
Papers by Israel Cidon
Proceedings of INFOCOM '97
In high-speed networks it is desirable to interleave routing and resource (such as bandwidth) res... more In high-speed networks it is desirable to interleave routing and resource (such as bandwidth) reservation. The PNNI standard for private ATM networks is an example of an algorithm that does this using a sequential crank-back mechanism. We suggest the implementation of resource reservation along several routes in parallel. We present an analytical model that demonstrates that when there are several
Proceedings of INFOCOM'95, 1995
Modern high speed networks (and ATM networks in particular) use resource reservation as a basic m... more Modern high speed networks (and ATM networks in particular) use resource reservation as a basic means of establishing communications. One-way on-the-fly reservation is a method for allocating resources for short bursts of data when regular reservation is too costly. The first such algorithms were recently suggested by Turner. We investigate two examples that are characteristic to the way traffic streams
Information Processing Letters, 1995
IEEE/ACM Transactions on Networking, 1997
Computer Communications, 1999
Eighteenth Convention of Electrical and Electronics Engineers in Israel
TechLAN is a cheap high-speed ATM network being developed at the Computer Networks Laboratory in ... more TechLAN is a cheap high-speed ATM network being developed at the Computer Networks Laboratory in the Department of Electrical Engineering at the Technion. Its purpose is twofold; to provide a low cost solution to sharing an ATM switch connection among several ATM users, and to serve as a LAN which provides local interconnection between ATM users without interfering with the
IEEE/ACM Transactions on Networking, 1999
Those who cannot remember the past, are condemned to repeat it." (Philosopher George Santaya... more Those who cannot remember the past, are condemned to repeat it." (Philosopher George Santayana) In this paper we show that keeping track of history enables significant improvements in the communication complexity of dynamic networks protocols. We improve the communication complexity for solving any graph problem from \Theta(E) to \Theta(V ), thus achieving the lower bound. Moreover, O(V ) is also our amortized complexity of solving any function (not only graph functions) defined on the local inputs of the nodes. This proves, for the first time, that amortized communication complexity, i.e. incremental cost of adapting to a single topology change, can be smaller than the communication complexity of solving the problem from scratch. This also has a practical importance: in real networks the topology and the local inputs of the nodes change.
In this paper, we show that keeping track of history enables significant improvements in the comm... more In this paper, we show that keeping track of history enables significant improvements in the communication complexity of dynamic network protocols. We present a communication optimal maintenance of a spanning tree in a dynamic network. The amortized (on the number of topological changes) message complexity is O(V), where V is the number of nodes in the network. The message size used by the algorithm is O(log |ID|) where |ID | is the size of the name space of the nodes. Typically, log |ID | = O(log V). Previous algorithms that adapt to dynamic networks involved Ω(E) messages per topological change—inherently paying for re-computation of the tree from scratch. Spanning trees are essential components in many distributed algorithms. Some examples include broadcast (dissemination of messages to all network nodes), multicast, reset (general adaptation of static algorithms to dynamic networks), routing, termination detection, and more. Thus, our efficient maintenance of a spanning tree imp...
ArXiv, 1999
Broadcast networks are often used in modern communication systems. A common broadcast network is ... more Broadcast networks are often used in modern communication systems. A common broadcast network is a single hop shared media system, where a transmitted message is heard by all neighbors, such as some LAN networks. In this work we consider a more complex environment, in which a transmitted message is heard only by a group of neighbors, such as Ad-Hoc networks, satellite and radio networks, as well as wireless multistation backbone system for mobile communication. It is important to design efficient algorithms for such environments. Our main result is a new Leader Election algorithm, with O(n) time complexity and O(n*lg(n)) message transmission complexity. Our distributed solution uses a propagation of information with feedback (PIF) building block tuned to the broadcast media, and a special counting and joining approach for the election procedure phase. The latter is required for achieving the linear time. It is demonstrated that the broadcast model requires solutions which are differ...
WebGL is a browser feature that enables JavaScript-based control of the graphics processing unit ... more WebGL is a browser feature that enables JavaScript-based control of the graphics processing unit (GPU) to render interactive 3D and 2D graphics, without the use of plug-ins. Exploiting WebGL for attacks will affect billions of users since browsers serve as the main interaction mechanism with the world wide web. This paper explores the potential threats derived from the recent move by browsers from WebGL 1.0 to the more powerful WebGL 2.0. We focus on two possible abuses of this feature: distributed password cracking and distributed cryptocurrency mining. Our evaluation of the attacks also includes the practical aspects of successful attacks, such as stealthiness and user-experience. Considering the danger of WebGL abuse, as observed in the experiments, we designed and evaluated a proactive defense. We implemented a Chrome extension that proved itself effective in detecting and blocking WebGL. We demonstrate in our experiments the major improvements of WebGL 2.0 over WebGL 1.0 both i...
In this paper we present a new model for routing that occurs in high-speed ATM networks. Within t... more In this paper we present a new model for routing that occurs in high-speed ATM networks. Within this model we define a general routing problem, called a virtual path layout. Given a network of nodes (switches) and links, one must find a set of paths in the network, termed the virtual path layout, whereby each pair of nodes may connect using a route that is a concatenation of a small number of virtual paths and is also short in terms of the network links it traverses. Each such layout implies a utilization of the routing tables in the network''s nodes. Our goal is to find a layout that minimizes this utilization, assuming that each such node has a central routing table. We prove that this problem is NP-complete, and consequently focus on a simpler problem, in which it is required to connect all nodes to a single switch. Next, we prove that even this problem is NP-complete, and restrict some of the assumptions to yield a practical subproblem, for which we present a polynomial-...
The emerging hybrid cloud architecture allows organizations to optimize their computation needs a... more The emerging hybrid cloud architecture allows organizations to optimize their computation needs and costs by maintaining their private computational infrastructure at high utilization and meeting peak requirements by offloading selected tasks to the public cloud. Consequently, there is a need to devise efficient systems equipped with online task cloudbursting algorithms that optimize the overall cost while maintaining adequate quality of service. Such algorithms must take into account the difference in communication and computational requirements associated with different tasks. For example, it is clear that when two tasks have the same local computational requirements, the one with the lower cloudbursting cost is a better candidate to be off-loaded and sent to the cloud. In this paper, we address the case in which arriving tasks have the same computational cost but different communication costs. We design scheduling system based on online decision algorithms driven by the user'...
Proceedings of INFOCOM '97
In high-speed networks it is desirable to interleave routing and resource (such as bandwidth) res... more In high-speed networks it is desirable to interleave routing and resource (such as bandwidth) reservation. The PNNI standard for private ATM networks is an example of an algorithm that does this using a sequential crank-back mechanism. We suggest the implementation of resource reservation along several routes in parallel. We present an analytical model that demonstrates that when there are several
Proceedings of INFOCOM'95, 1995
Modern high speed networks (and ATM networks in particular) use resource reservation as a basic m... more Modern high speed networks (and ATM networks in particular) use resource reservation as a basic means of establishing communications. One-way on-the-fly reservation is a method for allocating resources for short bursts of data when regular reservation is too costly. The first such algorithms were recently suggested by Turner. We investigate two examples that are characteristic to the way traffic streams
Information Processing Letters, 1995
IEEE/ACM Transactions on Networking, 1997
Computer Communications, 1999
Eighteenth Convention of Electrical and Electronics Engineers in Israel
TechLAN is a cheap high-speed ATM network being developed at the Computer Networks Laboratory in ... more TechLAN is a cheap high-speed ATM network being developed at the Computer Networks Laboratory in the Department of Electrical Engineering at the Technion. Its purpose is twofold; to provide a low cost solution to sharing an ATM switch connection among several ATM users, and to serve as a LAN which provides local interconnection between ATM users without interfering with the
IEEE/ACM Transactions on Networking, 1999
Those who cannot remember the past, are condemned to repeat it." (Philosopher George Santaya... more Those who cannot remember the past, are condemned to repeat it." (Philosopher George Santayana) In this paper we show that keeping track of history enables significant improvements in the communication complexity of dynamic networks protocols. We improve the communication complexity for solving any graph problem from \Theta(E) to \Theta(V ), thus achieving the lower bound. Moreover, O(V ) is also our amortized complexity of solving any function (not only graph functions) defined on the local inputs of the nodes. This proves, for the first time, that amortized communication complexity, i.e. incremental cost of adapting to a single topology change, can be smaller than the communication complexity of solving the problem from scratch. This also has a practical importance: in real networks the topology and the local inputs of the nodes change.
In this paper, we show that keeping track of history enables significant improvements in the comm... more In this paper, we show that keeping track of history enables significant improvements in the communication complexity of dynamic network protocols. We present a communication optimal maintenance of a spanning tree in a dynamic network. The amortized (on the number of topological changes) message complexity is O(V), where V is the number of nodes in the network. The message size used by the algorithm is O(log |ID|) where |ID | is the size of the name space of the nodes. Typically, log |ID | = O(log V). Previous algorithms that adapt to dynamic networks involved Ω(E) messages per topological change—inherently paying for re-computation of the tree from scratch. Spanning trees are essential components in many distributed algorithms. Some examples include broadcast (dissemination of messages to all network nodes), multicast, reset (general adaptation of static algorithms to dynamic networks), routing, termination detection, and more. Thus, our efficient maintenance of a spanning tree imp...
ArXiv, 1999
Broadcast networks are often used in modern communication systems. A common broadcast network is ... more Broadcast networks are often used in modern communication systems. A common broadcast network is a single hop shared media system, where a transmitted message is heard by all neighbors, such as some LAN networks. In this work we consider a more complex environment, in which a transmitted message is heard only by a group of neighbors, such as Ad-Hoc networks, satellite and radio networks, as well as wireless multistation backbone system for mobile communication. It is important to design efficient algorithms for such environments. Our main result is a new Leader Election algorithm, with O(n) time complexity and O(n*lg(n)) message transmission complexity. Our distributed solution uses a propagation of information with feedback (PIF) building block tuned to the broadcast media, and a special counting and joining approach for the election procedure phase. The latter is required for achieving the linear time. It is demonstrated that the broadcast model requires solutions which are differ...
WebGL is a browser feature that enables JavaScript-based control of the graphics processing unit ... more WebGL is a browser feature that enables JavaScript-based control of the graphics processing unit (GPU) to render interactive 3D and 2D graphics, without the use of plug-ins. Exploiting WebGL for attacks will affect billions of users since browsers serve as the main interaction mechanism with the world wide web. This paper explores the potential threats derived from the recent move by browsers from WebGL 1.0 to the more powerful WebGL 2.0. We focus on two possible abuses of this feature: distributed password cracking and distributed cryptocurrency mining. Our evaluation of the attacks also includes the practical aspects of successful attacks, such as stealthiness and user-experience. Considering the danger of WebGL abuse, as observed in the experiments, we designed and evaluated a proactive defense. We implemented a Chrome extension that proved itself effective in detecting and blocking WebGL. We demonstrate in our experiments the major improvements of WebGL 2.0 over WebGL 1.0 both i...
In this paper we present a new model for routing that occurs in high-speed ATM networks. Within t... more In this paper we present a new model for routing that occurs in high-speed ATM networks. Within this model we define a general routing problem, called a virtual path layout. Given a network of nodes (switches) and links, one must find a set of paths in the network, termed the virtual path layout, whereby each pair of nodes may connect using a route that is a concatenation of a small number of virtual paths and is also short in terms of the network links it traverses. Each such layout implies a utilization of the routing tables in the network''s nodes. Our goal is to find a layout that minimizes this utilization, assuming that each such node has a central routing table. We prove that this problem is NP-complete, and consequently focus on a simpler problem, in which it is required to connect all nodes to a single switch. Next, we prove that even this problem is NP-complete, and restrict some of the assumptions to yield a practical subproblem, for which we present a polynomial-...
The emerging hybrid cloud architecture allows organizations to optimize their computation needs a... more The emerging hybrid cloud architecture allows organizations to optimize their computation needs and costs by maintaining their private computational infrastructure at high utilization and meeting peak requirements by offloading selected tasks to the public cloud. Consequently, there is a need to devise efficient systems equipped with online task cloudbursting algorithms that optimize the overall cost while maintaining adequate quality of service. Such algorithms must take into account the difference in communication and computational requirements associated with different tasks. For example, it is clear that when two tasks have the same local computational requirements, the one with the lower cloudbursting cost is a better candidate to be off-loaded and sent to the cloud. In this paper, we address the case in which arriving tasks have the same computational cost but different communication costs. We design scheduling system based on online decision algorithms driven by the user'...