Transit Networking in ATM/B-ISDN based on Service Category

Size: px
Start display at page:

Download "Transit Networking in ATM/B-ISDN based on Service Category"

Transcription

1 Transt Networkng n ATM/B-ISDN based on Servce Category Young-Tak Km Dept. of Informaton and Communcaton Engneerng, College of Engneerng, YeungNam Unv. E-mal : ytkm@ynucc.yeungnam.ac.kr ABSTRACT The ATM Forum and ITU-T specfy multple servce categores of B-ISDN, such as (constant bt rate), RT-VBR (realtme - varable bt rate), NRT-VBR-COD/CLD (non-realtme - varable bt rate - connecton-orented data/connectonless data), ABR (avalable bt rate), and UBR (unspecfed bt rate). Each servce category specfes dfferent traffc parameters and QoS parameters : bandwdth, end-to-end transfer delay, cell transfer delay varance, bt error rate, and cell loss rate. In ths paper, we propose a transt networkng scheme n ATM/B-ISDN based on the servce category. In the proposed scheme the end-to-end vrtual channel/vrtual path connectons are routed accordng to the requred traffc characterstcs, dfferently. The major purpose of the servce category-based transt networkng s to provde the requred QoS to end users effcently, whle mantanng the network utlzaton level hgh. We also propose a restoraton strategy wth 5 restoraton classes. In the proposed restoraton strategy the user selects a restoraton class for hs specfc applcaton at the connecton setup phase. 1. B-ISDN servce categores ATM Forum defnes 5 B-ISDN servce categores [1]: (constant bt rate), RT-VBR (realtme - varable bt rate), NRT-VBR (non-realtme - varable bt rate), ABR (avalable bt rate), and UBR (unspecfed bt rate). The examples of servce are plan old telephone servce (POTS), crcut emulaton for DS1 (1.544/2.048 Mbps) and DS3 (45 Mbps), and -Vdeo. servce requres constant transfer rate that s specfed by ts end-to-end cell transfer delay (CTD) and peak cell rate (PCR). The examples of RT-VBR servce nclude the packetvdeo and audo n teleconferencng and n multmeda applcatons. In RT-VBR servces, the data transfer rate vares accordng to the amount of nformaton that s usually specfed by the source codng scheme. Thus the RT-VBR traffc s defned by the set of traffc/qos parameters, such as end-to-end CTD, PCR, sustanable cell rate (SCR) wth maxmum burst sze (MBS). The NRT-VBR servce category s ntended for nonreal-tme applcatons whch have bursty traffc characterstcs. NRT-VBR-COD (connecton-orented data) s defned for the connecton-orented data servces, such as X.25 PSDN or Frame relay. NRT-VBR-CLD (connectonless data) s defned for the connectonless data servces, such as IP datagram servce and SMDS (swtched mult-megabt data servce). For NRT-VBR- CLD, the transport network provdes several connectonless servce functon (CLSF) nodes n order to provde the store-and-forward data servce. Both NRT- VBR-COD and NRT-VBR-CLD do not specfy the tmng requrements, such as end-to-end CTD and CDV tolerance. ABR servce category s defned for the Internetnterconnecton servce through ATM/B-ISDN. The ABR traffc defnes the requred bandwdth by MCR (mnmum cell rate) that s the mnmum bandwdth that the transport network must guarantee. UBR servce category does not specfy any traffc/qos parameter. It only uses the currently avalable bandwdth of the transport network. The example traffc/qos parameters for each servce are as shown n the table. In the 64 kbps voce telephony servce, the end-to-end cell transfer delay should be kept below 300 ms for most lve conversatonal type applcaton [1-2]. The DS1/DS3 crcut emulaton requres the cell transfer delay 33

