A New Token Allocation Algorithm for TCP Traffic in Diffserv Network
|
|
- Tracey Washington
- 5 years ago
- Views:
Transcription
1 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, Taml Nadu sudha@ntt.edu and ammas@ntt.edu Abstract A new algorthm has been desgned for provdng optmal allocaton of tokens for TCP traffc n DffServ networks, whch s amed at mnmzng the packet losses of the ndvdual flows. The optmalty n token allocaton s acheved usng optmzaton technque employng Genetc Algorthm (GA). The transent performance of the proposed algorthm has been evaluated through Matlab smulaton. It has been observed from the smulaton studes that the token allocatons vary wth respect to the ncomng rate of the flows. A TCP frendly three color marker has also been proposed to mnmze the spacng between the subsequent IN and OUT packets. The formulaton of the objectve functon and the applcaton of GA for the optmzaton process have been explaned. The smulaton results pertanng to the token allocaton for two dfferent cases are furnshed. Keywords: Optmzaton, Genetc Algorthm, Token Allocaton, Packet Markng, DffServ networks. I. Introducton The Dfferentated Servces (DffServ) archtecture has been proposed as a scalable soluton for provdng servce dfferentaton among flows wthout any per-flow buffer management nsde the core of the network [1]. The buldng blocks of the assured servce nclude a traffc marker that marks packets as IN and OUT dependng upon the servce level agreement(sla) at the edge of the doman and an actve queue management technque such as RIO (RED wth IN / OUT ) n the network nteror [2],[3]. Prevous works on markers provde good per-flow markng but do not consder far token dstrbuton between ndvdual flows of the aggregate ncomng traffc [4],[5]. The servce goals promsed by the DffServ network are not lkely to be acheved n many stuatons due to the TCP congeston control algorthm, whch was developed for the best effort servce and has no knowledge about the prortes of packets [6] - [8]. Ibanez et al. have used a token bucket marker for assured servce and showed that t resulted n TCP not realzng the mnmum assured servce [9]. Feroz et al. have proposed a TCP frendly marker to mnmze the spacng between the subsequent IN packets to overcome the bursty nature of the traffc, whch s the man cause for the packet losses n TCP. However, there s no farness n allocaton of tokens to short-lved TCP flows [10]. Renjsh Kumar et al. have proposed two markers namely the Memory-based two Internatonal Journal of The Computer, the Internet and Management Vol. 16.No.3 (September-December, 2008) pp
2 S. Sudha and N. Ammasagounden color marker and Memory- based three color marker for TCP frendly traffc based on the rate estmator [11]. The bursty nature s resolved by means of probablstc markng. However, ths marker s TSW-TC based. II. Proposed Work In the present paper, a novel technque s proposed to dstrbute the tokens optmally among the TCP flows employng TB-TC usng genetc algorthm. A three colour packet markng algorthm s also presented. The proposed algorthm ams at optmal allocaton of tokens to small wndow flows as well as for others based on the avalablty of the tokens. Hence a mult-objectve functon s requred to be formulated for the optmzaton process. The man feature of the proposed marker s to optmally allocate the avalable tokens such that flows of hgher sendng rate get more tokens than those of lower sendng rate to mnmze the packet losses of the ndvdual flows. Ths requrement s met by usng a weghtng factor n formulatng the objectve functon whch s evaluated by an optmzaton process usng GA. The output of the optmzaton process results n a token allocaton vector X and the default spacng vector O of sze f, where f corresponds to the fracton of the total flows. The objectve functon for the proposed work s formulated as: Mnmze f F(x) = w =1 ( p x ) (1) subject to the followng constrants : ) The total tokens allocated to f flows should not exceed the avalable tokens. Ths requrement s met by the constrant g1 as follows: g1 = =1 x Tk ) The tokens allocated to any ndvdual flow, should not exceed ther estmated sendng rate n order to avod wastage of tokens and at the same tme not less than zero( negatve value s not possble). Ths constrant g2 s enforced by the upper and the lower lmts of the desgn parameter as g 2 where p = estmate of the number of packets correspondng to flow x = number of tokens allocated to flow n = total number of flows f = number of small wndow flows or the remanng (.e. t s a fracton of n) Tk = number of tokens expressed as packets w = weght factor for flow, whch s expressed as the fracton of the estmated packets of flow to the total estmated packets of f flows.e.. p w = (2) Token Allocaton Algorthm f = 0 x p f = 1 Step I: Identfyng the flows and fndng the total of the estmated packets For each flow, f ( E < k) then /*Increment Small wndows and fnd the total of them */ Sw ++; fnd Σ p ; correspondng to Sw /*Increment remanng flows and fnd the total of them */ else R ++; fnd Σ p ; correspondng to R p 42
3 A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network Step II : Dstrbuton of the tokens among the flows ) If ( Tk < Σ P ; of Sw ) /* If no tokens left after protectng Sw flows */ For small wndow flows Dvde Tk among the Sw flows optmally Sw F( X ) = w P x =1 /* The vector X s obtaned for Sw flows usng GA */ subject to the constrants O = [ p / x ] -1 ; For all other flows x = 0 ( ) ) Else f (Tk Σ p ; of Sw ) /* To protect small wndow flows all the tokens are assgned to SW flows */ For small wndow flows All packets are assgned tokens x = p O = 0 For all other flows /* If tokens are left after protectng Sw flows */ Dvde the remanng tokens among the other flows optmally R F(x) = w =1 ( p x ) /* The vector X s obtaned for other flows usng GA */ subject to the constrants O = [ p / x ] -1 /* The spacng vector O s obtaned for other flow */ It s to be noted that the allocaton of tokens s done once n every T seconds. Thus by the above algorthm, the token allocaton vector X and the packet nterleavng vector O (.e. default spacng) for all the n flows are obtaned. The packets are marked based on the vectors X and O. In the markng nterval of T secs., the spacng s updated dynamcally dependng on the ncomng rate. The markng algorthm proposed s amed at provdng three dfferent levels of markng, namely green, yellow and red as explaned n the packet markng algorthm furnshed below. Packet markng Algorthm count = count of number of packets of flow ) Save the spacng varable for each flow n a temporary varable. Ds = O ) For every packet that comes n, dentfy ts flow. ) For flow, check f IN tokens are avalable.e. f (x > 0 ) v) If true then mark as follows : f ( count O ) /*packet count s larger than the spacng*/ mark as green O = ( Ds (count O )) Reset count decrement x else f ((count < O ) and ( count Ds )) mark as yellow Reset count else Mark as red v). Else Mark as red III. Optmzaton usng GA The lower and the upper lmts of the allocaton vector X correspondng to the ndvdual flows are ntalzed to 0 and p respectvely. Startng from the specfcaton of the populaton sze, number of generatons, cross-over and mutaton probablty, the optmzaton process s ntated. In general, GA maxmzes the gven functon whereas n the present case, Internatonal Journal of The Computer, the Internet and Management Vol. 16.No.3 (September-December, 2008) pp
4 S. Sudha and N. Ammasagounden the am s to mnmze the objectve functon (eqn.1). So, the functon s wrtten as ftval = 1/ (1+objval), where objval s the objectve functon value and ftval s the ftness functon value. The detaled steps for obtanng the convergence of the objectve functon are shown n flow chart of Fg. 1. As a result of ths optmzaton, the token allocaton and the default spacng for all the f flows are obtaned n a vector X and O respectvely. Start Get f, p and Tk as nput Intalaze POP, GEN, cross-over and mutaton probablty and the lower and upper bounds of the desgn varables. GEN=1 Generate the ntal populaton POP=1 Calculate the weghts usng eqn.(2), evaluate the objectve functon usng eqn.(1) and the ftness value POP=POP+1 No Is POP >pp? Yes Generaton of off-sprngs and a new set of chromosomes Choose the max ftness and mn Objval n the present GEN GEN=GEN+1 No Is GEN >gen? Yes Fg. 1 Flowchart for the optmzaton process. GEN : generaton count POP : populaton count Prnt mn objval and the token allocaton vector among all the Generatons 44
5 A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network IV. Smulaton Results The followng values have been chosen for smulaton n the optmzaton process: Number of generatons, gen = 50; populaton sze, pp = 30; mutaton probablty = 0.002; cross-over probablty = 0.96 The smulaton was carred out for 10 flows of whch the frst fve were assumed as small wndow flows. The estmaton of the number of packets correspondng to each flow was generated randomly. The random generator follows a unform dstrbuton n the range [0, 1]. To have the effect of a real network, the estmates were scaled up to hgher values. The smulatons have been carred out for two cases namely ) when the network load s hgh and ) when the network load s low. In the frst case, the small wndow flows are protected by optmally allocatng the avalable tokens only to them. In the second case, after protectng small wndow flows, the remanng tokens are optmally allocated to the other flows. The number of tokens was sutably ntalzed n both the cases. The smulaton scenaro consders the network topology shown n Fg. 2 where there s a bottleneck lnk. The results of the smulaton are plotted n the form of graphs shown n Fg. 3. The token allocaton of the ndvdual flows by the proposed algorthm s compared wth that of the TCP frendly marker suggested by [10]. From the plots, t s observed that the token allocaton vares wth the estmaton of the number of packets, thus provdng an optmal allocaton of tokens. The suggested packet markng algorthm mnmzes the spacng between the two subsequent IN (green) as well as OUT packets. The OUT packets are further categorzed as yellow and red whch wll be treated dfferently n the network nteror. The colors green, yellow and red represent drop precedences 0, 1, 2 respectvely of a sngle AF class. S0 D0 S9 S0 R1 : Bottleneck Marker : : S9 R3 R2 D20 Marker R4. Sources data Acks Destnatons Fg. 2 Network topology Internatonal Journal of The Computer, the Internet and Management Vol. 16.No.3 (September-December, 2008) pp
6 S. Sudha and N. Ammasagounden Token allocaton n packets GA Marker TCP frendly Marker estmaton of the packets Number of flows (a) Token allocaton n packets GA Marker TCP-frendly marker estmaton of the packets Number of flows (b) Fg. 3 Varaton of token allocaton wth flows ( n =10, Sw = 5, R =5) (a) when network load s hgh (b) when network load s low 46
7 A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network V. Conclusons and Future Work In ths paper, a new algorthm has been proposed for token allocaton n a Dffserv network. The token allocaton algorthm suggested provdes an optmal dstrbuton of tokens to the flows, when the network load s hgh or low. A judcous formulaton of objectve functon combned wth GA technque for optmzaton has resulted n an optmal token allocaton vector for both small wndow flows and other flows. Further, a packet markng algorthm has also been proposed whch marks the packets as green, yellow or red n order to mnmze the spacng between the subsequent IN and OUT packets of these flows. It s expected that the packet losses may reduce by ths algorthm and hence better performance can be acheved n terms of tmeouts, goodput etc. However, ths has to be substantated by smulatng t n NS-2. As a further work, t s amed to evaluate the proposed TCP frendly marker through smulatons on NS-2 (Network Smulator). VI. References [1] S. Blake, D. Black, M. Carlson (1998), E. Daves, Z. Wang, and W. Wess, An archtecture for Dfferentated Servces, RFC 2475, December. [2] S. Floyd and V. Jacobson, (1993) Random Early Detecton gateways for congeston avodance, ACM/IEEE Transactons on Networkng, Vol.1, No. 4, pp [3] D. D. Clark and W. Fang (1998), Explct allocaton of best effort packet delvery servce, IEEE/ACM Transactons on Networkng, Vol.6, No.4, pp , [4] J. Henanen and R. Guern (1999), A two rate three color marker, RFC 2698, September. [5] J. Henanen and R. Guern (1999), A sngle rate three color marker, RFC 2697, September. [6] M. Banes, B. Nandy, P. Peda, N. Seddgh and M. Devestskots (2000), Usng TCP models to understand bandwdth assurance n a dfferentated servces network, Nortel Techncal Report, July. [7] I. Yeom, A. L. Narasmha Reddy (1994), Realzng throughput guarantees n a dfferentated servces network, Proc. ICMCS, Florence, Italy, 7-11, Vol.2, pp , June. [8] V. Jacobson and M. J. Karels (1998), Congeston avodance and control, Proc. SIGCOMM 88, Stanford, CA, USA, pp , August. [9] J. Ibanez and K. Nchols (1998), Prelmnary Smulaton Evaluaton of an assured servce, IETF Draft, August. [10] A. Feroz, A. Rao and S. Kalyanaraman (2000), A TCP - frendly traffc Marker for IP Dfferentated Servces, Proc. of the IEEE /IFIP 8 th Internatonal Workshop on Qualty of Servces, IWUQ o S. [11] K. R. Renjsh Kumar, A. L. Ananda, Llly Kutty Jacob (2002), TCP-frendly traffc condtonng n DffServ networks: a memory-based approach, Computer Networks, Vol 38, pp Internatonal Journal of The Computer, the Internet and Management Vol. 16.No.3 (September-December, 2008) pp
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 informationIntelligent Traffic Conditioners for Assured Forwarding Based Differentiated Services Networks 1
Intellgent Traffc Condtoners for Assured Forwardng Based Dfferentated Servces Networks B. Nandy, N. Seddgh, P. Peda, J. Ethrdge Nortel Networks, Ottawa, Canada Emal:{bnandy, nseddgh, ppeda, jethrdg}@nortelnetworks.com
More informationThe 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 informationAvoiding 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 informationEfficient 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 informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
More informationInternet 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 informationMulti-objective Design Optimization of MCM Placement
Proceedngs of the 5th WSEAS Int. Conf. on Instrumentaton, Measurement, Crcuts and Systems, Hangzhou, Chna, Aprl 6-8, 26 (pp56-6) Mult-objectve Desgn Optmzaton of MCM Placement Chng-Ma Ko ab, Yu-Jung Huang
More informationNGPM -- A NSGA-II Program in Matlab
Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 2011-07-26 Contents Contents... 1. Introducton...
More informationComparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments
Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,
More informationState of the Art in Differentiated
Outlne Dfferentated Servces on the Internet Explct Allocaton of Best Effort Packet Delvery Servce, D. Clark and W. Fang A Two bt Dfferentated Servces Archtecture for the Internet, K. Nchols, V. Jacobson,
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationDetermining 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 informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationNetwork 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 informationParallelism 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 informationCS 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 informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationHigh Performance DiffServ Mechanism for Routers and Switches: Packet Arrival Rate Based Queue Management for Class Based Scheduling
Hgh Performance DffServ Mechansm for Routers and Swtches: Packet Arrval Rate Based Queue Management for Class Based Schedulng Bartek Wydrowsk and Moshe Zukerman ARC Specal Research Centre for Ultra-Broadband
More informationLoad-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 informationRouting 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 informationGateway Algorithm for Fair Bandwidth Sharing
Algorm for Far Bandwd Sharng We Y, Rupnder Makkar, Ioanns Lambadars Department of System and Computer Engneerng Carleton Unversty 5 Colonel By Dr., Ottawa, ON KS 5B6, Canada {wy, rup, oanns}@sce.carleton.ca
More informationAdvanced Computer Networks
Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans
More informationRAP. 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 informationAn 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 informationCompiler 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 informationEfficient 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 informationPERFORMANCE ANALYSIS OF AF IN CONSIDERING LINK
I.J.E.M.S., VOL.2 (3) 211: 163-171 ISSN 2229-6X PERFORMANCE ANALYSIS OF AF IN CONSIDERING LINK UTILISATION BY SIMULATION Jai Kumar and U.C. Jaiswal Department of Computer Science and Engineering, Madan
More informationNeural Network Control for TCP Network Congestion
5 Amercan Control Conference June 8-, 5. Portland, OR, USA FrA3. Neural Network Control for TCP Network Congeston Hyun C. Cho, M. Sam Fadal, Hyunjeong Lee Electrcal Engneerng/6, Unversty of Nevada, Reno,
More informationIntegrated 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 informationPricing 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 informationSum 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 informationGA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks
Seventh Internatonal Conference on Intellgent Systems Desgn and Applcatons GA-Based Learnng Algorthms to Identfy Fuzzy Rules for Fuzzy Neural Networks K Almejall, K Dahal, Member IEEE, and A Hossan, Member
More informationSolutions for Real-Time Communication over Best-Effort Networks
Solutons for Real-Tme Communcaton over Best-Effort Networks Anca Hangan, Ramona Marfevc, Gheorghe Sebestyen Techncal Unversty of Cluj-Napoca, Computer Scence Department {Anca.Hangan, Ramona.Marfevc, Gheorghe.Sebestyen}@cs.utcluj.ro
More informationLoad 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 informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationA 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 informationF Geometric Mean Graphs
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.
More informationProblem 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 informationA Genetic Algorithm Based Dynamic Load Balancing Scheme for Heterogeneous Distributed Systems
Proceedngs of the Internatonal Conference on Parallel and Dstrbuted Processng Technques and Applcatons, PDPTA 2008, Las Vegas, Nevada, USA, July 14-17, 2008, 2 Volumes. CSREA Press 2008, ISBN 1-60132-084-1
More informationAnalysis 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 informationHIERARCHICAL SCHEDULING WITH ADAPTIVE WEIGHTS FOR W-ATM *
Copyrght Notce c 1999 IEEE. Personal use of ths materal s permtted. However, permsson to reprnt/republsh ths materal for advertsng or promotonal purposes or for creatng new collectve wors for resale or
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationAn 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 informationDESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT
DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,
More informationPriority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks
Prorty-Based Schedulng Algorthm for Downlnk Traffcs n IEEE 80.6 Networks Ja-Mng Lang, Jen-Jee Chen, You-Chun Wang, Yu-Chee Tseng, and Bao-Shuh P. Ln Department of Computer Scence Natonal Chao-Tung Unversty,
More informationMeta-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 informationSample Solution. Advanced Computer Networks P 1 P 2 P 3 P 4 P 5. Module: IN2097 Date: Examiner: Prof. Dr.-Ing. Georg Carle Exam: Final exam
Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans
More informationSciFed Journal of Telecommunication Single Fitness Function to Optimize Energy using Genetic Algorithms for Wireless Sensor Network
Ismal Abdullah,, 2017, 1:1 ScFed Journal of Telecommuncaton Research Artcle Open Access Sngle Ftness Functon to Optmze Energy usng Genetc Algorthms for Wreless Sensor Network *1 Ismal Abdullah, 2 Kald
More informationEVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS
Academc Research Internatonal ISS-L: 3-9553, ISS: 3-9944 Vol., o. 3, May 0 EVALUATIO OF THE PERFORMACES OF ARTIFICIAL BEE COLOY AD IVASIVE WEED OPTIMIZATIO ALGORITHMS O THE MODIFIED BECHMARK FUCTIOS Dlay
More informationSimulation and Exploration of RCP in the networks
EE384Y Smulaton and Exploraton of P n the networks Sprng, 003 Smulaton and Exploraton of P n the networks hanghua He changhua@stanford.edu June 06, 003 Abstract P (ate ontrol Protocol) s a rate-based congeston
More informationQuantifying 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 informationReliable and Efficient Routing Using Adaptive Genetic Algorithm in Packet Switched Networks
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 1, No 3, January 2012 ISSN (Onlne): 1694-0814 www.ijcsi.org 168 Relable and Effcent Routng Usng Adaptve Genetc Algorthm n Packet Swtched
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationControl strategies for network efficiency and resilience with route choice
Control strateges for networ effcency and reslence wth route choce Andy Chow Ru Sha Centre for Transport Studes Unversty College London, UK Centralsed strateges UK 1 Centralsed strateges Some effectve
More informationOptimization of Adaptive Transit Signal Priority Using Parallel Genetic Algorithm
TSINGHUA SCIENCE AND TECHNOLOGY ISSN 1007-0214 02/14 pp131-140 Volume 12, Number 2, Aprl 2007 Optmzaton of Adaptve Transt Sgnal Prorty Usng Parallel Genetc Algorthm Guangwe Zhou 1,** Albert Gan 2, L. Davd
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationBackpropagation: In Search of Performance Parameters
Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,
More informationFuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches
Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of
More informationA GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING
A GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING M. Nkravan and M. H. Kashan Department of Electrcal Computer Islamc Azad Unversty, Shahrar Shahreqods
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationTPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints
TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process
More informationA Novel Approach for an Early Test Case Generation using Genetic Algorithm and Dominance Concept based on Use cases
Alekhya Varkut et al, / (IJCSIT) Internatonal Journal of Computer Scence and Informaton Technologes, Vol. 3 (3), 2012,4218-4224 A Novel Approach for an Early Test Case Generaton usng Genetc Algorthm and
More informationGenetic Algorithm-based Hybrid Methods for a Flexible Single-operation Serial-batch Scheduling Problem with Mold Constraints
Sensors & Transducers, Vol. 55, Issue 8, August 0, pp. -4 Sensors & Transducers 0 by IFSA http://www.sensorsportal.com Genetc Algorthm-based Hybrd Methods for a Flexble Sngle-operaton Seral-batch Schedulng
More informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationMultiobjective fuzzy optimization method
Buletnul Ştnţfc al nverstăţ "Poltehnca" dn Tmşoara Sera ELECTRONICĂ ş TELECOMNICAŢII TRANSACTIONS on ELECTRONICS and COMMNICATIONS Tom 49(63, Fasccola, 24 Multobjectve fuzzy optmzaton method Gabrel Oltean
More informationResearch on Kruskal Crossover Genetic Algorithm for Multi- Objective Logistics Distribution Path Optimization
, pp.367-378 http://dx.do.org/.14257/jmue.215..8.36 Research on Kruskal Crossover Genetc Algorthm for Mult- Objectve Logstcs Dstrbuton Path Optmzaton Yan Zhang 1,2, Xng-y Wu 1 and Oh-kyoung Kwon 2, a,
More informationAn 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 informationQoS-aware composite scheduling using fuzzy proactive and reactive controllers
Khan et al. EURASIP Journal on Wreless Communcatons and Networkng 2014, 2014:138 http://jwcn.euraspjournals.com/content/2014/1/138 RESEARCH Open Access QoS-aware composte schedulng usng fuzzy proactve
More informationMobileGrid: 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 informationOptimization of Local Routing for Connected Nodes with Single Output Ports - Part I: Theory
U J.T. (: 33- (pr. 0 Optmzaton of Local Routng for Connected odes wth Sngle Output Ports - Part I: Theory Dobr tanassov Batovsk Faculty of Scence and Technology ssumpton Unversty Bangkok Thaland E-mal:
More informationVirtual 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 informationPositive 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 informationBandwidth 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 informationResource 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 informationApplication 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 informationDelay 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 informationDesign for Reliability: Case Studies in Manufacturing Process Synthesis
Desgn for Relablty: Case Studes n Manufacturng Process Synthess Y. Lawrence Yao*, and Chao Lu Department of Mechancal Engneerng, Columba Unversty, Mudd Bldg., MC 473, New York, NY 7, USA * Correspondng
More informationOutline. 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 informationComparisons 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 informationARTICLE IN PRESS. Signal Processing: Image Communication
Sgnal Processng: Image Communcaton 23 (2008) 754 768 Contents lsts avalable at ScenceDrect Sgnal Processng: Image Communcaton journal homepage: www.elsever.com/locate/mage Dstrbuted meda rate allocaton
More informationWhy Congestion Control. Congestion Control and Active Queue Management. TCP Congestion Control Behavior. Generic TCP CC Behavior: Additive Increase
Congeston Control and Actve Queue Management Congeston Control, Effcency and Farness Analyss of TCP Congeston Control A smple TCP throughput formula RED and Actve Queue Management How RED works Flud model
More informationA Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics
A Hybrd Genetc Algorthm for Routng Optmzaton n IP Networks Utlzng Bandwdth and Delay Metrcs Anton Redl Insttute of Communcaton Networks, Munch Unversty of Technology, Arcsstr. 21, 80290 Munch, Germany
More informationGoals and Approach Type of Resources Allocation Models Shared Non-shared Not in this Lecture In this Lecture
Goals and Approach CS 194: Dstrbuted Systems Resource Allocaton Goal: acheve predcable performances Three steps: 1) Estmate applcaton s resource needs (not n ths lecture) 2) Admsson control 3) Resource
More informationOPTIMIZATION OF FUZZY RULE BASES USING CONTINUOUS ANT COLONY SYSTEM
Proceedng of the Frst Internatonal Conference on Modelng, Smulaton and Appled Optmzaton, Sharah, U.A.E. February -3, 005 OPTIMIZATION OF FUZZY RULE BASES USING CONTINUOUS ANT COLONY SYSTEM Had Nobahar
More informationEffect of Number of Drop Precedences in Assured Forwarding
Internet Engineering Task Force Internet Draft Expires: January 2000 Mukul Goyal Arian Durresi Raj Jain Chunlei Liu The Ohio State University July, 999 Effect of Number of Drop Precedences in Assured Forwarding
More informationBiostatistics 615/815
The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts
More informationC2 Training: June 8 9, Combining effect sizes across studies. Create a set of independent effect sizes. Introduction to meta-analysis
C2 Tranng: June 8 9, 2010 Introducton to meta-analyss The Campbell Collaboraton www.campbellcollaboraton.org Combnng effect szes across studes Compute effect szes wthn each study Create a set of ndependent
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationUnsupervised 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 informationApplication 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 informationPERFORMANCE ANALYSIS OF AF IN CONSIDERING LINK UTILISATION BY SIMULATION WITH DROP-TAIL
I.J.E.M.S., VOL.2 (4) 2011: 221-228 ISSN 2229-600X PERFORMANCE ANALYSIS OF AF IN CONSIDERING LINK UTILISATION BY SIMULATION WITH DROP-TAIL Jai Kumar, Jaiswal Umesh Chandra Department of Computer Science
More informationElsevier Editorial System(tm) for Expert Systems With Applications Manuscript Draft
Elsever Edtoral System(tm) for Expert Systems Wth Applcatons Manuscrpt Draft Manuscrpt Number: ESWA-D-08-00701 tle: An Ordnal Optmzaton heory Based Algorthm for a Class of Smulaton Optmzaton Problems and
More informationPARETO BAYESIAN OPTIMIZATION ALGORITHM FOR THE MULTIOBJECTIVE 0/1 KNAPSACK PROBLEM
PARETO BAYESIAN OPTIMIZATION ALGORITHM FOR THE MULTIOBJECTIVE 0/ KNAPSACK PROBLEM Josef Schwarz Jří Očenáše Brno Unversty of Technology Faculty of Engneerng and Computer Scence Department of Computer Scence
More informationA Fair Access Mechanism Based on TXOP in IEEE e Wireless Networks
11 Internatonal Journal of Communcaton Networks and Informaton Securty (IJCNIS) Vol. 8, No. 1, Aprl 16 A Far Access Mechansm Based on TXOP n IEEE 8.11e Wreless Networks Marjan Yazdan 1, Maryam Kamal, Neda
More informationFuture Generation Computer Systems
Future Generaton Computer Systems 29 (2013) 1631 1644 Contents lsts avalable at ScVerse ScenceDrect Future Generaton Computer Systems journal homepage: www.elsever.com/locate/fgcs Gosspng for resource
More information