Game Based Virtual Bandwidth Allocation for Virtual Networks in Data Centers

Size: px
Start display at page:

Download "Game Based Virtual Bandwidth Allocation for Virtual Networks in Data Centers"

Transcription

1 Avaable onlne at Proceda Engneerng 23 (20) Power Electroncs and Engneerng Applcaton, 20 Game Based Vrtual Bandwdth Allocaton for Vrtual Networks n Data Centers Cu-rong Wang, Ku Lu, Cong Wang Department of Informaton, Northeastern Unversty at Qnhuangdao, Qnhuangdao , Chna Ema: wangcr@ma.neuq.edu.cn Abstract In current data center, vrtual machnes may experence severely degraded performance due to the competng of network traffc on shared physcal lnks. Ths stuaton s manly caused by unreasonable and unfar allocaton of the bandwdth resource. Ths paper presents a schema based on the dea of non-cooperatve game theory n the feld of mcroeconomcs for dynamc bandwdth resource allocaton between vrtual networks. By modelng vrtual networks as competng players and gvng the prcng mechansm whch decded by the physcal substrate network and to guarantee effcency, the schema can acheve optmal bandwdth allocaton at the Nash equbrum pont of the game. We prove that the scheme admts a unque equbrum pont. Expermental results show that the bandwdth allocaton between vrtual networks s effcent and far. 20 Publshed by Elsever Ltd. Open access under CC BY-NC-ND lcense. Selecton and/or peer-revew under responsbty of [name organzer] Keywords: Network vrtualzaton; data center; bandwdth allocaton; game model;. Introducton In recent years, more and more data centers are beng but to provde ncreasngly popular onlne applcaton servces, such as search, e-mas, IMs, web 2.0, and gamng, etc. These data centers often host some bandwdth-ntensve servces such as dstrbuted fe systems (e.g., GFS [] ), structured storage (e.g., BgTable [2] ). There are sgnfcant networkng requrements across all these cases. The major cause of congeston n current data center s that non-coordnaton of these traffc may result n the number of packets exceed the bufferng capacty of the swtch for output. In modern data centers, especally towards the cloud computng, not all network traffc s TCP (or TCP-frendly) and not all protocols perform self-regulaton the way TCP does. In fact, a growng proporton of network traffc s not TCP-frendly such as streamng meda, voce/vdeo over IP, and peer-to-peer traffc. Although TCP s Publshed by Elsever Ltd. Open access under CC BY-NC-ND lcense. do:0.06/j.proeng

2 Cu-rong Wang et al. / Proceda Engneerng 23 (20) self-regulatng, even a small amount of non-tcp frendly traffc can dsrupt far-sharng of swtched network resources. Network vrtualzaton has opened up new opportuntes for explct coordnaton that are smple, effectve, feasble, and complementary to swtch-level hardware support. Network vrtualzaton can extenuate the ossfyng forces of the current Ethernet and stmulate nnovaton by enablng dverse network archtectures to cohabt on a shared physcal substrate [3, 4]. In the man thought of network vrtualzaton, vrtual machnes of same applcatons n data center are parttoned nto same vrtual networks by network slcng; therefore the busness model can be two part: nfrastructure provder who buds the data center fabrc and servce provder who rents the vrtual machnes to run ther own applcatons and provdes Internet servce. Ths paper makes the case for dynamc bandwdth allocaton between vrtual lnks after the creaton of vrtual networks n the data center Ethernet to proactvely prevent network congeston and provde more agty. By leveragng the non-cooperatve game theory n the feld of mcroeconomcs, vrtual networks are modelled as competng players to run a game. We also present a prcng mechansm whch decded by the physcal substrate network to guarantee effcency and prove that the gven schema can prevent congeston and maxmze the utzaton of the physcal substrate network. The rest of the paper s organzed as follows. The basc game model s presented n Secton 2. In secton 3, we descrbe a dstrbuted mplementaton for dynamc bandwdth allocaton runnng on programmable swtches. Secton 4 presents expermental evdence va a smulaton mplementaton. Secton 5 gves the concluson. 2. Basc model The vrtual bandwdth allocaton optmzaton model n ths secton s consdered from the overall perspectve of the system whch contans vrtual networks and substrate hardware resource,.e. the bandwdth of the physcal network. Consder a substrate network wth a set L of lnks, and let C j be the capacty of substrate lnk j J. The network s shared by a set N of vrtual networks and ndexed by. Defne a vector b whch denotes the allocated bandwdth of vrtual network n lnk j. Let U ( b ) be the utty of vrtual network as a functon of hs bandwdth b. Note that the utty U ( b ) should be an ncreasng, nonnegatve, strctly concave and twce contnuously dfferentable functon of b over the range b 0. Assume further that uttes are addtve. The bandwdth control problem can be formulated as the followng optmal problem. The bandwdth control problem can be formulated as the followng optmal problem. N L MAX U ( b ) = l= P : s.. t, l, b 0, l L, b C For each vrtual network, ts bandwdth must be greater than or equal to 0, the total bandwdth of all vrtual networks n physcal lnk l does not exceed the maxmum bandwdth C l allowed by the hardware. Snce the utty functons are strctly concave, and hence contnuous, and the feasble soluton set s compact then the above optmal problem has a unque optmal soluton. P s an overall problem wth multple constrants. Consderng the fact that vrtual networks on data centers are of non-cooperatve nature n terms of ther demand for networks resources, leveragng noncooperatve game theory, let the network announce a rental prce per unt of bandwdth, then let all vrtual N l