2 B-ISDN Servce Category RT-VBR NRT- VBR- COD NRT- VBR- CLD ABR UBR Servce Examples POTS, Crcut Emulaton, -Vdeo Packet-Vdeo & Audo n teleconferencng, multmeda applcatons Connecton orented data servce (X.25,Frame-Relay) Connectonless data servces (IP-over-ATM,SMDS) Connecton orented data servce (LAN-nterconnecton) Connectonless data servces (LAN-nterconnecton, nternet) Traffc / QoS Parameters PCR, End-to-End CTD, Peak-to-Peak CDV, BER, CLR PCR, SCR/MBS, Endto-End CTD, Peak-to-Peak CDV, BER, CLR PCR, SCR/MBS, BER, CLR PCR, SCR/MBS, BER, CLR PCR, MCR Table 1: Servce categores n ATM/B-ISDN less than 150 µs, and the cell delay varance less than 250 µs at each swtchng node [3]. The servce for PVC Cell Relay requres the end-to-end CTD as 4 ms wth addtonal 2 ms for each 100 mles [5]. The VBR servces for mage/vdeo data transfer requres the cell transfer delay of 0.8 ms ~ 5 ms and the peak-to-peak cell delay varance of 1 ms ~ 6.5 ms. These two QoS parameters are tghter than those of traffc. The VBR traffc requres the bt error rate (BER) of 6 x 10-7 ~ 2.5 x 10-6 and the cell loss rato (CLR) of 8 x 10-7 ~ 9.5 x 10-6, when there s the error handlng mechansm n AAL. The data applcatons n general are ntolerant of errors, and data ntegrty between communcaton end ponts s requred [4]. When human nteracton s nvolved, data applcatons are ntolerant of large delays (for example, 3 seconds), whereas servces between machnes can tolerate moderately large delay. A user accessng a teller machne to do a bankng transacton demands a response tme of a few seconds, whereas account updates that take place between dfferent nformaton centers of a bank do not mpose a strct delay constrants. Delay jtter s not a bg concern n data servces, snce no synchronzaton or constant play-out rates are requred at the recever. The NRT-VBR-COD traffc for connecton-orented Frame Relay servce requres the end-to-end cell transfer delay of 27 ms ~ sec and the cell loss rato of 10-7 [6]. The NRT- VBR-CLD traffc for connectonless data servce such as SMDS requres smlar characterstcs for the VCC/VPC between the CLSFs. The LAN emulaton and IP-over- ATM traffc can be supported ether by ABR servce or UBR servce. In the case of ABR servce, mnmum cell rate (MCR) and cell loss rato (CLR) are guaranteed; whle the transport network guarantee nothng for the UBR servce. 2. Multple vrtual transt networks of servce categores In order to maxmze the network utlzaton whle guaranteeng the QoS requrements of each servce, the network should select the most approprate route for each VP/VC connecton establshment request. The ATM transport network mantan the lnk status data for each transmsson lnk between the swtchng nodes, and the node status data for each swtchng node. The lnk status data nclude nstalled capacty (LC j ), currently allocated bandwdth (AB j ), avalable bandwdth (AVB j ), utlzaton, current load ( ρ j ), resdual error rate (ε j ), and lnk transfer delay (τ j). The node status data nclude nstalled swtchng capacty (SC k ), currently allocated swtchng capacty (SAB k ), resdual error rate (ε k ), utlzaton, current load (ρ k ), swtchng delay (τ k ), and Cell Delay Varance (CDV k ). For the connecton establshment of a servce, the network selects an end-to-end VP/VC connecton route of shortest path that can guarantee the requred PCR, end-to-end CTD, peak-to-peak CDV. The connecton establshment of RT-VBR servces, the network selects an end-to-end VP/VC connecton route of shortest path that can guarantee the requred SCR & MBS, end-to-end CTD, peak-to-peak CDV. The connecton establshment of NRT-VBR servces fnds an end-to-end VP/VC connecton route whch can support the requred SCR & MBS or MCR, and CLR. For the ABR servces, the end-to-end VP/VC connecton route that can support the requred MCR s selected. In the case of UBR, there s no specfed traffc/qos restrctons. 34

3 Servce Example Voce telephony Crcut Emulaton PVC cell relay - Vdeo Phone Vdeo conference TV dstrbuton Bt rate End-to-End cell transfer delay (CTD) Peak-topeak cell delay varance (CDV) wthout error handlng n AAL BER wth error handlng n AAL wthout error handlng n AAL 64 kbps 300 ms 10 ms DS1 : 1.5 Mbps DS3 : 45 Mbps 64 kbps ~ 45 Mbps 64 kbps ~ 384 kbps 150 µs 1) 250 µs 1) ms ms per 100 mles CLR wth error handlng n AAL ) 1.7 x ms ms 130 ms x x x Mbps VBR 5 ms 6.5 ms x Mbps VBR 5 ms 6.5 ms x x x ~ 25 Mbps VBR 0.8 ms 1 ms 3 x x x 10-7 MPEG 1 core 1.5 Mbps VBR 5 ms 6.5 ms 4 x x x 10-6 MPEG 2 core 10 Mbps VBR 0.8 ms 1 ms 6 x x x x 10-6 Frame Relay SMDS LAN Emulaton 64 kbps ~ 2 Mbps 64 kbps ~ 45 Mbps 27ms ~ sec 2) 5 x ~ 10 Mbps - - IP-over-ATM ~ 70 Mbps - - 1) per swtchng node, 2) 1600 ~ 4096 octets frame 5 ms 1) 10-7 Table 2: Traffc parameters and QoS parameters of B-ISDN servce examples When there are multple canddates wth same condton, the routng algorthm selects the route that maxmze the network utlzaton. As we have shown n the prevous secton, the B- ISDN servce categores requre dfferent traffc characterstcs. As a result, the connecton management functon should select an end-to-end VP/VC connecton path based on the dfferent route selecton crtera of each servce category. For the realtme servces of and RT-VBR, the most mportant route selecton crtera are the requred bandwdth of PCR or SCR, end-to-end CTD, and CDV. For the NRT-VBR COD/CLD servces, the end-toend CTD and CDV are not crtcal crtera, so the routng algorthm may not fnd a shortest path. Instead, the routng algorthm wll select a path that can maxmze the network utlzaton, whle supportng the requred SCR or MCR, and CLR. The ABR servces requre only the guaranteed MCR wth tmng specfcaton. For the UBR servces, the network does not guarantee any traffc/qos parameter. CLSF Node B CLSF Node A Fg. 1: Multple transt routes 35

