A Load Balancing Model based on Load-aware for Distributed Controllers. Fengjun Shang, Wenjuan Gong
|
|
- Edgar Mathews
- 5 years ago
- Views:
Transcription
1 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 Science and Technology, Chongqing Univerity of Pot and Telecommunication, Chongqing , China Shangfj@cupt.edu.cn Keyword: Software-Defined Networking; Load-aware; Load Balancing; Failure Recovery Abtract. Software-Defined Networking (SDN) i a new paradigm that decouple the control plane from data plane. But with the continuou expanion of the network cale, a ingle controller face with calability iue and may trigger a ingle point of failure. It i important to take into account the calability of the control plane and how to balance the load of multiple controller. In thi paper, we tudy and analyzed the architecture model of multiple controller and then propoed a load balancing model baed on load-aware for ditributed controller which can flexibly adjut the flow-requet handled by each controller baed on the flow-requet, and reolved the ingle point of failure through fat recovery of failure. Introduction Recently with the continuou expanding of network cale and the increaing of network interconnection equipment and clae, traditional Internet face many challenge uch a controllability of management calability of cale and validation of innovative experiment[1]. Software-Defined Networking (SDN) architecture i currently een a one of the mot promiing paradigm where the network control i decoupled from data plane. Control plane i conited of a logically centralized controller which i reponible for making packet forwarding deciion and providing a programmatic interface to the application plane. Data plane, which i reponible for forwarding packet, i compoed of phyical device. In the SDN architecture, the data plane i controlled by the control plane through a well-defined API. SDN ha already ome concrete implementation. OpenFlow [2] i an open tandard protocol, pecifically deigned for the SDN network, that allow the communication between the control and data plane and permit the manipulation of the latter. At the beginning, the OpenFlow protocol wa developed at the Stanford Univerity around 2008 for enabling reearcher to run experimental protocol in the campu network, but now ha received wide attention from academia and indutry. In SDN architecture baed on OpenFlow, the OpenFlow witche end flow-requet to the controller via the OpenFlow protocol over a ecure channel and the controller et packet forwarding rule to witche via a global view of the network. The centralized control function of SDN ha reduced the complexity of network management and configuration, but with the continuou expanding of network cale and increaing demand for ervice, the centralized controller need to deal with maive flow-requet from witche and the calability problem of control plane i becoming more and more eriou [3]. The paper [4] point out that the NOX controller can handle 30K flow every econd and each flow need an average of 10m [5], however the data center including 100 witche can generate 10M flow-requet every econd which exceed the capability of controller [6]. So reearcher ha propoed many architecture model of ditributed controller. In 2010 the paper [3] propoed a ditribution of control plane called HyperFlow. HyperFlow i logically centralized but phyically ditributed. By paively ynchronizing network-wide view of OpenFlow controller, the witch i connected to the nearet controller, thu minimizing the control plane repone time to data plane requet. The paper [7] preent Onix, a ditributed ytem baed on control plane. Control plane written within Onix operate on a global view of the network, and ue The author - Publihed by Atlanti Pre 240
2 baic tate ditribution primitive provided by the platform. Onix provide a general API for control plane implementation, while allowing them to make their own trade-off among conitency, durability, and calability. In 2012, the paper [8] deigned a high calable mechanim named MSDN to balance the data flow initialization requet and then thoe requet were parallel proceed with a hare global network view. In the ame year, Yannan Hu propoed BalanceFlow [9], a controller load balancing architecture for OpenFlow network with by utilizing CONTROLLER X action extenion for OpenFlow witche. The uper controller can flexibly tune the flow-requet handled by each controller, without introducing unacceptable propagation latencie architecture. The Load Balancing Model baed on Load-aware for Ditributed Controller BalanceFlow architecture [9] ued uper controller to run flow-requet partition when controller load imbalance i detected. Once the uper controller ha a fault, the flow-requet partition function would be diable. So to reolve the above problem, we preent the load balancing model baed on load-aware for ditributed controller. In the model, each witch connect with multiple controller but at any moment i controlled by only one controller. And one controller can manage more than one witch. All controller are of the ame performance without uper controller, o the model reolve the problem of ingle point failure, improve the tability of the network; meanwhile we propoe load balancing algorithm baed on load-aware random aignment that enure that the network doe not trigger a larger tilt when partition the flow-requet. Beide in order to detect the failure of the controller, the controller will end heartbeat packet to each other. If a controller do not ent a heartbeat packet in the pecified time, then the other controller deem that the controller ha failed and will immediately run the load balancing algorithm to partition the flow-requet. The architecture model i hown in Fig.1. Fig.1 The Load Balancing Model Baed on Load-aware For Ditributed Controller Load Information Awarene. In the load balancing model preented by thi paper, the load information of the controller i mapped to the average number of flow-requet handled by it. The load information awarene point out that each controller can aware the load tatu autonomouly through calculating the ratio of average number of flow-requet to the total number of flow-requet in the network. And uing the flow-requet baed on witch pair i viable ince the total number of witch pair i uually limited with le torage pace. So every controller maintain an N* N order matrix Qavg which repreent the load information of controller, where N i the number of witche in the network. The element in the ith row, jth column denote the average number of flow-requet from witch i to witch j. When a 241
3 controller receive a flow-requet, it check the detination addre and ource addre and locate the correponding egre witch for that flow and the relevant element in the matrix i updated periodically. The average number of flow-requet from witch i to witch j i calculated uing the following Eq. 1. qavg (, i j) (1 ) qpre(, i j) p(, i j ) (1) Where i a weighted coefficient, qpre(, i j) i the average flow-requet number of previou cycle and p(, i j) i the number of flow-requet from witch i to witch j in a certain cycle. Load Balancing Algorithm baed on Load-aware Random Aignment. Thi paper propoe the load balancing algorithm baed on load-aware random aignment where all controller publih average flow-requet information to each other periodically, calculate the total number of flow-requet. If the average number of flow-requet handled by any controller contribute more than ome threhold of the total flow-requet rate in the network, the controller will aware that the load i imbalanced. Then the controller of load imbalance run the load balancing algorithm which reallocate flow-requet to multiple controller via allocation probability. Related Concept Decription. (1) load degree of witch pair to controller Firtly we uppoe the ditributed controller model ha k controller ( k 2 ), L ( ) i the ratio the average number of flow-requet of controller to the total number of flow-requet Q in the networkr total, calculated by Eq. 2. L ( ) Q / R 1, 2,, k (2) total So when L () exceed the given threhold, controller run the load balancing algorithm. On thi bai, we propoe the concept of the load degree of witch pair to controller L (, i j ), which denote the load of witch pair( i, j ) to controller, uing the Eq. 3. L (, i j) ( Q p(, i j))/ R total i, j 1, 2,, n (3) Where p(, i j) i the flow-requet that i about to be handled by the controller. The algorithm aume that every controller ha ame performance and elect average number of flow-requet and the flow-requet which i about to be handled to meaure the load of witch pair( i, j ) to controller. (2) load weight and load difference We define W (, i j ) a the load weight of witch pair( i, j ) to the controller, uing Eq. 3 to calculate: W ( i, j) (1 ) L( i, j) d( i, ) / d avg i, j 1,2,, n, 1, 2,, k (3) Where i a contant parameter, adjuting the weight between controller load and propagation latencie. When etting too mall, we ignore the benefit of reducing latencie. When etting too large, however, we do not require the load to be balanced. We empirically found that between and 0.15 give a good reult. d avg i the average node-to-controller latencie. Then we define W ( i, j ) a the load difference of witch pair ( i, j ) to the controller, which denote the difference between the um of all load weight of witch pair ( i, j ) to controller and the load weight of witch pair ( i, j ) to the controller, calculated by Eq. 4. k c c 0 W (, i j) W (, i j) W (, i j ) i, j 1,2,, n c 1, 2,, k (4) (3) allocation probability of witch pair to controller We define P ( i, j ) a the allocation probability of witch pair ( i, j ) to the controller. P ( i, j ) denote that the probability of flow-requet from witch pair ( i, j ) allocated to the controller, calculated according to Eq
4 k c c 0 P( i, j) W ( i, j)/ W ( i, j ) 1, 2,, k k 0 P(, i j ) 1 (5) In order to further reduce the probability of the occurrence of tilt in the network when traffic burt, we introduce random probability to divide the flow-requet. Through judging the random number [0, 1] fall on which ection of the allocation probability of witch pair to controller, elect the correponding controller. Procedure of Load Balancing Algorithm baed on Load-aware Random Aignment. After introducing the related concept of algorithm propoed by thi paper, the complete operation proce of load balancing algorithm baed on load-aware random aignment i a follow: 1) Initializing the network tate, divide the witche of the controller management. 2) Setting the controller load imbalance threhold ( 0.1)* k 1. 3) Controller update the repective average flow-requet matrix every cyclet m. 4) Controller end the repective average flow-requet information to each other every cyclet. Calculate L () of each controller. When L (), the controller occur load imbalance, run the load balancing algorithm, then kip to tep 5; when L (), the ditributed controller ytem i in a tate of balancing and kip to tep 3. 5) Calculate allocation probability of witch pair ( i, j ) to the controller, P( i, j ). Then repartition flow-requet from witch pair ( i, j ) to pecified controller according to P ( i, j ) via random probability. Evaluation In order to verify the feaibility of our ditributed controller model, we built an experimental environment. We evaluate our model on Abilene topology, which contain 10 node and 13 link. In our experimental, each witch connect ten hot and three controller (denote a A, B and C for implicity in illutrating) are deployed in the network. We et T m to 10m and T to 1 and the controller load imbalance threhold i calculated according the number of controller. The initial tatu of the network i hown in Fig.1. The default behavior of each witch i to forward it flow-requet to the nearet controller to achieve quick repone, o controller A, B and C will receive the flow-requet from 4, 3 and 3 witche repectively. At time 0 econd, we aume that the network ha been in a baic teady tatu. Each hot tart to end a packet flow to a randomly-choen hot. After that a hot randomly wait between 1 and 10m before ending a new flow. At time 40 econd, we intentionally increae the load of controller A ( by raiing the rate of ending new flow which are handled by controller A). We repeated the tet 20 time, and Fig.2 (a) plot the average load of the three controller over time when all controller are running normally, Fig.2 (b) plot the average load of the three controller over time when ome controller malfunction. Average number of flow-requet to controller Controller A Controller B Controller C Time() Average number of flow-requet to controller Controller A Controller B Controller C Time() (a) All controller are running normally (b) ome controller i broken Fig.2 the average number of flow-requet handled by three controller 243
5 According Fig.2, we can ee, that a the hot tart ending traffic, the average flow-requet received by each controller ramp up, the diviion of load i relatively cloe to the 4:3:3. In Fig.2 (a),after 20 encond, a expected, the load on controller A increae draamatically, and at time 44 econd the load of controller A exceed the controller load imbalance thehold 45%, o controller A run the load balancing algorithm to reallocate the flow-requet. And then the load of each controller i well under imbalance triggering threhold. In Fig.2 (b), at time 40 econd, the controller C i broken, o after 3 cycle of updating, the load balancing i invoked immediately and reallocate flow-requet to controller A and B. Then the load of the ret of controller i well under imbalance triggering threhold. Concluion Thi paper analyze the calability problem of SDN architecture and tudie the architecture model of multiple controller. And then propoe a load balancing model baed on load-aware for ditributed controller which can run the load balancing algorithm to reallocate the load of each controller. Our experiment how that the model can flexibly adjut the load of each controller and ucceed in avoiding the ingle point of failure and guarantee that the function of load balancing algorithm i run normally whether controller ha fault or not. Acknowledgement Thi work wa upported in part by the Chongqing Natural Science Foundation under Grant No.ctc2012jjA40038, the Chongqing Baic and Frontier Reearch Project under Grant No.ctc2013jcyjA40023, the Minitry of Indutry and Information Technology for the pecial funde of Development of the Internet of thing( ) and the Special Foundation for Young Scientit of Chongqing(NO.ctc2014kjrc-qnrc40002). Reference [1]Zhang C K, Yong C, Tang H Y, et al. State-of-the-art urvey on oftware-defined networking (SDN) [J]. Journal of Software, [2] Mckeown N, Anderon T, Balakrihnan H, et al. OpenFlow: Enabling Innovation in Campu Network[J]. Acm Sigcomm Computer Communication Review, 2008, 38(2): [3] Tootoonchian A, Ganjali Y. HyperFlow: a ditributed control plane for OpenFlow[C]// Proceeding of the 2010 internet network management conference on Reearch on enterprie networking. USENIX Aociation, 2010:3-3. [4] Gude N, Koponen T, Pettit J, et al. NOX: Toward an operating ytem for network[j]. Acm Sigcomm Computer Communication Review, 2008, 38(3): [5] Tavakoli A, Caado M, Koponen T, et al. Applying NOX to the Data center[j]. Hotnet, [6] Curti A R, Mogul J C, Tourrilhe J, et al. Devoflow: Scaling flow management for high-performance network[j]. Acm Sigcomm, 2011, 41(4): [7] Koponen T, Caado M, Gude N, et al. Onix: A Ditributed Control Platform for Large-cale Production Network.[J]. Proc Odi, 2010: [8] LIN Pingping, BI Jun, HU Hongyu, JIANG Xiaoke. MSDN:a Mechanim for Scalable Intra-domain Control Plane in SDN[J].Journal of Chinee Computer Sytem,2013,34(9): [9] Hu Y, Wang W, Gong X, et al. BalanceFlow: Controller load balancing for OpenFlow network[c]// Cloud Computing and Intelligent Sytem (CCIS), 2012 IEEE 2nd International Conference on. IEEE, 2012:
Distributed 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 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 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 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 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 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 informationThe Implementation of an Adaptive Mechanism in the RTP Packet in Mobile Video Transmission
2011 International Conference on Information Management and Engineering (ICIME 2011) IPCSIT vol. 52 (2012) (2012) IACSIT Pre, Singapore DOI: 10.7763/IPCSIT.2012.V52.91 The Implementation of an Adaptive
More informationModeling of underwater vehicle s dynamics
Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation
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 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 informationDAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications
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 Email: duongba@eec.oregontate.edu
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 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 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 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 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 informationFrequency Table Computation on Dataflow Architecture
Frequency Table Computation on Dataflow Architecture P. Škoda *, V. Sruk **, and B. Medved Rogina * * Ruđer Bošković Intitute, Zagreb, Croatia ** Faculty of Electrical Engineering and Computing, Univerity
More informationChapter 13 Non Sampling Errors
Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption
More informationDynamically Reconfigurable Neuron Architecture for the Implementation of Self- Organizing Learning Array
Dynamically Reconfigurable Neuron Architecture for the Implementation of Self- Organizing Learning Array Januz A. Starzyk,Yongtao Guo, and Zhineng Zhu School of Electrical Engineering & Computer Science
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 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 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 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 informationES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK
ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.
More informationResearch Article A Multicontroller Load Balancing Approach in Software-Defined Wireless Networks
Distributed Sensor Networks Volume 2015, Article ID 454159, 8 pages http://dx.doi.org/10.1155/2015/454159 Research Article A Multi Load Balancing Approach in Software-Defined Wireless Networks Haipeng
More informationSIMIT 7. Component Type Editor (CTE) User manual. Siemens Industrial
SIMIT 7 Component Type Editor (CTE) Uer manual Siemen Indutrial Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimizationreult
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 informationANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION
ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION A. Váque-Nava * Ecuela de Ingeniería. CENTRO UNIVERSITARIO MEXICO. DIVISION DE ESTUDIOS SUPERIORES J. Figueroa
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 informationDEveloping a deep insight into how traffic flows
A Model Approach to the Etimation of -to- Traffic Matrice Ke Xu, Senior Member, IEEE, Meng Shen, Yong Cui, Member, IEEE, Mingjiang Ye, and Yifeng Zhong Abtract -to- (P2P) application have witneed an increaing
More informationIntegration of Digital Test Tools to the Internet-Based Environment MOSCITO
Integration of Digital Tet Tool to the Internet-Baed Environment MOSCITO Abtract Current paper decribe a new environment MOSCITO for providing acce to tool over the internet. The environment i built according
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 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 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 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 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 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 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 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 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 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 informationA Software-Defined Networking Security Controller Architecture. Fengjun Shang, Qiang Fu
4th International Conference on Machinery, Materials and Computing Technology (ICMMCT 2016) A Software-Defined Networking Security Controller Architecture Fengjun Shang, Qiang Fu College of Computer Science
More informationSIMIT 7. Profinet IO Gateway. User Manual
SIMIT 7 Profinet IO Gateway Uer Manual Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimizationreult are only non-binding uggetion
More informationAspects of Formal and Graphical Design of a Bus System
Apect of Formal and Graphical Deign of a Bu Sytem Tiberiu Seceleanu Univerity of Turku, Dpt. of Information Technology Turku, Finland tiberiu.eceleanu@utu.fi Tomi Weterlund Turku Centre for Computer Science
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 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 informationPolicy-based Injection of Private Traffic into a Public SDN Testbed
Intitut für Techniche Informatik und Kommunikationnetze Adrian Friedli Policy-baed Injection of Private Traffic into a Public SDN Tetbed Mater Thei MA-2013-12 Advior: Dr. Bernhard Ager, Vaileio Kotroni
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 informationKeywords: Defect detection, linear phased array transducer, parameter optimization, phased array ultrasonic B-mode imaging testing.
Send Order for Reprint to reprint@benthamcience.ae 488 The Open Automation and Control Sytem Journal, 2014, 6, 488-492 Open Acce Parameter Optimization of Linear Phaed Array Tranducer for Defect Detection
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 informationESRP Storage Program EMC VNXe3100 (500 User) Mailbox Resiliency Storage Solution for Microsoft Exchange 2010
ESRP Stor Program EMC VNXe31 (5 Uer) Mailbox Reilie Stor Solution for Microoft Exchan 21 Teted with: ESRP Stor Verion 3. Teted Date: 4/25/211 EMC Corporation Corporate Headquarter Hopkinton, MA 1748-913
More informationModelling the impact of cyber attacks on the traffic control centre of an urban automobile transport system by means of enhanced cybersecurity
Modelling the impact of cyber attack on the traffic control centre of an urban automobile tranport ytem by mean of enhanced cyberecurity Yoana Ivanova 1,* 1 Bulgarian Academy of Science, Intitute of ICT,
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 informationFirewall Packet Filtering Optimization using Statistical Traffic Awareness Test
Firewall Packet Filtering Optimization uing Statitical Traffic Awarene Tet Zouheir Trabel Liren Zhang and Safaa Zeidan Faculty of Information Technology UAE Univerity Al-Ain, UAE {trabel lzhang, afaa.z}
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 informationESRP Storage Program EMC Celerra NX4 (500 User) Mailbox Resiliency Storage Solution for Microsoft Exchange 2010
ESRP Stor Program EMC Celerra NX4 (5 Uer) Mailbox Reilie Stor Solution for Microoft Exchan 21 Teted with: ESRP Stor Verion. Teted Date: 6/25/21 EMC Corporation Corporate Headquarter Hopkinton, MA 1748-91
More informationEthernet Peer-To-Peer Communication With Model 353 And Procidia i pac Controllers
iemen Energy & utomation pplication ata Ethernet Peer-To-Peer Communication With odel 353 nd Procidia ipac Controller 353-113 Rev. 1 July Ethernet i a leading form of network communication that i often
More informationKinematics Programming for Cooperating Robotic Systems
Kinematic Programming for Cooperating Robotic Sytem Critiane P. Tonetto, Carlo R. Rocha, Henrique Sima, Altamir Dia Federal Univerity of Santa Catarina, Mechanical Engineering Department, P.O. Box 476,
More informationImage authentication and tamper detection using fragile watermarking in spatial domain
International Journal of Advanced Reearch in Computer Engineering & Technology (IJARCET) Volume 6, Iue 7, July 2017, ISSN: 2278 1323 Image authentication and tamper detection uing fragile watermarking
More informationGray-level histogram. Intensity (grey-level) transformation, or mapping. Use of intensity transformations:
Faculty of Informatic Eötvö Loránd Univerity Budapet, Hungary Lecture : Intenity Tranformation Image enhancement by point proceing Spatial domain and frequency domain method Baic Algorithm for Digital
More informationAalborg Universitet. Published in: Proceedings of the Working Conference on Advanced Visual Interfaces
Aalborg Univeritet Software-Baed Adjutment of Mobile Autotereocopic Graphic Uing Static Parallax Barrier Paprocki, Martin Marko; Krog, Kim Srirat; Kritofferen, Morten Bak; Krau, Martin Publihed in: Proceeding
More informationA Handover Scheme for Mobile WiMAX Using Signal Strength and Distance
A Handover Scheme for Mobile WiMAX Uing Signal Strength and Ditance Mary Alatie, Mjumo Mzyece and Anih Kurien Department of Electrical Engineering/French South African Intitute of Technology (F SATI) Thwane
More informationModeling and Analysis of Slow CW Decrease for IEEE WLAN
Modeling and Analyi of Slow CW Decreae for IEEE 82. WLAN Qiang Ni, Imad Aad 2, Chadi Barakat, and Thierry Turletti Planete Group 2 Planete Group INRIA Sophia Antipoli INRIA Rhône-Alpe Sophia Antipoli,
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 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 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 informationAnalytical Redundancy and Fuzzy Inference in AUV Fault Detection and Compensation
Analytical Redundancy and Fuzzy Inference in AUV Fault Detection and Compenation A. J. Healey Profeor and Director Center for AUV Reearch Naval Potgraduate School Monterey, CA 93953 healey@me.np.navy.mil
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 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 informationA Novel Grey-RSS Navigation System Design for Mobile Robots
A vel Grey-RSS Navigation Sytem Deign for Mobile Robot Albert Wen-Long Yao*,, Hin-Te Liao, and Shiou-De Chen Department of Mechanical and Automation Engineering, National Kaohiung Firt Univerity of Science
More informationPerformance Evaluation of an Advanced Local Search Evolutionary Algorithm
Anne Auger and Nikolau Hanen Performance Evaluation of an Advanced Local Search Evolutionary Algorithm Proceeding of the IEEE Congre on Evolutionary Computation, CEC 2005 c IEEE Performance Evaluation
More informationStream: Low Overhead Wireless Reprogramming for Sensor Networks
Thi full text paper wa peer reviewed at the direction of IEEE Communication Society ubject matter expert for publication in the IEEE INFOCOM 27 proceeding. : Low Overhead Wirele Reprogramming for Senor
More informationChapter 7 Packet-Switching Networks. Chapter 7 Packet-Switching Networks. Packet Switching. Network Layer. Network Service
Chapter 7 Packet-Switching etwork etwork Operation & Topology Datagram and Virtual Circuit Structure of a Packet Switch Routing in Packet etwork Shortet Path Routing etwork Chapter 7 Packet-Switching etwork
More informationA METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS
Vietnam Journal of Science and Technology 55 (5) (017) 650-657 DOI: 10.1565/55-518/55/5/906 A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS Nguyen Huu Quang *, Banh
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 informationPower Aware Location Aided Routing in Mobile Ad-hoc Networks
International Journal of Scientific and Reearch Publication, Volume, Iue 1, December 01 1 Power Aware Location Aided Routing in Mobile Ad-hoc Network Anamika Computer Science, Inderprataha Engineering
More informationThrough the Diversity of Bandwidth-Related Metrics, Estimation Techniques and Tools: An Overview
I. J. Computer Network and Information Security, 08, 8, -6 Publihed Oine Augut 08 in MECS (http://www.mec-pre.org/) DOI: 0.585/icni.08.08.0 Through the Diverity of Bandwidth-Related Metric, Etimation Technique
More informationThe development of the South African ehealth Strategy assessed against the recommendations of the WHO/ITU ehealth Strategy Toolkit
The development of the South African ehealth Strategy aeed againt the recommendation of the WHO/ITU ehealth Strategy Toolkit Roemary Foter PhD a,b a ehealth Strategy and Policy Diviion, Medical Reearch
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 informationE5ZE-8 Multipoint Temperature Controller Communications Manual
E5ZE-8 Multipoint Temperature Controller Communication Manual Produced December 2000 Notice: OMRON product are manufactured for ue according to proper procedure by a qualified operator and only for the
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 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 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 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 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 informationDistributed Media-Aware Rate Allocation for Video Multicast over Wireless Networks
Ditributed Media-Aware Rate Allocation for Video Multicat over Wirele Network Xiaoqing Zhu, Thoma Schierl, Thoma Wiegand, Senior Member, IEEE, and Bernd Girod, Fellow, IEEE Abtract A unified optimization
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 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 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 informationAnisotropic filtering on normal field and curvature tensor field using optimal estimation theory
Aniotropic filtering on normal field and curvature tenor field uing optimal etimation theory Min Liu Yuhen Liu and Karthik Ramani Purdue Univerity, Wet Lafayette, Indiana, USA Email: {liu66 liu28 ramani}@purdue.edu
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 informationOptimal Peer-to-Peer Technique for Massive Content Distribution
1 Optimal Peer-to-Peer Technique for Maive Content Ditribution Xiaoying Zheng, Chunglae Cho and Ye Xia Computer and Information Science and Engineering Department Univerity of Florida Email: {xiazheng,
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 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 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 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 informationA User-Attention Based Focus Detection Framework and Its Applications
A Uer-Attention Baed Focu Detection Framework and It Application Chia-Chiang Ho, Wen-Huang Cheng, Ting-Jian Pan, Ja-Ling Wu Communication and Multimedia Laboratory, Department of Computer Science and Information
More informationThe norm Package. November 15, Title Analysis of multivariate normal datasets with missing values
The norm Package November 15, 2003 Verion 1.0-9 Date 2002/05/06 Title Analyi of multivariate normal dataet with miing value Author Ported to R by Alvaro A. Novo . Original by Joeph
More informationLessons Learned Migrating a Major Application to Exadata v2
Leon Learned Migrating a Major Application to Exadata v2 Oracle Open World 2010 Aaron Werman Bank of America aaron.werman@gmail.com Diclaimer All opinion are thoe of the author No endorement are intended:
More informationMotion Control (wheeled robots)
3 Motion Control (wheeled robot) Requirement for Motion Control Kinematic / dynamic model of the robot Model of the interaction between the wheel and the ground Definition of required motion -> peed control,
More information