Evaluation of TCP Variants and Bandwidth on Demand over Next Generation Satellite Network

Size: px
Start display at page:

Download "Evaluation of TCP Variants and Bandwidth on Demand over Next Generation Satellite Network"

Transcription

1 Evaluaton of TCP Varants and Bandwdth on Demand over Next Generaton Satellte Network Songrth Kttperachol, Zhl Sun and Hatham Cruckshank Centre for Communcaton Systems Research Unversty of Surrey Guldford, Surrey, GU2 7XH, UK Abstract the Internet has become an mportant part of day to day actvtes. There s hardly a day wthout usng Internet, such as readng Emals and artcles as well as enjoyng musc and vdeo. Thus, t s very mportant for the Internet to be provded to anyone anywhere. Terrestral network has been the underlyng nfrastructure for the Internet. However, terrestral network by tself cannot always satsfy all of the growng demands for the Internet, partcularly n the remote areas. Thus, the deployment of the Next Generaton Satellte Network (NGSN) s needed to fll n the gap and break the dgtal dvde. Ths paper evaluates how the performances of TCP over NGSN wth dynamc bandwdth allocaton mechansm. The TCP used n ths work s a real-world TCP based on both Lnux and Wndow Vsta mplementatons whch have been ntegrated nto a network smulator, INET. The study reveals that the TCP performances n terms of utlzaton and robustness, frendlness and farness, and user s perceved Qualty of Servce are clearly affected by the dynamc bandwdth allocaton mechansm. Keywords Lnux, TCP, Next Generaton Satellte Network, Bandwdth on Demand I. INTRODUCTION Over the Internet, transmsson Control Protocol or TCP [1] s the most domnant protocol snce t s the protocol on whch legacy Internet applcatons are based. Although NewReno, the latest IETF standard TCP [2], performs exceptonally well over the tradtonal network, ts performances are qute lmted n the next generaton network havng large Bandwdth Delay Product (BDP). Thus, varous developments have been carred out to mprove TCP performances. Lnux TCP s a part of the Lnux TCP/IP network stack whch provdes ten other TCP varants,.e. bc, cubc, hghspeed, hamlton, hybla, scalable, vegas, veno and westwood, n addton to the standard TCP, reno. Detals of these varants can be found n lteratures. In addton, the Wndow Vsta based TCP, known as compound, s ntegrated nto Lnux kernel by [3]. Thus, to obtan realstc TCP dynamc, TCP functonaltes of Lnux TCP/IP network stack (ver ) are ntegrated nto a network smulator, INET [4, 5]. As a consequence, more accurate TCP dynamc can be observed n smulated network envronments of INET. The advance n satellte technologes,.e. powerful codng, hghspeed lnk, multple spotbeam and on-board processor, presents NGSN. Moreover, the adopton of the latest standards n Dgtal Vdeo Broadcastng (DVB),.e. DVB-S/S2 [6, 7] standard clent enhanced clent Fg. 1 Smulaton setup NGSN standard server enhanced server and DVB-RCS [8] enables fully nteractve Internet servces over NGSN at a relatvely low cost. Wth dynamc bandwdth allocaton,.e. Bandwdth on Demand (BoD), NGSN s able to utlze bandwdth effcently. Nonetheless, BoD when coupled wth network characterstcs, such as large BDP and hgh data loss rate, can consderably affect TCP performances and thus Internet servces over NGSN. Ths work s to evaluate the performances of non standard TCP, based on Lnux and Mcrosoft Vsta mplementatons, aganst reno n terms of utlzaton and robustness, frendlness and farness, and user s perceved Qualty of Servce over the NGSN wth BoD. Smulaton setup s outlned n Secton II whereas smulaton results and dscussons are gven n secton III. Fnally, secton IV presents conclusons and future works. II. SIMULATION SETUP The setup s based on NGSN. The satellte tself s the next generaton geostatonary satellte havng multple spotbeams, hghspeed lnks and on-board processor. The downlnk/uplnk s based on TDM/TDMA and both have the same bandwdth. The uplnk bandwdth s segmented nto frames. Each frame contans 48 tme slots; one of whch s a preamble slot and the rest are data slots. A data slot s equvalent to eght MPEG-II (188-bytes) frames or 154 bytes; thus supportng Ethernet frames or 15 bytes. In general, gven bt rate (R) and slot length (SL), slot duraton (SD) can be calculated as follow. SD = SL (1) R /8/$ IEEE IWSSC 28 Authorzed lcensed use lmted to: Unversty of Surrey. Downloaded on Aprl 12,21 at 9::4 UTC from IEEE Xplore. Restrctons apply.