3 782 Cu-rong Wang et al. / Proceda Engneerng 23 (20) networks play a non-cooperatve game, the resultng bandwdth allocaton at the Nash equbrum pont of the game solves the above optmal problem P. 3. Dstrbuted mplementaton As mentoned above, the soluton for vrtual bandwdth allocaton n data center s stl a global problem. It s mpossble to manage vast amounts of vrtual nodes n large-scale network, because a centralzed soluton whch requres real-tme access to all physcal swtches wthn the physcal network to get vrtual bandwdth consumpton and also need a large-scale computng s obvously unrealstc. There s no gan n usng the local nterpretaton unless we can devse a local way to solve the problem. In ths secton, we present a dstrbuted framework whch runnng on the rack swtches n data centers to mplement the bandwdth control game. The overall optmzaton problem P can be splt nto several dstrbuted problem. Recall the problem n the prevous secton, each b n vector b = ( b, l L) denotes the allocated bandwdth for vrtual network n lnk l. For any set of vrtual network lnks L we have L L. Takng nto account of the dversfcaton and varabty of vrtual network topologes, we need to regulate all dmensons of L and make t equal to the dmenson of L. Let L be the new lnk set of vrtual network, the two under sets are equvalent. L =, f l L; L L, l L, () L = 0, f ; l L L = 0 means that the bandwdth allocated for vrtual network on lnk l s 0. Then the overall optmal problem P can be rewrtten as: N L L N U b U b = = l= l= = MAX ( ) ( ) N N N = U ( b ) + U ( b ) U ( b ) = = 2 = L From equaton (2) we can see the P can be transformed nto L sub optmzaton problems on each network port of rack swtches. When the bandwdth allocaton for every vrtual network on each port of the rack swtches n the physcal network s optmal, the overall optmzaton problem P can be solved smultaneously. Ths dstrbuted soluton n large-scale data center network was feasble, and can be easy acheved. Then we can get the sub optmzaton problems on each network port of rack swtches: MAX U ( b) n = st.., b 0, n b C Where n s the number of vrtual networks, b denotes the allocated bandwdth for vrtual network. U ( b ) s the utty functon dscussed n the prevous secton. Then we can bud the non-cooperatve game model for bandwdth allocaton accordng to sub optmzaton problem (3). Gvng the utty functon of each vrtual network: F( ω, b) = u ( b) ω (4) l (2) (3)