4 Servce Category 1 () Servce Category 2 (RT-VBR) Servce Category 3 (NRT-VBR-COD/CLD) Servce Category 4 (ABR) Servce Category 5 (UBR) Fg. 2: Separated vrtual networks based on servce category Snce the multmeda termnals connected to a Local Exchange (LEX) node requre multple connectons of varous servce categores to other LEX nodes, t s more effcent to confgure n advance the separated vrtual transt VP route for each LEX-to-LEX par, based on the estmated traffc amounts of each servce category, and allocate dynamcally the VC bandwdth for each connecton setup request. By ths pre-planned vrtual transt VP networks, the network can be confgured to keep the maxmzed utlzaton level accordng to the estmated traffc amount. The vrtual transt VP network s perodcally reconfgured to reflect the current traffc requrements and network load condtons. 3. Bandwdth allocatons n servce categorybase4d Networkng In order to guarantee the requred QoS level to users and mantan the network utlzaton n best condton, the transport network must perform the bandwdth allocaton and the route selecton accordng to the servce category. For the servce, the bandwdth must be allocated for the requred PCR (peak cell rate), and the end-to-end CTD must be guaranteed. The route selecton for the traffc s fndng a route wth mnmum end-to-end CTD that can allocate the requred bandwdth, peak-to-peak CDV (cell delay varance) and CLR (cell loss rato). In RT-VBR servce, the bandwdth s allocated for the requred SCR (sustanable cell rate) that s defned as the upper bound on the conformng average rate of an ATM connecton. For the RT-VBR servces, the transport network guarantee the SCR wth assocated MBS (maxmum burst sze), end-to-end cell transfer delay tmng, and peak-to-peak CDV. The route selecton crtera for the RT-VBR traffc are same as the servce. In NRT-VBR-COD/CLD servces, the requested bandwdth s allocated ether by SCR or MCR. The transport network must guarantee the SCR/MCR, mean CDV. The route selecton crtera are CLR and maxmzed network utlzaton. In NRT-VBR-COD servce, a route s establshed between end-users; whle n the NRT-VBR-CLD servces, routes are establshed between connectonless servce functon (CLSF) such as IP-routers. In ABR servces, the transport network guarantees the MCR (mnmum cell rate) of the requested bandwdth and the CLR. The route selecton crteron s the maxmzed network utlzaton. In UBR servces, the transport network guarantees no specfc traffc/qos parameters for the servces. Thus, the route selecton crteron s just the maxmzed network utlzaton. B-ISDN Servce Category RT-VBR Bandwdth allocaton PCR SCR Route selecton Guarantee Other selecton crtera PCR, end-to-end CDV mn end-to-end CTD, peak-to-peak CDV, CLR SCR, end-to-end CTD, P- mn end-to-end CTD, peak-to-peak to-p CDV CDV, CLR NRT-VBR-COD SCR, MCR SCR, MCR, mean CTD CLR, max utlzaton NRT-VBR-CLD SCR, MCR SCR, MCR CLR, max utlzaton ABR MCR MCR, CLR max utlzaton UBR None None max utlzaton Table 3: Bandwdth allocaton and route selecton crtera 36

5 At each swtchng node, the bandwdth allocaton s performed accordng to the prorty of servce category. The swtchng node determnes the acceptance of the connecton establshment request by the connecton admsson control (CAC) wth the buffer allocaton (BA) strategy. The servce traffc has the hghest prorty n the bandwdth allocaton. The network guarantees the peak cell rate (PCR) and the end-to-end cell transfer delay (CTD) of each servce. Also, the swtchng node should guarantee the cell delay varance (CDV) by allocatng enough buffer sze. The RT-VBR servce traffc has the second prorty n the bandwdth allocaton. The network guarantees the sustanable cell rate (SCR), the end-to-end CTD and the CDV of each RT-VBR servce. Node A Node B Avalable bandwdth for ABR & UBR traffc Reserved bandwdth for ABR traffc = Reserved bandwdth for RT-VBR traffc = Guaranteed bandwdth for traffc = MCR Reserved bandwdth for NRT-VBR-COD/CLD traffc = SCR PCR Fg. 3: Bandwdth management at ATM swtchng node The NRT-VBR-COD and NRT-VBR-CLD servces specfy the requred bandwdth by SCR or MCR. The network must guarantee the SCR or the MCR of each NRT-VBR-COD/CLD servce as specfed n the connecton setup request. There s no tmng requrement of end-to-end CTD and peak-to-peak CDV n NRT- VBR-COD/CLD servce. For some specfc applcatons, the mean end-to-end CTD may be specfed n the NRT- VBR-COD traffc/qos parameters. For the ABR servce traffc, the ATM transport network guarantees the mnmum cell rate (MCR). There s no tmng requrement n the ABR servce. The remanng bandwdth can be allocated to ABR and UBR servce. For the UBR servce traffc, nothng s guaranteed by the transport network. SCR 4. based on servce categores To provde fault tolerant communcaton servces, the ATM transport network must reserve backup path for each actve end-to-end connecton wth approprate bandwdth, so as to reroute the end-to-end VC path n the case of fault occurrence. The bandwdth allocaton for the backup path s determned accordng to the restoraton strategy. In ths paper, we propose a restoraton strategy wth 5 restoraton classes. class 1 provdes the guaranteed backup bandwdth for 100 % of the PCR. In ths case, the actve end-to-end VP/VC connecton has a backup path that can restore the whole traffc when there s a lnk or node falure. The restoraton class 1 can be used for the servce of hgher prorty that requres relable nformaton transfer servces. In restoraton class 2, the backup route s allocated wth 100 % of the SCR of the actve path, whle 100 % of the MCR of the actve path s allocated n restoraton class 3. The restoraton class 2 and class 3 can be used n the RT-VBR servce and NRT-VBR-COD servce, respectvely. In restoraton class 4, a backup path s shared by multple actve connectons. The backup path has a reserved bandwdth of 100 % of the largest PCR of the actve connectons that uses t. When there are multple lnk/node falures concurrently, only one connecton can be rerouted to the backup path, and all other connectons must be restored by dynamc end-toend connecton establshment mechansms. In restoraton class 5, no backup bandwdth s allocated, but the most approprate backup route s preplanned. When a lnk/node falure s occurred n the actve path, the connecton management functon tres to allocate the bandwdth along the backup route. If the bandwdth allocaton s not successful, the reroutng must fnd a new end-to-end connecton for restoraton by the dynamc connecton establshment mechansm. The user selects a specfc restoraton for hs applcaton at the connecton setup phase. The usage costs of the restoraton classes are dfferent accordng to the bandwdth allocaton for both the actve connecton and the backup path. 37