2 utlzaton utlzaton utlzaton Utlzaton (%) (a) 2-Mbps lnk wth 1-packet buffer (b) 4-Mbps lnk wth 2-packet buffer (c) 8-Mbps lnk wth 4-packet buffer Fg. 2 Utlzaton of TCP over the satellte lossy lnk wth BoD The total frame duraton s 48 SD. The bandwdth s allocated dynamcally accordng to a request/allocaton scheme of BoD [9]. The request s based on Volume Based Dynamc Capacty (VDBC) and the allocaton s based on proportonal allocator. Bandwdth s requested and allocated n numbers of slots and s performed once every superframe,.e. multple frames. The allocator s located on board the satellte where all the requests are collected and data slots are computed and then allocated n a round robn manner. Let R and A be slot request and slot allocaton whereas Q ( t) and D ( t) be queue occupancy and slot defct snce the last request for termnal, Q ( Δt) + L ( ) R = D Δt and R f R DS A = (3) R R f otherwse and s.t. A DS where x s the smallest nteger greater than x, DS s the data slots per frame and s.t. s the abbrevaton for subject to. The slot allocaton,.e. Termnal Burst Tme Plan (TBTP), s broadcasted at the begnnng of the next superframe. Once recevng the TBTP, satellte termnals can begn transmttng data but only n the desgnated data slots of the correspondng superframe. The allocaton tme T,.e. tme needed for a slot request to become effectve, follows ths expresson, T = n F DS SL T P (4) ( ) s.t. where n s the smallest nteger that satsfes the condton, F s frames per superframe and P s the propagaton delay, roughly 5 ms for geostatonary satellte. If the request s not entrely satsfed, slot defct s added to the next request. In ths study, the request/allocaton s performed every three frames and the network s setup as dsplayed n Fg. 1. Clent network conssts of standard and enhanced peers and connects to a satellte gateway. Two correspondng servers are (2) on the other sde of the network and connect to two gateways. A TCP applcaton (2 MB fle download) s requested by peers at a random tme whch s exponentally dstrbuted and one second on average. The uplnks are setup for three cases (a) 2-Mbps wth 1-packet, (b) 4-Mbps wth 2-packet and (c) 8-Mbps lnk wth 4-packet buffer. The choces of buffer szes are smply to accommodate the BDP of the satellte lnk. The network smulator used s the modfed INET [5]. III. RESULTS AND DISCUSSIONS A. Utlzaton and Robustness In general, utlzaton and robustness ndcate the effcency of TCP when utlzng a bottleneck lnk and when dealng wth packet losses. In ths study, the satellte lnks are assumed to be lossy wth bt error rate (BER) rangng from 1-1 to 1-7. Utlzatons and robustness of TCP over the satellte lnk wth BoD for the three lnk setups are dsplayed n Fg. 2. Fg. 2 (a) llustrates that wth 2-Mbps lnk and 1-packet buffer, all varants acheve utlzaton at 4 percents or lower. For low BER,.e. 1-1 to 1-9, reno, bc, cubc, hghspeed and scalable acheve utlzaton at roughly 3-4 percents whereas compound, hamlton, hybla, veno and westwood are at 2-3 percents. For hgh BER,.e. 1-8 to 1-7, cubc, hamlton and hybla are the only varants that do not suffer sgnfcant drop n utlzaton. However, vegas dsplays the lowest utlzaton at 1 percents or less regardless of BER. Fg. 2 (b) llustrates that wth 4-Mbps lnk and 2-packet buffer, all varants dsplay mprovement n utlzaton but stll lmted to 6 percents. It s clear that varants havng the hghest and the lowest utlzaton are veno and vegas respectvely. For low BER, bc and cubc acheve utlzaton at 5 percents whereas the rest are around 4-5 percents. For hgh BER, cubc, hamlton and hybla are the only varants havng utlzaton mantaned at 2 percents or more. Fg. 2 (c) llustrates that wth 8-Mbps lnk and 4- packet buffer, all varants appear to dsplay utlzaton smlar Authorzed lcensed use lmted to: Unversty of Surrey. Downloaded on Aprl 12,21 at 9::4 UTC from IEEE Xplore. Restrctons apply.