4 Cu-rong Wang et al. / Proceda Engneerng 23 (20) Where ω s a wlngness-to-pay (also called a bd) announced by vrtual network to the substrate network, u ( b) s the utty functon of vrtual network lkes U (). After collectng each ω, the substrate network chooses a bandwdth allocaton strategy bb (, b2,..., b N ). If the substrate network always seeks to allocate the entre lnk capacty, then prce s calculated as follows: n = l p = ω C (5) Assumng that all vrtual networks on lnk l are ratonal and do not know the bd of any other vrtual networks, then equaton (4) and (5) defne a non-cooperatve game, at the Nash equbrum pont of the game the bandwdth allocaton s optmal. We then proof there exsts a unque Nash equbrum pont n the game defnte by (4). Proof: From equaton (5) we can calculate the allocated bandwdth for vrtual network : b = ω p. Then rewrte the utty functon of each vrtual network: ω F( ω, ω ) = u ( c) ω (6) n ω Where ω = ( ω, ω,... ω, ω ) reflects the effect to vrtual network accordng to the demand of other + n vrtual networks. For the game defnte by equaton (6), there exsts a Nash equbrum pont only f for any vrtual network, when there s no change on the bd of other vrtual networks, there s a fxed * strategy ω meet: * * * F( ω, ω ) F( ωω, ) (7) = Let W = ω, substtute t nto (6) and calculate the frst order dervatve: k k cw F = u (8) 2 ( W + ) ω Snce u () s a twce dfferentable concave functon, u c s strctly decreasng n b 0. Obvously, 2 cw ( W + ω ) s strctly decreasng n ω 0. So F < 0,.e. F s also a twce dfferentable concave functon, so there exsts a unque ω * maxmze the functon F, thus the game has a unque Nash equbrum pont. At the equbrum pont the proft of each vrtual network s maxmzed, so the vrtual bandwdth allocaton strategy s far and effcent 4. Performance Evaluaton We mplemented the dstrbuted vrtual bandwdth allocaton schema dscussed n Secton 3 usng OpenFlow VM [5] envronment. For the lmtaton of the current software, we made a smple but suffcently persuasve experment as shown n Fg., where PC has two ports, eth and eth2 and PC 2 has one port connect to the OpenFlow Swtch.

5 784 Cu-rong Wang et al. / Proceda Engneerng 23 (20) PC PC 2 Lnk 3 P P2 P3 OpenFlow Swtch Fg.. Smple topology for evaluaton In PC, we use two perf clents to generate a TCP flow and a UDP flow wth destnaton to PC 2. We test each flow s assgned bandwdth wth and wthout bandwdth allocaton schema to verfy the farness. Note that n the experment wth the allocaton schema, lnk 3 s slced nto two vrtual lnks. VN VN 0.8 VN VN Bandwdth (Gb/s) Bandwdth (Gb/s) Tme (s) Tme (s) Fg. 2. (a) No bandwdth allocaton case (b) Wth the bandwdth allocaton schema For non-vrtualzed case as shown n Fg.2 (a), when UDP flow was sent, the bandwdth assgned to TCP flow dropped serously. In Fg.2 (b), for the substrate network was slced nto two vrtual networks, and wth the dynamc bandwdth allocaton schema, both flow s QoS s guaranteed. They farly share the bandwdth when they oversubscrbed the lnk smultaneously under same wlngness-to-pay. Ths can confrm the truth of that network vrtualzaton can provde an effcent mechansm to prevent congeston n data center network whch full of vrtual machnes, and also a more agty way for QoS guarantee. 5. Concluson Ths paper ntroduced a bandwdth allocaton schema base game theory to allevate congeston problems n data center networks. We present a overall optmal problem and gve a dstrbuted mplementaton approach. Maybe there s a certan dstance from a practcal fully mature system, we beleve that network vrtualzaton and dynamc bandwdth allocaton are more sutable for the future data center networks, especally n the context of mult-tenancy mechansm of cloud computng. References

6 Cu-rong Wang et al. / Proceda Engneerng 23 (20) [] Ghemawat S, Gobo H, Leung S. T. The Google FeSystem. In Proceedng of the nneteenth ACM symposum on Operatng systems prncples, New York; 2003: [2] Fay C, Jeffrey D, Sanjay G, et al. Bgtable: A Dstrbuted Storage System for Structured Data. In Proceedngs of The 7th conference on usenx symposum on operatng systems desgn and mplementaton, Seattle; 2006: [3] Shmonsh H, Ish S. Vrtualzed network nfrastructure usng OpenFlow. In Proceedngs of the 200 IEEE/IFIP Network Operatons and Management Symposum Workshops, Osaka; 200: [4] Wang Y, Keller E, Bskeborn B, et al. Vrtual routers on the move: Lve router mgraton as a network-management prmtve. In Proceedngs of the SIGCOMM 08, Seattle; 2008: [5] Yakoums Y, Kobayash M. Innovatng n Your Network wth OpenFlow: A Hands-on Tutoral. In Proceedngs of the 8th Annual Symposum on Hgh Performance Interconnects, Mountan Vew; 200: 2-22.

Efficient Distributed File System (EDFS)