6 class class 1 class 2 class 3 class 4 class 5 Strategy Guaranteed backup bandwdth for 100 % PCR Guaranteed backup bandwdth for 100 % SCR Guaranteed backup bandwdth for 100 % MCR N : 1 shared backup bandwdth 0 backup bandwdth wth just pre-routng for the canddate route Table 4: classes In general, the hghly relable servce wll select the restoraton class 1 whch guarantees a backup path wth 100 % of PCR. For fault tolerant servce provson, the RT-VBR servce wll select restoraton class 2 whch guarantees a backup path 100 % of SCR. In the same manner, the relable NRT-VBR-COD/CLD servces wll select the restoraton class 3 whch guarantees a backup path wth 100 % of MCR. For the same servce category, however, dfferent restoraton class can be chosen accordng to the specfc applcaton and the requested level of relablty of the servce. For example the NRT-VBR-COD servce for the money transfer between dfferent banks may requre restoraton class 3, whle the NRT-VBR-COD servce for the transfer of log data between nformaton centers may requre restoraton class 5, because of the dfference of the urgency. 5. Perodc Re-balancng of Vrtual Transt Networks For the maxmum network utlzaton, the connecton management functon of the ATM/B-ISDN must pre-plan the separated vrtual transt network for each servce category. The connecton management functon setups the ATM VPCs for transt networkng accordng to the predcted usage between the ATM LEX par. In ths transt route desgn, several VPCs are establshed for each of the B-ISDN servce classes n order to satsfy the multple QoS class requrements. Also, for the VPC restoraton at falure occurrence, backup bandwdth must be prepared for the workng connectons. The bandwdth allocatons for the backup routes are determned by the estmated restoraton strategy of the users. The transt route desgn algorthm must establsh the transt routes for the maxmze network avalablty. It also has to desgn the transt route to guarantee the performance requrements of the predcted ATM VC connectons. The result of the transt route desgn s nformed to the subnetwork management systems and the swtchng nodes. At each swtchng node, the route selecton parameters (such as nstalled lnk capacty, lnk usage cost and prorty) are specfed by the connecton management functon. The user plane s VP/VC lnks are establshed by the sgnalng of the control plane, along the pre-planned transt VP route for each servce category, based on the route selecton parameters. In order to reflect the actual fluctuatons around the predctons, we need a load balancng procedure that analyzes the short-term/long-term network usage, and reflects the results on the routng decsons. The load balancng functons updates the route selecton parameters (selecton prorty, lnk cost, etc.) that are used by the route selecton algorthm (RSA) of the control plane n the on-demand VCC setup process. Long term Predcted usage Short term Network load (Network-wde traffc condton) Traffc montorng Fg. 4: Perodc load balancng and transt route management 6. Conclusons Network topology update Transt Route Desgn Multple transt VP trals based on servce category Routes update Load Balancng RSA ATM EX RSA ATM EX VC Connecton setup by sgnalng In ths paper, we proposed a transt networkng scheme based on servce category n ATM/B-ISDN. In the proposed transt networkng scheme the end-to-end ATM VP/VC connectons are routed accordng to the requred traffc characterstcs, dfferently. The major purpose of the servce category-based connecton management s to provde the requred QoS to end users effcently, whle mantanng the network utlzaton level at maxmum. RSA ATM EX Management plane Route selecton parameter (prorty, lnk cost) update Control plane Swtchng node and Lnk 38

7 We frst analyzed the traffc characterstcs of the 5 B-ISDN servce categores :, RT-VBR, NRT-VBR- COD/CLD, ABR, and UBR. And we defned the bandwdth allocaton strategy and the route selecton crtera. We then proposed a separated vrtual transt networkng for the servce categores. The vrtual transt network s pre-planned accordng to the estmated traffc amount between each local exchange (LEX) node pars. To accommodate the traffc load fluctuaton, the vrtual transt network s re-balanced perodcally based on the short-term usage and the long-term usage. We also proposed a restoraton strategy wth 5 restoraton classes. The restoraton class s selected by the user at the connecton setup request. In restoraton class 1, 2, 3, the network reserves backup bandwdth of 100 % of PCR, SCR, and MCR, respectvely. In restoraton class 4, one backup route s shared by N actve VCCs/VPCs. In restoraton class 5, no backup bandwdth s reserved, but the route s pre-planned to allocate the bandwdth n the case of lnk/node falure n best-effort. Each restoraton class has dfferent cost accordng to the bandwdth usage for both actve and backup paths. Currently, we are developng a smulaton software of the proposed transt networkng archtecture, on the OPNET smulaton platform [9]. We wll evaluate the performance of the connecton management archtecture wth a realstc network confguraton of Korean Informaton Infrastructure (KII). Generc Requrements for Exchange Access Frame Relay PVC servce, Issue 1, May [7] ATM Forum, Crcut Emulaton Servce - Interoperablty specfcaton Ver. 2.0, Jan [8] ATM Forum, Voce and Telephony over ATM to the desktop specfcaton, May [9] OPNET Ver 3.0 Manual Young-Tak Km graduated Yeung-Nam Unv. n Feb. 1984, and receved Master Degree and Ph.D. from KAIST (Korea Advanced Insttute of Scence and Technology) n 1986 and 1990, respectvely. He joned Korea Telecom (KT) n March 1990, where he researched and developed the ATM Metropoltan Area Network (MAN) Swtchng System, and the networkng of ATM Hghway for Informaton Infrastructure. He transferred to Yeung-Nam Unv. n September 1994 as an assstant professor. Hs research nterest feld s ATM/B-ISDN Transt Networkng Technology based on the IN (Intellgent Network), TINA (Telecommuncatons Informaton Networkng), TMN (Telecommuncatons Management Network), and Next Generaton Internet (NGI). [References] [1] ATM Forum, Traffc management specfcaton, ver. 4.0, Aprl [2] ATM Transport and Network Integrty, Tsong-Ho Wu and Norak Yoshka, Academc Press, [3] Bellcore, Techncal Advsory TA-NWT , Broadband ISDN Swtchng System Generc Requrements, Issue 2, August [4] Asynchronous Transfer Mode Networks : Performance Issues, 2nd Ed., Raf O. Onvural, Artech House, [5] Bellcore Techncal Advsory, TA-TSV , Generc Requrements for Exchange PVC Cell Relay Servce, Issue 1, August [6] Bellcore Techncal Reference, TR-TSV , 39