3 Throughput (Mbps) vs Tme (s) reno-bc reno-compound reno-cubc reno-hghspeed reno-hamlton reno-hybla (a) 2-Mbps lnk wth 1-packet buffer competng flows reno-bc reno-compound reno-cubc reno-hghspeed reno-hamlton reno-hybla (b) 4-Mbps lnk wth 2-packet buffer competng flows reno-bc reno-compound reno-cubc reno-hghspeed reno-hamlton reno-hybla to the results prevously found n Fg. 2 (b). But, compound and hghspeed are the only varants able to acheve utlzaton at 8 and 7 percents respectvely whereas vegas stll dsplays the lowest utlzaton. These low utlzatons are rather uncommon when a large fle download s consdered but t s all due to the nteracton between TCP and BoD. Pror to data transmsson, bandwdth has to be frst allocated. Accordng to (2) and (4), the numbers of data slots that can be requested gven the buffer sze of 1, 2 and 4 are 12, 141 and 141 slots per superframe and the allocaton tme gven the lnks of 2, 4 and 8 Mbps are.866,.866 and.649 s; therefore, ncreasng the overall latency and resultng n 1, 2 and 3 dle superframes pror to transmsson (c) 8-Mbps lnk wth 4-packet buffer Fg. 3 Aggregate throughput of two reno and two competng flows over the satellte lnk wth BoD competng flows Thus, to have all 141 data slots allocated per superframe, the mnmum buffer sze of 141 s needed. Lkewse, to request all data slots n the subsequent superframe, a buffer sze of 282 or more s requred n order to avod any packet drops f another 141 packets arrve before any of the prevous 141 packets can be transmtted. Evdently, when BoD s used, queued packets do not necessarly mply full utlzaton and larger buffers are essental to mantan full utlzaton. Accordng to the results, TCP usng an ncrease n delay as a sgn for network congeston, lke vegas, s lkely to dsplay sgnfcantly degraded performances due to large varatons n delay caused by BoD mechansm. In addton, the buffer sze of 1 or 2 packets are nsuffcent to request all 141 data Authorzed lcensed use lmted to: Unversty of Surrey. Downloaded on Aprl 12,21 at 9::4 UTC from IEEE Xplore. Restrctons apply.

4 throughput 1..5 Throughput (Mbps) (a) 2-Mbps lnk wth 1-packet buffer throughput throughput (b) 4-Mbps lnk wth 2-packet buffer (c) 8-Mbps lnk wth 4-packet buffer Fg. 4 Average throughput of reno and other competng flows over the satellte lnk wth BoD. slots for two consecutve superframes, therefore resultng n poor utlzatons. Although two consecutve superframes can be requested by the 4-packet buffer, three superframes are dle and cannot be utlzed before TBTP arrves. Gven that TCP requres feedbacks,.e. acknowledgement, to ncrease ts transmsson rate, havng more dle superframes can lead to even lower utlzaton. Clearly, BoD adversely affects the performances of TCP by ncreasng both round trp tme and delay varaton as well as leavng a number of superframes unutlzed. In addton to BoD, lower BER s also necessary to obtan hgher utlzaton partcularly for larger bandwdth. Accordng to the results, compound, hghspeed and veno acheve hgher utlzaton for very low BER whereas cubc, hamlton, hybla and scalable appear to be more robust when compared to reno. B. Frendlness and Farness In general, TCP s sad to be frendly f ts throughput s no hgher than that of reno under the same condtons and to be far f ts throughput s relatvely the same as that of reno when competng on the same bottleneck lnk. In ths study, four concurrent fle downloads are used; two of whch are reno whle the other two are other competng varants. The satellte lnks are assumed to be error free and the smoothed aggregate throughputs of reno flows and competng varants for the three lnk setups are dsplayed n Fg. 3. Fg. 3 (a) llustrates that wth 2-Mbps lnk and 1-packet buffer, all varants are frendly and far except for vegas that s frendly but unfar. In addton, even wth four concurrent flows,.e. two reno and two competng flows, 1-percent utlzaton s yet to be acheved. Ths s due to the effects of BoD on TCP mentoned earler. As a result, the aggregate throughputs n any cases are unable to acheve the far share of bandwdth at 1 Mbps,.e. half of the avalable bandwdth. Fg. 3 (b) llustrates that wth 4-Mbps lnk and 2-packet buffer, all varants are frendly and far except for vegas that s frendly but unfar. In addton, n the cases of reno, bc, compound, cubc, hghspeed, scalable, veno and westwood beng competng flows, the aggregate throughputs are able to acheve the far share of 2-Mbps bandwdth but not n the cases of hamlton and hybla. Fg. 3 (c) llustrates that wth 8-Mbps lnk and 4-packet buffer, all varants stll reman frendly and far except for vegas that remans frendly but unfar. In addton, the aggregate throughputs n all cases are able to acheve the far share of 4-Mbps bandwdth. A closer nvestgaton reveals that the throughput dsplays trajectory wth three dstnct characterstcs when convergng to the far share. The frst one s the sudden convergence, formng a rectangle-lke shape,.e. reno, compound, hghspeed and westwood. The second one s the slow convergence, formng a trangle-lke shape,.e. bc, cubc and scalable. The thrd one s smlar to the second one except wth hgher varaton durng convergence,.e. hamlton and hybla. Despte the fact that some varants, such as bc, cubc, hamlton, hybla and scalable, are known to be unfrendly and unfar to reno n the terrestral network, the study reveals that BoD mechansm s able to entrely change ther characterstcs when competng wth reno such that they become frendly and far. Accordng to the results, all TCP varants, except vegas, are found to be both frendly and far whereas vegas s found to be frendly but fals to be far. C. User s Preceved Qualty of Servce User s perceved QoS (UQoS) s used to ndcate on how well the gven servces perform from the user pont of vew. In general, hgher throughput often mples better UQoS, partcularly for downloadng servces. Based on the results of Fg. 3, average throughput of ndvdual competng flows s dsplayed n Fg. 4. In each group, the frst two bars are the average throughput of reno whereas the other two bars are that of other competng varants. The tcp? ndcates the competng varant that s labeled on the x-axs. In ths study, the average throughput s loosely used as UQoS. Fg. 4 (a) llustrates that wth 2-Mbps lnk and 1-packet Authorzed lcensed use lmted to: Unversty of Surrey. Downloaded on Aprl 12,21 at 9::4 UTC from IEEE Xplore. Restrctons apply.