Efficient Distributed File System (EDFS) Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Research of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm

Research of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm , pp.197-202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

Virtual Machine Placement Based on the VM Performance Models in Cloud

Virtual Machine Placement Based on the VM Performance Models in Cloud Vrtual Machne Placement Based on the VM Performance Models n Cloud Hu Zhao, Qnghua Zheng, Member, IEEE, Wezhan Zhang Member, IEEE, Yuxuan Chen, Yunhu Huang SPKLSTN Lab, Department of Computer Scence and

More information

Regional Load Balancing Circuitous Bandwidth Allocation Method Based on Dynamic Auction Mechanism

Regional Load Balancing Circuitous Bandwidth Allocation Method Based on Dynamic Auction Mechanism ATEC Web of Conferences 76, (8) IFID 8 https://do.org/./matecconf/876 Regonal Load Balancng Crcutous Bandwdth Allocaton ethod Based on Dynamc Aucton echansm Wang Chao, Zhang Dalong, Ran Xaomn atonal Dgtal

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual Machine Migration based on Trust Measurement of Computer Node Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

Application of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling

Application of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling , pp.40-45 http://dx.do.org/10.14257/astl.2017.143.08 Applcaton of Improved Fsh Swarm Algorthm n Cloud Computng Resource Schedulng Yu Lu, Fangtao Lu School of Informaton Engneerng, Chongqng Vocatonal Insttute

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

A Low-Overhead Routing Protocol for Ad Hoc Networks with selfish nodes

A Low-Overhead Routing Protocol for Ad Hoc Networks with selfish nodes A Low-Oerhead Routng Protocol for Ad Hoc Networks wth selfsh nodes Dongbn Wang 1, Xaofeng Wang 2, Xangzhan Yu 3, Kacheng Q 1, Zhbn Xa 1 1 School of Software Engneerng, Bejng Unersty of Posts and Telecommuncatons,100876,

More information

A Model Based on Multi-agent for Dynamic Bandwidth Allocation in Networks Guang LU, Jian-Wen QI

A Model Based on Multi-agent for Dynamic Bandwidth Allocation in Networks Guang LU, Jian-Wen QI 216 Jont Internatonal Conference on Artfcal Intellgence and Computer Engneerng (AICE 216) and Internatonal Conference on etwork and Communcaton Securty (CS 216) ISB: 978-1-6595-362-5 A Model Based on Mult-agent

More information

CS 268: Lecture 8 Router Support for Congestion Control

CS 268: Lecture 8 Router Support for Congestion Control CS 268: Lecture 8 Router Support for Congeston Control Ion Stoca Computer Scence Dvson Department of Electrcal Engneerng and Computer Scences Unversty of Calforna, Berkeley Berkeley, CA 9472-1776 Router

More information

Application of VCG in Replica Placement Strategy of Cloud Storage

Application of VCG in Replica Placement Strategy of Cloud Storage Internatonal Journal of Grd and Dstrbuted Computng, pp.27-40 http://dx.do.org/10.14257/jgdc.2016.9.4.03 Applcaton of VCG n Replca Placement Strategy of Cloud Storage Wang Hongxa Computer Department, Bejng

More information

Distributed Middlebox Placement Based on Potential Game

Distributed Middlebox Placement Based on Potential Game Int. J. Communcatons, Network and System Scences, 2017, 10, 264-273 http://www.scrp.org/ournal/cns ISSN Onlne: 1913-3723 ISSN Prnt: 1913-3715 Dstrbuted Mddlebox Placement Based on Potental Game Yongwen

More information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive Semi-definite Programming Localization in Wireless Sensor Networks Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer

More information

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment Journal of Physcs: Conference Seres PAPER OPEN ACCESS Resource and Vrtual Functon Status Montorng n Network Functon Vrtualzaton Envronment To cte ths artcle: MS Ha et al 2018 J. Phys.: Conf. Ser. 1087

More information

Pricing Network Resources for Adaptive Applications in a Differentiated Services Network

Pricing Network Resources for Adaptive Applications in a Differentiated Services Network IEEE INFOCOM Prcng Network Resources for Adaptve Applcatons n a Dfferentated Servces Network Xn Wang and Hennng Schulzrnne Columba Unversty Emal: {xnwang, schulzrnne}@cs.columba.edu Abstract The Dfferentated

More information

MobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks

MobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks MobleGrd: Capacty-aware Topology Control n Moble Ad Hoc Networks Jle Lu, Baochun L Department of Electrcal and Computer Engneerng Unversty of Toronto {jenne,bl}@eecg.toronto.edu Abstract Snce wreless moble

More information

Video Proxy System for a Large-scale VOD System (DINA)

Video Proxy System for a Large-scale VOD System (DINA) Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

A fair buffer allocation scheme

A fair buffer allocation scheme A far buffer allocaton scheme Juha Henanen and Kalev Klkk Telecom Fnland P.O. Box 228, SF-330 Tampere, Fnland E-mal: juha.henanen@tele.f Abstract An approprate servce for data traffc n ATM networks requres

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

Available online at ScienceDirect. Procedia Computer Science 46 (2015 )

Available online at  ScienceDirect. Procedia Computer Science 46 (2015 ) Avalable onlne at www.scencedrect.com ScenceDrect Proceda Computer Scence 46 (2015 ) 558 565 Internatonal Conference on Informaton and Communcaton Technologes (ICICT 2014) A Novel Famly Genetc Approach

More information

Analysis of Collaborative Distributed Admission Control in x Networks

Analysis of Collaborative Distributed Admission Control in x Networks 1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT 3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ

More information

SRB: Shared Running Buffers in Proxy to Exploit Memory Locality of Multiple Streaming Media Sessions

SRB: Shared Running Buffers in Proxy to Exploit Memory Locality of Multiple Streaming Media Sessions SRB: Shared Runnng Buffers n Proxy to Explot Memory Localty of Multple Streamng Meda Sessons Songqng Chen,BoShen, Yong Yan, Sujoy Basu, and Xaodong Zhang Department of Computer Scence Moble and Meda System

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More information

Avoiding congestion through dynamic load control

Avoiding congestion through dynamic load control Avodng congeston through dynamc load control Vasl Hnatyshn, Adarshpal S. Seth Department of Computer and Informaton Scences, Unversty of Delaware, Newark, DE 976 ABSTRACT The current best effort approach

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

Fast Computation of Shortest Path for Visiting Segments in the Plane

Fast Computation of Shortest Path for Visiting Segments in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang

More information

An Optimal Bandwidth Allocation and Data Droppage Scheme for Differentiated Services in a Wireless Network

An Optimal Bandwidth Allocation and Data Droppage Scheme for Differentiated Services in a Wireless Network Purdue Unversty Purdue e-pubs ECE Techncal Reports Electrcal and Computer Engneerng 3--7 An Optmal Bandwdth Allocaton and Data Droppage Scheme for Dfferentated Servces n a Wreless Network Waseem Shekh

More information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

Querying by sketch geographical databases. Yu Han 1, a *

Querying by sketch geographical databases. Yu Han 1, a * 4th Internatonal Conference on Sensors, Measurement and Intellgent Materals (ICSMIM 2015) Queryng by sketch geographcal databases Yu Han 1, a * 1 Department of Basc Courses, Shenyang Insttute of Artllery,

More information

Energy Aware Virtual Machine Migration Techniques for Cloud Environment

Energy Aware Virtual Machine Migration Techniques for Cloud Environment Energy Aware rtual Machne Mgraton Technques for Cloud Envronment Kamal Gupta Department of CSE MMU, Sadopur jay Katyar, PhD Department of CSE MMU, Mullana ABSTRACT Cloud Computng offers ndspensable nfrastructure

More information

Unsupervised Learning

Unsupervised Learning Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and

More information

Available online at Available online at Advanced in Control Engineering and Information Science

Available online at   Available online at   Advanced in Control Engineering and Information Science Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced

More information

Dynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication

Dynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 008 proceedngs. Dynamc Bandwdth Provsonng wth Farness and Revenue Consderatons

More information

Delay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks

Delay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks Appl. Math. Inf. Sc. 7, No. 2L, 467-474 2013) 467 Appled Mathematcs & Informaton Scences An Internatonal Journal http://dx.do.org/10.12785/ams/072l13 Delay Varaton Optmzed Traffc Allocaton Based on Network

More information

ATYPICAL SDN consists of a logical controller in the

ATYPICAL SDN consists of a logical controller in the IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 25, NO. 6, DECEMBER 2017 3587 Mnmzng Flow Statstcs Collecton Cost Usng Wldcard-Based Requests n SDNs Hongl Xu, Member, IEEE, Zhuolong Yu, Chen Qan, Member, IEEE,