Simulation Based Analysis of FAST TCP using OMNET++

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

More information

Real-Time Guarantees. Traffic Characteristics. Flow Control

Real-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 information

Virtual Machine Migration based on Trust Measurement of Computer Node

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

More information

Load Balancing for Hex-Cell Interconnection Network

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

More information

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

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

More information

HIERARCHICAL SCHEDULING WITH ADAPTIVE WEIGHTS FOR W-ATM *

HIERARCHICAL 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 information

A fair buffer allocation scheme

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

More information

Performance Analysis of a Managed Bandwidth Service for ATM Networks

Performance 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 information

Goals and Approach Type of Resources Allocation Models Shared Non-shared Not in this Lecture In this Lecture

Goals 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 information

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

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

More information

AADL : about scheduling analysis

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

More information

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks

FAHP 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 information

Analysis of Collaborative Distributed Admission Control in x Networks

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

More information

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

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

More information

Enhanced Signaling Scheme with Admission Control in the Hybrid Optical Wireless (HOW) Networks

Enhanced 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 information

Scheduling and queue management. DigiComm II

Scheduling 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 information

TECHNICAL REPORT AN OPTIMAL DISTRIBUTED PROTOCOL FOR FAST CONVERGENCE TO MAXMIN RATE ALLOCATION. Jordi Ros and Wei K Tsai

TECHNICAL REPORT AN OPTIMAL DISTRIBUTED PROTOCOL FOR FAST CONVERGENCE TO MAXMIN RATE ALLOCATION. Jordi Ros and Wei K Tsai TECHNICAL REPORT AN OPTIMAL DISTRIUTED PROTOCOL FOR FAST CONVERGENCE TO MAXMIN RATE ALLOCATION Jord Ros and We K Tsa Department of Electrcal and Computer Engneerng Unversty of Calforna, Irvne 1 AN OPTIMAL

More information

Use of Genetic Algorithms in Efficient Scheduling for Multi Service Classes

Use 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 information

IJCTA Nov-Dec 2016 Available

IJCTA Nov-Dec 2016 Available Dr K Santh et al, Internatonal Journal of Computer Technology & Applcatons,Vol 7(6),773-779 Optmzed Route Technque for DSR Routng Protocol n MANET Dr.K.Santh, Assocate Professor, Dept. of Computer Scence,

More information

Fast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems

Fast 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 information

Priority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks

Priority-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 information

Bandwidth Allocation for Service Level Agreement Aware Ethernet Passive Optical Networks

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

More information

QoS-aware energy-saving mechanism for hybrid optical-wireless broadband access networks

QoS-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 information

Pricing Network Resources for Adaptive Applications in a Differentiated Services Network

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

More information

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

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

More information

CS 268: Lecture 8 Router Support for Congestion Control

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

More information

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment

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

More information

Adaptive Connection Admission Control for Mission Critical Real-Time Communication Networks Abstract 1 Introduction

Adaptive Connection Admission Control for Mission Critical Real-Time Communication Networks Abstract 1 Introduction Adaptve Connecton Admsson Control for Msson Crtcal Real-Tme Communcaton etwors B. Devalla, A. Sahoo, Y. Guan, C. L, R. Bettat and W. Zhao Department of Computer Scence, Texas A&M Unversty, College Staton,

More information

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

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

More information

Solutions for Real-Time Communication over Best-Effort Networks

Solutions for Real-Time Communication over Best-Effort Networks Solutons for Real-Tme Communcaton over Best-Effort Networks Anca Hangan, Ramona Marfevc, Gheorghe Sebestyen Techncal Unversty of Cluj-Napoca, Computer Scence Department {Anca.Hangan, Ramona.Marfevc, Gheorghe.Sebestyen}@cs.utcluj.ro

More information

Mobile Intelligent Agent Technology for QoS Provisioning and Network Management

Mobile Intelligent Agent Technology for QoS Provisioning and Network Management Proceedngs of the 10th WSEAS Internatonal Conference on COMMUNICATIONS, Voulagmen, Athens, Greece, July 10-12, 2006 (pp340-345) Moble Intellgent Agent Technology for QoS Provsonng and Network Management

More information

Adaptive Energy and Location Aware Routing in Wireless Sensor Network