5 bc TABLE I. TCP PERFORMANCES compound cubc hghspeed 1 flow utlzaton o ++ o ++ - o o robustness + o ++ o o -- o o when compared to reno + means better o means comparable - means lower buffer, bc, compound, hghspeed, hamlton, hybla and veno, when competng aganst reno, acheve relatvely the same throughput as reno does whereas cubc and scalable acheve slghtly hgher throughput than reno. However, vegas and westwood dsplay lowest and slghtly lower throughput respectvely. Fg. 4 (b) llustrates that wth 4-Mbps lnk and 2-packet buffer, bc, compound, hghspeed, hamlton, hybla and veno acheve throughput smlar to reno whereas cubc and scalable stll acheve slghtly hgher throughput than reno. But, vegas and westwood dsplay throughput that s lower than reno. Fg. 4 (c) llustrates that wth 8-Mbps lnk and 4-packet buffer, besdes vegas and westwood, all varants acheve throughput comparable to reno. Stll, vegas and westwood dsplays lower throughput. Accordng to the results, UQoS based on bc, compound, hghspeed, hamlton, hybla and veno are at the same level as reno whereas UQoS based on cubc and scalable s slghtly better. However, UQoS provded by westwood s margnally lower and UQoS provded by vegas s the lowest. IV. CONCLUSIONS AND FUTURE WORKS Ths paper evaluates the performances of real-world TCP based on Lnux and Mcrosoft Vsta mplementatons over a satellte lnk of NGSN wth BoD. The metrcs of nterest are utlzaton and robustness, frendlness and farness, and UQoS. The fndngs based on the study are summarzed n TABLE I. The Noveltes of ths work are frst the use of the exstng protocol mplementaton n smulated envronment n whch more realstc protocol behavors can be produced and captured, and second the dscovery that real-world TCP may not perform optmally over a typcal NGSN partcularly wth BoD. Evdently, the performances of TCP can easly be degraded by a smple BoD mechansm. The result suggests that gven the satellte envronments, compound and hghspeed are best at utlzaton whle cubc, hamlton and hybla are best at robustness. Addtonally, all varants, other than vegas, are both frendly and far when competng aganst reno. Lastly, cubc and scalable delvers slghtly better UQoS when sharng the same lnk wth reno. Although not havng the best utlzaton, cubc and scalable hamlton hybla scalable 4 concurrent flows (2 reno and 2 competng varants) frendlness o o o o o o o ++ o o farness o o o o o o o -- o o vegas veno UQoS o o + o o o + -- o - westwood appear to be the best TCP from the user s pont of vews. Wth BoD, the presence of queue occupancy no longer mples full utlzaton and addtonal slot watng tme has to be added to the overall round trp tme. Therefore, larger buffer sze s requred not only to accommodate larger BDP but also to allow a number of superframes to be requested. It s clear that BoD causes several superframes to be dle and unutlzed n whch t contrbutes to even lower utlzaton. Thus, to optmze TCP performances over NGSN wth BoD, buffer sze, bandwdth and frame structure have to carefully be fne tuned, snce they are related to one another. The fnal am s to optmze the slot watng tme and the number of unutlzed superframes caused by BoD. In addton to BoD, Adaptve Codng and Modulaton (ACM), a mechansm that adapts transmsson rate to best sut wreless envronment, also affect TCP performances by causng the total avalable bandwdth to vary. Moreover, f nterworkng between the next generaton terrestral network and NGSN s mportant, IP QoS archtecture, such as Dfferentated Servce, has to be consdered n order to provde end-to-end QoS across the ntegrated next generaton network. The future works nclude further study on the mpacts of BoD,.e. dfferent buffer szes, dfferent request/allocaton setups and dfferent BoD schemes, on TCP performances. Next, the mpact of ACM and later the combned effects of both BoD and ACM on TCP performances wll be studed. Fnally, the performances of TCP over the ntegrated next generaton satellte-terrestral network, utlzng BoD, ACM and IP QoS, wll be nvestgated. ACKNOWLEDGMENT Songrth Kttperachol thanks the Royal Tha Navy and EPSRC for fnancal support. REFERENCE [1] M. Allman, V. Paxson, and W. Stevens, "TCP congeston control," RFC 2581, Aprl, [2] S. Floyd, T. Henderson, and A. Gurtov, "The NewReno modfcaton to TCP's fast recovery algorthm," RFC 3782, Aprl, 24. [3] D. X. We and P. Cao, "NS-2 TCP-Lnux: an NS-2 TCP mplementaton wth congeston control algorthms from Lnux," n Proceedng of 26 workshop of ns-2: the IP network smulator, Psa, Italy, 1 October 26. [4] A. Varga, "OMNeT++ dscrete event smulaton system," [5] S. Kttperachol, Z. Sun, and H. Cruckshank, "Integraton of Lnux TCP mplementaton: verfcaton and valdaton," n Proceedng of SPECTS '8, Ednburgh, UK, June 28, to be publshed. [6] ETSI, "Dgtal Vdeo Broadcastng (DVB) - framng structure, channel codng and modulaton for 11/12 GHz satellte servces," EN 3 421, August, [7] ETSI, "Dgtal Vdeo Broadcastng (DVB): user gudelnes for the second generaton system for broadcastng, nteractve servces, news gatherng and other broadband satellte applcatons (DVB-S2)," TR , February, 25. [8] ETSI, "Dgtal Vdeo Broadcastng (DVB): nteracton channel for satellte dstrbuton systems," EN 31 79, 23. [9] A. Gotta, F. Potort, and R. Secch, "Smulatng dynamc bandwdth allocaton on satellte lnks," n Proceedng of 26 workshop on ns- 2: the IP network smulator, Psa, Italy, 1 October 26. Authorzed lcensed use lmted to: Unversty of Surrey. Downloaded on Aprl 12,21 at 9::4 UTC from IEEE Xplore. Restrctons apply.

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

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

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

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

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

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

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