More information

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,

More information

Internet Traffic Managers

Internet Traffic Managers Internet Traffc Managers Ibrahm Matta matta@cs.bu.edu www.cs.bu.edu/faculty/matta Computer Scence Department Boston Unversty Boston, MA 225 Jont work wth members of the WING group: Azer Bestavros, John

More information

Advanced radio access solutions for the new 5G requirements

Advanced radio access solutions for the new 5G requirements Advanced rado access solutons for the new 5G requrements Soumaya Hamouda Assocate Professor, Unversty of Carthage Tuns, Tunsa Soumaya.hamouda@supcom.tn IEEE Summt 5G n Future Afrca. May 3 th, 2017 Pretora,

More information

A Topology-aware Random Walk

A Topology-aware Random Walk A Topology-aware Random Walk Inkwan Yu, Rchard Newman Dept. of CISE, Unversty of Florda, Ganesvlle, Florda, USA Abstract When a graph can be decomposed nto clusters of well connected subgraphs, t s possble

More information

The Shortest Path of Touring Lines given in the Plane

The Shortest Path of Touring Lines given in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He

More information

Cognitive Radio Resource Management Using Multi-Agent Systems

Cognitive Radio Resource Management Using Multi-Agent Systems Cogntve Rado Resource Management Usng Mult- Systems Jang Xe, Ivan Howtt, and Anta Raja Department of Electrcal and Computer Engneerng Department of Software and Informaton Systems The Unversty of North

More information

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

Quantifying Responsiveness of TCP Aggregates by Using Direct Sequence Spread Spectrum CDMA and Its Application in Congestion Control

Quantifying Responsiveness of TCP Aggregates by Using Direct Sequence Spread Spectrum CDMA and Its Application in Congestion Control Quantfyng Responsveness of TCP Aggregates by Usng Drect Sequence Spread Spectrum CDMA and Its Applcaton n Congeston Control Mehd Kalantar Department of Electrcal and Computer Engneerng Unversty of Maryland,

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

Assembler. Building a Modern Computer From First Principles.

Assembler. Building a Modern Computer From First Principles. Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought

More information

Energy-Efficient Workload Placement in Enterprise Datacenters

Energy-Efficient Workload Placement in Enterprise Datacenters COVER FEATURE CLOUD COMPUTING Energy-Effcent Workload Placement n Enterprse Datacenters Quan Zhang and Wesong Sh, Wayne State Unversty Power loss from an unnterruptble power supply can account for 15 percent

More information

CLOUD computing is widely adopted in current professional

CLOUD computing is widely adopted in current professional IEEE TRANSACTIONS ON CLOUD COMPUTING, VOL. 6, NO. 4, OCTOBER-DECEMBER 2018 1191 Usng Proactve Fault-Tolerance Approach to Enhance Cloud Servce Relablty Jale Lu, Shangguang Wang, Senor Member, IEEE, Ao

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

A MapReduce-supported Data Center Networking Topology

A MapReduce-supported Data Center Networking Topology A MapReduce-supported Data Center Networkng Topology Zelu Dng*,, Xue Lu, Deke Guo*, Honghu Chen*, Xueshan Luo* * Natonal Unversty of Defense Technology, Chna McGll Unversty, Canada Abstract Several novel

More information

AADL : about scheduling analysis

AADL : about scheduling analysis AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng

More information

An Efficient Algorithm for PC Purchase Decision System

An Efficient Algorithm for PC Purchase Decision System Proceedngs of the 6th WSAS Internatonal Conference on Instrumentaton, Measurement, Crcuts & s, Hangzhou, Chna, Aprl 15-17, 2007 216 An ffcent Algorthm for PC Purchase Decson Huay Chang Department of Informaton

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Efficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model. Eiji Oki May 28, 2009 The University of Electro-Communications

Efficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model. Eiji Oki May 28, 2009 The University of Electro-Communications Effcent Loa-Balance IP Routng Scheme Base on Shortest Paths n Hose Moel E Ok May 28, 2009 The Unversty of Electro-Communcatons Ok Lab. Semnar, May 28, 2009 1 Outlne Backgroun on IP routng IP routng strategy

More information

Bandwidth Allocation for Service Level Agreement Aware Ethernet Passive Optical Networks