Adaptive 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 information

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

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

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Routing in Degree-constrained FSO Mesh Networks

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

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL 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 information

Connection-information-based connection rerouting for connection-oriented mobile communication networks

Connection-information-based connection rerouting for connection-oriented mobile communication networks Dstrb. Syst. Engng 5 (1998) 47 65. Prnted n the UK PII: S0967-1846(98)90513-7 Connecton-nformaton-based connecton reroutng for connecton-orented moble communcaton networks Mnho Song, Yanghee Cho and Chongsang

More information

A KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE

A KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE A KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE 1 TAO LIU, 2 JI-JUN XU 1 College of Informaton Scence and Technology, Zhengzhou Normal Unversty, Chna 2 School of Mathematcs

More information

Advanced radio access solutions for the new 5G requirements

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

More information

IEEE E: QOS PROVISIONING AT THE MAC LAYER YANG XIAO, THE UNIVERSITY OF MEMPHIS

IEEE E: QOS PROVISIONING AT THE MAC LAYER YANG XIAO, THE UNIVERSITY OF MEMPHIS ACCEPTED FROM O PEN C ALL IEEE 802.11E: QOS PROVISIONING AT THE MAC LAYER YANG XIAO, THE UNIVERSITY OF MEMPHIS ess AIFS[j] AIFS[] PIFS SIFS AIFS[] Content 0 to CW Bac Slot Select s The emergng IEEE 802.11e

More information

Integrated Congestion-Control Mechanism in Optical Burst Switching Networks

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

More information

Design of the Application-Level Protocol for Synchronized Multimedia Sessions

Design of the Application-Level Protocol for Synchronized Multimedia Sessions Desgn of the Applcaton-Level Protocol for Synchronzed Multmeda Sessons Chun-Chuan Yang Multmeda and Communcatons Laboratory Department of Computer Scence and Informaton Engneerng Natonal Ch Nan Unversty,

More information

Internet Traffic Managers

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

More information

Understanding the Variable Bit Rate Real Time (VBR rt) Service Category for ATM VCs

Understanding the Variable Bit Rate Real Time (VBR rt) Service Category for ATM VCs Understanding the Variable Bit Rate Real Time (VBR rt) Service Category for ATM VCs Document ID: 10414 Contents Introduction Prerequisites Requirements Components Used Conventions What is Variable Bit

More information

PERFORMANCE EVALUATION OF VOICE OVER IP USING MULTIPLE AUDIO CODEC SCHEMES

PERFORMANCE EVALUATION OF VOICE OVER IP USING MULTIPLE AUDIO CODEC SCHEMES ISSN 1819-668 www.arpnjournals.com PERFORMANCE EVALUATION OF VOICE OVER IP USING MULTIPLE AUDIO CODEC SCHEMES L. Audah 1, A.A.M. Kamal 1, J. Abdullah 1, S.A. Hamzah 1 and M.A.A. Razak 2 1 Optcal Communcaton

More information

Halmstad University Post-Print

Halmstad University Post-Print Halmstad Unversty Post-Prnt Admsson Control for Swtched Realtme Ethernet Schedulng Analyss versus etwor Calculus Xng Fan and Magnus Jonsson.B.: When ctng ths wor cte the orgnal artcle. Orgnal Publcaton:

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

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

More information

different problems from other networks ITU-T specified restricted initial set Limited number of overhead bits ATM forum Traffic Management

different problems from other networks ITU-T specified restricted initial set Limited number of overhead bits ATM forum Traffic Management Traffic and Congestion Management in ATM 3BA33 David Lewis 3BA33 D.Lewis 2007 1 Traffic Control Objectives Optimise usage of network resources Network is a shared resource Over-utilisation -> congestion

More information

Efficient Distributed File System (EDFS)

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

More information

International Journal of Scientific & Engineering Research, Volume 4, Issue 12, December-2013 ISSN

International Journal of Scientific & Engineering Research, Volume 4, Issue 12, December-2013 ISSN 833 Polynomal Tme Algorthm (PTA) to generate a survvable rng vrtual topology for Optcal WDM based on Hamltonan Crcut Detecton Heurstcs(HCDH) *Sajal Kanta Das, Department of Computer Scence & Technology,

More information

A Fair MAC Algorithm with Dynamic Priority for e WLANs

A 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 information

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

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

More information

Energy and QoS aware Routing in Wireless Sensor Networks

Energy and QoS aware Routing in Wireless Sensor Networks Energy and QoS aware Routng n Wreless Sensor Networks Kemal Akkaya and Mohamed Youns Department of Computer Scence and Electrcal Engneerng Unversty of Maryland, Baltmore County Baltmore, MD 225 kemal youns@cs.umbc.edu

More information

FORESIGHTED 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 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 information

PARNIAN: A TWO-STAGE NESTED-AUCTION FOR DYNAMIC BANDWIDTH ALLOCATION IN ETHERNET PASSIVE OPTICAL NETWORKS *

PARNIAN: 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 information

Network Coding as a Dynamical System

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

More information

Research Article. ISSN (Print) s k and. d k rate of k -th flow, source node and

Research 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 information

ATM Traffic Management

ATM Traffic Management ATM Traffic Management Professor of Computer and Info. Sciences Columbus, OH 43210-1277 These slides are available at http://www.cis.ohio-state.edu/~jain/cis777-99 1 Dime Sale One Megabit memory, One Megabyte

More information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) , VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

BROADBAND AND HIGH SPEED NETWORKS