More information

The Impact of Delayed Acknowledgement on E-TCP Performance In Wireless networks

The Impact of Delayed Acknowledgement on E-TCP Performance In Wireless networks The mpact of Delayed Acknoledgement on E-TCP Performance n Wreless netorks Deddy Chandra and Rchard J. Harrs School of Electrcal and Computer System Engneerng Royal Melbourne nsttute of Technology Melbourne,

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

Gateway Algorithm for Fair Bandwidth Sharing

Gateway Algorithm for Fair Bandwidth Sharing Algorm for Far Bandwd Sharng We Y, Rupnder Makkar, Ioanns Lambadars Department of System and Computer Engneerng Carleton Unversty 5 Colonel By Dr., Ottawa, ON KS 5B6, Canada {wy, rup, oanns}@sce.carleton.ca

More 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

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

WITH rapid improvements of wireless technologies,

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

BANDWIDTH OPTIMIZATION OF INDIVIDUAL HOP FOR ROBUST DATA STREAMING ON EMERGENCY MEDICAL APPLICATION

BANDWIDTH OPTIMIZATION OF INDIVIDUAL HOP FOR ROBUST DATA STREAMING ON EMERGENCY MEDICAL APPLICATION ARPN Journal of Engneerng and Appled Scences 2006-2009 Asan Research Publshng Network (ARPN). All rghts reserved. BANDWIDTH OPTIMIZATION OF INDIVIDUA HOP FOR ROBUST DATA STREAMING ON EMERGENCY MEDICA APPICATION

