Design and analysis of load balancing scheduling strategies on distributed computer networks using virtual routing approach

... consideration of practical constraints In the following, the main contributions of this thesis on indivisible load balancing and divisible load scheduling are discussed respectively For static load balancing ... optimization problem On the basis of these results, we propose an ecient algorithm for scheduling divisible loads using the concept of load balancing...

Ngày tải lên: 16/09/2015, 15:54

... on the design and analysis of algorithms for solving a class of routing shop scheduling problems In the last four decades, considerable research work has been carried out on manufacturing scheduling ... The authors claimed that the space-based local search method performed equally well as the ACO algorithm and that the GRASP gave better solutions than the ACO i...

Ngày tải lên: 14/09/2015, 14:07

... lower bandwidth consumption and less access latency In [55], a method of combining unicasting, patching, staggered broadcasting, and streambundling broadcasting was proposed to deliver videos of ... partitioning”, and “video partitioning” Media segmentation in temporal domains and spatial domains Segmenting/partitioning media streams can be made in the temporal domains or i...

Ngày tải lên: 16/09/2015, 08:30

... DESIGN AND ANALYSIS OF ALGORITHMS FOR SOLVING SOME STOCHASTIC VEHICLE ROUTING AND SCHEDULING PROBLEMS By TENG SUYAN (B.ENG M.ENG.) A THESIS SUBMITTED FOR THE DEGREE OF DOCTOR OF PHILOSOPHY ... administration problems in running the depots, in designing an information system, in routing and scheduling of vehicles to customers, in loading of goods i...

Ngày tải lên: 17/09/2015, 17:19

Ngày tải lên: 17/04/2014, 09:16

... can be completely avoided and the lifetime of the BSN can be prolonged Another energy-efficient TDMA-based MAC protocol for wireless BSNs is the BodyMAC [13], which uses flexible and efficient bandwidth ... conditions, an energy-efficiency comparison between DQMAC performance and that of the standard facto 802.15.4 MAC and the BSN -MAC is portrayed BSN -MAC has been selected...

Ngày tải lên: 21/06/2014, 11:20

... Res Lett (2008) 3:416–420 design can be employed as memory cells We also develop a continuum model in this paper to analyze the proposed NEMS memory cell design Design of Memory Cells Figure illustrates ... used as a random access memory (RAM) cell It should be noted that Kang and Hwang [16] proposed the similar NEMS design, called ‘Carbon nanotube shuttle’ memory device Ho...

Ngày tải lên: 22/06/2014, 01:20

... 30.11 Table 5: The ten best results of the BOWS hall of fame, at the end of the two phases of the contest The attacks carried out in the second phase of the contest are the ones with the dates in ... results of the first phase of the contest, and the last five are results of the second phase In Figure a summary of these results is given: the P...

Ngày tải lên: 22/06/2014, 19:20

... set and sends back HCM Terminate (b) Proposed soft handoff procedure Figure 6: Soft handoff algorithm and procedure 4.2 Soft handoff One of the major benefits of a CDMA system is the ability of a ... Spain, September 2004 [7] J Yao, T C Wong, and Y H Chew, Cross-layer design on the reverse and forward links capacities balancing in cellular CDMA systems,” in Proceedings...

Ngày tải lên: 22/06/2014, 22:20

... proof of Theorem 2. 1.1.) 92 BASIC PROBLEMS AND PROTOCOLS Exercise 2. 9. 12 Let G be a tree Show that, in this case, no Backedge messages will be sent in any execution of DF Traversal Exercise 2. 9.13 ... costs of Flood+Reply, and thus of Shout, are also simple to determine; in fact (Exercise 2. 9 .21 ): T[Flood+Reply] = T[Flooding]+1 Thus M[Shout] = 4m − 2n + (2. 14) T[Shou...

Ngày tải lên: 12/08/2014, 16:21

... (Exercise 3.10. 64) Protocol CompleteElect implementing the strategy we have just designed is shown in Figures 3 .43 , 3 .44 , and 3 .45 Let us analyze the cost of the protocol How many candidates there ... two copies of G and remove from both of them the edge e; we then connect these two graphs G and G by adding two new edges e1 = (x , x ) and e2 = (y , y ), where x and x (re...

Ngày tải lên: 12/08/2014, 16:21

... 34:372–3 76, 1985 [ 16] D Rotem, N Santoro, and J.B Sidney Shout-echo selection in distributed files Networks, 16: 77– 86, 19 86 [17] N Santoro, M Scheutzow, and J.B Sidney On the expected complexity of distributed ... 1989 [6] O Gerstel and S Zaks The bit complexity of distributed sorting Algorithmica, 18: 405–4 16, 1997 [7] H.P Hofstee, A.J Martin, and J.L.A van de Snepsch...

Ngày tải lên: 12/08/2014, 16:21

... If the result of AND is 1, all the entities have value and are in state minimum, and thus know the result If the result of AND MIN-FINDING AND ELECTION: WAITING AND GUESSING 3 67 is 0, the entities ... the existence and the nature of the trade-off between time and bits Some interesting choices are shown in Figure 6. 27 Examining the trade-off, we discover two important...

Ngày tải lên: 12/08/2014, 16:21

... entity), and we will treat both spontaneous events and the ringing of the alarm clocks as the same type of events and call them timeouts We represent by (x, M) the event of x receiving message M, and ... To understand which properties (and thus restrictions) would suffice we need to examine the proof of Theorem 7.2.1 and to understand what are the particular conditions insid...

Ngày tải lên: 12/08/2014, 16:21

... types of failures Distributed Computing, 2 :95 –103, 198 7 [28] J.Y Halpern and Y Moses Knowledge and common knowledge in a distributed environment Journal of the ACM, 37(3):5 49 587, July 199 0 [ 29] ... proofs for distributed consensus Distributed Computing, 1(1):26– 39, 198 6 [22] M.J Fisher, N.A Lynch, and M.S Paterson Impossibility of distributed consensus with one...

Ngày tải lên: 12/08/2014, 16:21