BROADBAND AND HIGH SPEED NETWORKS BROADBAND AND HIGH SPEED NETWORKS ATM SERVICE CATEGORIES Service Categories : represent particular combinations of traffic parameters and QoS parameters. These parameters are determined by users for a

More information

QoS Bandwidth Estimation Scheme for Delay Sensitive Applications in MANETs

QoS Bandwidth Estimation Scheme for Delay Sensitive Applications in MANETs Communcatons and Network, 2013, 5, 1-8 http://dx.do.org/10.4236/cn.2013.51001 Publshed Onlne February 2013 (http://www.scrp.org/journal/cn) QoS Bandwdth Estmaton Scheme for Delay Senstve Applcatons n MANETs

More information

ABSTRACT 1. INTRODUCTION RESEARCH ARTICLE

ABSTRACT 1. INTRODUCTION RESEARCH ARTICLE WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Wrel. Commun. Mob. Comput. 2015; 15:2111 2124 Publshed onlne 5 May 2014 n Wley Onlne Lbrary (wleyonlnelbrary.com)..2479 RESEARCH ARTICLE Optmzed bandwdth allocaton

More information

A Fair Access Mechanism Based on TXOP in IEEE e Wireless Networks

A 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 information

11. Traffic management in ATM

11. Traffic management in ATM lect11.ppt S-38.145 - Introduction to Teletraffic Theory - Fall 2000 1 Contents Introduction ATM technique Service categories Traffic contract Traffic and congestion control in ATM Connection Admission

More information

11. Traffic management in ATM. lect11.ppt S Introduction to Teletraffic Theory Spring 2003

11. Traffic management in ATM. lect11.ppt S Introduction to Teletraffic Theory Spring 2003 lect11.ppt S-38.145 - Introduction to Teletraffic Theory Spring 2003 1 Contents Introduction ATM technique Service categories and traffic contract Traffic and congestion control in ATM Connection Admission

More information

State of the Art in Differentiated

State 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 information

High Performance DiffServ Mechanism for Routers and Switches: Packet Arrival Rate Based Queue Management for Class Based Scheduling

High Performance DiffServ Mechanism for Routers and Switches: Packet Arrival Rate Based Queue Management for Class Based Scheduling Hgh Performance DffServ Mechansm for Routers and Swtches: Packet Arrval Rate Based Queue Management for Class Based Schedulng Bartek Wydrowsk and Moshe Zukerman ARC Specal Research Centre for Ultra-Broadband

More information

QoS Evaluation of HTTP over Satellites

QoS Evaluation of HTTP over Satellites 2011 Internatonal Conference on Cyber-Enabled Dstrbuted Computng and Knowledge Dscovery QoS Evaluaton of HTTP over Satelltes Lukman Audah Faculty of Electrcal and Electronc Engneerng Unverst Tun Hussen

More information

Session 5.3. Switching/Routing and Transmission planning

Session 5.3. Switching/Routing and Transmission planning ITU Regonal Semnar Belgrade Serba and Montenegro 20-24 24 June 2005 Sesson 5.3 Swtchng/Routng and Transmsson plannng volvng nfrastructures to NGN and related Plannng Strateges and Tools I.S. Sesson 5.3-1

More information

Efficient Mobility Management in Different Wireless Network for Continuous Flow of Information

Efficient Mobility Management in Different Wireless Network for Continuous Flow of Information Effcent Moblty Management n Dfferent Wreless Network for Contnuous Flow of Informaton Mr. P.Thrunavukkarasu, Ms. P.Irene Berl Yazhn PG Scholar, Dept. of CSE, SRM Unversty, Chenna, Inda Assstant Professor,

More information

A Frame Packing Mechanism Using PDO Communication Service within CANopen

A 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 information

Cognitive Radio Resource Management Using Multi-Agent Systems

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

More information

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

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

More information

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

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

More information

A Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks

A 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 information

Concurrent Apriori Data Mining Algorithms

Concurrent Apriori Data Mining Algorithms Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng

More information

Efficient QoS Provisioning at the MAC Layer in Heterogeneous Wireless Sensor Networks

Efficient QoS Provisioning at the MAC Layer in Heterogeneous Wireless Sensor Networks Effcent QoS Provsonng at the MAC Layer n Heterogeneous Wreless Sensor Networks M.Soul a,, A.Bouabdallah a, A.E.Kamal b a UMR CNRS 7253 HeuDaSyC, Unversté de Technologe de Compègne, Compègne Cedex F-625,

More information

BROADBAND AND HIGH SPEED NETWORKS

BROADBAND AND HIGH SPEED NETWORKS BROADBAND AND HIGH SPEED NETWORKS INTRODUCTION ATM stands for Asynchronous Transfer Mode ATM is a flexible high bandwidth, low delay network technology that is: Capable of handling voice, video and data

More information

Protocol Architecture (diag) Computer Networks. ATM Connection Relationships. ATM Logical Connections

Protocol Architecture (diag) Computer Networks. ATM Connection Relationships. ATM Logical Connections 168 430 Computer Networks Chapter 11 Asynchronous Transfer Mode Protocol Architecture Similarities between ATM and packet switching Transfer of data in discrete chunks Multiple logical connections over

More information

Load-Balanced Anycast Routing

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

More information

Avoiding congestion through dynamic load control

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

More information

Sample Solution. Advanced Computer Networks P 1 P 2 P 3 P 4 P 5. Module: IN2097 Date: Examiner: Prof. Dr.-Ing. Georg Carle Exam: Final exam