More information

WIRELESS communication technology has gained widespread

WIRELESS communication technology has gained widespread 616 IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 4, NO. 6, NOVEMBER/DECEMBER 2005 Dstrbuted Far Schedulng n a Wreless LAN Ntn Vadya, Senor Member, IEEE, Anurag Dugar, Seema Gupta, and Paramvr Bahl, Senor

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

A Network Bandwidth Computation Technique for IP Storage with QoS Guarantees

A Network Bandwidth Computation Technique for IP Storage with QoS Guarantees A Network Bandwdth Computaton Technque for IP Storage wth QoS Guarantees Young Jn Nam 1, Junkl Ryu 1, Chank Park 1, and Jong Suk Ahn 2 1 Department of Computer Scence and Engneerng Pohang Unversty of Scence

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

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

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

Channel-Quality Dependent Earliest Deadline Due Fair Scheduling Schemes for Wireless Multimedia Networks

Channel-Quality Dependent Earliest Deadline Due Fair Scheduling Schemes for Wireless Multimedia Networks Channel-Qualty Dependent Earlest Deadlne Due Far Schedulng Schemes for Wreless Multmeda Networks Ahmed K. F. Khattab Khaled M. F. Elsayed ahmedkhattab@eng.cu.edu.eg khaled@eee.org Department of Electroncs

More information

An Optimal Algorithm for Prufer Codes *

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

More information

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

ARTICLE IN PRESS. Signal Processing: Image Communication

ARTICLE IN PRESS. Signal Processing: Image Communication Sgnal Processng: Image Communcaton 23 (2008) 754 768 Contents lsts avalable at ScenceDrect Sgnal Processng: Image Communcaton journal homepage: www.elsever.com/locate/mage Dstrbuted meda rate allocaton

More information

Shared Running Buffer Based Proxy Caching of Streaming Sessions

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

More information

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

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Inter-protocol fairness between

Inter-protocol fairness between Inter-protocol farness between TCP New Reno and TCP Westwood+ Nels Möller, Chad Barakat, Konstantn Avrachenkov, and Etan Altman KTH, School of Electrcal Engneerng SE- 44, Sweden Emal: nels@ee.kth.se INRIA

More information

Instantaneous Fairness of TCP in Heterogeneous Traffic Wireless LAN Environments

Instantaneous Fairness of TCP in Heterogeneous Traffic Wireless LAN Environments KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS VOL. 10, NO. 8, Aug. 2016 3753 Copyrght c2016 KSII Instantaneous Farness of TCP n Heterogeneous Traffc Wreless LAN Envronments Young-Jn Jung 1 and

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

Real-time interactive applications

Real-time interactive applications Real-tme nteractve applcatons PC-2-PC phone PC-2-phone Dalpad Net2phone vdeoconference Webcams Now we look at a PC-2-PC Internet phone example n detal Internet phone over best-effort (1) Best effort packet

More information

Neural Network Control for TCP Network Congestion

Neural Network Control for TCP Network Congestion 5 Amercan Control Conference June 8-, 5. Portland, OR, USA FrA3. Neural Network Control for TCP Network Congeston Hyun C. Cho, M. Sam Fadal, Hyunjeong Lee Electrcal Engneerng/6, Unversty of Nevada, Reno,

More information

A Binarization Algorithm specialized on Document Images and Photos

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

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

Dynamic Bandwidth Allocation Schemes in Hybrid TDM/WDM Passive Optical Networks

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

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

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

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

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

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

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,

More information

Mathematics 256 a course in differential equations for engineering students

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

More information

A Distributed Dynamic Bandwidth Allocation Algorithm in EPON

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

