Clock Synchronization using Packet Streams
|
|
- Tamsyn Maxwell
- 8 years ago
- Views:
Transcription
1 Clock Synchronization using Packet Streams Philipp Blum and Lothar Thiele Institut für Technische Informatik und Kommunikationsnetze ETH Zürich, ETH Zentrum, CH-892 Zürich, Switzerland Abstract. Recent distributed applications in the domains of digital audio and sensor networks require clock synchronization in the order of 1µs. The achievable precision depends on system properties like synchronization message delay and synchronization message pattern. These properties are often unknown or difficult to determine. Therefore we propose a new analysis for clock synchronization algorithms. The analysis is based on two properties: safe synchronization and optimal selective synchronization. We present two algorithms that use an arbitrary stream of synchronization messages to achieve clock synchronization over an asynchronous communication channel and on clocks with unknown and variable drift. The first algorithm needs no parameterization, is safe and optimal selective. The second algorithm improves the first with a drift compensation mechanism. It is safe. A parameter of the algorithm allows to choose between fast drift compensation and high probability of optimal selective behavior. Simulation results show that the algorithms can achieve 1µs precision on 82.11b wireless LAN in ad-hoc mode. 1 Introduction and Related Work Recent distributed applications in the domain of high-quality digital audio require clock synchronization between nodes in the order of 1µs. Similar precision requirements in the context of sensor networks have been reported by [6]. Tight synchronization is difficult because of clock drift and non-deterministic message delay. Another limiting factor is the amount of communication spent on synchronization. Several probabilistic clock synchronization algorithms have been proposed to achieve a good precision under partially unknown system specifications. [3, 1, 9] use a client-server approach to read reference time repeatedly until this succeeds with a specified precision bound. [3] achieves a precision in the order of 1ms using 4 messages per minute, [1] is similar. [9] achieves 1µs using highly deterministic Myrinet communication. The drawback of client-server schemes is that they do not scale well with system size and synchronization message frequency. A producer-consumer approach is taken in [2]. With unidirectional communication only, a precision in the order of 1ms is achieved. This approach requires that statistical properties of the message delays are known. For broadcast networks, [5] proposes a scheme that eliminates the medium access time from the synchronization path and achieves precision in the order of 1µs using commercial off-the-shelf technology. Unknown system properties like non-deterministic message delay and synchronization message pattern make it difficult to apply bounds on the achievable precision as proposed by [8, 7, 1, 12, 11]. Therefore we propose an analysis of clock synchronization algorithms under completely unknown system specifications in terms of message delay and message pattern. Instead of bounds on the achievable precision, we propose two properties that describe good algorithms. Safe synchronization never degrades the precision of a synchronized clock. Optimal selective synchronization never misses to improve the precision if there is a chance to do so. As a consequence, the achieved precision can only improve when more communication is spent on clock synchronization. We propose two new algorithms. The first algorithm needs no parameterization, is safe and optimal selective. The second algorithm This work has been developed in cooperation with BridgeCo AG, Ringstrasse 14, 86 Dübendorf, Switzerland The author has received funding from the Swiss Commission for Technology and Innovation (KTI), Effingerstrasse 27, 33 Bern, Switzerland
2 improves the first in that it compensates clock drift. It is safe. A parameter of the algorithm allows to chose between fast drift compensation and high probability of optimal selective behavior. We evaluate the algorithms based on real network and clock traces, obtained in a 82.11b wireless LAN network in ad-hoc mode and standard Linux PCs. Our assumptions on communication and clocks are similar to those of [8, 12, 11]. Our system model is different from [3, 1, 9] that assume a client-server synchronization algorithm with communication in both directions. It is different from [2] in that we make no statistical assumptions on message delay distribution. It is different from [5] in that we do not require a broadcast medium, though our producer-consumer scheme is also directly applicable in a broadcast system. Our algorithms are similar to Lamport s algorithm for physical clocks [8]. They are different in that they start software clocks that progress always slower than reference time. Presentation overview: In section 2, we introduce a model for clock synchronization algorithms that use streams of synchronization messages. Section 3 introduces the properties safe synchronization and optimal selective synchronization and presents the local selection algorithm. In section 4, we present the local selection algorithm with drift compensation. Section 5 presents simulation results based on real network and clock traces. 2 System model The system we study in this paper is distributed to two nodes: On the first node, a process that has access to reference time generates synchronization messages. Reference time is assumed to be a positive real number t R. We refer to this node and the associated process as the synchronization source or producer. The second node has no direct access to reference time but it can read a local hardware clock that has an arbitrary offset and an unknown and variable drift relative to reference time. We refer to this node as the synchronization consumer. Upon every arrival of a synchronization message, a clock synchronization algorithm is invoked on the consumer. 2.1 Communication Definition 1. A Synchronization message is a tuple (s, r) where s R represents its send time, i.e. reference time at the moment when the message is sent at the producer node, and where r R represents receive time, i.e. reference time at the moment when the message is received at the consumer node. The payload of a synchronization message includes at least its send time. The delay of a message is the difference between its send and receive time, i.e. d def = r s. The delay of a synchronization message is positive, i.e. d >. Definition 2. A Synchronization stream is an infinite sequence S def = (s i, r i ) i N 1 of synchronization messages received by the consumer, ordered by their receive time, i.e. i N 1 : r i < r i+1. Messages can get lost in the communication channel: The index i only counts those synchronization messages that eventually reach the consumer. Messages can get reordered in the channel: The index i counts the synchronization messages in their order of arrival, which is not necessarily the order in which they are produced. 2.2 Clocks The consumer node has access to a read-only hardware clock h. The clock synchronization algorithm computes a new software clock c i whenever it is executed. An application that requires synchronization always reads the software clock that has been started last. Software clocks are a well known concept [13, 4] and are also known under the name of logical clocks.
3 Definition 3. The Hardware clock is a monotone increasing and differentiable function h : R R that maps all values of reference time t to clock time h(t). The drift of the hardware clock is a function ρ h : R R that maps all values of reference time t to h s derivation minus 1: ρ h (t) def = dh(t)/dt 1. (1) Assumption 1 The drift of the hardware clock is bounded by the known constant ρ h max. The first derivation of the drift is bounded by the known constant δ h max. t R : ρ h (t) < ρ h max dρ h (t)/dt < δ h max. (2) Definition 4. A Software clock is a monotone increasing and differentiable function c i : R R that maps values of reference time t to clock time c i (t). The function c i is computed at time t = r i and its domain is {t R ri }. The index i expresses that the software clock c i (t) is started in the i-th execution of the synchronization algorithm. The drift of the software clock functions is defined as ρ i (t) def = dc i (t)/dt 1 and the precision as ɛ i (t) def def = c i (t) t. We will use the shortcuts c i = c i (r i ), def def ɛ i = ɛ i (r i ), ρ i = ρ i (r i ) and ρ h def i = ρ h (r i ). These definitions apply analogously to c i, ρ i and used in section 4. ɛ i 2.3 Clock synchronization algorithm Upon the reception of the synchronization message (s i, r i ), the consumer invokes a clock synchronization algorithm. The input for this algorithm is the payload of the synchronization message, i.e. s i and a timestamp from the local hardware clock h i = h(r i ). The output is a new software clock c i (t), which is supposed to be synchronized to reference time. The algorithm has access to memory to retrieve information that has been stored in previous executions. This allows the algorithm to use the current value of all previously started software clocks c j (r i ), j < i in its computation of the new software clock. 3 Analysis of clock synchronization using streams We have made no assumptions on communication except that messages arrive after they have been sent. Therefore it is not possible to calculate a finite bound on the precision a clock synchronization algorithm can achieve. Instead, we propose properties that describe a good algorithm and try to find implementable algorithms for which these properties hold under the assumptions made in the previous section. 3.1 Safe clock synchronization Definition 5. Safety A clock synchronization algorithm is safe if in all executions except the first, it starts a software clock with an initial precision that is equal to or better than the precision of the previously started software clock at this time: i N >1 : ɛ i ɛ i 1 (r i ). (3) The probabilistic algorithms are not safe. [3, 1, 9] select updates if the measured bound on the precision is better than a configured threshold. However this condition does not imply that the precision itself improves by the update. [2] updates the clock after a fixed number of synchronization messages have been received. Thus a better precision of the new clock reading is only probable but not guaranteed.
4 Definition 6. A Selective synchronization algorithm is a clock synchronization algorithm that calculates a candidate initial value c i R and a decision select i {true, false}. The new software clock is started with the initial value c i : { ci if select c i := i = true (4) c i 1 (r i ) if select i = false We have found a selective clock synchronization algorithm that is safe for all synchronization streams: Definition 7. The Local selection algorithm is a selective synchronization algorithm with: c i := s i, select i := (i = 1) (s i > c i 1 (r i )), (6) c i (t) := c i + (1 ρ h max)(h(t) h i ). (7) def The precision of the candidate initial value is defined as ɛ i = c i r i. In the case of the local selection algorithm, it is ɛ i = s i r i = d i, which is always negative. The algorithm only then selects a candidate initial value if it is ahead of the current software clock. Equations (5) and (6) correspond in essence to Lamport s algorithm [8]. In addition, the local selection algorithm assures by (7) that the drift of the software clock c i (t) is always negative. Proposition 1. The local selection algorithm is safe. Proof. We have to show that if a candidate initial value is selected, it does not degrade precision, i.e. select i ɛ i ɛ i 1 (r i ). From (6) we get select i s i > c i 1 (r i ). Therefore, s i r i > c i 1 (r i ) r i and ɛ i > ɛ i 1 (r i ). Since > ɛ i > ɛ i 1 (r i ), we get ɛ i ɛ i 1 (r i ), which is what we wanted to prove. Since the proof did not require (7), Lamport s algorithm is also safe. 3.2 Optimal selective clock synchronization There exists also a trivial algorithm that is safe: Start all new software clocks with the current reading of the previously started software clock c i = c i 1 (r i ). Though safe, this is obviously not a good clock synchronization algorithm. Therefore we complement the safety property by a second property that a synchronization algorithm should fulfill: Definition 8. Optimal selective A selective synchronization algorithm is optimal selective if in all executions, it starts a software clock with an initial precision that is equal to or better than the precision of the candidate initial value: i N 1 : ɛ i ɛ i. (8) The property is true if an algorithm never misses to improve the precision if it has the chance to do so. The property does not hold for [3, 1, 9] because updates are selected on the base of the precision bounds and not the precision itself. Different interpretations are possible for [2]: The property is either not defined if the algorithm is executed only after the required number of messages have been received or it does not hold, if the algorithm is executed upon every message arrival and only selects an update in fixed intervals. Proposition 2. The local selection algorithm is optimal selective. (5)
5 Proof. We have to show that all candidate initial values that have not been selected would have degraded precision, i.e. select i ɛ i ɛ i 1 (r i ). From (6) we get select i ɛ i ɛ i 1 (r i ). To conclude our proof we have to show that ɛ i 1 (r i ) is negative. Since ɛ i 1 (r i ) = ɛ i 1 + r i r i 1 ρ i 1 (t)dt and t R ri 1 : ρ i 1 (t) = ρ h (t) ρ h max <, we get ɛ i 1 (r i ) < ɛ i 1. By (5),(6) and (4), we know that ɛ i 1 = max( c i 1, c i 2 (r i 1 )) r i and thus ɛ i 1 < max(, ɛ i 2 ). Together with the anchor ɛ 1 = ɛ 1 <, this proves that i N 1 : ɛ i < by induction. This algorithm makes always the right decisions even though it knows neither the precision of the candidate initial value ɛ i nor that of the current value of the previously started software clock ɛ i 1 (r i ). This is possible, because the software clock and the candidate initial value are both always behind reference time. Then it suffices to select only those candidate initial values that are larger and therefore closer to reference time than the current reading of the previously started clock. The algorithm of Lamport [8] is not optimal selective, because if the consumer clock is ahead of reference time and its drift is positive, the algorithm will never select updates anymore and the precision degrades forever. The drawback of the local selection algorithm is that in three out of four cases, the absolute value of the software clock drift is larger than the drift of the hardware clock, assuming equal probability distribution of ρ h (t) in the interval [ ρ h max, ρ h max]. 4 Drift compensation In this section we extend the local selection algorithm presented in the previous section with a drift compensation mechanism. Definition 9. The Local selection algorithm with drift compensation is a selective synchronization algorithm that uses the same expressions as the local selection algorithm for the candidate initial value c i (5) and the decision select i (6). Additionally it calculates the drift compensation term β i, using the parameter b. A modified software clock c i (t) is started at time t = r i : β i := { ρ h max if i = 1 max{β i 1 δ h max(h i h i 1 ), β i,j j N 1, j < i} otherwise β i,j := β j + c i c j (r i) (h i h j ) b (h i h j ) 2δh max (h i h j ), (1) c i (t) := c i + (1 + max(β i 1/2δ h max (h(t) h i), ρ h max ))(h(t) h i). (11) Without looking at the drift compensation mechanism, we can state that, Proposition 3. The local selection algorithm with drift compensation is safe. The proof of proposition 1 applies directly to the algorithm with drift compensation, since both algorithms use the same c i and select i. But what about optimal selectivity? The proof of proposition 2 required that the current reading of the previously started clock has a negative precision. This is guaranteed if the drift of all software clocks is always negative. The drift of the modified software clock is ρ i (t) = ρh (t) + max(β i δmax h (h(t) h i), ρ h max ), (12) and by assumption 2 smaller than its initial value, i.e. ρ i (t) < ρ i. If it can be shown that the initial drift ρ i is always negative, then the local selection algorithm with drift compensation is optimal selective. After the first execution with β 1 = ρ h max, the modified software clock is the same as that from (7). In later executions, the drift compensation term β i is set to the maximum of all potential drift compensation terms β i,j, but it is never set below the current drift (9)
6 compensation of the previously started clock β i 1 δmax(h h i h i 1 ). The potential drift compensation terms β i,j are computed based on the comparison of the new candidate initial value c i with the current reading of the previously started software clock c j (r i) j < i. Compared to β j, the drift compensation term β i,j can be increased by ( c i c j (r i))/(h i h j ), but is decreased by b/(h i h j ) + 2δmax h (h i h j ). The parameter b is a constant, therefore it decreases β i,j most for software clocks c j (t) that have been started only recently (small h i h j ). The term 2δmax(h h i h j ) has the opposite effect: Clocks that have been started a long time ago can not be used for drift compensation. Therefore, a real implementation of the algorithm need not evaluate all possible β i,j. Proposition 4. If ɛ j < b, then the local selection algorithm with drift compensation is optimal selective. Proof. We have to show that the drift of a newly started software clock c i (t) is negative, i.e. ρ i <, assuming that drift compensation is based on the previously started software clock c j (t), i.e. β i = β i,j. By (12) we get ɛ j (r i) > ɛ j ρ j (h i h j ) δmax h (h i h j ) 2. Using ρ h j = ρ j β j and ρ h i < ρh j +δh max (h i h j ), we derive ρ h i < β j ( c i c j (r i) + ɛ j )/(h i h j )+δmax h (h i h j ). Introducing ɛ j < b, we get ρh i < β j ( c i c j (r i) b)/(h i h j )+δmax h (h i h j ) and finally ρ i = ρh i + β i <. Clearly, no finite b can guarantee ɛ j < b in our asynchronous communication model. A large b assures a high probability of optimal selectivity but makes drift compensation slow. A small b provides a fast drift compensation that sometimes computes software clocks with a positive initial drift ρ i >. The algorithm is not optimal selective anymore: Future candidate initial values may have a better precision than c i (t), but are not selected, because c i (t) is ahead of reference time. Since the drift of all software clocks c i (t) always decreases and eventually becomes negative, the precision of this software clock also becomes negative at some time in the future. After this moment, all candidate initial values that improve the precision of the software clock are selected again. 5 Experimental results We have evaluated the local selection algorithms through Matlab simulations. The hardware clock drift and the synchronization message delays have been measured and recorded on a real system consisting of two standard Linux PCs and a 82.11b wireless LAN in ad-hoc mode. The timestamp counter register (TSC) of the producer PC served as the reference time source. The TSC of the consumer PC served as the hardware clock. The timestamps s i and h i were recorded within the wireless LAN driver. Additional measures had to be taken to measure r i : Externally generated impulses fed into the parallel ports generate simultaneous interrupts on both PCs. Pairs of timestamps recorded in the corresponding interrupt service routines allow to interpolate the precision of the hardware clock at the time of receiving synchronization messages. Thus, the can be derived. We recorded two streams of 15 synchronization messages each, received in ca. 5 minutes, i.e. on average one synchronization message is received every 2 ms. The first scenario is that of a completely empty communication medium. In the second scenario, the medium is shared with two additional stations that do not participate in clock synchronization, but periodically exchange large files via ftp. The recorded delays are shown in fig.1, left side. The deterministic delay of the synchronization messages has been removed a-priori, because it is not subject of this study. Computation time of the algorithm is neglected. The numerical results of the local selection algorithm without drift compensation is shown in fig.1, right side.
7 a) delay d i [ms] b) delay d i [ms] c) CDF(d i ) [1] receive time r i Synchronization message delays d) precision ε i e) precision ε i f) 1 CDF(ε i ) [1].5 Precision achieved by the local selection algorithm delay d i [ms] precision ε i Fig. 1. Left: Delay of messages in a 82.11b ad-hoc network. a) Exclusive access to the medium, no other stations. b) Medium shared with 2 additional stations that periodically exchange large files via ftp. c) Cumulative probability density function of a) and b). The average delay is different, the minimal delay remains constant. Right: Precision of the local selection algorithm without drift compensation. d) Exclusive medium access. e) Shared medium. f) The algorithm achieves in 9% of the time a precision better than 15µs in scenario and 4µs in the shared medium scenario In the implementation of the local selection algorithm with drift compensation, equation (9) has been simplified to β i := max{β i 1 1/2δ h max (h i h i 1 ), β i,i 5 }, which reduces computation time (only β i,i 5 has to be evaluated) and memory requirements (5 times the space required to store c j, h j, β j ). The parameter b has been set to 4µs. Fig.2, left side, shows the numerical results. Drift compensation improves the achieved precision, especially in the shared medium scenario. Fig.2, right side, shows hardware and software clock drift. Drift compensation removes unknown and variable hardware clock drift. 6 Conclusion We found algorithms that never actively degrade precision and do not miss to improve precision if there is a chance to do so. The performance in terms of achieved precision these algorithms achieve always improves, if additional synchronization messages are received. This is not the case for probabilistic algorithms [3, 1, 9] and [2]. While the safety property also applies to Lamport s algorithm [8], only the local selection algorithms are optimal selective. Experimental results show that the local selection algorithm with drift compensation can achieve synchronization of the non-deterministic delay in the range of 1µs on a standard wireless LAN in ad-hoc mode requiring less than one received synchronization message every 2ms. These parameters match with the requirements of high-quality audio distribution and the capabilities of commonly available technology (wireless LAN, Linux PCs). The results are comparable to those of [5]. While our algorithm seems to require more communication, it can also be used when no broadcast medium is available. Schreiber and Sigg describe in their master thesis [14] an implementation of the local selection algorithms on Linux PCs that achieves a precision of 4µs. The discrepancy to the 1µs achieved in simulation is mainly due to the simple deterministic delay elimination mechanism used. Deterministic delay elimination is not possible without communication in the inverse direction, i.e. from the consumer to the producer. It is straightforward to combine the local selection algorithms with a mechanism that progressively removes the deterministic delay by exchanging messages with the synchronization source in a client-server style, rather than the producer-consumer pattern employed by the local selection algorithms. It remains to
8 a) precision ε i b) precision ε i CDF(ε i ) [1] Precision achieved by the local selection algorithm with drift compensation receive time r i 1.5 c) f) precision ε i d) 1 [ppm] [ppm] ρ h i ρ i [ppm] hardware clock drift Clock drift in the shared medium scenario e) software clock drift with drift compensation receive time r i ρ i ρ i ρ h i Fig. 2. Left: Precision of the local selection algorithm with drift compensation. a) Exclusive medium access. b) Shared medium. c) The algorithm achieves in 9% of the time a precision better than 8µs in both scenarios. Right: Drift rate of the hardware clock and the two synchronized clocks, all for the shared medium scenario. d) The drift of the software clock without drift compensation ρ(t) is equal to the hardware clock drift ρ h (t) minus the maximal hardware clock drift ρ h max = 1ppm. The drift of the software clock with drift compensation ρ (t) is initially equal to that of the software clock without drift compensation and strives towards zero. e) Close-up of ρ h (t). f) Close-up of ρ (t), considerably more stable than ρ h (t). be studied, how this combination can be made most efficient in terms of total bandwidth consumption and local memory and computation requirements. References 1. Gianluigi Alari and Augusto Ciuffoletti. Implementing a probabilistic clock synchronization algorithm. Real Time Systems, 13(1):25 46, K. Arvind. Probabilistic clock synchronization in distributed systems. IEEE Transactions on Parallel and Distributed Systems, 5(5): , May Flaviu Cristian. Probabilistic clock synchronization. Journal of Distributed Computing, 3: , Danny Dolev, Rüdiger Reischuk, Ray Strong, and Ed Wimmers. A decentralized high performance time service architecture. Technical Report 95/26, Institute for Computer Science, University of Lübeck, November Jeremy Elson, Lewis Girod, and Deborah Estrin. Fine grained network time synchronization using reference broadcasts. Technical Report 28, Laboratory for Embedded Collaborative Systems LECS, UCLA, May Lewis Girod, Vladimir Bychkovskiy, Jeremy Elson, and Deborah Estrin. Locating tiny sensors in time and space: A case study. In International Conference on Computer Design ICCD, September Joseph Y. Halpern, Nimrod Megiddo, and Ashfaq A. Munshi. Optimal precision in the presence of uncertainty. Journal of Complexity, 1(2):17 196, Leslie Lamport. Time, clocks and the ordering of events in a distributed system. Communications of the ACM, 21(7): , July Cheng Liao, Margaret Martonosi, and Douglas W. Clark. Experience with an adaptive globallysynchronizing clock algorithm. In ACM Symposium on Parallel Algorithms and Architectures, pages , Jennifer Lundelius and Nancy Lynch. An upper and lower bound for clock synchronization. Information and Control, 62(2/3):19 24, August/September Rafail Ostrovsky and Boaz Patt-Shamir. Optimal and efficient clock synchronization under drifting clocks. In Symposium on Principles of Distributed Computing, pages 3 12, Boaz Patt-Shamir and Sergio Rajsbaum. A theory of clock synchronization. In Proceeding of the 26th Annual ACM Symposium on Theory of Computing, Montreal, Canada, pages , May F. Schmuck and F. Cristian. Continuous clock amortization need not affect the precision of a clock synchronization algorithm. In Proceedings of the Nineth ACM Symposion on Principles of Distributed Computing, pages , Eric Schreiber and Daniel Sigg. Clock synchronization for wireless LAN. Master s thesis, ETH Zürich, Departement of Information Technology and Electrical Engineering, Institute TIK, Gloriastrasse 35, ETH Zentrum, 892 Zürich, July 22. ( blum).
Synchronization in. Distributed Systems. Cooperation and Coordination in. Distributed Systems. Kinds of Synchronization.
Cooperation and Coordination in Distributed Systems Communication Mechanisms for the communication between processes Naming for searching communication partners Synchronization in Distributed Systems But...
More informationA Slow-sTart Exponential and Linear Algorithm for Energy Saving in Wireless Networks
1 A Slow-sTart Exponential and Linear Algorithm for Energy Saving in Wireless Networks Yang Song, Bogdan Ciubotaru, Member, IEEE, and Gabriel-Miro Muntean, Member, IEEE Abstract Limited battery capacity
More informationClock Synchronization
Clock Synchronization Henrik Lönn Electronics & Software Volvo Technological Development Contents General Types of Synchronisation Faults and problems to cope with Example algorithms Transmission delays
More informationHomework 1 (Time, Synchronization and Global State) - 100 Points
Homework 1 (Time, Synchronization and Global State) - 100 Points CS25 Distributed Systems, Fall 2009, Instructor: Klara Nahrstedt Out: Thursday, September 3, Due Date: Thursday, September 17 Instructions:
More information6.852: Distributed Algorithms Fall, 2009. Class 2
.8: Distributed Algorithms Fall, 009 Class Today s plan Leader election in a synchronous ring: Lower bound for comparison-based algorithms. Basic computation in general synchronous networks: Leader election
More informationRole of Clusterhead in Load Balancing of Clusters Used in Wireless Adhoc Network
International Journal of Electronics Engineering, 3 (2), 2011, pp. 283 286 Serials Publications, ISSN : 0973-7383 Role of Clusterhead in Load Balancing of Clusters Used in Wireless Adhoc Network Gopindra
More informationThe Trip Scheduling Problem
The Trip Scheduling Problem Claudia Archetti Department of Quantitative Methods, University of Brescia Contrada Santa Chiara 50, 25122 Brescia, Italy Martin Savelsbergh School of Industrial and Systems
More informationSynchronization of sampling in distributed signal processing systems
Synchronization of sampling in distributed signal processing systems Károly Molnár, László Sujbert, Gábor Péceli Department of Measurement and Information Systems, Budapest University of Technology and
More informationComputer Network. Interconnected collection of autonomous computers that are able to exchange information
Introduction Computer Network. Interconnected collection of autonomous computers that are able to exchange information No master/slave relationship between the computers in the network Data Communications.
More informationTCOM 370 NOTES 99-12 LOCAL AREA NETWORKS AND THE ALOHA PROTOCOL
1. Local Area Networks TCOM 370 NOTES 99-12 LOCAL AREA NETWORKS AND THE ALOHA PROTOCOL These are networks spanning relatively short distances (e.g. within one building) for local point-to-point and point-to-multipoint
More informationLatency on a Switched Ethernet Network
Application Note 8 Latency on a Switched Ethernet Network Introduction: This document serves to explain the sources of latency on a switched Ethernet network and describe how to calculate cumulative latency
More informationCommunications and Computer Networks
SFWR 4C03: Computer Networks and Computer Security January 5-8 2004 Lecturer: Kartik Krishnan Lectures 1-3 Communications and Computer Networks The fundamental purpose of a communication system is the
More informationAttenuation (amplitude of the wave loses strength thereby the signal power) Refraction Reflection Shadowing Scattering Diffraction
Wireless Physical Layer Q1. Is it possible to transmit a digital signal, e.g., coded as square wave as used inside a computer, using radio transmission without any loss? Why? It is not possible to transmit
More informationMiddleware and Distributed Systems. System Models. Dr. Martin v. Löwis. Freitag, 14. Oktober 11
Middleware and Distributed Systems System Models Dr. Martin v. Löwis System Models (Coulouris et al.) Architectural models of distributed systems placement of parts and relationships between them e.g.
More informationTheorem (informal statement): There are no extendible methods in David Chalmers s sense unless P = NP.
Theorem (informal statement): There are no extendible methods in David Chalmers s sense unless P = NP. Explication: In his paper, The Singularity: A philosophical analysis, David Chalmers defines an extendible
More informationLecture 4 Online and streaming algorithms for clustering
CSE 291: Geometric algorithms Spring 2013 Lecture 4 Online and streaming algorithms for clustering 4.1 On-line k-clustering To the extent that clustering takes place in the brain, it happens in an on-line
More informationLocal Area Networks transmission system private speedy and secure kilometres shared transmission medium hardware & software
Local Area What s a LAN? A transmission system, usually private owned, very speedy and secure, covering a geographical area in the range of kilometres, comprising a shared transmission medium and a set
More informationA NOVEL RESOURCE EFFICIENT DMMS APPROACH
A NOVEL RESOURCE EFFICIENT DMMS APPROACH FOR NETWORK MONITORING AND CONTROLLING FUNCTIONS Golam R. Khan 1, Sharmistha Khan 2, Dhadesugoor R. Vaman 3, and Suxia Cui 4 Department of Electrical and Computer
More informationImpedance 50 (75 connectors via adapters)
VECTOR NETWORK ANALYZER PLANAR TR1300/1 DATA SHEET Frequency range: 300 khz to 1.3 GHz Measured parameters: S11, S21 Dynamic range of transmission measurement magnitude: 130 db Measurement time per point:
More informationECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE
ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE YUAN TIAN This synopsis is designed merely for keep a record of the materials covered in lectures. Please refer to your own lecture notes for all proofs.
More informationPassive Discovery Algorithms
t t Technische Universität Berlin Telecommunication Networks Group arxiv:1506.05255v1 [cs.ni] 17 Jun 2015 Optimized Asynchronous Passive Multi-Channel Discovery of Beacon-Enabled Networks Niels Karowski,
More informationThis article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination.
IEEE/ACM TRANSACTIONS ON NETWORKING 1 A Greedy Link Scheduler for Wireless Networks With Gaussian Multiple-Access and Broadcast Channels Arun Sridharan, Student Member, IEEE, C Emre Koksal, Member, IEEE,
More informationCMSC 858T: Randomized Algorithms Spring 2003 Handout 8: The Local Lemma
CMSC 858T: Randomized Algorithms Spring 2003 Handout 8: The Local Lemma Please Note: The references at the end are given for extra reading if you are interested in exploring these ideas further. You are
More informationA PC-BASED TIME INTERVAL COUNTER WITH 200 PS RESOLUTION
35'th Annual Precise Time and Time Interval (PTTI) Systems and Applications Meeting San Diego, December 2-4, 2003 A PC-BASED TIME INTERVAL COUNTER WITH 200 PS RESOLUTION Józef Kalisz and Ryszard Szplet
More informationAn On-Line Algorithm for Checkpoint Placement
An On-Line Algorithm for Checkpoint Placement Avi Ziv IBM Israel, Science and Technology Center MATAM - Advanced Technology Center Haifa 3905, Israel avi@haifa.vnat.ibm.com Jehoshua Bruck California Institute
More informationReconfigurable Architecture Requirements for Co-Designed Virtual Machines
Reconfigurable Architecture Requirements for Co-Designed Virtual Machines Kenneth B. Kent University of New Brunswick Faculty of Computer Science Fredericton, New Brunswick, Canada ken@unb.ca Micaela Serra
More informationCompetitive Analysis of On line Randomized Call Control in Cellular Networks
Competitive Analysis of On line Randomized Call Control in Cellular Networks Ioannis Caragiannis Christos Kaklamanis Evi Papaioannou Abstract In this paper we address an important communication issue arising
More informationSemester Thesis Traffic Monitoring in Sensor Networks
Semester Thesis Traffic Monitoring in Sensor Networks Raphael Schmid Departments of Computer Science and Information Technology and Electrical Engineering, ETH Zurich Summer Term 2006 Supervisors: Nicolas
More informationMonitoring Large Flows in Network
Monitoring Large Flows in Network Jing Li, Chengchen Hu, Bin Liu Department of Computer Science and Technology, Tsinghua University Beijing, P. R. China, 100084 { l-j02, hucc03 }@mails.tsinghua.edu.cn,
More informationBrewer s Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services
Brewer s Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services Seth Gilbert Nancy Lynch Abstract When designing distributed web services, there are three properties that
More informationModified Energy Efficient Cache Invalidation Algorithm in Mobile Environment
Modified Energy Efficient Cache Invalidation Algorithm in Mobile Environment S. Sankara Gomathi, S. Krishnamurthi Abstract Maintenance of the cache consistency is a complicated issue in the wireless mobile
More informationScheduling Real-time Tasks: Algorithms and Complexity
Scheduling Real-time Tasks: Algorithms and Complexity Sanjoy Baruah The University of North Carolina at Chapel Hill Email: baruah@cs.unc.edu Joël Goossens Université Libre de Bruxelles Email: joel.goossens@ulb.ac.be
More informationCSC 774 Advanced Network Security. Outline. Related Work
CC 77 Advanced Network ecurity Topic 6.3 ecure and Resilient Time ynchronization in Wireless ensor Networks 1 Outline Background of Wireless ensor Networks Related Work TinyeRync: ecure and Resilient Time
More informationOverview Motivating Examples Interleaving Model Semantics of Correctness Testing, Debugging, and Verification
Introduction Overview Motivating Examples Interleaving Model Semantics of Correctness Testing, Debugging, and Verification Advanced Topics in Software Engineering 1 Concurrent Programs Characterized by
More informationReal-Time (Paradigms) (51)
Real-Time (Paradigms) (51) 5. Real-Time Communication Data flow (communication) in embedded systems : Sensor --> Controller Controller --> Actor Controller --> Display Controller Controller Major
More informationEmail: tjohn@mail.nplindia.ernet.in
USE OF VIRTUAL INSTRUMENTS IN RADIO AND ATMOSPHERIC EXPERIMENTS P.N. VIJAYAKUMAR, THOMAS JOHN AND S.C. GARG RADIO AND ATMOSPHERIC SCIENCE DIVISION, NATIONAL PHYSICAL LABORATORY, NEW DELHI 110012, INDIA
More informationRT-QoS for Wireless ad-hoc Networks of Embedded Systems
RT-QoS for Wireless ad-hoc Networks of Embedded Systems Marco accamo University of Illinois Urbana-hampaign 1 Outline Wireless RT-QoS: important MA attributes and faced challenges Some new ideas and results
More informationPerformance Evaluation of The Split Transmission in Multihop Wireless Networks
Performance Evaluation of The Split Transmission in Multihop Wireless Networks Wanqing Tu and Vic Grout Centre for Applied Internet Research, School of Computing and Communications Technology, Glyndwr
More informationBroadband Networks. Prof. Dr. Abhay Karandikar. Electrical Engineering Department. Indian Institute of Technology, Bombay. Lecture - 29.
Broadband Networks Prof. Dr. Abhay Karandikar Electrical Engineering Department Indian Institute of Technology, Bombay Lecture - 29 Voice over IP So, today we will discuss about voice over IP and internet
More informationNon-Data Aided Carrier Offset Compensation for SDR Implementation
Non-Data Aided Carrier Offset Compensation for SDR Implementation Anders Riis Jensen 1, Niels Terp Kjeldgaard Jørgensen 1 Kim Laugesen 1, Yannick Le Moullec 1,2 1 Department of Electronic Systems, 2 Center
More informationChapter 6: distributed systems
Chapter 6: distributed systems Strongly related to communication between processes is the issue of how processes in distributed systems synchronize. Synchronization is all about doing the right thing at
More informationAN OVERVIEW OF QUALITY OF SERVICE COMPUTER NETWORK
Abstract AN OVERVIEW OF QUALITY OF SERVICE COMPUTER NETWORK Mrs. Amandeep Kaur, Assistant Professor, Department of Computer Application, Apeejay Institute of Management, Ramamandi, Jalandhar-144001, Punjab,
More informationIntelligent Agents for Routing on Mobile Ad-Hoc Networks
Intelligent Agents for Routing on Mobile Ad-Hoc Networks Y. Zhou Dalhousie University yzhou@cs.dal.ca A. N. Zincir-Heywood Dalhousie University zincir@cs.dal.ca Abstract This paper introduces a new agent-based
More informationPART III. OPS-based wide area networks
PART III OPS-based wide area networks Chapter 7 Introduction to the OPS-based wide area network 7.1 State-of-the-art In this thesis, we consider the general switch architecture with full connectivity
More informationDistributed Systems Theory 6. Clock synchronization - logical vs. physical clocks. November 9, 2009
Distributed Systems Theory 6. Clock synchronization - logical vs. physical clocks November 9, 2009 1 Synchronization: single CPU sys vs. dist sys. Single CPU: DS: critical regions, mutual exclusion, and
More informationBounded Cost Algorithms for Multivalued Consensus Using Binary Consensus Instances
Bounded Cost Algorithms for Multivalued Consensus Using Binary Consensus Instances Jialin Zhang Tsinghua University zhanggl02@mails.tsinghua.edu.cn Wei Chen Microsoft Research Asia weic@microsoft.com Abstract
More informationReducing Task Completion Time in Mobile Offloading Systems through Online Adaptive Local Restart
Reducing Task Completion Time in Mobile Offloading Systems through Online Adaptive Local Restart Qiushi Wang and Katinka Wolter Freie Universität Berlin Institut für Informatik 2nd February 2015 Mobile
More informationAdaptive Tolerance Algorithm for Distributed Top-K Monitoring with Bandwidth Constraints
Adaptive Tolerance Algorithm for Distributed Top-K Monitoring with Bandwidth Constraints Michael Bauer, Srinivasan Ravichandran University of Wisconsin-Madison Department of Computer Sciences {bauer, srini}@cs.wisc.edu
More informationTD 271 Rev.1 (PLEN/15)
INTERNATIONAL TELECOMMUNICATION UNION STUDY GROUP 15 TELECOMMUNICATION STANDARDIZATION SECTOR STUDY PERIOD 2009-2012 English only Original: English Question(s): 12/15 Geneva, 31 May - 11 June 2010 Source:
More informationUsing Generalized Forecasts for Online Currency Conversion
Using Generalized Forecasts for Online Currency Conversion Kazuo Iwama and Kouki Yonezawa School of Informatics Kyoto University Kyoto 606-8501, Japan {iwama,yonezawa}@kuis.kyoto-u.ac.jp Abstract. El-Yaniv
More informationPQoS Parameterized Quality of Service. White Paper
P Parameterized Quality of Service White Paper Abstract The essential promise of MoCA no new wires, no service calls and no interference with other networks or consumer electronic devices remains intact
More information3.7. Clock Synch hronisation
Chapter 3.7 Clock-Synchronisation hronisation 3.7. Clock Synch 1 Content Introduction Physical Clocks - How to measure time? - Synchronisation - Cristian s Algorithm - Berkeley Algorithm - NTP / SNTP -
More informationComputer Networks and Internets, 5e Chapter 6 Information Sources and Signals. Introduction
Computer Networks and Internets, 5e Chapter 6 Information Sources and Signals Modified from the lecture slides of Lami Kaya (LKaya@ieee.org) for use CECS 474, Fall 2008. 2009 Pearson Education Inc., Upper
More informationDDR subsystem: Enhancing System Reliability and Yield
DDR subsystem: Enhancing System Reliability and Yield Agenda Evolution of DDR SDRAM standards What is the variation problem? How DRAM standards tackle system variability What problems have been adequately
More informationPrecision Time Protocol (PTP/IEEE-1588)
White Paper W H I T E P A P E R "Smarter Timing Solutions" Precision Time Protocol (PTP/IEEE-1588) The Precision Time Protocol, as defined in the IEEE-1588 standard, provides a method to precisely synchronize
More informationApplication of Adaptive Probing for Fault Diagnosis in Computer Networks 1
Application of Adaptive Probing for Fault Diagnosis in Computer Networks 1 Maitreya Natu Dept. of Computer and Information Sciences University of Delaware, Newark, DE, USA, 19716 Email: natu@cis.udel.edu
More informationPERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS
PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS Reza Azizi Engineering Department, Bojnourd Branch, Islamic Azad University, Bojnourd, Iran reza.azizi@bojnourdiau.ac.ir
More informationQuantum Support for Multiprocessor Pfair Scheduling in Linux
Quantum Support for Multiprocessor fair Scheduling in Linux John M. Calandrino and James H. Anderson Department of Computer Science, The University of North Carolina at Chapel Hill Abstract This paper
More informationPossible Applications
FRAUNHOFER Institute for integrated circuits iis DECT Wireless Voice and Data Communications DECT stands for Digital Enhanced Cordless Telecommunication and is an accepted standard in more than 100 countries.
More informationOptimal batch scheduling in DVB-S2 satellite networks
Optimal batch scheduling in DVB-S2 satellite networks G. T. Peeters B. Van Houdt and C. Blondia University of Antwerp Department of Mathematics and Computer Science Performance Analysis of Telecommunication
More informationStochastic Models for Inventory Management at Service Facilities
Stochastic Models for Inventory Management at Service Facilities O. Berman, E. Kim Presented by F. Zoghalchi University of Toronto Rotman School of Management Dec, 2012 Agenda 1 Problem description Deterministic
More informationPrediction of DDoS Attack Scheme
Chapter 5 Prediction of DDoS Attack Scheme Distributed denial of service attack can be launched by malicious nodes participating in the attack, exploit the lack of entry point in a wireless network, and
More informationNetwork Design Performance Evaluation, and Simulation #6
Network Design Performance Evaluation, and Simulation #6 1 Network Design Problem Goal Given QoS metric, e.g., Average delay Loss probability Characterization of the traffic, e.g., Average interarrival
More informationLoad Balancing and Switch Scheduling
EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load
More informationDynamic Network Resources Allocation in Grids through a Grid Network Resource Broker
INGRID 2007 Instrumenting the GRID Second International Workshop on Distributed Cooperative Laboratories Session 2: Networking for the GRID Dynamic Network Resources Allocation in Grids through a Grid
More information.:!II PACKARD. Performance Evaluation ofa Distributed Application Performance Monitor
r~3 HEWLETT.:!II PACKARD Performance Evaluation ofa Distributed Application Performance Monitor Richard J. Friedrich, Jerome A. Rolia* Broadband Information Systems Laboratory HPL-95-137 December, 1995
More informationA Transport Protocol for Multimedia Wireless Sensor Networks
A Transport Protocol for Multimedia Wireless Sensor Networks Duarte Meneses, António Grilo, Paulo Rogério Pereira 1 NGI'2011: A Transport Protocol for Multimedia Wireless Sensor Networks Introduction Wireless
More informationAlgorithms for Interference Sensing in Optical CDMA Networks
Algorithms for Interference Sensing in Optical CDMA Networks Purushotham Kamath, Joseph D. Touch and Joseph A. Bannister {pkamath, touch, joseph}@isi.edu Information Sciences Institute, University of Southern
More informationWhite Paper. Real-time Capabilities for Linux SGI REACT Real-Time for Linux
White Paper Real-time Capabilities for Linux SGI REACT Real-Time for Linux Abstract This white paper describes the real-time capabilities provided by SGI REACT Real-Time for Linux. software. REACT enables
More informationEnabling Open-Source High Speed Network Monitoring on NetFPGA
Network Operations and Management Symposium (NOMS) 2012 Enabling Open-Source High Speed Network Monitoring on NetFPGA Gianni Antichi, Stefano Giordano Email: @iet.unipi.it Department of Information
More informationDistributed Synchronization
CIS 505: Software Systems Lecture Note on Physical Clocks Insup Lee Department of Computer and Information Science University of Pennsylvania Distributed Synchronization Communication between processes
More informationDepartment of Electrical and Computer Engineering Ben-Gurion University of the Negev. LAB 1 - Introduction to USRP
Department of Electrical and Computer Engineering Ben-Gurion University of the Negev LAB 1 - Introduction to USRP - 1-1 Introduction In this lab you will use software reconfigurable RF hardware from National
More informationSFWR 4C03: Computer Networks & Computer Security Jan 3-7, 2005. Lecturer: Kartik Krishnan Lecture 1-3
SFWR 4C03: Computer Networks & Computer Security Jan 3-7, 2005 Lecturer: Kartik Krishnan Lecture 1-3 Communications and Computer Networks The fundamental purpose of a communication network is the exchange
More informationCONTROL MICROSYSTEMS DNP3. User and Reference Manual
DNP3 User and Reference Manual CONTROL MICROSYSTEMS SCADA products... for the distance 48 Steacie Drive Telephone: 613-591-1943 Kanata, Ontario Facsimile: 613-591-1022 K2K 2A9 Technical Support: 888-226-6876
More informationJournal of Theoretical and Applied Information Technology 20 th July 2015. Vol.77. No.2 2005-2015 JATIT & LLS. All rights reserved.
EFFICIENT LOAD BALANCING USING ANT COLONY OPTIMIZATION MOHAMMAD H. NADIMI-SHAHRAKI, ELNAZ SHAFIGH FARD, FARAMARZ SAFI Department of Computer Engineering, Najafabad branch, Islamic Azad University, Najafabad,
More information2 Basic Concepts. Contents
2. Basic Concepts Contents 2 Basic Concepts a. Link configuration b. Topology c. Transmission mode d. Classes of networks 1 a. Link Configuration Data links A direct data link is one that establishes a
More informationDeuceScan: Deuce-Based Fast Handoff Scheme in IEEE 802.11 Wireless Networks
: Deuce-Based Fast Handoff Scheme in IEEE 82.11 Wireless Networks Yuh-Shyan Chen, Chung-Kai Chen, and Ming-Chin Chuang Department of Computer Science and Information Engineering National Chung Cheng University,
More informationTrigno/Vicon System Integration
Delsys and Vicon Analog Integration Motion capture systems will often have the ability to sample analog data channels as a convenient means for synchronizing external data streams with motion capture data.
More informationSimulation-Based Security with Inexhaustible Interactive Turing Machines
Simulation-Based Security with Inexhaustible Interactive Turing Machines Ralf Küsters Institut für Informatik Christian-Albrechts-Universität zu Kiel 24098 Kiel, Germany kuesters@ti.informatik.uni-kiel.de
More informationECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2015
ECON 459 Game Theory Lecture Notes Auctions Luca Anderlini Spring 2015 These notes have been used before. If you can still spot any errors or have any suggestions for improvement, please let me know. 1
More informationLANs. Local Area Networks. via the Media Access Control (MAC) SubLayer. Networks: Local Area Networks
LANs Local Area Networks via the Media Access Control (MAC) SubLayer 1 Local Area Networks Aloha Slotted Aloha CSMA (non-persistent, 1-persistent, p-persistent) CSMA/CD Ethernet Token Ring 2 Network Layer
More information(Refer Slide Time: 00:01:16 min)
Digital Computer Organization Prof. P. K. Biswas Department of Electronic & Electrical Communication Engineering Indian Institute of Technology, Kharagpur Lecture No. # 04 CPU Design: Tirning & Control
More informationImplementation of a Lightweight Service Advertisement and Discovery Protocol for Mobile Ad hoc Networks
Implementation of a Lightweight Advertisement and Discovery Protocol for Mobile Ad hoc Networks Wenbin Ma * Department of Electrical and Computer Engineering 19 Memorial Drive West, Lehigh University Bethlehem,
More informationChapter 11 I/O Management and Disk Scheduling
Operating Systems: Internals and Design Principles, 6/E William Stallings Chapter 11 I/O Management and Disk Scheduling Dave Bremer Otago Polytechnic, NZ 2008, Prentice Hall I/O Devices Roadmap Organization
More informationInfluence of Load Balancing on Quality of Real Time Data Transmission*
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 6, No. 3, December 2009, 515-524 UDK: 004.738.2 Influence of Load Balancing on Quality of Real Time Data Transmission* Nataša Maksić 1,a, Petar Knežević 2,
More informationPredictable response times in event-driven real-time systems
Predictable response times in event-driven real-time systems Automotive 2006 - Security and Reliability in Automotive Systems Stuttgart, October 2006. Presented by: Michael González Harbour mgh@unican.es
More informationPerformance Monitoring and Control in Contention- Based Wireless Sensor Networks
Performance Monitoring and Control in Contention- Based Wireless Sensor Networks Thomas Lindh #1, Ibrahim Orhan #2 # School of Technology and Health, KTH Royal Institute of Technology Marinens vag 30,
More informationAn enhanced TCP mechanism Fast-TCP in IP networks with wireless links
Wireless Networks 6 (2000) 375 379 375 An enhanced TCP mechanism Fast-TCP in IP networks with wireless links Jian Ma a, Jussi Ruutu b and Jing Wu c a Nokia China R&D Center, No. 10, He Ping Li Dong Jie,
More informationNOVEL PRIORITISED EGPRS MEDIUM ACCESS REGIME FOR REDUCED FILE TRANSFER DELAY DURING CONGESTED PERIODS
NOVEL PRIORITISED EGPRS MEDIUM ACCESS REGIME FOR REDUCED FILE TRANSFER DELAY DURING CONGESTED PERIODS D. Todinca, P. Perry and J. Murphy Dublin City University, Ireland ABSTRACT The goal of this paper
More informationAn Overview of Clock Synchronization
An Overview of Clock Synchronization Barbara Simons, IBM Almaden Research Center Jennifer Lundelius Welch, GTE Laboratories Incorporated Nancy Lynch, MIT 1 Introduction A distributed system consists of
More informationONLINE EXERCISE SYSTEM A Web-Based Tool for Administration and Automatic Correction of Exercises
ONLINE EXERCISE SYSTEM A Web-Based Tool for Administration and Automatic Correction of Exercises Daniel Baudisch, Manuel Gesell and Klaus Schneider Embedded Systems Group, University of Kaiserslautern,
More informationAn Efficient Distributed Algorithm to Identify and Traceback DDoS Traffic
Ó The Author 26. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org doi:1.193/comjnl/bxl26
More informationContinuous network discovery using Opportunistic Scanning
Continuous network discovery using Opportunistic Scanning Authors: Date: 2009-11-17 Slide 1 Abstract This presentation is in response to WNG requesting more information on the capability of 802.11 to support
More informationRedes de Comunicação em Ambientes Industriais Aula 7
Redes de Comunicação em Ambientes Industriais Aula 7 Luís Almeida Paulo Pedreiras lda@det.ua.pt pedreiras@det.ua.pt Electronic Systems Lab-IEETA / DET Universidade de Aveiro Aveiro, Portugal RCAI 2005/2006
More informationMONITORING AND DIAGNOSIS OF A MULTI-STAGE MANUFACTURING PROCESS USING BAYESIAN NETWORKS
MONITORING AND DIAGNOSIS OF A MULTI-STAGE MANUFACTURING PROCESS USING BAYESIAN NETWORKS Eric Wolbrecht Bruce D Ambrosio Bob Paasch Oregon State University, Corvallis, OR Doug Kirby Hewlett Packard, Corvallis,
More information5 Performance Management for Web Services. Rolf Stadler School of Electrical Engineering KTH Royal Institute of Technology. stadler@ee.kth.
5 Performance Management for Web Services Rolf Stadler School of Electrical Engineering KTH Royal Institute of Technology stadler@ee.kth.se April 2008 Overview Service Management Performance Mgt QoS Mgt
More informationOn Correlating Performance Metrics
On Correlating Performance Metrics Yiping Ding and Chris Thornley BMC Software, Inc. Kenneth Newman BMC Software, Inc. University of Massachusetts, Boston Performance metrics and their measurements are
More informationRN-Codings: New Insights and Some Applications
RN-Codings: New Insights and Some Applications Abstract During any composite computation there is a constant need for rounding intermediate results before they can participate in further processing. Recently
More informationThe QOOL Algorithm for fast Online Optimization of Multiple Degree of Freedom Robot Locomotion
The QOOL Algorithm for fast Online Optimization of Multiple Degree of Freedom Robot Locomotion Daniel Marbach January 31th, 2005 Swiss Federal Institute of Technology at Lausanne Daniel.Marbach@epfl.ch
More information1 The EOQ and Extensions
IEOR4000: Production Management Lecture 2 Professor Guillermo Gallego September 9, 2004 Lecture Plan 1. The EOQ and Extensions 2. Multi-Item EOQ Model 1 The EOQ and Extensions This section is devoted to
More information