Bandwidth Allocation for Service Level Agreement Aware Ethernet Passive Optical Networks Bandwdth Allocaton for Servce Level Agreement Aware Ethernet Passve Optcal Networks Dawd Nowak Performance Engneerng Laboratory School of Electronc Engneerng Dubln Cty Unversty Emal: nowakd@eengdcue Phlp

More information

Multi-objective Virtual Machine Placement for Load Balancing

Multi-objective Virtual Machine Placement for Load Balancing Mult-obectve Vrtual Machne Placement for Load Balancng Feng FANG and Bn-Bn Qu,a School of Computer Scence & Technology, Huazhong Unversty Of Scence And Technology, Wuhan, Chna Abstract. The vrtual machne

More information

an assocated logc allows the proof of safety and lveness propertes. The Unty model nvolves on the one hand a programmng language and, on the other han

an assocated logc allows the proof of safety and lveness propertes. The Unty model nvolves on the one hand a programmng language and, on the other han UNITY as a Tool for Desgn and Valdaton of a Data Replcaton System Phlppe Quennec Gerard Padou CENA IRIT-ENSEEIHT y Nnth Internatonal Conference on Systems Engneerng Unversty of Nevada, Las Vegas { 14-16

More information

RAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems:

RAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems: Speed/RAP/CODA Presented by Octav Chpara Real-tme Systems Many wreless sensor network applcatons requre real-tme support Survellance and trackng Border patrol Fre fghtng Real-tme systems: Hard real-tme:

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

A fast algorithm for color image segmentation

A fast algorithm for color image segmentation Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 006 A fast algorthm for color mage segmentaton L. Dong Unersty of Wollongong, lju@uow.edu.au

More information

Two-Stage Data Distribution for Distributed Surveillance Video Processing with Hybrid Storage Architecture

Two-Stage Data Distribution for Distributed Surveillance Video Processing with Hybrid Storage Architecture Two-Stage Data Dstrbuton for Dstrbuted Survellance Vdeo Processng wth Hybrd Storage Archtecture Yangyang Gao, Hatao Zhang, Bngchang Tang, Yanpe Zhu, Huadong Ma Bejng Key Lab of Intellgent Telecomm. Software

More information

A Load-balancing and Energy-aware Clustering Algorithm in Wireless Ad-hoc Networks

A Load-balancing and Energy-aware Clustering Algorithm in Wireless Ad-hoc Networks A Load-balancng and Energy-aware Clusterng Algorthm n Wreless Ad-hoc Networks Wang Jn, Shu Le, Jnsung Cho, Young-Koo Lee, Sungyoung Lee, Yonl Zhong Department of Computer Engneerng Kyung Hee Unversty,

More information

Maintaining temporal validity of real-time data on non-continuously executing resources

Maintaining temporal validity of real-time data on non-continuously executing resources Mantanng temporal valdty of real-tme data on non-contnuously executng resources Tan Ba, Hong Lu and Juan Yang Hunan Insttute of Scence and Technology, College of Computer Scence, 44, Yueyang, Chna Wuhan

More information

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Risk-Based Packet Routing for Privacy and Compliance-Preserving SDN

Risk-Based Packet Routing for Privacy and Compliance-Preserving SDN Rsk-Based Packet Routng for Prvacy and Complance-Preservng SDN Karan K. Budhraja Abhshek Malvankar Mehd Bahram Chnmay Kundu Ashsh Kundu Mukesh Snghal, Unversty of Maryland, Baltmore County, MD, USA Emal:

More information

Routing in Degree-constrained FSO Mesh Networks

Routing in Degree-constrained FSO Mesh Networks Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Routng n Degree-constraned FSO Mesh Networks Zpng Hu, Pramode Verma, and James Sluss Jr. School of Electrcal & Computer Engneerng

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

Shared Running Buffer Based Proxy Caching of Streaming Sessions

Shared Running Buffer Based Proxy Caching of Streaming Sessions Shared Runnng Buffer Based Proxy Cachng of Streamng Sessons Songqng Chen, Bo Shen, Yong Yan, Sujoy Basu Moble and Meda Systems Laboratory HP Laboratores Palo Alto HPL-23-47 March th, 23* E-mal: sqchen@cs.wm.edu,

More information

Stitch-n-Sync: Discreetly Disclosing Topology Information Using Logically Centralized Controllers

Stitch-n-Sync: Discreetly Disclosing Topology Information Using Logically Centralized Controllers Sttch-n-Sync: Dscreetly Dsclosng Topology Informaton Usng Logcally Centralzed Controllers Presented at The 3 rd Internatonal Workshop on Capacty Sharng (CSWS'13) n conjuncton wth ICNP'13 by Yvon GOURHANT

More information

Online Policies for Opportunistic Virtual MISO Routing in Wireless Ad Hoc Networks

Online Policies for Opportunistic Virtual MISO Routing in Wireless Ad Hoc Networks 12 IEEE Wreless Communcatons and Networkng Conference: Moble and Wreless Networks Onlne Polces for Opportunstc Vrtual MISO Routng n Wreless Ad Hoc Networks Crstano Tapparello, Stefano Tomasn and Mchele

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Technical Report. i-game: An Implicit GTS Allocation Mechanism in IEEE for Time- Sensitive Wireless Sensor Networks

Technical Report. i-game: An Implicit GTS Allocation Mechanism in IEEE for Time- Sensitive Wireless Sensor Networks www.hurray.sep.pp.pt Techncal Report -GAME: An Implct GTS Allocaton Mechansm n IEEE 802.15.4 for Tme- Senstve Wreless Sensor etworks Ans Koubaa Máro Alves Eduardo Tovar TR-060706 Verson: 1.0 Date: Jul

More information

Network Coding as a Dynamical System

Network Coding as a Dynamical System Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.

More information

Improved Resource Allocation Algorithms for Practical Image Encoding in a Ubiquitous Computing Environment

Improved Resource Allocation Algorithms for Practical Image Encoding in a Ubiquitous Computing Environment JOURNAL OF COMPUTERS, VOL. 4, NO. 9, SEPTEMBER 2009 873 Improved Resource Allocaton Algorthms for Practcal Image Encodng n a Ubqutous Computng Envronment Manxong Dong, Long Zheng, Kaoru Ota, Song Guo School

More information

Fibre-Optic AWG-based Real-Time Networks

Fibre-Optic AWG-based Real-Time Networks Fbre-Optc AWG-based Real-Tme Networks Krstna Kunert, Annette Böhm, Magnus Jonsson, School of Informaton Scence, Computer and Electrcal Engneerng, Halmstad Unversty {Magnus.Jonsson, Krstna.Kunert}@de.hh.se

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

Learning-Based Top-N Selection Query Evaluation over Relational Databases

Learning-Based Top-N Selection Query Evaluation over Relational Databases Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **

More information

A QoS-aware Scheduling Scheme for Software-Defined Storage Oriented iscsi Target

A QoS-aware Scheduling Scheme for Software-Defined Storage Oriented iscsi Target A QoS-aware Schedulng Scheme for Software-Defned Storage Orented SCSI Target Xanghu Meng 1,2, Xuewen Zeng 1, Xao Chen 1, Xaozhou Ye 1,* 1 Natonal Network New Meda Engneerng Research Center, Insttute of

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

Integrated Congestion-Control Mechanism in Optical Burst Switching Networks

Integrated Congestion-Control Mechanism in Optical Burst Switching Networks Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subect matter experts for publcaton n the IEEE GLOBECOM 2005 proceedngs Integrated Congeston-Control Mechansm n Optcal Burst

More information

Comparisons of Packet Scheduling Algorithms for Fair Service among Connections on the Internet

Comparisons of Packet Scheduling Algorithms for Fair Service among Connections on the Internet Comparsons of Packet Schedulng Algorthms for Far Servce among Connectons on the Internet Go Hasegawa, Takahro Matsuo, Masayuk Murata and Hdeo Myahara Department of Infomatcs and Mathematcal Scence Graduate

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

Towards High Fidelity Network Emulation

Towards High Fidelity Network Emulation Towards Hgh Fdelty Network Emulaton Lanje Cao, Xangyu Bu, Sona Fahmy, Syuan Cao Department of Computer Scence, Purdue nversty, West Lafayette, IN, SA E-mal: {cao62, xb, fahmy, cao208}@purdue.edu Abstract

More information

Scalability of a Mobile Cloud Management System

Scalability of a Mobile Cloud Management System Scalablty of a Moble Cloud Management System Roberto Bfulco Unversty of Napol Federco II roberto.bfulco2@unna.t Marcus Brunner NEC Laboratores Europe brunner@neclab.eu Peer Hasselmeyer NEC Laboratores

More information