Design and implementation of priority and timewindow based traffic scheduling and routingspectrum allocation mechanism in elastic optical networks
|
|
- Dorothy Dennis
- 6 years ago
- Views:
Transcription
1 Journal of Physcs: Conference Seres PAPER OPEN ACCESS Desgn and mplementaton of prorty and tmewndow based traffc schedulng and routngspectrum allocaton mechansm n elastc optcal networks To cte ths artcle: Honghuan Wang et al 016 J. Phys.: Conf. Ser Related content - A hgh performance herarchcal storage management system for the Canadan ter- 1 centre at TRIUMF D C Deatrch, S X Lu and R Tafrout - Optmzaton of on-lne prncpal component analyss E Schlösser, D Saad and M Behl - Mössbauer spectroscopy n the energy doman usng synchrotron radaton M Seto, R Masuda, S Hgashtanguch et al. Vew the artcle onlne for updates and enhancements. Ths content was downloaded from IP address on 11/01/018 at 10:34
2 Desgn and mplementaton of prorty and tme-wndow based traffc schedulng and routng-spectrum allocaton mechansm n elastc optcal networks Honghuan Wang 1, Fangyuan Xng 1, Hongx Yn 1 *, Nan Zhao 1 and Bzhan Lan 1 Lab of Optcal Communcatons and Photonc Technology, School of Informaton and Communcaton Engneerng, Dalan Unversty of Technology, Dalan, , Chna HAEPC Informaton and Telecommuncaton Company, Zhengzhou, , Chna E-mal: *hxyn@dlut.edu.cn Abstract. Wth the explosve growth of network servces, the reasonable traffc schedulng and effcent confguraton of network resources have an mportant sgnfcance to ncrease the effcency of the network. In ths paper, an adaptve traffc schedulng polcy based on the prorty and tme wndow s proposed and the performance of ths algorthm s evaluated n terms of schedulng rato. The routng and spectrum allocaton are acheved by usng the Floyd shortest path algorthm and establshng a node spectrum resource allocaton model based on greedy algorthm, whch s proposed by us. The farness ndex s ntroduced to mprove the capablty of spectrum confguraton. The results show that the desgned traffc schedulng strategy can be appled to networks wth multcast and broadcast functonaltes, and makes them get real-tme and effcent response. The scheme of node spectrum confguraton mproves the frequency resource utlzaton and gves play to the effcency of the network. 1. Introducton In recent years, wth the rapd development of broadband and hgh rate servces, such as bg data, cloud computng, hgh defnton vdeo on demand and Internet of Thngs, optcal networks need to be able to deal wth the enormous carrer pressure brought by these large capacty servces. Nowadays, the fxed-grd rgd-bandwdth WDM network s wdely used to allocate resources. Ths fxed-grd WDM optcal network allocates the same spectrum resources for spectrum requrements of dfferent servces at varous rate and dfferent bandwdth, whch wll lead to excessve resource waste when the servces need only low-rate and low-bandwdth requrements. Moreover, the waste of resources wll show deteroratng trend wth the expanson of networks. Therefore, the novel spectrum-slced elastc optcal path (SLICE) network [1, ] based on programmable devces has been proposed. However, the flexble grd network s also facng new ssues, such as traffc schedulng scheme [3] and the effectve allocaton of network resources, to be addressed. Therefore, an adaptve traffc schedulng polcy based on the prorty and tme wndow s proposed n ths paper. The performance of ths algorthm s evaluated n terms of schedulng rato. Moreover, the routng and spectrum allocaton are acheved by usng the Floyd shortest path algorthm and establshng a node spectrum resource allocaton model based on greedy algorthm. The farness ndex (FI) [4] s ntroduced to mprove the capablty of spectrum confguraton. Content from ths work may be used under the terms of the Creatve Commons Attrbuton 3.0 lcence. Any further dstrbuton of ths work must mantan attrbuton to the author(s) and the ttle of the work, journal ctaton and DOI. Publshed under lcence by Ltd 1
3 . Adaptve schedulng algorthm The prorty s defned consderng bandwdth and duraton of a servce request, assumng that bandwdths are proportonal to data-rates. The model that determnes the schedulng order s abstractly expressed as T( s, d, p, dt, w ), where s and d are the source node and the destnaton node, respectvely, and p s the traffc prorty. dt s the expected startng tme of schedulng and w represents tme wndow. Fgure 1 denotes the tme-wndow model of schedulng. If the actual scheduled startng moment S can move wthn tme wndow followng dt,.e., dt w S, the traffc s scheduled, whch stops at E. Otherwse, the schedulng fals. When dt s the same, the scheduled startng moment s movable wthn the ndvdual tme wndow. Table 1 represents prortes and tme-wndow settng. The traffc wth hgh-prorty should be scheduled earler, whle the tme effcency of schedulng should also be consdered at the same tme. The shorter tme wndow of traffc,.e., the earler deadlne dt w, can save more dle tme for schedulng more traffc. Therefore, schedulng effcency of each servce request conssts of prorty effcency and tme effcency. The prorty effcency s expressed as a p. The tme effcency s (-0.1( - )/( - expressed as dt b w S E S )) e, 1,,. The overall effcency of a scheduled traffc s G a b, whch s exploted to measure the performance of the schedulng algorthm. Obvously, ths algorthm reflects a better performance wth a greater schedulng effcency. The goal of ths algorthm s N 1 G =max s. t. S dt (1) w 0 () dt w S (3) where S dt represents that the actual startng moment s not earler than expected startng tme of schedulng, w 0 shows that the tme wndow s not less than 0, dt w S means that the actual startng moment s before the deadlne of request. The adaptve schedulng algorthm wth tme wndow wll have a range and sort crtera to adjust to the actual schedulng order when a large number of servce requests arrve synchronously. The method s depcted n Algorthm 1. The core of ths schedulng polcy s the sortng a large number of servce requests based on three dfferent crtera, whch are the prorty rule (PR), the deadlne rule (DR), and the prorty-deadlne rule (PDR). The performance of ths algorthm s evaluated n terms of schedulng rato. w dt S E Fgure 1. Tme-wndow model of schedulng. Table 1. Prortes and Tme-wndow Settng. Requests Prorty Tme Wndow(ms) Hgh-bandwdth, Short-duraton 4 50 Hgh-bandwdth, Long-duraton 3 30 Low-bandwdth, Short-duraton 0 Low-bandwdth, Long-duraton 1 10 t
4 Algorthm 1 Adaptve Schedulng Algorthm 1: Intalze dle tme : Read the requests belongng to a schedulng perod 3: Sort the requests by prorty or deadlne 4: Take the sorted requests n order 5: whle requests queue s not empty, do 6: for dle tme meet the dt and w do 7: (a) A request jon executve matrx. 8: (b) Watng for allocaton of spectrum resources. 9: (c) Update startng pont of dle tme. 10: end for 11: (a) Request added to delay matrx. 1: (b) Update requests to the next schedulng perod 13: end whle 14: Schedulng fnshed 3. Routng and node spectrum confguraton Schedulng and resource allocaton model n Fgure shows that the traffc successfully added to the executon queue wll wat for correspondng routng and spectrum allocaton accordng to the source node and destnaton node. The shortest path between any two nodes s calculated by usng Floyd algorthm [5] n ths paper. The spectrum resource dstrbuton of node output lnks s altered on a regular bass, takng nto account the network spectrum consstency and contnuty n the perspectve of network node spectrum resource reconfguraton. Assume that each node has the capablty of center frequency converson [6]. As shown n Fgure 3, the spectrum resource s allocated for the traffc to access the respectve lnks through node. An approprate spectrum allocaton polcy can groom traffc as much as possble, and save spectrum resources substantally, whle ensurng the qualty of servce. In order to make the output lnks of node get equtable dstrbuton of spectrum resources and reduce traffc blockng probablty, a node spectrum allocaton scheme based on greedy algorthm s proposed. The steps of ths algorthm are presented below. 1) Set a certan tme perod. Calculate the average value of maxmum and mnmum bandwdth among traffc requests through each lnk n the set tme nterval. Ths average bandwdth B s defned as the ntal soluton of bandwdth for lnk. ) Set an approprate frequency slot perod. Select several lnks randomly and make them share a same frequency-slot perod, and accumulate each B of these selected lnks. If the sum of B s less than the frequency slots perod, replace each B wth a larger bandwdth B n the traffc requests queue. If the sum s stll lower than the frequency slots perod, do the same operaton untl t s closest to the perod. 3) Move central frequences of traffc to the correspondng spectrum. 4) Use the frst-ft spectrum assgnment approach to allocate spectrum resources for traffc leadng to dfferent lnks through the node. Source nodes Request1 Optcal network Destnaton nodes Request Traffc Schedulng RSA Data Processng RequestN Optcal Network Fgure. Schedulng and resource allocaton model. 3
5 Queue (, 1) Queue (, )... Queue (, N-1) Queue (, N) Node L 1... L N-1 FSs1 FSs L N L 1 L L 3 L N Fgure 3. Spectrum allocaton model of node. The effectveness of the proposed algorthm n terms of better qualty of servce s modfed by assgnng broadband for each output lnks of the node. The farness ndex (FI) can be defned as below to measure the equty of spectrum allocaton scheme N ( ( B / A )) 1 FI, 1,, N N N ( B / A ) 1 where N s the total number of node output lnks. A and B are respectvely the request spectrum bandwdth and the actual assgned bandwdth for lnk. Vsbly, FI s a value between 0 and 1. The FI closer to 1 ndcates a better farness between the lnks and a lower blockng probablty. When FI s lower than the threshold, the node spectrum for lnks s reconfgured. 4. Results and dscussons 4.1. Performance of schedulng polcy To verfy the performance of the adaptve schedulng algorthm based on prorty and tme wndow, the number of prortes s ncreased by addng the number of bandwdth threshold of request. Sx prortes and 50ms schedulng nterval are set n the smulaton. The schedulng rato wth dfferent prortes s taken as a evaluaton ndex. The result shows schedulng performance comparson curve of three crtera, as shown n Fgure 4. (4) 1 Schedulng Rato PR DR PDR Prorty Fgure 4. Schedulng rato vs. prorty under three crtera Fgure 5. 6-node test network. 4
6 Fgure 4 shows that schedulng rato of PR and PDR ncreases lnearly wth the growth of prorty. The schedulng rato of DR has the smlar trend wth the former two crtera when the prorty s low, whle presentng a downtrend wth hgher prortes. In ths case, schedulng rato of DR depends prmarly on the deadlne of traffc requrement. Therefore, dfferent schedulng rules exhbt ther own advantages n dfferent requrements. The PDR or DR should be selected to avod low-prorty traffc not to be treated for a long tme. The PR presents better schedulng rato when the prorty s hgh. Therefore, an approprate sort rule should be chosen to meet the user's mult-meda servce requests wth dfferent granulartes. Ths schedulng scheme s also applcable among multple networks. The approprate adjustments for prorty or tme wndow of servce request can mprove the probablty of a tmely response for the network wth real-tme requrements. 4.. Performance of routng and node spectrum allocaton The performance of routng algorthm s verfed through a 6-node test network presented n Fgure 5. As seen from the weghted graph, Floyd algorthm can accurately calculate the shortest path between any two nodes n the network. The objectve of spectrum allocaton s to meet servce requrements whle reducng the spectral fragmentaton. Assume that each node has the capablty of center frequency converson. The traffc passes node to dfferent destnatons through respectve output lnks. Seven output lnks are set to verfy the farness of node spectrum allocaton n the smulaton. 50 spectrum slces are set to a frequency slot perod (FS) and allocated to partal lnks randomly. When the spectral occupancy of one FS reaches the upper lmt, another FS s assgned to remanng lnks. Fgure 6 (a) shows the status of node spectrum. The whte and blue hstograms, respectvely, represent dle spectrum and request spectrum of lnks, whle the red hstogram presents the occuped spectrum wthn FS. Fgure 6 (b) reports the spectrum allocaton of output lnks. Clearly, lnks 6, 4,, 1 share the same FS and lnks 5, 3 share the second FS, whle lnk 7 s confgured n another FS. Result of smulaton shows that the node spectrum confguraton scheme greatly reduces spectrum fragmentaton and mproves the utlzaton of spectrum resources. The throughput of the node s set to 110 Erlang n the node spectrum allocaton smulaton based on greedy algorthm. The bandwdth s assgned to each lnk to satsfy traffc transmsson. Farness Index (FI) vares wth varance between the lnks under node spectrum allocaton as shown n Fgure 7. When the bandwdth of each lnk request s smlar,the FI s closer to 1, namely, the farness of allocated spectrum between lnks s better. If FI s less than a set threshold, reset the combnaton of lnks sharng the same FS or shorten FS to reduce the lnk varance. In ths case, less allocated spectrum for one lnk that affects the qualty of servce and ncreases blockng probablty s avoded. (a) 50 Slces Occuped Request Idle Lnk (b) Frequency Slots L7 L5 L3 L6 L4 L L Slces Fgure 6. (a) Status of node spectrum (b) Spectrum allocaton of output lnks 5
7 FI Varance between the Lnks Fgure 7. Farness vs. varance between the lnks under node spectrum allocaton. 5. Concluson In ths paper, an adaptve traffc schedulng algorthm based on prorty and tme wndow s presented. Routng and spectrum allocaton for scheduled traffc are acheved wth the flexble and reconfgurable network node. The desgned traffc schedulng strategy can be appled to the networks wth multcast and broadcast, and makes them get real-tme and effcent response, whch lays the foundaton for the schedulng nvestgaton of multmeda servces wth dfferent granularty n the future network. The scheme of node spectrum confguraton mproves the frequency resource utlzaton and gves play to the effcency of the network, whle the farness of spectrum assgnments for servces through lnks leadng to dfferent destnaton nodes, s ensured. Acknowledgment Ths work was supported n part by the Natonal Natural Scence Foundaton of Chna (NSFC) under Grants and The Frst HAEPC Scence and Technology Project n 015 under Grant 517Q014006V. References [1] Jnno M, Takara H, Kozck B, Tsukshma Y, Sone Y and Matsuoka S 009 Spectrum-effcent and scalable elastc optcal path network: archtecture, benefts, and enablng technologes Communcatons Magazne [] Jnno M, Ohara T, Sone Y, Hrano A, Ishda O and Tomzawa M 011 Elastc and adaptve optcal networks: possble adopton scenaros and future standardzaton aspects Communcatons Magazne [3] Huang X and Ma M 005 An effcent schedulng algorthm for real-tme traffc on WDM optcal networks The 9th Int. Conf. on Communcatons Systems pp [4] Thagarajan S and Soman A K 001 Capacty farness of WDM networks wth groomng capabltes Optcal Network Magazne 4-3 [5] Floyd R 196 Algorthm 97: shortest path Comm. ACM [6] Paolucc F, Sambo N, Melon G, Berrettn G, Fres F, Pot L and Castold P 014 SDN control of all-optcal frequency converson and defragmentaton for super-channels OFC pp 1,3,
Cluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More 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 informationSimulation 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 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 informationA proportional fair scheduling algorithm based on QoS utility function in wireless networks
Avalable onlne www.jocpr.com Journal of Chemcal and Pharmaceutcal esearch, 2014, 6(5):1957-1963 esearch Artcle ISSN : 0975-7384 CODEN(USA) : JCPC5 A proportonal far schedulng algorthm based on QoS utlty
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 informationDynamic Bandwidth Allocation Schemes in Hybrid TDM/WDM Passive Optical Networks
Dynamc Bandwdth Allocaton Schemes n Hybrd TDM/WDM Passve Optcal Networks Ahmad R. Dhan, Chad M. Ass, and Abdallah Sham Concorda Insttue for Informaton Systems Engneerng Concorda Unversty, Montreal, Quebec,
More informationReal-Time Guarantees. Traffic Characteristics. Flow Control
Real-Tme Guarantees Requrements on RT communcaton protocols: delay (response s) small jtter small throughput hgh error detecton at recever (and sender) small error detecton latency no thrashng under peak
More informationFibre-Optic AWG-based Real-Time Networks
Fbre-Optc AWG-based Real-Tme Networks Krstna Kunert, Annette Böhm, Magnus Jonsson, School of Informaton Scence, Computer and Electrcal Engneerng, Halmstad Unversty {Magnus.Jonsson, Krstna.Kunert}@de.hh.se
More informationFAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks
2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng
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 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 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 informationVideo Proxy System for a Large-scale VOD System (DINA)
Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,
More informationRegional Load Balancing Circuitous Bandwidth Allocation Method Based on Dynamic Auction Mechanism
ATEC Web of Conferences 76, (8) IFID 8 https://do.org/./matecconf/876 Regonal Load Balancng Crcutous Bandwdth Allocaton ethod Based on Dynamc Aucton echansm Wang Chao, Zhang Dalong, Ran Xaomn atonal Dgtal
More 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 informationDistributed Resource Scheduling in Grid Computing Using Fuzzy Approach
Dstrbuted Resource Schedulng n Grd Computng Usng Fuzzy Approach Shahram Amn, Mohammad Ahmad Computer Engneerng Department Islamc Azad Unversty branch Mahallat, Iran Islamc Azad Unversty branch khomen,
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 informationA Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks
A Sem-Dstrbuted oad Balancng Archtecture and Algorthm for Heterogeneous reless Networks Md. Golam Rabul Ala Choong Seon Hong * Kyung Hee Unversty, Korea rob@networkng.khu.ac.kr, cshong@khu.ac.kr Abstract
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 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 informationA Model Based on Multi-agent for Dynamic Bandwidth Allocation in Networks Guang LU, Jian-Wen QI
216 Jont Internatonal Conference on Artfcal Intellgence and Computer Engneerng (AICE 216) and Internatonal Conference on etwork and Communcaton Securty (CS 216) ISB: 978-1-6595-362-5 A Model Based on Mult-agent
More 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 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 informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
More 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 informationWITH rapid improvements of wireless technologies,
JOURNAL OF SYSTEMS ARCHITECTURE, SPECIAL ISSUE: HIGHLY-RELIABLE CPS, VOL. 00, NO. 0, MONTH 013 1 Adaptve GTS Allocaton n IEEE 80.15.4 for Real-Tme Wreless Sensor Networks Feng Xa, Ruonan Hao, Je L, Naxue
More informationEnhanced Signaling Scheme with Admission Control in the Hybrid Optical Wireless (HOW) Networks
Enhanced Sgnalng Scheme wth Admsson Control n the Hybrd Optcal Wreless (HOW) Networks Yng Yan, Hao Yu, Henrk Wessng, and Lars Dttmann Department of Photoncs Techncal Unversty of Denmark Lyngby, Denmark
More informationDynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 008 proceedngs. Dynamc Bandwdth Provsonng wth Farness and Revenue Consderatons
More informationScheduling and queue management. DigiComm II
Schedulng and queue management Tradtonal queung behavour n routers Data transfer: datagrams: ndvdual packets no recognton of flows connectonless: no sgnallng Forwardng: based on per-datagram forwardng
More informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More informationA Fair MAC Algorithm with Dynamic Priority for e WLANs
29 Internatonal Conference on Communcaton Software and Networks A Far MAC Algorthm wth Dynamc Prorty for 82.e WLANs Rong He, Xumng Fang Provncal Key Lab of Informaton Codng & Transmsson, Southwest Jaotong
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 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 informationBuffer Management Algorithm Design and Implementation Based on Network Processors
(IJCSIS) Internatonal Journal of Computer Scence and Informaton Securty, Buffer Management Algorthm Desgn and Implementaton Based on Network Processors Yechang Fang, Kang Yen Dept. of Electrcal and Computer
More informationA New Token Allocation Algorithm for TCP Traffic in Diffserv Network
A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,
More 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 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 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 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 informationSRB: Shared Running Buffers in Proxy to Exploit Memory Locality of Multiple Streaming Media Sessions
SRB: Shared Runnng Buffers n Proxy to Explot Memory Localty of Multple Streamng Meda Sessons Songqng Chen,BoShen, Yong Yan, Sujoy Basu, and Xaodong Zhang Department of Computer Scence Moble and Meda System
More informationUse of Genetic Algorithms in Efficient Scheduling for Multi Service Classes
Use of Genetc Algorthms n Effcent Schedulng for Mult Servce Classes Shyamale Thlakawardana and Rahm Tafazoll Centre for Communcatons Systems Research (CCSR), Unversty of Surrey, Guldford, GU27XH, UK Abstract
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 informationQoS-aware energy-saving mechanism for hybrid optical-wireless broadband access networks
DOI.07/s117-017-0690-3 ORIGINAL PAPER QoS-aware energy-savng mechansm for hybrd optcal-wreless broadband access networks Ruyan Wang 1 Ale Lang 1 Chao Zhou 1 Dapeng Wu 1 Hong Zhang 1 Receved: 5 September
More informationScheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research
Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research
More informationA Distributed Dynamic Bandwidth Allocation Algorithm in EPON
www.ccsenet.org/mas Modern Appled Scence Vol. 4, o. 7; July 2010 A Dstrbuted Dynamc Bandwdth Allocaton Algorthm n EPO Feng Cao, Demng Lu, Mnmng Zhang, Kang Yang & Ynbo Qan School of Optoelectronc 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 informationDistributed Middlebox Placement Based on Potential Game
Int. J. Communcatons, Network and System Scences, 2017, 10, 264-273 http://www.scrp.org/ournal/cns ISSN Onlne: 1913-3723 ISSN Prnt: 1913-3715 Dstrbuted Mddlebox Placement Based on Potental Game Yongwen
More informationA Frame Packing Mechanism Using PDO Communication Service within CANopen
28 A Frame Packng Mechansm Usng PDO Communcaton Servce wthn CANopen Mnkoo Kang and Kejn Park Dvson of Industral & Informaton Systems Engneerng, Ajou Unversty, Suwon, Gyeongg-do, South Korea Summary The
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
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 informationPARNIAN: A TWO-STAGE NESTED-AUCTION FOR DYNAMIC BANDWIDTH ALLOCATION IN ETHERNET PASSIVE OPTICAL NETWORKS *
IJST, Transactons of Electrcal Engneerng, Vol. 35, No. E1, pp 45-61 Prnted n The Islamc Republc of Iran, 2011 Shraz Unversty PARNIAN: A TWO-STAGE NESTED-AUCTION FOR DYNAMIC BANDWIDTH ALLOCATION IN ETHERNET
More informationFast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems
Fast Retransmsson of Real-Tme Traffc n HIPERLAN/ Systems José A Afonso and Joaqum E Neves Department of Industral Electroncs Unversty of Mnho, Campus de Azurém 4800-058 Gumarães, Portugal {joseafonso,
More informationTowards Efficient Optical Burst-Switched Networks without All-Optical Wavelength Converters
Towards Effcent Optcal Burst-Swtched Networks wthout All-Optcal Wavelength Converters João Pedro 1,2, Paulo Montero 1,3, and João Pres 2 1 D1 Research, Semens Networks S.A., R. Irmãos Semens 1, 2720-093
More informationA Knowledge Sharing Resource Library Platform Based on Multivariate Large Data Predictive Compensation
A Knowledge Sharng Resource Lbrary Platform Based on Multvarate Large Data Predctve Compensaton Yng Wang Informaton Engneerng Insttute, Informaton Teachng Appled Technology Extenson Center, Chongqng Vocatonal
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 informationMaintaining temporal validity of real-time data on non-continuously executing resources
Mantanng temporal valdty of real-tme data on non-contnuously executng resources Tan Ba, Hong Lu and Juan Yang Hunan Insttute of Scence and Technology, College of Computer Scence, 44, Yueyang, Chna Wuhan
More 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 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 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 informationShared Running Buffer Based Proxy Caching of Streaming Sessions
Shared Runnng Buffer Based Proxy Cachng of Streamng Sessons Songqng Chen, Bo Shen, Yong Yan, Sujoy Basu Moble and Meda Systems Laboratory HP Laboratores Palo Alto HPL-23-47 March th, 23* E-mal: sqchen@cs.wm.edu,
More 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 informationAdvanced radio access solutions for the new 5G requirements
Advanced rado access solutons for the new 5G requrements Soumaya Hamouda Assocate Professor, Unversty of Carthage Tuns, Tunsa Soumaya.hamouda@supcom.tn IEEE Summt 5G n Future Afrca. May 3 th, 2017 Pretora,
More informationEvaluation of an Enhanced Scheme for High-level Nested Network Mobility
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.
More 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 informationAnalysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD
Analyss on the Workspace of Sx-degrees-of-freedom Industral Robot Based on AutoCAD Jn-quan L 1, Ru Zhang 1,a, Fang Cu 1, Q Guan 1 and Yang Zhang 1 1 School of Automaton, Bejng Unversty of Posts and Telecommuncatons,
More informationPerformance Analysis of a Managed Bandwidth Service for ATM Networks
Performance Analyss of a Managed Bandwdth Servce for ATM Networks Chrstos Bouras Chryss Chantz Vaggels Kapoulas Alexandros Panagopoulos Ioanna Sampraku Afrodte Sevast Research Academc Computer Technology
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationResearch Article. ISSN (Print) s k and. d k rate of k -th flow, source node and
Scholars Journal of Engneerng and Technology (SJET) Sch. J. Eng. Tech., 2015; 3(4A):343-350 Scholars Academc and Scentfc Publsher (An Internatonal Publsher for Academc and Scentfc Resources) www.saspublsher.com
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 informationImproved Resource Allocation Algorithms for Practical Image Encoding in a Ubiquitous Computing Environment
JOURNAL OF COMPUTERS, VOL. 4, NO. 9, SEPTEMBER 2009 873 Improved Resource Allocaton Algorthms for Practcal Image Encodng n a Ubqutous Computng Envronment Manxong Dong, Long Zheng, Kaoru Ota, Song Guo School
More informationARTICLE IN PRESS. Computer Networks xxx (2008) xxx xxx. Contents lists available at ScienceDirect. Computer Networks
Computer Networks xxx (28) xxx xxx Contents lsts avalable at ScenceDrect Computer Networks journal homepage: www.elsever.com/locate/comnet On applyng far queung dscplne to schedule requests at access gateway
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationAdaptive Energy and Location Aware Routing in Wireless Sensor Network
Adaptve Energy and Locaton Aware Routng n Wreless Sensor Network Hong Fu 1,1, Xaomng Wang 1, Yngshu L 1 Department of Computer Scence, Shaanx Normal Unversty, X an, Chna, 71006 fuhong433@gmal.com {wangxmsnnu@hotmal.cn}
More informationChannel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7
Optmzed Regonal Cachng for On-Demand Data Delvery Derek L. Eager Mchael C. Ferrs Mary K. Vernon Unversty of Saskatchewan Unversty of Wsconsn Madson Saskatoon, SK Canada S7N 5A9 Madson, WI 5376 eager@cs.usask.ca
More informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented
More informationResearch of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm
, pp.197-202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,
More informationClustering Based Adaptive Power Control for Interference Mitigation in Two-Tier Femtocell Networks
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS VOL. 8, NO. 4, Apr. 2014 1424 Copyrght c 2014 KSII Clusterng Based Adaptve Power Control for Interference Mtgaton n Two-Ter Femtocell Networks Hong
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
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 informationUSER CLASS BASED QoS DIFFERENTIATION IN e WLAN
USER CLASS BASED QoS DIFFERENTIATION IN 802.11e WLAN Amt Kejrwal, Ratan Guha School of Computer Scence Unversty of Central Florda Orlando, FL-32816 USA E-mal: {kejrwal, guha}@cs.ucf.edu Manak Chatterjee
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 informationNETWORK LIFETIME AND ENERGY EFFICIENT MAXIMIZATION FOR HYBRID WIRELESS NETWORK
NETWORK LIFETIME AND ENERGY EFFICIENT MAXIMIZATION FOR HYBRID WIRELESS NETWORK Prasana kumar. S 1, Deepak.N 2, Tajudeen. H 3, Sakthsundaram. G 4 1,2,3,4Student, Department of Electroncs and Communcaton,
More informationReal-time Fault-tolerant Scheduling Algorithm for Distributed Computing Systems
Real-tme Fault-tolerant Schedulng Algorthm for Dstrbuted Computng Systems Yun Lng, Y Ouyang College of Computer Scence and Informaton Engneerng Zheang Gongshang Unversty Postal code: 310018 P.R.CHINA {ylng,
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationAn Adaptive Virtual Machine Location Selection Mechanism in Distributed Cloud
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS VOL. 9, NO. 12, Dec. 2015 4776 Copyrght c2015 KSII An Adaptve Vrtual Machne Locaton Selecton Mechansm n Dstrbuted Cloud Shukun Lu 1, Wea Ja 2 1 School
More informationFORESIGHTED JOINT RESOURCE RECIPROCATION AND SCHEDULING STRATEGIES FOR REAL-TIME VIDEO STREAMING OVER PEER-TO-PEER NETWORKS
FORESIGHTED JOINT RESOURCE RECIPROCATION AND SCHEDULING STRATEGIES FOR REAL-TIME VIDEO STREAMING OVER PEER-TO-PEER NETWORKS Sunghoon Ivan Lee, Hyunggon Park, and Mhaela van der Schaar Electrcal Engneerng
More informationHybrid Job Scheduling Mechanism Using a Backfill-based Multi-queue Strategy in Distributed Grid Computing
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.12 No.9, September 2012 39 Hybrd Job Schedulng Mechansm Usng a Backfll-based Mult-queue Strategy n Dstrbuted Grd Computng Ken Park
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 informationTHere are increasing interests and use of mobile ad hoc
1 Adaptve Schedulng n MIMO-based Heterogeneous Ad hoc Networks Shan Chu, Xn Wang Member, IEEE, and Yuanyuan Yang Fellow, IEEE. Abstract The demands for data rate and transmsson relablty constantly ncrease
More informationDelay Analysis and Time-Critical Protocol Design for In-Vehicle Power Line Communication Systems
Delay Analyss and Tme-Crtcal Protocol Desgn for In-Vehcle Power Lne Communcaton Systems Zhengguo Sheng, Daxn Tan, Vctor C.M. Leung and Gaurav Bansal Abstract Wth the emergng automated tasks n vehcle doman,
More informationResponse-Time Guarantees in ATM Networks
Response-Tme Guarantees n ATM Networks Andreas Ermedahl Hans Hansson Mkael Sjödn Department of Computer Systems Uppsala Unversty Sweden E-mal: febbe,hansh,mcg@docs.uu.se Abstract We present a method for
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 informationUBICC Publishers 2008 Ubiquitous Computing and Communication Journal
UBICC Journal Ubqutous Computng and Communcaton Journal 008 Volume 3. 008-04-30. ISSN 99-844 Specal Issue on Moble Adhoc Networks UBICC ublshers 008 Ubqutous Computng and Communcaton Journal Edted by Usman
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 informationBIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING
An Improved K-means Algorthm based on Cloud Platform for Data Mnng Bn Xa *, Yan Lu 2. School of nformaton and management scence, Henan Agrcultural Unversty, Zhengzhou, Henan 450002, P.R. Chna 2. College
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 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 informationA Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
More informationA QoS-aware Scheduling Scheme for Software-Defined Storage Oriented iscsi Target
A QoS-aware Schedulng Scheme for Software-Defned Storage Orented SCSI Target Xanghu Meng 1,2, Xuewen Zeng 1, Xao Chen 1, Xaozhou Ye 1,* 1 Natonal Network New Meda Engneerng Research Center, Insttute of
More information