ABRC: An End-to-End Rate Adaptation Scheme for Multimedia Streaming over Wireless LAN*

ABRC: An End-to-End Rate Adaptation Scheme for Multimedia Streaming over Wireless LAN* ARC: An End-to-End Rate Adaptaton Scheme for Multmeda Streamng over Wreless LAN We Wang Soung C Lew Jack Y Lee Department of Informaton Engneerng he Chnese Unversty of Hong Kong Shatn N Hong Kong {wwang2

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

The Codesign Challenge

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

More information

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

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

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

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

Constructing Minimum Connected Dominating Set: Algorithmic approach

Constructing Minimum Connected Dominating Set: Algorithmic approach Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected

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

Video streaming over the Internet is becoming very popular and

Video streaming over the Internet is becoming very popular and Streamng MPEG-4 AudoVsual Objects Usng TCP-Frendly Rate Control and Unequal Error Protecton Toufk Ahmed 1, Ahmed Mehaoua 1 and Vncent Lecure 2 1 2 CNRS-PRSM LabUnversty of Versalles CRAN lab CNRS UMR 739

More information

Channel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7

Channel 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 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

Network-Driven Layered Multicast with IPv6

Network-Driven Layered Multicast with IPv6 Network-Drven Layered Multcast wth IPv6 Ho-pong Sze and Soung C. Lew Department of Informaton Engneerng, The Chnese Unversty of Hong Kong, Shatn, N.T., Hong Kong {hpsze8, soung}@e.cuhk.edu.hk Abstract.

More information

Efficient Content Distribution in Wireless P2P Networks

Efficient Content Distribution in Wireless P2P Networks Effcent Content Dstrbuton n Wreless P2P Networs Qong Sun, Vctor O. K. L, and Ka-Cheong Leung Department of Electrcal and Electronc Engneerng The Unversty of Hong Kong Pofulam Road, Hong Kong, Chna {oansun,

More information

ELEC 377 Operating Systems. Week 6 Class 3

ELEC 377 Operating Systems. Week 6 Class 3 ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems

More information

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

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

More information

Analytic Evaluation of Quality of Service for On-Demand Data Delivery

Analytic Evaluation of Quality of Service for On-Demand Data Delivery Analytc Evaluaton of Qualty of Servce for On-Demand Data Delvery Hongfe Guo Haonan Tan ( guo@cs.wsc.edu) (haonan@cs.wsc.edu) Abstract Qualty of servce (QoS) measured as balkng probablty and average watng

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

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

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

More information

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

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

More information

A High-Performance Router: Using Fair-Dropping Policy

A High-Performance Router: Using Fair-Dropping Policy Internatonal Journal of Computer Scence and Telecommuncatons [Volume 5, Issue 4, Aprl 2014] A Hgh-Performance Router: Usng Far-Droppng Polcy ISSN 2047-3338 Seyyed Nasser Seyyed Hashem 1, Shahram Jamal

More information

Performance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks

Performance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks RESEARCH Open Access Performance analyss of dstrbuted cluster-based MAC protocol for multuser MIMO wreless networks Azadeh Ettefagh *, Marc Kuhn, Celal Eşl and Armn Wttneben Abstract It s known that multuser

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More 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

Combined SINR Based Vertical Handoff Algorithm for Next Generation Heterogeneous Wireless Networks

Combined SINR Based Vertical Handoff Algorithm for Next Generation Heterogeneous Wireless Networks Combned SINR Based Vertcal Handoff Algorthm for Next Generaton Heterogeneous Wreless Networks Kemeng Yang, Iqbal Gondal, Bn Qu and Laurence S. Dooley Faculty of Informaton Technology Monash Unversty Melbourne,

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

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

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

FAST TCP: Motivation, Architecture, Algorithms, Performance

FAST TCP: Motivation, Architecture, Algorithms, Performance FAST TCP: Motvaton, Archtecture, Algorthms, Performance Cheng Jn Davd X. We Steven H. Low Engneerng & Appled Scence, Caltech http://netlab.caltech.edu Abstract We descrbe FAST TCP, a new TCP congeston

More information

Algorithms for Routing and Centralized Scheduling to Provide QoS in IEEE Mesh Networks

Algorithms for Routing and Centralized Scheduling to Provide QoS in IEEE Mesh Networks Algorthms for Routng and Centralzed Schedulng to Provde QoS n IEEE 802.16 Mesh Networks Harsh Shetya Dept of Electrcal Communcaton Engneerng Indan Insttute of Scence Bangalore, Inda. 560012 harsh@pal.ece.sc.ernet.n

More information

Remote display of large raster images using JPEG2000 and the rectangular FishEye-View

Remote display of large raster images using JPEG2000 and the rectangular FishEye-View Remote dsplay of large raster mages usng JPEG2000 and the rectangular FshEye-Vew René Rosenbaum* Insttute of Computer Graphcs Unversty of Rostock 18059 Rostock Germany rrosen@nformatk.un-rostock.de Davd

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

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

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

More information

Content Classification for Caching under CDNs

Content Classification for Caching under CDNs Content Classfcaton for Cachng under CDNs George Palls 1,2, Charlaos homos 2, Konstantnos Stamos 2, Athena Vakal 2, George Andreads 3 1 Department of Computer Scence, Unversty of Cyprus 2 Department of

More information

ARTICLE IN PRESS. Computer Networks xxx (2008) xxx xxx. Contents lists available at ScienceDirect. Computer Networks

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

Dynamic Code Block Size for JPEG 2000

Dynamic Code Block Size for JPEG 2000 Dynamc Code Block Sze for JPEG 2000 Png-Sng Tsa a, Yann LeCornec b a Dept. of Computer Scence, Unv. of Texas Pan Amercan, 1201 W. Unv. Dr., Ednburg, TX USA 78539-2999; b Sgma Desgns, Inc., 1778 McCarthy

More information

Efficient Broadcast Disks Program Construction in Asymmetric Communication Environments

Efficient Broadcast Disks Program Construction in Asymmetric Communication Environments Effcent Broadcast Dsks Program Constructon n Asymmetrc Communcaton Envronments Eleftheros Takas, Stefanos Ougaroglou, Petros copoltds Department of Informatcs, Arstotle Unversty of Thessalonk Box 888,

More information

Queueing Network-based Optimisation Techniques for Workload Allocation in Clusters of Computers *

Queueing Network-based Optimisation Techniques for Workload Allocation in Clusters of Computers * Queueng Network-based Optmsaton Technques for Workload Allocaton n Clusters of Computers * Lgang He, Stephen A. Jarvs, Davd Bacgalupo, Danel P. Spooner, Xnuo Chen and Graham R. Nudd Department of Computer

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

Optimum Number of RLC Retransmissions for Best TCP Performance in UTRAN

Optimum Number of RLC Retransmissions for Best TCP Performance in UTRAN Optmum Number of RLC Retransmssons for Best TCP Performance n UTRAN Olver De Mey, Laurent Schumacher, Xaver Dubos {ode,lsc,xdubos}@nfo.fundp.ac.be Computer Scence Insttute, The Unversty of Namur (FUNDP)

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

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

Post-Streaming Rate Analysis - A New Approach to Mobile Video Streaming with Predictable Performance

Post-Streaming Rate Analysis - A New Approach to Mobile Video Streaming with Predictable Performance The fnal verson of record s avalable at http://dx.do.org/10.1109/tmc.2017.2694418 IEEE TRANSACTIONS ON MOBILE COMPUTING, MANUSCRIPT ID TMC-2016-05-0324 1 Post-Streamng Rate Analyss - A New Approach to

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

An Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems

An Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems S. J and D. Shn: An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems 2355 An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems Seunggu J and Dongkun Shn, Member,

More information

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

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

More information

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

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

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

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

More information

QoS-aware composite scheduling using fuzzy proactive and reactive controllers

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

Module Management Tool in Software Development Organizations

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

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

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

More information

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

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

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Performance Improvement of Direct Diffusion Algorithm in Sensor Networks

Performance Improvement of Direct Diffusion Algorithm in Sensor Networks Mddle-East Journal of Scentfc Research 2 (): 566-574, 202 ISSN 990-9233 IDOSI Publcatons, 202 DOI: 0.5829/dos.mejsr.202.2..43 Performance Improvement of Drect Dffuson Algorthm n Sensor Networks Akbar Bemana

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

Application of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling

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

More information

THE low-density parity-check (LDPC) code is getting

THE low-density parity-check (LDPC) code is getting Implementng the NASA Deep Space LDPC Codes for Defense Applcatons Wley H. Zhao, Jeffrey P. Long 1 Abstract Selected codes from, and extended from, the NASA s deep space low-densty party-check (LDPC) codes

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