Traffic Management for the Gentle Random Early Detection using Discrete- Time Queueing
|
|
- Frank Nash
- 5 years ago
- Views:
Transcription
1 Informaton Management n Modern Organzatons: Trends & Challenges 89 Traffc Management for the Gentle Random Early Detecton usng Dscrete- Tme Queueng. Introducton Abstract Hussen Abdel-aber Deartment of Comutng Unversty of Bradford BD7 DP U habdela@ Bradford.ac.uk Fad Thabtah Deartment of MIS Phladelha Unversty Amman Jordan ffayez@hladelha.edu.o Mke Woodward Deartment of Comutng Unversty of Bradford BD7 DP U m.e.woodward@ Bradford.ac.uk artcular router buffer when the connectons demand Snce some network connectons transmt ackets on network resources.e. buffer rooms and larger than others there could be unbalanced share n the avalable bandwdth and buffer rooms among the exstng connectons. Further connectons that send ackets more than others buld more buffer saces whch therefore cause the network to become congested. Ths aer rooses a dscrete-tme queueng analytcal model based on Gentle Random bandwdth exceed the avalable bandwdth caacty at the router [6 8 9] whch consequently deterorates the nternet erformance. The congeston can also lead to drong large number of ackets obtanng long average queueng delay for arrval ackets unstable average queue length and unfar share of network resources among network hosts [8]. Early Detecton (GRED method whch controls the Several actve queue management (AQM congeston ncdent by decreasng the connectons transmttng rates lnearly at certan levels. We comare our analytcal model wth the classc GRED n terms of several dfferent erformance metrcs ncludng average queue length throughut average queueng delay and acket rate n order to dentfy the one that offers better Qualty of Servce (QoS. Furthermore we comare both models accordng to the acket drong robablty to determne the one that dros smaller number of ackets. Lastly n ths aer we nvestgate the mnmum otmal oston at both the GRED and our analytcal model router buffers that gves a satsfed erformance. methods.e. [ ] have been develoed n the comuter networks lterature n order to control the congeston. These methods were rmarly roosed to ( manage and control the congested routers buffers n the nternet ( deloy farness among network connectons (3 otmse the network erformance by drong fewer number of ackets (4 acheve low average watng tme for ackets n the routers buffers and (5 guarantee hgh throughut [9 ]. In order to desgn a new AQM method one has to answer three man questons accordng to [5]:. What s the congeston metrc that wll hel n controllng the congeston?. How the congested router buffer wll nform the eywords: Gentle Random Early Detecton (GRED nalytcal connectons to modfy ther transmsson rates. Model Queueng System Dscrete-tme Queue. Snce the massve develoments n the nternet technology n several alcatons such as audo and vdeo data traffc the nternet becomes one of the fastest develoment technologes n recent years [6 8]. These nternet alcatons necesstate hgh seed router buffers to delver data to ther rosectve recevers. One key ssue related to nternet alcatons erformance n comuter networks s congeston. The congeston occurs n the nternet at a 3. What s the acket drong robablty functon and what s the olcy used for drong the ackets.e. lnearly [6] exonentally [4 5] etc. One of the early and oular AQM methods s Random Early Detecton (RED [6] a number of successful AQM methods were roosed after RED such as Gentle RED (GRED [8] Random Exonental Markng (REM [4 5] Dynamc Random Early Dro (DRED [7] Stablzed RED (SRED [] BLUE [3 5] Adatve RED (ARED [7] and Generalzed Random Early Evason Network (GREEN [4]. However In accordance wth modellng queueng networks usng dscrete-tme
2 9 Informaton Management n Modern Organzatons: Trends & Challenges queues few research works have been mlemented.e. [ 3 9]. [9] has constructed an analytcal model based on RED to omt the bas aganst bursty flows and to manage the average queueng delay of ackets. Recently [ 3] roosed a number of new analytcal models for managng the congeston ncdent n wreless and fxed networks. Partcularly [3] resented a dscrete-tme queue analytcal model based on DRED [7] method and comared ther model wth DRED wth reference to dfferent erformance metrcs such as average queue length throughut etc. They showed exermentally that ther roosed analytcal model dros less number of ackets than DRED and t mantans the throughut better than DRED. [ ] develoed dscrete-tme queue analytcal models based on BLUE algorthm [3] and comared ther models wth BLUE. Ther exermental results demonstrated that ther roosed analytcal models outerformed BLUE wth resect to acket rate and throughut. In ths aer we resent a dscrete-tme queue analytcal model that uses GRED method [8] to control the congested routers buffers n relmnary stages. The roosed model s called GRED Lnear Decreasng (GREDLD. We comare between the roosed analytcal model and GRED wth reference to dfferent erformance metrcs n order to determne the one that rovdes better QoS. Moreover ths aer nvestgates the otmal oston for the mnmum at the router buffer for both the GRED and the GREDLD whch should guarantee a satsfed erformance. The rest of ths aer s organsed as follows: the GRED method s ntroduced n Secton. Secton 3 dscusses the roosed dscrete-tme queue analytcal model. The comarson results are resented n Secton 4 and Secton 5 concludes the aer.. The Gentle Random Early Detecton (GRED Random Early Dro (RED [6] s one of the known AQM methods whch has been used to detect and manage congestons. One of RED man lmtatons occurs when the average queue length ( aql becomes larger than the maxmum ( max oston at ts router buffer [6] whch forces RED to dro every arrval acket to allevate the congeston. Moreover snce the aql s larger than the max the queue length ( ql of RED becomes unstable. To overcome the above lmtaton [8] roosed the Gentle Random Early Dro (GRED algorthm. GRED manly uses the followng arameters: aql max mnmum oston at the router buffer ( mn and twce the maxmum oston at the router buffer ( double max. GRED does not dro ackets when the aql s less than the mn oston rather when the aql s between the mn and the max GRED dros the arrval ackets arbtrary and the D value ncreases from to D max. However f aql s between the max and the double max GRED dros ackets arbtrary and the from Dmax D vares to. Fnally f the aql exceeds the double max acket ( D. GRED dros each arrval 3. Dscrete-tme Queueng Analytcal Model Based on Lnear Decreasng In ths secton we roose a new dscrete-tme queueng analytcal model based on GRED for the queung system dslayed n Fgure and we call t GREDLD. The roosed model s aled to the queung network router buffer shown below to manage the congeston ncdent as early as ossble. The queueng system shown n Fgure has a fnte caacty ( ackets ncludng ackets n servce. It s connectons begn transmttng ackets at rate ql at the GRED router buffer s smaller when the ( than the mn ackets have been droed ( D therefore there mght be no. In cases where the queue length s between mn and max the sources decrease ther transmttng rates lnearly from to n order to allevate the congeston ( mn * ( ( double max mn f mn < max and the D value ncreases lnearly from to.
3 Informaton Management n Modern Organzatons: Trends & Challenges 9 Moreover when the queue length s between max and double max the sources decrease ther transmttng rates lnearly from to amng to reduce the mact of the congeston on GRED router buffer where ( ( mn ( double max mn f max < max double and the D ncreases lnearly from to. However n cases when the queue double max length exceeds the the sources decrease ther transmttng rates from to n order to control the congeston and thereby GRED dros ackets at DP rate. and reresent the average arrval rates for the sources n the queung system before reachng the mn ndex between mn and max ndexes between max and ndexes and after reachng double max double max ndex resectvely. β corresonds to the average servce rate at the GRED router the queung dsclne n the queung system shown n Fgure s frst come frst serve (FCFS and we assume that > > > andβ > therefore β > β > and β >. The state transton dagram for GREDLD s llustrated n Fgure 3.
4 9 Informaton Management n Modern Organzatons: Trends & Challenges Based on Fgure 3 the balance equatons for the GREDLD are roduced and gven n equatons - below: ( [ β ( ] ( [ β ( ( ] [ β ( ]... ( In general we obtan Fnally [ ( ] [ β ( ( ] [ β ( ] [ ( ] [ β ( ] where 34...mn..... (3 mn [ ( ] mn [ β ( ( ] mn [ β ( mn ] mn [ ( ] mn mn β mn mn ( mn ( [ β ( mn ] mn In general we obtan... (4. (5 [ ( ] [ β ( ( ] [ β ( ].. (6 β γ where where mn mn mn β ( ( 3... double max 3...mn... (3 double max double max double max [ ( ] double max double max β ( double max ( [ β ( ] double max... (7 double max [ double max ( ] double max [ β ( ( ] [ β ( ] double max... (8 In general we obtan double max [ ( ] [ β ( ( ] [ β ( ] where double max double max ( ( Where double max X double max max J and max mn I therefore also can be defned as below: mn I J X.. ( ( ( Letγ β mn < double max where..... ( After comutng the balance equatons we aly equaton ( on them to evaluate the robabltes of the queueng system states whch are defned as follows: γ β mn ( mn ( mn ( ( ( γ mn mn mn ( ( (4 Where mn mn mn... double max and < mn
5 Informaton Management n Modern Organzatons: Trends & Challenges 93 doublemax mn doublemax ( mn max β β double doublemax γ Where mn γ... X β ( ( ( double max γ mn... (5 After the states robabltes are comuted we calculate the robablty of no ackets n the system queue node ( where can be obtaned usng the normalsed equaton (6b. Then T Packets/slot ( doublemax mn threshol ( ( ( (6a.. (6b....(7 P aql P γ ( ( γ mn γ ( z z mn β ( γ ( ( γ double max ( ( mn (.(8 mn ( Next we evaluate the erformance metrcs (average mn queue length ( aql throughut fracton (T average queung delay ( D ackets robablty P ( for the roosed analytcal model. Frstly we estmate the aql utlsng the generatng functon ( z P shown n equaton (7. The aql equals the frst dervatve of the generatng functon z and ths s defned n equaton (9. ( z X ( ( γ ( ( ( γ mn γ γ double max mn mn double max double max ( γ l l mn P at Secondly we comute the T usng equaton (. Thrdly D s calculated based on aql and T results usng equaton (. Fnally we comute utlsng equaton (. double mn max l mn [ γ mn ( γ ] ( γ ( γ * ( ( ( aql P D slots T T ( γ ( ( γ l slots ( T slots P X X ( γ ( γ γ γ X ( γ ( ( γ γ mn [ ] ( *
6 94 Informaton Management n Modern Organzatons: Trends & Challenges aql P ( ( mn γ γ double max β mn mn double max ( (9 [ γ mn ( γ ] ( γ ( γ * ( ( [ ] X X ( γ ( γ γ γ X( γ ( ( γ γ mn double max ( γ l l mn 4. The Probablty of Arrval ( Versus Performance Metrcs Results P mn... ( 4. Exermental Results Ths secton res(6bents numercal results for the GREDLD and the GRED methods wth resect to dfferent erformance metrcs ncludng ( aql ( T ( D and ( P to dentfy the model that rovdes better erformance. In addton we roduce the acket drong robablty ( D values for both models to decde the model that dros fewer numbers of ackets. Ths secton s organsed as follows: The erformance metrcs aganst the robablty of arrval ( results of both the GRED and the GREDLD are demonstrated n Subsecton 4.. Subsecton 4. examnes the otmal oston for the mn n both models and the D results are gven n Subsecton 4.3. The goal of ths secton s to determne whch of GRED and GREDLD offers better QoS wth resect to the erformance metrcs dscussed n Secton 4. The arameters of both models were set as follows: β mn max qw and the number of slots D System Caacty ( max were set to and resectvely. was set to varable values rangng between [.3.7]. Fgures and 7 show the numercal results of versus aql versus T versus D and versus P resectvely for the models we consder. Fgures 4 and 6 dect that GRED generates better aql and D results than the roosed analytcal model. Secfcally Fgure 4 demonstrates that GRED stablses the aql better than that of GREDLD and ts D results are smaller than that of GREDLD. Whereas Fgures 5 and 7 exhbt that our analytcal model outerforms GRED wth reference to T and P results. To be more secfc Fgure 5 llustrates that GREDLD roduces a hghert results than that of GRED and thus t serves larger number of ackets. Further Fgure 7 dects P robablty of Arrval (Alha Vs. Average Queue Length Probablty of Arrval (Alha Vs. Throughut P robablty of Arrval (Alha Probablty of Arrval (Alha Lnear Decreasng Analytcal Model Fgure 4: Vs. aql results. The Orgnal GRED Lnear Decreasng Analytcal Model The Orgnal GRED Fgure 5: Vs. T results.
7 Informaton Management n Modern Organzatons: Trends & Challenges P robablty of Arrval (Alha Vs. Average Queueng Delay P robablty of Arrval (Alha Lnear Decreasng Analytcal Model Fgure 6: Vs. D results. The Orgnal GRED P ro bablty o f A rrval (A lha Vs. P acket Lo ss R ate P robablty of Arrval (Alha Lnear Decreasng Analytcal Model Fgure 7: Vs. P results. The Orgnal GRED M nthresho ld Vs. A verage Queue Length M nthresho ld V s. T hro ughut Fgure 8: M nthresho ld Lnear Decreasng Analytcal Model mn The Orgnal GRED Vs. aql results Fgure 9: M nthresho ld Lnear Decreasng Analytcal M odel mn Vs. T results. The Orgnal GRED that the GREDLD derves smaller P results than that of GRED and as a result of that our analytcal model dros less number of ackets than GRED. 4. The mn Versus Performance Metrcs Results Ths secton ams to determne the otmal locaton (ndex of the mn at the router buffer whch gves a satsfed QoS n both models. Ths can be acheved by generatng numercal results wth resect to the erformance metrcs and settng the mn arameter to dfferent values n both the GRED and the GREDLD. The arameter values for the roosed analytcal model and GRED were set to the same values gven n Subsecton 4. wth two excetons. These are and mn whch were set to.7 and any value n the range between [3-8] resectvely. Fgures 8 9 and dslay the results of the mn versus aql the mn versus T the mn versus D and the P resectvely for mn versus GRED and GREDLD. We observe n Fgures 8 and that GRED offers better aql and D results than that of GREDLD wth reference to the mn oston at the router buffer. Whereas Fgures 9 and llustrate that the roosed analytcal model derves bettert and P results than that of GRED. The results of Fgures 8 and dect that the best mn oston at GRED s the furthest value from the max.e. 3. Whereas the otmal mn oston at GREDLD router s 8 whch s the largest ossble value. Ths means that the otmal oston for the mn of GREDLD that gves a satsfed erformance s to set t to the largest ossble value.e. the max.
8 96 Informaton Management n Modern Organzatons: Trends & Challenges M nthresho ld Vs. A verage Queueng D elay M nthresho ld Lnear Decreasng Analytcal Model Fgure : mn The Orgnal GRED Vs. D results. 4.3 The Packet Drong Probablty ( D Functon Results Ths secton comares the roosed analytcal model and GRED wth reference to the D n order to determne the one that dros less number of ackets. The arameters used to roduce the results n ths secton for both models are smlar to those gven n Secton 4. wth three excetons. These are and number of slots whch have been set to and resectvely. Fgures and 3 show the D results for the GRED and GREDLD resectvely. In artcular Fgure llustrates the slots versus the D where a slot reresents a basc tme unt and contans the acket arrval and/or dearture tme. The current queue length versus the D s dslayed n Fgure 3. After analysng Fgures and 3 we found out that GREDLD router buffer dros fewer numbers of ackets than GRED. In addton we notced n Fgure M nthre s ho ld V s. P a c k et Lo s s R a te Fgure: M nthresho ld Lnear Decreasng A nalytcal M o del The Orgnal GRED mn Vs. P results. that GRED starts drong ackets at t s router buffer when the number of slots reaches 883. Ths means that GRED ncreases t s D lnearly from to D.( max as long as the number of slots s between 883 and 9 and when the number of slots becomes 9 the aql reaches the max also ncreases ts oston. Furthermore the GRED D value lnearly as long as the number of slots s between 9 and 44. Ths means that the aql value s also between max and doublemax and when number of slots becomes 44 the aql becomes double max and D consequently GRED dros every arrval acket (. Fgure 3 shows the D results of GREDLD at each queue length. After analysng ths fgure we observed that when the queue length reaches 3 GREDLD router buffer begns ( mn Slots Vs. Packet Drong Probablty The Current Queue Length Vs. Packet Drong Probablty Packet Drong Probablty Slots Packet Drong Probablty The Current Queue Length The Orgnal GRED Lnear Decreasng Analytcal Model Fgure : The D results for the GRED. Fgure 3: The D results for the GREDLD drong ackets because of the congeston ncdent.
9 Informaton Management n Modern Organzatons: Trends & Challenges 97 Moreover GREDLD ncreases ts D value from to as long as the current queue length s between 3 and 8. Whereas when the queue length reaches 8 ( double max the router buffer wll dro every arrval acket ( D. 5. Conclusons We roose a new lnear decreasng dscrete-tme queue analytcal model based on GRED and we call t GREDLD. We comare the roosed analytcal model and GRED amng to determne the one that offers better QoS. Dfferent evaluaton metrcs ncludng average queue length average queung delay acket drong robablty throughut have been used as the base of our comarson. We summarse the exermental results as follow: GRED outerforms the roosed analytcal model n terms of average queue length and average queueng delay erformance measures. GREDLD roduces throughut and acket rate results better than that of GRED method. Accordng to acket drong robablty GREDLD dros less number of ackets than GRED. The deal mn oston n GRED router that roduces a satsfed average queue length and average queueng delay s to set t far from the max oston. In terms of the deal oston of the mn n GRED router that roduces good throughut and acket rates s to set t as close as ossble to the max. Whereas settng the mn near the max n the GREDLD router roduces a satsfed erformance metrcs results. In near future we ntend to aly the roosed analytcal model n the nternet and at the base statons n wreless networks. We also ntend to use our analytcal model n networks wth n queues (fxed or wreless rather than sngle queue node networks. References. Abdelaber H. Thabtah F. Woodward M. Had W. Lnear Analyss for a BLUE Congeston Control Algorthm usng A Dscrete-tme Queue. Proceedng n the 3 rd Internatonal Conference on Informaton Technology ICIT Amman Jordan May 7.. Abdelaber H. Woodward M. Thabtah F. Al-dabat M. Modellng BLUE Actve Queue Management usng Dscrete-tme Queue. Proceedng n the 7 Internatonal Conference of Informaton Securty and Internet Engneerng (ICISIE London U.. July Abdelaber H. Woodward M. Thabtah F. Etbega M. A Dscrete-tme Queue Analytcal Model based on Dynamc Random Early Dro. Proceedng n the Fourth IEEE Internatonal Conference on Informaton Technology: New Generatons (ITNG Arl 7 Las Vegas USA. 4. Athuralya S. Lasley D. and Low S. An Enhanced Random Early Markng Algorthm for Internet Flow Control INFOCOM Telavv Israel Athuralya S. L V. H. Low S. H. and Yn Q. REM: Actve Queue Management IEEE Network 5( May. 6. Atsum Y. ondoh E. Altntas O. and Yoshda T. A New Congeston Control Algorthm for Sack-TCP wth RED Routers Ultra-hgh seed Network and Comuter Technology Labs. (UNCL Jaan. 7. Aweya J. Ouellette M. and Montuno D. Y. A Control Theoretc Aroach to Actve Queue Management Com. Net. vol. 36 ssue -3 July Jan R. Congeston Control n Comuter Networks: Issues and Trends IEEE Network Magazne Bartek Wydrowsk B. P. and Zukerman M. Hgh Performance DffServ Mechansm for Routers and Swtches: Packet Arrval Rate based Queue Management for Class Based Schedulng Proceedngs of the Second Internatonal IFIP-TC6 Networkng Conference on Networkng Technologes Servces and Protocols; Performance of Comuter and Communcaton Networks; and Moble and Wreless Communcatons Lecture Notes In Comuter Scence vol ISBN: Braden R. Clark D. Crowcroft J. Dave B. Deerng S. Estrn D. Floyd S. Jacobson V. Mnshall G. Partrdge C. Peterson L. Ramakrshnan. Shenker S. wroclawsk J. and Zhang L. Recommendatons on Queue Management and Congeston Avodance n the Internet RFC 39 Arl Brandauer C. Iannaccone G. Dot C. Zegler T. Fdda S. and May M. Comarson of Tal Dro and Actve Queue Management Performance for bulk-data and Web-lke Internet Traffc In Proceedng. ISCC IEEE July.. Chrysostomou C. Ptslldes A. Hadollas G. Sekercoglu A. and Polycarou M. Fuzzy Exlct Markng for Congeston Control n Dfferentated Servces Networks Proceedngs of the Eght IEEE Internatonal Symosum on Comuters and Communcaton (ISCC Feng W. kandlur D.Saha D. and Shn.G. Blue: A new class of actve queue management algorthms Unv. Mchgan Ann ArborMITech. Re.UM CSE-TR Ar.999.
10 98 Informaton Management n Modern Organzatons: Trends & Challenges 4. Feng W.aada A. and Thulasdasan S. GREEN: Proactve Queue Management over a Best-Effort Network n Proceedng of IEEE GlobeCom (GLOBECOM Tae Tawan November LA-UR Feng W. Shn.G. and kandlur D. The Blue Actve Queue Management Algorthms IEEE/ACM Transactons on Networkng Volume. Issue 4 August. 6. Floyd S. and Jacobson V. Random Early Detecton Gateways for Congeston Avodance. IEEE/ACM Transactons on Networkng (4: Aug Floyd S. Ramakrshna G. and Shenker S. Adatve RED: An Algorthm for Increasng the Robustness of RED s Actve Queue Management Techncal reort ICSI August. 8. Floyd S. Recommendatons on usng the gentle varant of RED May. avalable at htt:// 9. May M. Bolot. J. DotC. and Lyles B. Reasons Not to Deloy RED. Proc. of 7 th. Internatonal Worksho on Qualty of Servce (IWQos 99 ages 6-6 June Ott T. Lakshman T. and Wong L. SRED: Stablzed RED n Proc. IEEE INFOCOM Mar
Modelling BLUE Active Queue Management using Discrete-time Queue
roceedngs of e World Congress on Engneerng 7 Vol WCE 7, July - 4, 7, London, U.. Modellng BLUE Actve Queue Management usng Dscrete-tme Queue H. Abdel-jaber Deartment of Comutng, Unversty of Bradford, U
More informationPriority Queuing with Finite Buffer Size and Randomized Push-out Mechanism
ICN 00 Prorty Queung wth Fnte Buffer Sze and Randomzed Push-out Mechansm Vladmr Zaborovsy, Oleg Zayats, Vladmr Muluha Polytechncal Unversty, Sant-Petersburg, Russa Arl 4, 00 Content I. Introducton II.
More informationFuzzy approach to solve multi-objective capacitated transportation problem
Internatonal Journal of Bonformatcs Research, ISSN: 0975 087, Volume, Issue, 00, -0-4 Fuzzy aroach to solve mult-objectve caactated transortaton roblem Lohgaonkar M. H. and Bajaj V. H.* * Deartment of
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationDesign of Modified RED Implemented in a Class Based CIOQ Switch
Desgn of Modfed RED Imlemented n a Class Based CIOQ Swtch Chengchen Hu, Bn Lu Deartment of Comuter Scence and Technology, Tsnghua Unversty Bejng, P. R. Chna, 100084 hucc03@ mals.tsnghua.edu.cn, lub@tsnghua.edu.cn
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationManaging Capacity Through Reward Programs. on-line companion page. Byung-Do Kim Seoul National University College of Business Administration
Managng Caacty Through eward Programs on-lne comanon age Byung-Do Km Seoul Natonal Unversty College of Busness Admnstraton Mengze Sh Unversty of Toronto otman School of Management Toronto ON M5S E6 Canada
More informationAn Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
An Upper Bound on SINR Threshold for Call Admsson Control n Multple-Class CDMA Systems wth Imperfect ower-control Mahmoud El-Sayes MacDonald, Dettwler and Assocates td. (MDA) Toronto, Canada melsayes@hotmal.com
More informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationReliability Gain of Network Coding in Lossy Wireless Networks
Relablty Gan of Network Codng n Lossy Wreless Networks Majd Ghader Deartment of Comuter Scence Unversty of Calgary mghader@cs.ucalgary.ca Don Towsley and Jm Kurose Deartment of Comuter Scence Unversty
More informationDeparture Process from a M/M/m/ Queue
Dearture rocess fro a M/M// Queue Q - (-) Q Q3 Q4 (-) Knowledge of the nature of the dearture rocess fro a queue would be useful as we can then use t to analyze sle cases of queueng networs as shown. The
More informationAlgorithms for factoring
CSA E0 235: Crytograhy Arl 9,2015 Instructor: Arta Patra Algorthms for factorng Submtted by: Jay Oza, Nranjan Sngh Introducton Factorsaton of large ntegers has been a wdely studed toc manly because of
More informationA Lower Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
A ower Bound on SIR Threshold for Call Admsson Control n Multple-Class CDMA Systems w Imperfect ower-control Mohamed H. Ahmed Faculty of Engneerng and Appled Scence Memoral Unversty of ewfoundland St.
More informationTCP NewReno Throughput in the Presence of Correlated Losses: The Slow-but-Steady Variant
TCP NewReno Throughut n the Presence of Correlated Losses: The Slow-but-Steady Varant Roman Dunaytsev, Yevgen Koucheryavy, Jarmo Harju Insttute of Communcatons Engneerng Tamere Unversty of Technology Tamere,
More informationPerformance Evaluation of Deadline Monotonic Policy over protocol
erformance Evaluaton of Deadlne Monotonc olcy over 80. rotocol Ines El Korb and Lela Azouz Sadane Natonal School of Comuter Scence Unversty of Manouba 00 Tunsa Emals: nes.korb@gmal.com Lela.sadane@ens.rnu.tn
More informationAssignment 5. Simulation for Logistics. Monti, N.E. Yunita, T.
Assgnment 5 Smulaton for Logstcs Mont, N.E. Yunta, T. November 26, 2007 1. Smulaton Desgn The frst objectve of ths assgnment s to derve a 90% two-sded Confdence Interval (CI) for the average watng tme
More informationAn application of generalized Tsalli s-havrda-charvat entropy in coding theory through a generalization of Kraft inequality
Internatonal Journal of Statstcs and Aled Mathematcs 206; (4): 0-05 ISS: 2456-452 Maths 206; (4): 0-05 206 Stats & Maths wwwmathsjournalcom Receved: 0-09-206 Acceted: 02-0-206 Maharsh Markendeshwar Unversty,
More informationMODELING TRAFFIC LIGHTS IN INTERSECTION USING PETRI NETS
The 3 rd Internatonal Conference on Mathematcs and Statstcs (ICoMS-3) Insttut Pertanan Bogor, Indonesa, 5-6 August 28 MODELING TRAFFIC LIGHTS IN INTERSECTION USING PETRI NETS 1 Deky Adzkya and 2 Subono
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationDr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur
Analyss of Varance and Desgn of Exerments-I MODULE III LECTURE - 2 EXPERIMENTAL DESIGN MODELS Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 2 We consder the models
More informationAnalysis of Queuing Delay in Multimedia Gateway Call Routing
Analyss of Queung Delay n Multmeda ateway Call Routng Qwe Huang UTtarcom Inc, 33 Wood Ave. outh Iseln, NJ 08830, U..A Errol Lloyd Computer Informaton cences Department, Unv. of Delaware, Newark, DE 976,
More informationEffects of bursty traffic in service differentiated Optical Packet Switched networks
Effects of bursty traffc n servce dfferentated Optcal Packet Swtched networks Harald Øverby, orvald Stol Department of Telematcs, orwegan Unversty of Scence and Technology, O.S. Bragstadsplass E, -749
More informationAnalysis of Discrete Time Queues (Section 4.6)
Analyss of Dscrete Tme Queues (Secton 4.6) Copyrght 2002, Sanjay K. Bose Tme axs dvded nto slots slot slot boundares Arrvals can only occur at slot boundares Servce to a job can only start at a slot boundary
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationSOLVING CAPACITATED VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS BY GOAL PROGRAMMING APPROACH
Proceedngs of IICMA 2013 Research Topc, pp. xx-xx. SOLVIG CAPACITATED VEHICLE ROUTIG PROBLEMS WITH TIME WIDOWS BY GOAL PROGRAMMIG APPROACH ATMII DHORURI 1, EMIUGROHO RATA SARI 2, AD DWI LESTARI 3 1Department
More information2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting k Symbols within One Period
-Adc Comlexty of a Seuence Obtaned from a Perodc Bnary Seuence by Ether Insertng or Deletng Symbols wthn One Perod ZHAO Lu, WEN Qao-yan (State Key Laboratory of Networng and Swtchng echnology, Bejng Unversty
More informationElsevier Editorial System(tm) for Journal of the Franklin Institute Manuscript Draft
Elsever Edtoral System(tm) for Journal of the Frankln Insttute Manuscrpt Draft Manuscrpt umber: FI-D-09-00471 Ttle: On the Asymptotc Queueng Behavor of General AQM Routers Artcle Type: Modelng & Smulaton
More informationDUE: WEDS FEB 21ST 2018
HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationAdaptive Dynamical Polling in Wireless Networks
BULGARIA ACADEMY OF SCIECES CYBERETICS AD IFORMATIO TECHOLOGIES Volume 8, o Sofa 28 Adaptve Dynamcal Pollng n Wreless etworks Vladmr Vshnevsky, Olga Semenova Insttute for Informaton Transmsson Problems
More informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More informationDigital PI Controller Equations
Ver. 4, 9 th March 7 Dgtal PI Controller Equatons Probably the most common tye of controller n ndustral ower electroncs s the PI (Proortonal - Integral) controller. In feld orented motor control, PI controllers
More informationTCOM 501: Networking Theory & Fundamentals. Lecture 7 February 25, 2003 Prof. Yannis A. Korilis
TCOM 501: Networkng Theory & Fundamentals Lecture 7 February 25, 2003 Prof. Yanns A. Korls 1 7-2 Topcs Open Jackson Networks Network Flows State-Dependent Servce Rates Networks of Transmsson Lnes Klenrock
More informationSupplementary Material for Spectral Clustering based on the graph p-laplacian
Sulementary Materal for Sectral Clusterng based on the grah -Lalacan Thomas Bühler and Matthas Hen Saarland Unversty, Saarbrücken, Germany {tb,hen}@csun-sbde May 009 Corrected verson, June 00 Abstract
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More information290 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: FUNDAMENTAL THEORY AND APPLICATIONS, VOL. 45, NO. 3, MARCH H d (e j! ;e j!
9 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: FUNDAMENTAL THEORY AND APPLICATIONS, VOL. 45, NO. 3, MARCH 998 Transactons Brefs Two-Dmensonal FIR Notch Flter Desgn Usng Sngular Value Decomoston S.-C. Pe,
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationComparing two Quantiles: the Burr Type X and Weibull Cases
IOSR Journal of Mathematcs (IOSR-JM) e-issn: 78-578, -ISSN: 39-765X. Volume, Issue 5 Ver. VII (Se. - Oct.06), PP 8-40 www.osrjournals.org Comarng two Quantles: the Burr Tye X and Webull Cases Mohammed
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationPricing and Resource Allocation Game Theoretic Models
Prcng and Resource Allocaton Game Theoretc Models Zhy Huang Changbn Lu Q Zhang Computer and Informaton Scence December 8, 2009 Z. Huang, C. Lu, and Q. Zhang (CIS) Game Theoretc Models December 8, 2009
More informationPower law and dimension of the maximum value for belief distribution with the max Deng entropy
Power law and dmenson of the maxmum value for belef dstrbuton wth the max Deng entropy Bngy Kang a, a College of Informaton Engneerng, Northwest A&F Unversty, Yanglng, Shaanx, 712100, Chna. Abstract Deng
More informationHidden Markov Model Cheat Sheet
Hdden Markov Model Cheat Sheet (GIT ID: dc2f391536d67ed5847290d5250d4baae103487e) Ths document s a cheat sheet on Hdden Markov Models (HMMs). It resembles lecture notes, excet that t cuts to the chase
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationOpportunistic Weighted Fair Queueing
Opportunstc Weghted Far Queueng Knda Khawam, Danel Kofman GET/ENST Telecom Pars Emal: {khawam, kofman}@enst.fr Abstract The ongong evoluton towards the generalzaton of wreless access to mult-servce networks
More informationQueue Dynamics of RED Gateways Under Large Number of TCP Flows
Queue Dynamcs of RED Gateways Under Large umber of TC Flows eerapol Tnnakornsrsuphap, Armand M. Makowsk peerapol@eng.umd.edu, armand@sr.umd.edu Department of ECE and and Insttute for Systems Research Unversty
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationAdvanced Topics in Optimization. Piecewise Linear Approximation of a Nonlinear Function
Advanced Tocs n Otmzaton Pecewse Lnear Aroxmaton of a Nonlnear Functon Otmzaton Methods: M8L Introducton and Objectves Introducton There exsts no general algorthm for nonlnear rogrammng due to ts rregular
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationThe Expectation-Maximization Algorithm
The Expectaton-Maxmaton Algorthm Charles Elan elan@cs.ucsd.edu November 16, 2007 Ths chapter explans the EM algorthm at multple levels of generalty. Secton 1 gves the standard hgh-level verson of the algorthm.
More informationA Quadratic Cumulative Production Model for the Material Balance of Abnormally-Pressured Gas Reservoirs F.E. Gonzalez M.S.
Formaton Evaluaton and the Analyss of Reservor Performance A Quadratc Cumulatve Producton Model for the Materal Balance of Abnormally-Pressured as Reservors F.E. onale M.S. Thess (2003) T.A. Blasngame,
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 31 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 6. Rdge regresson The OLSE s the best lnear unbased
More information6. Hamilton s Equations
6. Hamlton s Equatons Mchael Fowler A Dynamcal System s Path n Confguraton Sace and n State Sace The story so far: For a mechancal system wth n degrees of freedom, the satal confguraton at some nstant
More informationLecture # 02: Pressure measurements and Measurement Uncertainties
AerE 3L & AerE343L Lecture Notes Lecture # 0: Pressure measurements and Measurement Uncertantes Dr. Hu H Hu Deartment of Aerosace Engneerng Iowa State Unversty Ames, Iowa 500, U.S.A Mechancal Pressure
More informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationA General Class of Selection Procedures and Modified Murthy Estimator
ISS 684-8403 Journal of Statstcs Volume 4, 007,. 3-9 A General Class of Selecton Procedures and Modfed Murthy Estmator Abdul Bast and Muhammad Qasar Shahbaz Abstract A new selecton rocedure for unequal
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationA Performance Model of Space-Division ATM Switches with Input and Output Queueing *
A Perforance Model of Sace-Dvson ATM Swtches wth Inut and Outut Queueng * Guogen Zhang Couter Scence Deartent Unversty of Calforna at Los Angeles Los Angeles, CA 94, USA Wlla G. Bulgren Engneerng Manageent
More informationNon-Ideality Through Fugacity and Activity
Non-Idealty Through Fugacty and Actvty S. Patel Deartment of Chemstry and Bochemstry, Unversty of Delaware, Newark, Delaware 19716, USA Corresondng author. E-mal: saatel@udel.edu 1 I. FUGACITY In ths dscusson,
More informationClock-Gating and Its Application to Low Power Design of Sequential Circuits
Clock-Gatng and Its Applcaton to Low Power Desgn of Sequental Crcuts ng WU Department of Electrcal Engneerng-Systems, Unversty of Southern Calforna Los Angeles, CA 989, USA, Phone: (23)74-448 Massoud PEDRAM
More informationOutline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]
DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationPop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing
Advanced Scence and Technology Letters, pp.164-168 http://dx.do.org/10.14257/astl.2013 Pop-Clc Nose Detecton Usng Inter-Frame Correlaton for Improved Portable Audtory Sensng Dong Yun Lee, Kwang Myung Jeon,
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationA Quadratic Cumulative Production Model for the Material Balance of Abnormally-Pressured Gas Reservoirs F.E. Gonzalez M.S.
Natural as Engneerng A Quadratc Cumulatve Producton Model for the Materal Balance of Abnormally-Pressured as Reservors F.E. onale M.S. Thess (2003) T.A. Blasngame, Texas A&M U. Deartment of Petroleum Engneerng
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationGravitation and Spatial Interaction
Unversty College London Lectures on Urban Modellng January 2017 Gravtaton and Satal Interacton Mchael Batty m.batty@ucl.ac.u @mchaelbatty 16 January, 2017 htt://www.satalcomlexty.nfo/ Lectures on Urban
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationSimulation Modelling Practice and Theory
Smulaton Modellng Practce and Theory 17 (009) 558 568 Contents lsts avalable at ScenceDrect Smulaton Modellng Practce and Theory journal homepage: www.elsever.com/locate/smpat Performance analyss of a
More informationCOMPLETE BUFFER SHARING IN ATM NETWORKS UNDER BURSTY ARRIVALS
COMPLETE BUFFER SHARING WITH PUSHOUT THRESHOLDS IN ATM NETWORKS UNDER BURSTY ARRIVALS Ozgur Aras and Tugrul Dayar Abstract. Broadband Integrated Servces Dgtal Networks (B{ISDNs) are to support multple
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationIrregular vibrations in multi-mass discrete-continuous systems torsionally deformed
(2) 4 48 Irregular vbratons n mult-mass dscrete-contnuous systems torsonally deformed Abstract In the paper rregular vbratons of dscrete-contnuous systems consstng of an arbtrary number rgd bodes connected
More informationMinimisation of the Average Response Time in a Cluster of Servers
Mnmsaton of the Average Response Tme n a Cluster of Servers Valery Naumov Abstract: In ths paper, we consder task assgnment problem n a cluster of servers. We show that optmal statc task assgnment s tantamount
More informationApplication of Queuing Theory to Waiting Time of Out-Patients in Hospitals.
Applcaton of Queung Theory to Watng Tme of Out-Patents n Hosptals. R.A. Adeleke *, O.D. Ogunwale, and O.Y. Hald. Department of Mathematcal Scences, Unversty of Ado-Ekt, Ado-Ekt, Ekt State, Ngera. E-mal:
More informationOrientation Model of Elite Education and Mass Education
Proceedngs of the 8th Internatonal Conference on Innovaton & Management 723 Orentaton Model of Elte Educaton and Mass Educaton Ye Peng Huanggang Normal Unversty, Huanggang, P.R.Chna, 438 (E-mal: yepeng@hgnc.edu.cn)
More informationLecture Randomized Load Balancing strategies and their analysis. Probability concepts include, counting, the union bound, and Chernoff bounds.
U.C. Berkeley CS273: Parallel and Dstrbuted Theory Lecture 1 Professor Satsh Rao August 26, 2010 Lecturer: Satsh Rao Last revsed September 2, 2010 Lecture 1 1 Course Outlne We wll cover a samplng of the
More informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
More informationThe equation of motion of a dynamical system is given by a set of differential equations. That is (1)
Dynamcal Systems Many engneerng and natural systems are dynamcal systems. For example a pendulum s a dynamcal system. State l The state of the dynamcal system specfes t condtons. For a pendulum n the absence
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationQuality of Routing Congestion Games in Wireless Sensor Networks
Qualty of Routng ongeston Gaes n Wreless Sensor Networs ostas Busch Lousana State Unversty Rajgoal Kannan Lousana State Unversty Athanasos Vaslaos Unv. of Western Macedona 1 Outlne of Tal Introducton Prce
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationCOMPOSITE BEAM WITH WEAK SHEAR CONNECTION SUBJECTED TO THERMAL LOAD
COMPOSITE BEAM WITH WEAK SHEAR CONNECTION SUBJECTED TO THERMAL LOAD Ákos Jósef Lengyel, István Ecsed Assstant Lecturer, Professor of Mechancs, Insttute of Appled Mechancs, Unversty of Mskolc, Mskolc-Egyetemváros,
More informationA Mathematical Theory of Communication. Claude Shannon s paper presented by Kate Jenkins 2/19/00
A Mathematcal Theory of Communcaton Claude hannon s aer resented by Kate Jenkns 2/19/00 Publshed n two arts, July 1948 and October 1948 n the Bell ystem Techncal Journal Foundng aer of Informaton Theory
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationA Simple Inventory System
A Smple Inventory System Lawrence M. Leems and Stephen K. Park, Dscrete-Event Smulaton: A Frst Course, Prentce Hall, 2006 Hu Chen Computer Scence Vrgna State Unversty Petersburg, Vrgna February 8, 2017
More informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More informationDistributed Optimal TXOP Control for Throughput Requirements in IEEE e Wireless LAN
Dstrbuted Optmal TXOP Control for Throughput Requrements n IEEE 80.e Wreless LAN Ju Yong Lee, Ho Young Hwang, Jtae Shn, and Shahrokh Valaee KAIST Insttute for Informaton Technology Convergence, KAIST,
More informationThe Quadratic Trigonometric Bézier Curve with Single Shape Parameter
J. Basc. Appl. Sc. Res., (3541-546, 01 01, TextRoad Publcaton ISSN 090-4304 Journal of Basc and Appled Scentfc Research www.textroad.com The Quadratc Trgonometrc Bézer Curve wth Sngle Shape Parameter Uzma
More informationSOME NOISELESS CODING THEOREM CONNECTED WITH HAVRDA AND CHARVAT AND TSALLIS S ENTROPY. 1. Introduction
Kragujevac Journal of Mathematcs Volume 35 Number (20, Pages 7 SOME NOISELESS COING THEOREM CONNECTE WITH HAVRA AN CHARVAT AN TSALLIS S ENTROPY SATISH KUMAR AN RAJESH KUMAR 2 Abstract A new measure L,
More informationPerformance Upper Bounds of High Altitude Platform Systems over a Two-State Switched Channel
Performance Uer Bounds of Hgh Alttude Platform Systems over a Two-State Swtched Channel Hen Th Thu Nguyen, Hung Vet Nguyen, Thang Nhat e Faculty of Telecommuncatons, Posts and Telecommuncatons Insttute
More informationConcepts for Wireless Ad Hoc
Bandwdth and Avalable Bandwdth oncepts for Wreless Ad Hoc Networks Marco A. Alzate Unversdad Dstrtal, Bogotá Néstor M. Peña Unversdad de los Andes, Bogotá Mguel A. abrador Unversty of South Florda, Tampa
More informationResearch Article Green s Theorem for Sign Data
Internatonal Scholarly Research Network ISRN Appled Mathematcs Volume 2012, Artcle ID 539359, 10 pages do:10.5402/2012/539359 Research Artcle Green s Theorem for Sgn Data Lous M. Houston The Unversty of
More informationMachine Learning. Classification. Theory of Classification and Nonparametric Classifier. Representing data: Hypothesis (classifier) Eric Xing
Machne Learnng 0-70/5 70/5-78, 78, Fall 008 Theory of Classfcaton and Nonarametrc Classfer Erc ng Lecture, Setember 0, 008 Readng: Cha.,5 CB and handouts Classfcaton Reresentng data: M K Hyothess classfer
More information