Sample Solution. Advanced Computer Networks P 1 P 2 P 3 P 4 P 5. Module: IN2097 Date: Examiner: Prof. Dr.-Ing. Georg Carle Exam: Final exam Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans

More information

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

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

More information

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

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

More information

William Stallings Data and Computer Communications 7 th Edition. Chapter 11 Asynchronous Transfer Mode

William Stallings Data and Computer Communications 7 th Edition. Chapter 11 Asynchronous Transfer Mode William Stallings Data and Computer Communications 7 th Edition Chapter 11 Asynchronous Transfer Mode Protocol Architecture Similarities between ATM and packet switching Transfer of data in discrete chunks

More information

Utility Based Scheduling and Call Admission Control for Long Term Evolution Networks

Utility Based Scheduling and Call Admission Control for Long Term Evolution Networks Journal of Computer Scence 2012, 8 (12), 2025-2031 ISSN 1549-3636 2012 do:10.3844/cssp.2012.2025.2031 Publshed Onlne 8 (12) 2012 (http://www.thescpub.com/cs.toc) Utlty Based Schedulng and Call Admsson

More information

VOICE AND DATA PERFORMANCE OF THE cdma2000 1XEV-DV SYSTEM

VOICE AND DATA PERFORMANCE OF THE cdma2000 1XEV-DV SYSTEM VOICE AND DATA PERFORMANCE OF THE cdma2000 1XEV-DV SYSTEM R. Thomas Derryerry, Ln Ma, Zhgang Rong 1 Noka Research Center 6000 Connecton Drve MS 2:700 Irvng, Texas USA ABSTRACT The antcpated ncrease n future

More information

ATM Switch. Traffic Shaper. ATM Switch. Traffic Shaper. ATM Switch. Terminal Equipment. Terminal Equipment UNI UNI

ATM Switch. Traffic Shaper. ATM Switch. Traffic Shaper. ATM Switch. Terminal Equipment. Terminal Equipment UNI UNI Mult-rate Trac Shapng and End-to-End Performance Guarantees n ATM Debanjan Saha Department of Computer Scence Unversty of Maryland College Park, MD 20742 E-mal: debanjan@cs.umd.edu Sart Mukherjee y Dept.

More information

Statistical Admission Control Using Delay Distribution Measurements

Statistical Admission Control Using Delay Distribution Measurements Statstcal Admsson Control Usng Delay Dstrbuton Measurements KARTIK GOPALAN State Unversty of New York at Bnghamton LAN HUANG IBM Almaden Research Center GANG PENG and TZI-CKER CHIUEH Stony Brook Unversty

More information

Protection Switching Methods for Point-to-Multipoint Connections in Packet Transport Networks

Protection Switching Methods for Point-to-Multipoint Connections in Packet Transport Networks Protecton Swtchng Methods for Pont-to-Multpont Connectons n Packet Transport Networks Dae-Ub Km, Jeong-dong yoo, Jong Hyun Lee, Byung Chul Km, and Jae Yong Lee In ths paper, we dscuss the ssues of provdng

More information

An Admission Control Framework Integrating Radio and IP-Transport in 3GPP-based Networks

An Admission Control Framework Integrating Radio and IP-Transport in 3GPP-based Networks An Admsson Framework Integratng Rado and IP-Transport n 3GPP-based Networks R. Ferrús, J. Olmos, O. Sallent, J. Pérez-Romero, F. Casadevall Sgnal Theory and Communcatons Department, UPC, Barcelona e-mal:

More information

Oracle Database: 12c Administrator

Oracle Database: 12c Administrator Oracle Database: 12c Admnstrator 1 Duraton: 5 Days (30 hours) What you wll learn: Ths Oracle Database: SQL and PL/SQL Fundamentals tranng delvers the fundamentals of SQL and PL/SQL along wth the benefts

More information

Response-Time Guarantees in ATM Networks

Response-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 information

Adaptive Network Resource Management in IEEE Wireless Random Access MAC

Adaptive Network Resource Management in IEEE Wireless Random Access MAC Adaptve Network Resource Management n IEEE 802.11 Wreless Random Access MAC Hao Wang, Changcheng Huang, James Yan Department of Systems and Computer Engneerng Carleton Unversty, Ottawa, ON, Canada Abstract

More information

Fibre-Optic AWG-based Real-Time Networks

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

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Relational Analysis based Concurrent Multipath Transfer over Heterogeneous Vehicular Networks

Relational Analysis based Concurrent Multipath Transfer over Heterogeneous Vehicular Networks www.ijcsi.org 1 Relatonal Analyss based Concurrent Multpath Transfer over Heterogeneous Vehcular Networks Yuanlong Cao 1, Changqao Xu 1,2, Janfeng Guan 1, Ja Zhao 3, We Quan 1, Mngchuan Zhang 1 and Hongke

More information

THere are increasing interests and use of mobile ad hoc

THere 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 information

ATM Hierarchical Shaping ATM VC into VP Shaping, page 1

ATM Hierarchical Shaping ATM VC into VP Shaping, page 1 ATM Hierarchical Shaping ATM VC into VP Shaping, page 1 Traffic shaping is a quality of service (QoS) mechanism that is used to manage the network traffic by shaping the traffic to a specified rate. Traffic

More information

An efficient iterative source routing algorithm

An efficient iterative source routing algorithm An effcent teratve source routng algorthm Gang Cheng Ye Tan Nrwan Ansar Advanced Networng Lab Department of Electrcal Computer Engneerng New Jersey Insttute of Technology Newar NJ 7 {gc yt Ansar}@ntedu

More information