DAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications
|
|
- Grace Brooks
- 6 years ago
- Views:
Transcription
1 DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Thinh Nguyen School of EECS Oregon State Univerity Corvalli, OR 97330, USA Duc A. Tran Department of Computer Science Univerity of Maachuett at Boton Boton, MA 02125, USA Abtract In thi paper we tudy the problem of aigning uer to erver and data replication in a ditributed manner for online ocial networking OSN) application. Typical OSN application uch a Facebook and Twitter are built on top of an infratructure of erver, which handle the uer data torage and communication. Thu, for a given uer communication pattern, the load of the erver depend critically on the aignment of uer to erver. A good aignment will reduce the overall load of the ytem. Furthermore, by replicating data acro the erver judiciouly, the overall load can alo be further reduced. Unfortunately, thi optimal aignment and data replication problem i NP-hard. Therefore, we introduce a ditributed heuritic algorithm in which the erver perform local computation and exchange information among each other iteratively in uch a way that the algorithm converge to a good aignment and replication in term of reducing the overall ytem load a well a balancing the load among the erver. In contrat with a centralized algorithm, a ditributed algorithm offer the advantage of balancing the computation among all the erver a well a the ability to naturally adapt to timevarying uer communication pattern. Simulation reult how promiing performance for the propoed algorithm. Index Term Ditributed optimization, ocial network, large cale ditributed ytem, data replication I. INTRODUCTION For calability, online ocial network OSN) uch a Facebook, Twitter, Linkedin, etc. employ an underlying infratructure of erver which handle the communication and data torage on behalf of the uer. Specifically, each uer i aigned to a primary erver. When data i tranferred from one uer to another, the uer do not et up a network connection directly with each other. Intead, their primary erver will perform the data tranfer on their behalf. If the two uer are aigned to the ame primary erver, then intercommunication between two erver are not needed. A a reult, for a given uer communication pattern, the load of the erver depend critically on the aignment of uer to erver. To be concrete, Thi work wa upported in part by the National Science Foundation under grant CNS and CNS in thi paper we conider the following protocol ued in a typical cenario of OSN application wall pot in FaceBook. When a uer u goe online, it will 1) iue a read requet to it primary erver u for tored peronal data and then requet for it friend information; 2) If it friend are aigned on the ame u, the read requet for friend meage i imply reading data from the local torage; 3) However, if ome of it friend are aigned to different erver, then the primary erver forward the read requet to every primary erver of it friend. In repone to the requet, the friend primary erver read the data e.g., the previouly poted meage by it friend) from their databae, and end them back to u. u then return the data to uer u. In thi cenario, the erver load i incurred by 1) reading data from the databae and 2) communication between erver. A an example, let u conider a uer u, it two friend, uer v and w with their different primary erver u, v, and w, repectively. When uer u goe on line, it will read data from it primary erver S u which incur a read load. Next, S u end two requet to v and w to requet the updated data from v and w on behalf on u. Thi incur a communication load on three erver. v and w then read the updated data from their databae which incur a read load on them. v and w then return the updated data back to u which further incur a communication cot. We note that the read cot i primarily due to time and computation involved with reading data from dik while the communication cot i primarily due to the bandwidth cot. The communication cot i reduced if uer v and w reide on the ame primary erver u. In that cae, no inter-erver communication i needed, thu no communication load i incurred. On the other hand, the read load remain the ame ince three read from the databae are till required. Thu, to reduce the overall load, it make ene to aign friend to the ame erver. However, thi i not alway poible. One way to reduce the load i to replicate the uer data acro multiple erver. Replication. If the data of uer v i replicated on the primary erver of it friend uer u. Then when u goe online,
2 no inter-erver communication load i incurred. Furthermore, replicating uer data on different erver alo make the ytem le uceptible to bottleneck failure. However, data replication incur a load of writing additional data to the databae. Thu, there i a trade-off in term of the communication load and writing load which in turn depend on the frequency of reading veru writing for different uer. Load Balance. Another important apect affecting the ytem performance i to balance the load among the erver, i.e., to prevent the cenario where ome erver are overloaded while other are idle. It i well-known that thee cenario can ubtantially degrade the performance of a ditributed ytem. Baed on the dicuion above, for a given uer communication pattern, the load of the erver depend critically on the aignment of uer to erver. The uer communication pattern are defined by not only the ocial network of friend typically repreented a a relationhip graph among friend), but alo how often uer log in Facebook read), pot meage write), and the length of the poted meage. A good aignment will reduce the overall load and balance the individual load among the erver. Furthermore, by replicating data acro the erver judiciouly, the overall load can alo be further reduced. II. BACKGROUND There are two main tak of data management in OSN: aignment uer to erver and data replication. There are much work focuing on thee uch problem. In [1], author propoed a centralized algorithm for partitioning the network of uer baed on a relaxation of an integer program. The dynamical change of the network a well a replication problem were not conidered in thi work. Algorithm propoed in [2] and are baed on the community tructure of the network. Modularity i a very good parameter which repreent the tructure of the network a well a how uer are related among themelve. However, computing modularity for the whole network i computationally expenive. Replication cheme propoed in [3] and [4] relie on a fixed partition cheme and a fixed number of replica i applied for all uer data. When network tructure change, i.e node addition/deletion, a new aignment cheme might be needed to achieved before changing replication cheme would lead to better ytem performance. Moreover, ocial network are very kew where mot uer having low degree of friend; and with a good aignment cheme the required replica i minimal and the redundant replica merely upport load balance among erver. Our work focue on ditributed algorithm which adapt to the dynamical change of the network and minimize the global objective function value which i the um of load incurred by uer activitie. Unfortunately, thi optimal aignment and data replication problem i NP-hard. Therefore, we introduce a ditributed heuritic algorithm in which the erver perform local computation and exchange information among each other iteratively in uch a way that the algorithm converge to a good aignment and replication in term of 1) reducing the overall ytem load a well a 2) balancing the load among the erver. In contrat with a centralized algorithm, a ditributed algorithm offer the advantage of balancing the computation among all the erver and the ability to naturally adapt to the time-varying uer communication pattern which i often the cae for OSN application. III. PROBLEM FORMULATION We firt define the following notation and derive the quantitie of interet: N, M: Number of uer and erver, repectively. V, S: A et of all uer and erver, repectively. Nv): et of uer who ha relationhip with uer v v neighbor). c r v, c w v, c t v: average cot of reading/writing and tranferring v data repectively. Thee cot are function of v total load amount. P {0, 1} N M : An aignment matrix where p u = 1 if uer u i aigned to a primary erver, and p u = 0 otherwie. Since a uer i aigned exactly to one primary M erver, p u = 1 and 0 N p u N, i. =1 u=1 X {0, 1} N M : A replication matrix where x up = 1 if uer u data i replicated on erver p, and x u = 0 otherwie. Since uer data i never replicated on it primary erver, x u p u.if uer u data i replicated M on K erver, x u = K. =1 r v, w v : the uer v average rate of reading and writing, repectively. In thi ection, we firt derive different type of load for a given uer-erver aignment without replication. Thee are neceary for the mathematical formulation and are the building block for the propoed ditributed algorithm. Replication will be conidered hortly. We now tart with the read and communication load. Read Load. Uer v data i intereted in by v itelf and it friend. Then the total read load on a erver i: L r = v V p v rv c r v + r u c r ) v Communication Load. If v and u are aigned to the ame primary erver, then there i no communication load. On the other hand, data need to be tranferred between the two, and thu the total communication load of i computed a: L c = v V p v 1) r u c t v1 p u ) ). 2) where p u [0, 1]. Write Load. Whenever a uer v update it data, a write load i incurred at it primary erver, and total write load at erver i: L w = v V w v c w v p v. 3)
3 From all the above, the total load of all the erver without replication L wor i computed a: L wor = S L r + L c + L w. 4) Data Replication. Up until now we dicu the communication, read, and write load auming no data replication. Now if uer data i replicated on erver, a dicued previouly, the communication load will be reduced. Therefore, the total change in the ytem load due to replication i: L Rep = v V x vn wv c w v c t v n S r u p un ) The total load with replication L can be now rewritten a: Let 5) L = L wo + L Rep. 6) L = L M and d = L L denote the average erver load and the imbalance load of erver, repectively. We define our objective function a: F = L + α max d, 7) where α, 1) i the weighted factor for controlling the trade-off between load imbalance and the total erver load. The problem of aigning uer to erver and replication data i now cated a an integer programming problem with the optimization variable being p u and x u, denoting the primary uer-erver aignment and the replication cheme, repectively. Formally, the optimization problem i: Minimize: F Subject to: p u = 1 u 8) p u + x u 1 u 9) x u K 10) p u {0, 1} 11) x u {0, 1} 12) The contraint 8) enure that every uer ha exactly one primary erver; contraint 9) guarantee that uer u data i never replicated on the ame primary erver; and contraint 10) retrict the maximum number of replica within ytem. Thi optimization problem i unfortunately NP-hard. The proof i omitted due to limited pace. Therefore, in the next ection we will preent a ditributed algorithm that produce an approximate olution. Propoition 1: The global objective function i bounded by: F L F < F U 13) and Where F L = v V wv c w v + r v c r v + { F U = F L + max L c max, L Rep max with L c max = v V } r u c r ) v 14) + α N 1 N F L 15) r u c t v1 p u ) L Rep max = v V w v c w v min{ Nv), N} Proof: The detailed proof i omitted due to the lack of pace. IV. DISTRIBUTED ALGORITHM/PROTOCOL In thi ection, we propoe an approximate ditributed algorithm for olving the optimization problem above. The algorithm conit of two part. The firt part i a greedy method to provide quick convergence to a local olution. The next part employ imulated annealing method to overcome the local olution. For the firt part, the main idea i: at each time tep, the mot overloaded erver i elected to 1) reaign ome of it uer to other erver or 2) replicate it uer data to other erver in order to reduce it load. By appropriate taking either one or two action above, both the total load and and load imbalance will be imultaneouly reduced over time. For uch an algorithm to work, ome mall amount of information mut be kept and exchanged among the erver to allow the erver to know immediately whether 1) it i the mot overloaded erver and 2) whether it hould take action 1) or 2). The econd part, imulated annealing method will alo be computed locally. In what follow, we how the following information and local computation are ufficient to perform uch a ditributed algorithm. Local information and computation. Each erver i aumed to handle a number of uer, and thu it maintain all information pertained to it local uer. Specifically, thi information include a table of total read load incurred by each uer due to it friend from other uer. Let u define the following locally tored information at erver : N, V : The number and the et of uer primarily aigned to erver, repectively. L N M 1) : A matrix repreent the average load due to v data requet from other erver whoe entrie L v, n), n S \ denote the load of reading and tranferring v data to it friend located on erver n. Recall that L v, n) = p ut1 x vn )r u c r v. N r, V r : : The number and the et of uer whoe data are replicated on erver. kv): number of v replica. Given the information above, the total read and communication load at erver can be computed locally a: L r = v V rv c r v + n L v, n) ) 16)
4 Similarly, the total write load at erver can be computed locally a: L w = v V w v c w v + u V r w u c w u 17) The total load that erver contribute to the overall ytem load i: L = L r + L w 18) Now, each erver exchange their total load among each other. Thu, every erver will be able to determine whether it i the maximum load erver. Next, given that a erver i the maximum load erver, it will either 1) reaign ome of it uer to other erver or 2) replicate it uer data to other erver in order to reduce it load. To chooe either of the action, the maximum load erver will ue a greedy approach that take the action out of two that reult in the maximum reduction of the objective value F. The reduction of the objective value due to each of the action can be etimated locally a follow. Load Change due to Replication. If uer v current data on, i replicated on erver n, then the local read and communication load at erver will reduce by L v, n) ince L v, n) = 0 after the replication action. The write load at erver t will increae by w r. The load at erver will decreae by L v, n), the load at erver n will increae by w v c w v and the overall ytem load will change by: L = w v c w v L v, d) 19) Load Change due to Reaignment of Primary Server. Aume i the primary erver of v, then by reaigning uer v to another erver n, the load at erver will decreae by L v, n) + w v c w v, the load at erver n will increae by p ur u c r v + 1 x vn )w v c w v, and the change in the overall ytem load i: L = p u r u c r v L v, n) x vn w v c w 20) Load Change due to Replication Removal. Often, due to greedy move, it i poible that one get a lower objective value by backtracking via removing a replication. Therefore, we will calculate the reduced load due to removing a replication. If we remove u replication on erver, the load at erver will increae by v Nu) p vr v c t u w u c w u, and the change in overall ytem load i: L = p v r v c t u w u c w u 21) v Nu) For each of the change in load, we will alo be able to compute the change in F which include the load imbalance ince the load from all other erver are available. It i important to note that 19),20),21) can be computed locally. Thu, we propoe the following ditributed algorithm DAROS) for uer-erver aignment and replication. There TABLE I: Simulation reult M,K) % Global cot aved %Inter-erver % Repl. cot 8,1) ,3) ,7) ,1) ,3) ,7) are two tage in DAROS: optimization mode and convergence mode. In optimization mode, only overload erver involve in the optimization proce. Each overload erver elect each currently aigned uer and compute the gain of reaigning uer to a new erver or replicating uer data only and/or removing current replication. The deciion are made baed on which action will reult in better gain. The proce of replicating and reaigning uer in the optimization mode will be iterated until no more change in uer-aignment i oberved, i.e., the algorithm probably converge to a local olution. We call thi the convergence mode. To overcome the local olution, in the convergence mode, all erver will compute the gain of each tentative action reaign, replicate or remove replication) and make a deciion with probability of min{1, exp F/ where F i the etimated gain and i an experimental coefficient for controlling the convergence rate of the overall DAROS. We ued T B a a function of global objective value in uch a way that if the global objective function value i near the global optimal point, the probability of perturbation i low, i.e = β F F L F U F L. Thi i the bai of the imulated annealing method. We now decribe with the firt tage of the algorithm. Algorithm 1 DAROS 1: Input: {V }, {L }, K 2: Output: p u, x u 3: Aign equal number of uer to each erver uniformly at random. 4: Set mode to optimization 5: repeat 6: if mode i optimization then 7: Run algorithm 2 8: if No action ha been made then 9: Switch to convegence mode 10: end if 11: ele//convergence mode 12: Run algorithm 3 13: Switch to Optimization mode 14: end if 15: until Freeze V. SIMULATION RESULT In thi ection, we how our preliminary imulation reult. In particular, we ue the Facebook data [5] which ha N = uer and 817,090 relationhip. Simulation parame-
5 Algorithm 2 Optimization mode 1: At each time tep, the erver exchange their load among each other. 2: if i the mot overloaded erver then 3: for each v in V do 4: Reaign uer baed on F Reaign 20) 5: Replicate uer data baed on F Repl 19) 6: end for 7: % Now we perform backtrack ince during the previou greedy move might be uboptimal. 8: for each v in V r do 9: Let F removing = change in objective value by removing v replication uing 21) 10: if F removing < 0 then 11: Removing v replication on 12: Decreae kv) 13: end if 14: end for 15: end if Algorithm 3 Convergence mode 1: Set T B = β F F L F U F L 2: for each v at every erver do 3: for each n S \ do 4: Compute F Reaign by 20) 5: Reaign v to t with 6: probability min{1, exp F Reaign 7: if There i no v replication on t then 8: F Repl by 19) 9: Replicate v data on t 10: with probability min{1, exp F Repl 11: end if 12: for each v in V r do 13: F Remove by 21) 14: Remove v data replication 15: with probability min{1, exp F Remove 16: end for 17: end for 18: end for ter are: ReadRate=1, WriteRate=0.1, ReadCot=0.01, Write- Cot=1, TranferCot=0.02, α = 0.5; M,K) = 8,1),8,3),8,7). Fig. 1a), Fig. 1b), and 1c) how the change in global objective function value, the inter-erver communication cot, and the replication cot, repectively. Initially, the erver are aigned an equal number of uer uniformly at random. Thu, a imple algorithm of aigning equal number of uer to each erver would have the performance imilar to that of the propoed algorithm at iteration = 0. A een, the objective function decreae ignificantly over time, howing the ignificant benefit of our propoed algorithm over the naive method. Each pike in the graph correpond to the imulated annealing method to overcome the local minimum. Once the uer are perturbed in convergence mode, the communication and replication cot increae dramatically. However, at next iteration, thee cot reduce ignificantly due to appropriate reaignment and replication. A een, thi help the algorithm to further reduce the objective value and inter-erver communication cot. The imulation reult table I) how that the global cot i aved by about 46% compared to the random aignment/replication cheme. The inter-erver communication cot and the replication cot are jut mall fraction of the global cot. Global objective function 1.6 x # iteration a) Replcation cot %) Inter erver comm. cot %) # iteration c) # iteration Fig. 1: a) Objective function value b) Inter-erver communication cot %) c) Replication cot %). VI. CONCLUSION We tudy the problem of aigning uer to erver and data replication in a ditributed manner for online ocial networking OSN) application. Thi problem i NP-hard. Therefore, we introduce a ditributed heuritic algorithm that find a good aignment and replication in term of reducing the overall ytem load a well a balancing the load among the erver. In contrat with a centralized algorithm, a ditributed algorithm offer the advantage of balancing the computation among all the erver and the ability to naturally adapt to time-varying uer communication pattern. Simulation reult how the effectivene of our propoed algorithm. REFERENCES [1] H. Nihida and T. Nguyen, Optimal client-erver aignment for internet ditributed ytem, in ICCCN [2] M. Newman, Modularity and community tructure in network. in Proc Natl Acad Sci USA 2006). [3] D. A. Tran, K. Nguyen, and C. Pham, S-CLONE: Sociallyaware data replication for ocial network, Comput. Netw., vol. 56, no. 7, pp , May [Online]. Available: [4] K. Nguyen, C. Pham, D. A. Tran, and F. Zhang, Preerving ocial locality in data replication for ocial network, in Proceeding of IEEE ICDCS 2011 Workhop on Simplifying Complex Network for Practitioner SIMPLEX 2011), Minneapoli, MN, June [5] B. Viwanath, A. Milove, M. Cha, and K. P. Gummadi, On the evolution of uer interaction in Facebook, in Proc. Workhop on Online Social Network, 2009, pp b)
Lecture 14: Minimum Spanning Tree I
COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce
More informationKey Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.
Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in
More informationA Practical Model for Minimizing Waiting Time in a Transit Network
A Practical Model for Minimizing Waiting Time in a Tranit Network Leila Dianat, MASc, Department of Civil Engineering, Sharif Univerity of Technology, Tehran, Iran Youef Shafahi, Ph.D. Aociate Profeor,
More informationAN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROBLEM
RAC Univerity Journal, Vol IV, No, 7, pp 87-9 AN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROLEM Mozzem Hoain Department of Mathematic Ghior Govt
More informationPerformance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationMinimum congestion spanning trees in bipartite and random graphs
Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu
More informationDistributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router
Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To
More informationSee chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM
Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two
More informationAnalyzing Hydra Historical Statistics Part 2
Analyzing Hydra Hitorical Statitic Part Fabio Maimo Ottaviani EPV Technologie White paper 5 hnode HSM Hitorical Record The hnode i the hierarchical data torage management node and ha to perform all the
More informationService and Network Management Interworking in Future Wireless Systems
Service and Network Management Interworking in Future Wirele Sytem V. Tountopoulo V. Stavroulaki P. Demeticha N. Mitrou and M. Theologou National Technical Univerity of Athen Department of Electrical Engineering
More informationRouting Definition 4.1
4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing
More informationUniversität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut
More informationSLA Adaptation for Service Overlay Networks
SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada
More informationKeywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE
Volume 5, Iue 8, Augut 2015 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Verification of Agent
More information1 The secretary problem
Thi i new material: if you ee error, pleae email jtyu at tanford dot edu 1 The ecretary problem We will tart by analyzing the expected runtime of an algorithm, a you will be expected to do on your homework.
More informationTopics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X
Lecture 37: Global Optimization [Adapted from note by R. Bodik and G. Necula] Topic Global optimization refer to program optimization that encompa multiple baic block in a function. (I have ued the term
More informationAn Approach to a Test Oracle for XML Query Testing
An Approach to a Tet Oracle for XML Query Teting Dae S. Kim-Park, Claudio de la Riva, Javier Tuya Univerity of Oviedo Computing Department Campu of Vieque, /n, 33204 (SPAIN) kim_park@li.uniovi.e, claudio@uniovi.e,
More informationConnected Placement of Disaster Shelters in Modern Cities
Connected Placement of Diater Shelter in Modern Citie Huanyang Zheng and Jie Wu Department of Computer and Information Science Temple Univerity, USA {huanyang.zheng, jiewu}@temple.edu ABSTRACT Thi paper
More informationA Hybrid Deployable Dynamic Traffic Assignment Framework for Robust Online Route Guidance
A Hybrid Deployable Dynamic Traffic Aignment Framework for Robut Online Route Guidance Sriniva Peeta School of Civil Engineering, Purdue Univerity Chao Zhou Sabre, Inc. Sriniva Peeta School of Civil Engineering
More informationCutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck.
Cutting Stock by Iterated Matching Andrea Fritch, Oliver Vornberger Univerity of Onabruck Dept of Math/Computer Science D-4909 Onabruck andy@informatikuni-onabrueckde Abtract The combinatorial optimization
More informationStochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang
Stochatic Search and Graph Technique for MCM Path Planning Chritine D. Piatko, Chritopher P. Diehl, Paul McNamee, Cheryl Rech and I-Jeng Wang The John Hopkin Univerity Applied Phyic Laboratory, Laurel,
More informationHassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,
COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon ghaziri@aub.edu.lb Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM)
More informationLinkGuide: Towards a Better Collection of Hyperlinks in a Website Homepage
Proceeding of the World Congre on Engineering 2007 Vol I LinkGuide: Toward a Better Collection of Hyperlink in a Webite Homepage A. Ammari and V. Zharkova chool of Informatic, Univerity of Bradford anammari@bradford.ac.uk,
More informationA System Dynamics Model for Transient Availability Modeling of Repairable Redundant Systems
International Journal of Performability Engineering Vol., No. 3, May 05, pp. 03-. RAMS Conultant Printed in India A Sytem Dynamic Model for Tranient Availability Modeling of Repairable Redundant Sytem
More informationHow to Select Measurement Points in Access Point Localization
Proceeding of the International MultiConference of Engineer and Computer Scientit 205 Vol II, IMECS 205, March 8-20, 205, Hong Kong How to Select Meaurement Point in Acce Point Localization Xiaoling Yang,
More informationAdvanced Encryption Standard and Modes of Operation
Advanced Encryption Standard and Mode of Operation G. Bertoni L. Breveglieri Foundation of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) i a ymmetric cryptographic algorithm AES
More informationDrawing Lines in 2 Dimensions
Drawing Line in 2 Dimenion Drawing a traight line (or an arc) between two end point when one i limited to dicrete pixel require a bit of thought. Conider the following line uperimpoed on a 2 dimenional
More information3D SMAP Algorithm. April 11, 2012
3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative
More informationMarkov Random Fields in Image Segmentation
Preented at SSIP 2011, Szeged, Hungary Markov Random Field in Image Segmentation Zoltan Kato Image Proceing & Computer Graphic Dept. Univerity of Szeged Hungary Zoltan Kato: Markov Random Field in Image
More informationManeuverable Relays to Improve Energy Efficiency in Sensor Networks
Maneuverable Relay to Improve Energy Efficiency in Senor Network Stephan Eidenbenz, Luka Kroc, Jame P. Smith CCS-5, MS M997; Lo Alamo National Laboratory; Lo Alamo, NM 87545. Email: {eidenben, kroc, jpmith}@lanl.gov
More informationA Multi-objective Genetic Algorithm for Reliability Optimization Problem
International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR
More informationEdits in Xylia Validity Preserving Editing of XML Documents
dit in Xylia Validity Preerving diting of XML Document Pouria Shaker, Theodore S. Norvell, and Denni K. Peter Faculty of ngineering and Applied Science, Memorial Univerity of Newfoundland, St. John, NFLD,
More informationApplication of Social Relation Graphs for Early Detection of Transient Spammers
Radolaw rendel and Henryk Krawczyk Application of Social Relation raph for Early Detection of Tranient Spammer RADOSLAW RENDEL and HENRYK KRAWCZYK Electronic, Telecommunication and Informatic Department
More informationOn Peer-to-Peer Media Streaming Λ
On eer-to-eer Media Streaming Λ Dongyan Xu y, Mohamed Hefeeda, Suanne Hambruch, Bharat Bhargava Department of Computer Science urdue Univerity, Wet Lafayette, IN 797 fdxu, hefeeda, eh, bbg@c.purdue.edu
More informationOn successive packing approach to multidimensional (M-D) interleaving
On ucceive packing approach to multidimenional (M-D) interleaving Xi Min Zhang Yun Q. hi ankar Bau Abtract We propoe an interleaving cheme for multidimenional (M-D) interleaving. To achieved by uing a
More informationRefining SIRAP with a Dedicated Resource Ceiling for Self-Blocking
Refining SIRAP with a Dedicated Reource Ceiling for Self-Blocking Mori Behnam, Thoma Nolte Mälardalen Real-Time Reearch Centre P.O. Box 883, SE-721 23 Väterå, Sweden {mori.behnam,thoma.nolte}@mdh.e ABSTRACT
More informationTrainable Context Model for Multiscale Segmentation
Trainable Context Model for Multicale Segmentation Hui Cheng and Charle A. Bouman School of Electrical and Computer Engineering Purdue Univerity Wet Lafayette, IN 47907-1285 {hui, bouman}@ ecn.purdue.edu
More informationAUTOMATIC TEST CASE GENERATION USING UML MODELS
Volume-2, Iue-6, June-2014 AUTOMATIC TEST CASE GENERATION USING UML MODELS 1 SAGARKUMAR P. JAIN, 2 KHUSHBOO S. LALWANI, 3 NIKITA K. MAHAJAN, 4 BHAGYASHREE J. GADEKAR 1,2,3,4 Department of Computer Engineering,
More informationResearch Article Longest Path Reroute to Optimize the Optical Multicast Routing in Sparse Splitting WDM Networks
International Optic Volume 0, Article ID 9, page http://dxdoiorg/0/0/9 Reearch Article Longet Path Reroute to Optimize the Optical Multicat Routing in Spare Splitting WDM Network Huanlin Liu, Hongyue Dai,
More informationTowards Mobility-Aware Proactive Caching for Vehicular Ad hoc Networks
Toward Mobility-Aware Proactive aching for Vehicular Ad hoc Network Youef AlNagar, Sameh Hony, Amr A. El-Sherif Wirele Intelligent Network enter (WIN), Nile Univerity, Giza, Egypt. Department of Electrical
More informationIncreasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment
Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in
More information3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES
MAKARA, TEKNOLOGI, VOL. 9, NO., APRIL 5: 3-35 3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES Mochammad Zulianyah Informatic Engineering, Faculty of Engineering, ARS International Univerity,
More informationmapping reult. Our experiment have revealed that for many popular tream application, uch a networking and multimedia application, the number of VC nee
Reolving Deadlock for Pipelined Stream Application on Network-on-Chip Xiaohang Wang 1,2, Peng Liu 1 1 Department of Information Science and Electronic Engineering, Zheiang Univerity Hangzhou, Zheiang,
More informationUsing Partial Evaluation in Distributed Query Evaluation
A X x Z z R r y Y B Uing Partial Evaluation in Ditributed Query Evaluation Peter Buneman Gao Cong Univerity of Edinburgh Wenfei Fan Univerity of Edinburgh & Bell Laboratorie Anataio Kementietidi Univerity
More informationResource Auto-Scaling and Sparse Content Replication for Video Storage Systems
1 Reource Auto-Scaling and Spare Content Replication for Video Storage Sytem DI NIU 1, HONG XU 2 and BAOCHUN LI 3, Univerity of Alberta 1, City Univerity of Hong Kong 2, Univerity of Toronto 3 Many video-on-demand
More informationA SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS
A SIMPLE IMPERATIVE LANGUAGE Eventually we will preent the emantic of a full-blown language, with declaration, type and looping. However, there are many complication, o we will build up lowly. Our firt
More informationLaboratory Exercise 2
Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on
More informationThe Association of System Performance Professionals
The Aociation of Sytem Performance Profeional The Computer Meaurement Group, commonly called CMG, i a not for profit, worldwide organization of data proceing profeional committed to the meaurement and
More informationMulticast with Network Coding in Application-Layer Overlay Networks
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 22, NO. 1, JANUARY 2004 1 Multicat with Network Coding in Application-Layer Overlay Network Ying Zhu, Baochun Li, Member, IEEE, and Jiang Guo Abtract
More informationA Basic Prototype for Enterprise Level Project Management
A Baic Prototype for Enterprie Level Project Management Saurabh Malgaonkar, Abhay Kolhe Computer Engineering Department, Mukeh Patel School of Technology Management & Engineering, NMIMS Univerity, Mumbai,
More information[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata
he 32nd International Congre and Expoition on Noie Control Engineering Jeju International Convention Center, Seogwipo, Korea, Augut 25-28, 2003 [N309] Feedforward Active Noie Control Sytem with Online
More informationOperational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz
Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,
More informationA Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds *
Advance in Linear Algebra & Matrix Theory, 2012, 2, 20-24 http://dx.doi.org/10.4236/alamt.2012.22003 Publihed Online June 2012 (http://www.scirp.org/journal/alamt) A Linear Interpolation-Baed Algorithm
More informationDECENTRALIZED structured overlays and distributed. Distributed, Secure Load Balancing with Skew, Heterogeneity, and Churn
Harvard Technical Report TR-3-4 Ditributed, Secure Load Balancing with Skew, Heterogeneity, and Churn Jonathan Ledlie and Margo Seltzer Abtract Numerou propoal exit for load balancing in peer-to-peer (pp)
More informationMinimum Energy Reliable Paths Using Unreliable Wireless Links
Minimum Energy Reliable Path Uing Unreliable Wirele Link Qunfeng Dong Department of Computer Science Univerity of Wiconin-Madion Madion, Wiconin 53706 qunfeng@c.wic.edu Micah Adler Department of Computer
More informationLocalized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks
Localized Minimum Spanning Tree Baed Multicat Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Senor Network Hanne Frey Univerity of Paderborn D-3398 Paderborn hanne.frey@uni-paderborn.de
More informationxy-monotone path existence queries in a rectilinear environment
CCCG 2012, Charlottetown, P.E.I., Augut 8 10, 2012 xy-monotone path exitence querie in a rectilinear environment Gregory Bint Anil Mahehwari Michiel Smid Abtract Given a planar environment coniting of
More information999 Computer System Network. (12) Patent Application Publication (10) Pub. No.: US 2006/ A1. (19) United States
(19) United State US 2006O1296.60A1 (12) Patent Application Publication (10) Pub. No.: Mueller et al. (43) Pub. Date: Jun. 15, 2006 (54) METHOD AND COMPUTER SYSTEM FOR QUEUE PROCESSING (76) Inventor: Wolfgang
More informationFloating Point CORDIC Based Power Operation
Floating Point CORDIC Baed Power Operation Kazumi Malhan, Padmaja AVL Electrical and Computer Engineering Department School of Engineering and Computer Science Oakland Univerity, Rocheter, MI e-mail: kmalhan@oakland.edu,
More informationSet-based Approach for Lossless Graph Summarization using Locality Sensitive Hashing
Set-baed Approach for Lole Graph Summarization uing Locality Senitive Hahing Kifayat Ullah Khan Supervior: Young-Koo Lee Expected Graduation Date: Fall 0 Deptartment of Computer Engineering Kyung Hee Univerity
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in Verilog and implemented
More informationNew Structural Decomposition Techniques for Constraint Satisfaction Problems
New Structural Decompoition Technique for Contraint Satifaction Problem Yaling Zheng and Berthe Y. Choueiry Contraint Sytem Laboratory Univerity of Nebraka-Lincoln Email: yzheng choueiry@ce.unl.edu Abtract.
More informationUC Berkeley International Conference on GIScience Short Paper Proceedings
UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment
More informationA CLUSTERING-BASED HYBRID REPLICA CONTROL PROTOCOL FOR HIGH AVAILABILITY IN GRID ENVIRONMENT
Journal of Computer Science 10 (12): 2442-2449, 2014 ISSN: 1549-3636 2014 R. Latip et al., Thi open acce article i ditributed under a Creative Common Attribution (CC-BY) 3.0 licene doi:10.3844/jcp.2014.2442.2449
More informationnp vp cost = 0 cost = c np vp cost = c I replacing term cost = c+c n cost = c * Error detection Error correction pron det pron det n gi
Spoken Language Paring with Robutne and ncrementality Yohihide Kato, Shigeki Matubara, Katuhiko Toyama and Yauyohi nagaki y Graduate School of Engineering, Nagoya Univerity y Faculty of Language and Culture,
More informationArchitecture and grid application of cluster computing system
Architecture and grid application of cluter computing ytem Yi Lv*, Shuiqin Yu, Youju Mao Intitute of Optical Fiber Telecom, Chongqing Univ. of Pot & Telecom, Chongqing, 400065, P.R.China ABSTRACT Recently,
More informationDiverse: Application-Layer Service Differentiation in Peer-to-Peer Communications
Divere: Application-Layer Service Differentiation in Peer-to-Peer Communication Chuan Wu, Student Member, IEEE, Baochun Li, Senior Member, IEEE Department of Electrical and Computer Engineering Univerity
More informationA Load Balancing Model based on Load-aware for Distributed Controllers. Fengjun Shang, Wenjuan Gong
4th International Conference on Machinery, Material and Computing Technology (ICMMCT 2016) A Load Balancing Model baed on Load-aware for Ditributed Controller Fengjun Shang, Wenjuan Gong College of Compute
More informationA Fast Association Rule Algorithm Based On Bitmap and Granular Computing
A Fat Aociation Rule Algorithm Baed On Bitmap and Granular Computing T.Y.Lin Xiaohua Hu Eric Louie Dept. of Computer Science College of Information Science IBM Almaden Reearch Center San Joe State Univerity
More informationFocused Video Estimation from Defocused Video Sequences
Focued Video Etimation from Defocued Video Sequence Junlan Yang a, Dan Schonfeld a and Magdi Mohamed b a Multimedia Communication Lab, ECE Dept., Univerity of Illinoi, Chicago, IL b Phyical Realization
More informationChapter S:II (continued)
Chapter S:II (continued) II. Baic Search Algorithm Sytematic Search Graph Theory Baic State Space Search Depth-Firt Search Backtracking Breadth-Firt Search Uniform-Cot Search AND-OR Graph Baic Depth-Firt
More informationOptimal Multi-Robot Path Planning on Graphs: Complete Algorithms and Effective Heuristics
Optimal Multi-Robot Path Planning on Graph: Complete Algorithm and Effective Heuritic Jingjin Yu Steven M. LaValle Abtract arxiv:507.0390v [c.ro] Jul 05 We tudy the problem of optimal multi-robot path
More informationShortest Paths Problem. CS 362, Lecture 20. Today s Outline. Negative Weights
Shortet Path Problem CS 6, Lecture Jared Saia Univerity of New Mexico Another intereting problem for graph i that of finding hortet path Aume we are given a weighted directed graph G = (V, E) with two
More informationDelaunay Triangulation: Incremental Construction
Chapter 6 Delaunay Triangulation: Incremental Contruction In the lat lecture, we have learned about the Lawon ip algorithm that compute a Delaunay triangulation of a given n-point et P R 2 with O(n 2 )
More informationBuilding a Compact On-line MRF Recognizer for Large Character Set using Structured Dictionary Representation and Vector Quantization Technique
202 International Conference on Frontier in Handwriting Recognition Building a Compact On-line MRF Recognizer for Large Character Set uing Structured Dictionary Repreentation and Vector Quantization Technique
More informationAn Algebraic Approach to Adaptive Scalable Overlay Network Monitoring
An Algebraic Approach to Adaptive Scalable Overlay Network Monitoring ABSTRACT Overlay network monitoring enable ditributed Internet application to detect and recover from path outage and period of degraded
More informationComputer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder
Computer Arithmetic Homework 3 2016 2017 Solution 1 An adder for graphic In a normal ripple carry addition of two poitive number, the carry i the ignal for a reult exceeding the maximum. We ue thi ignal
More informationCompressed Sensing Image Processing Based on Stagewise Orthogonal Matching Pursuit
Senor & randucer, Vol. 8, Iue 0, October 204, pp. 34-40 Senor & randucer 204 by IFSA Publihing, S. L. http://www.enorportal.com Compreed Sening Image Proceing Baed on Stagewie Orthogonal Matching Puruit
More information(12) Patent Application Publication (10) Pub. No.: US 2003/ A1
US 2003O196031A1 (19) United State (12) Patent Application Publication (10) Pub. No.: US 2003/0196031 A1 Chen (43) Pub. Date: Oct. 16, 2003 (54) STORAGE CONTROLLER WITH THE DISK Related U.S. Application
More informationISSN: (Online) Volume 3, Issue 4, April 2015 International Journal of Advance Research in Computer Science and Management Studies
ISSN: 2321-7782 (Online) Volume 3, Iue 4, April 2015 International Journal Advance Reearch in Computer Science and Management Studie Reearch Article / Survey Paper / Cae Study Available online at: www.ijarcm.com
More informationEfficient Data Forwarding in Mobile Social Networks with Diverse Connectivity Characteristics
Efficient Data Forwarding in Mobile Social Network with Divere Connectivity Characteritic Xiaomei Zhang and Guohong Cao Department of Computer Science and Engineering The Pennylvania State Univerity, Univerity
More informationDistributed Partial Information Management (DPIM) Schemes for Survivable Networks - Part II
IEEE INFOCO 2002 1 Ditributed Partial Information anagement (DPI) Scheme for Survivable Network - Part II Dahai Xu Chunming Qiao Department of Computer Science and Engineering State Univerity of New York
More informationDistributed, Secure Load Balancing with Skew, Heterogeneity, and Churn
Ditributed, Secure Load Balancing with Skew, Heterogeneity, and Churn The Harvard community ha made thi article openly available. Pleae hare how thi acce benefit you. Your tory matter. Citation Publihed
More informationDWH Performance Tuning For Better Reporting
DWH Performance Tuning For Better Sandeep Bhargava Reearch Scholar Naveen Hemrajani Aociate Profeor Dineh Goyal Aociate Profeor Subhah Gander IT Profeional ABSTRACT: The concept of data warehoue deal in
More informationWeb Page Recommendation Approach Using Weighted Sequential Patterns and Markov Model
Global Journal of Computer Science and Technology Volume 2 Iue 9 Verion.0 April 202 Type: Double Blind Peer Reviewed International Reearch Journal Publiher: Global Journal Inc. (USA) Online ISSN: 0975-472
More informationMulti-Target Tracking In Clutter
Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and
More informationA note on degenerate and spectrally degenerate graphs
A note on degenerate and pectrally degenerate graph Noga Alon Abtract A graph G i called pectrally d-degenerate if the larget eigenvalue of each ubgraph of it with maximum degree D i at mot dd. We prove
More information(12) Patent Application Publication (10) Pub. No.: US 2011/ A1
(19) United State US 2011 0316690A1 (12) Patent Application Publication (10) Pub. No.: US 2011/0316690 A1 Siegman (43) Pub. Date: Dec. 29, 2011 (54) SYSTEMAND METHOD FOR IDENTIFYING ELECTRICAL EQUIPMENT
More informationA Novel Feature Line Segment Approach for Pattern Classification
12th International Conference on Information Fuion Seattle, WA, USA, July 6-9, 2009 A Novel Feature Line Segment Approach for Pattern Claification Yi Yang Intitute of Integrated Automation Xi an Jiaotong
More informationPlanning of scooping position and approach path for loading operation by wheel loader
22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier a a The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each b c circuit will be decribed in Verilog
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in VHL and implemented
More informationA Local Mobility Agent Selection Algorithm for Mobile Networks
A Local Mobility Agent Selection Algorithm for Mobile Network Yi Xu Henry C. J. Lee Vrizlynn L. L. Thing Intitute for Infocomm Reearch, 21 Heng Mui Keng Terrace, Singapore 119613 Email: {yxu, hlee, vriz}@i2r.a-tar.edu.g
More informationAn Intro to LP and the Simplex Algorithm. Primal Simplex
An Intro to LP and the Simplex Algorithm Primal Simplex Linear programming i contrained minimization of a linear objective over a olution pace defined by linear contraint: min cx Ax b l x u A i an m n
More informationToday s Outline. CS 561, Lecture 23. Negative Weights. Shortest Paths Problem. The presence of a negative cycle might mean that there is
Today Outline CS 56, Lecture Jared Saia Univerity of New Mexico The path that can be trodden i not the enduring and unchanging Path. The name that can be named i not the enduring and unchanging Name. -
More informationMAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc
MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic
More informationIMPROVED JPEG DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION. Tak-Shing Wong, Charles A. Bouman, and Ilya Pollak
IMPROVED DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION Tak-Shing Wong, Charle A. Bouman, and Ilya Pollak School of Electrical and Computer Engineering Purdue Univerity ABSTRACT We propoe
More informationLoad Estimation of Social Networking Web Sites Using Clustering Technique
International Journal of Electronic and Electrical Engineering Vol. 4, No. 6, December 216 Load Etimation of Social Networking Web Site Uing Clutering Technique Deepti Bhagwani and Setu Kumar Chaturvedi
More informationAn efficient resource allocation algorithm for OFDMA cooperative relay networks with fairness and QoS guaranteed
Univerity of Wollongong Reearch Online Faculty of Informatic - Paper (Archive) Faculty of Engineering and Information Science 200 An efficient reource allocation algorithm for OFDMA cooperative relay network
More information