IEEE n Aggregation Performance Study for the Multicast
|
|
- Alicia Cunningham
- 6 years ago
- Views:
Transcription
1 IEEE n Aggregaton Performance Study for the Multcast Yousr Daldoul, Toufk Ahmed, Djamal-Eddne Meddour To cte ths verson: Yousr Daldoul, Toufk Ahmed, Djamal-Eddne Meddour. IEEE n Aggregaton Performance Study for the Multcast. IFIP Wreless Days (WD 2011), Oct 2011, Canada. pp.1-6, 2011, < /WD >. <hal > HAL Id: hal Submtted on 9 Jan 2012 HAL s a mult-dscplnary open access archve for the depost and dssemnaton of scentfc research documents, whether they are publshed or not. The documents may come from teachng and research nsttutons n France or abroad, or from publc or prvate research centers. L archve ouverte plurdscplnare HAL, est destnée au dépôt et à la dffuson de documents scentfques de nveau recherche, publés ou non, émanant des établssements d ensegnement et de recherche franças ou étrangers, des laboratores publcs ou prvés.
2 IEEE n Aggregaton Performance Study for the Multcast Yousr Daldoul 1, 2, Toufk Ahmed 2, Djamal-Eddne Meddour 1 1 France Telecom - Orange Labs, France 2 LaBRI, Unversty of Bordeaux 1, France {yousr.daldoul, djamal.meddour}@orange-ftgroup.com, tad@labr.fr Abstract- One of the major features proposed n the IEEE n amendment s the use of frame aggregaton. Thus, two types of frame aggregatons are defned: MAC Servce Data Unt Aggregaton (A-MSDU) and MAC Protocol Data Unt Aggregaton (A-MPDU). As frame aggregaton s manly defned to ncrease the effcency of the MAC layer, ths feature s very needed to support multmeda traffc such as Hgh Defnton TV (HDTV). The multcast transport s another way to ncrease the MAC layer effcency by transmttng the same nformaton only once to many recevers. However, the standard does not defne a relable multcast and consequently the n s unable to provde a relable transport for multcast streams. The aa remans the only draft to handle the unrelablty ssue of the multcast, but the proposed soluton s defned only for the legacy standard and does not consder the aggregaton feature of the n. In ths paper we desgn a new extenson for the aa n order to take a full advantage of the n capabltes and we provde a new analytcal model to evaluate the performance of the MAC layer. We partcularly study the mpact of the frame aggregaton type on the MAC throughput for the multcast transport. Our results show that n an deal channel (no losses), A-MSDU slghtly outperforms A-MPDU when usng the data rate of 6.5Mbps and both schemes have the same performance wth rates of 130 and 300 Mbps. However the use of A-MPDU aggregaton becomes more effcent n a nosy channel. I. INTRODUCTION The IEEE n [1] s known to be the next generaton technology for the hgh throughput wreless networks. It allows data rates up to 600 Mbps. Wth ts hgh capacty, ths soluton becomes commonly used wthn new communcaton devces. The reduced effcency of the legacy MAC layer was frstly resolved by e usng the Block frame and the Block Acknowledgement transfers, and then enhanced by n usng frame aggregaton. Thus two aggregaton schemes are defned: MAC Servce Data Unt Aggregaton (A- MSDU) and MAC Protocol Data Unt Aggregaton (A-MPDU). Although the data rate of the PHY layer has consderably ncreased wthn the n compared to the legacy standard, the unrelablty problem of the multcast remans unresolved. Lke the legacy , the n does not use any feedback polcy when a frame s transmtted to a group address (broadcast or multcast). Hence the relablty of the multcast s hugely reduced compared to the uncast. In order to provde a relable multcast transport, the aa [3] defnes a new Acknowledgement (ACK) polcy for the However ths soluton does not consder the frame aggregaton feature of the n. In ths paper we desgn a new extenson to the aa amendment n order to take a full advantage of the n capabltes. Then, we evaluate through an analytcal model the performance of A-MSDU and A-MPDU aggregaton schemes to transport a relable multcast traffc. We partcularly show how the encapsulated MSDUs sze and the bt error rate affect the effcency of the MAC layer. The remander of ths paper s organzed as follows. Secton II ntroduces related work of some proposed multcast protocols we have studed, dscussng ther compatblty wth n and hghlghtng ther problems and drawbacks. Changes brought to the aa are descrbed n secton III. In secton IV we provde our analytcal model. We devote secton V to show the performance of the two aggregaton schemes. Fnally, n secton VI, we conclude. II. RELATED WORKS II-A. State of the art of relable multcast proposals Many protocols were desgned to address the unrelablty of the multcast n the WLAN [3-7]. They can be classfed nto two categores: ACK-based [3,4,5] and Negatve Acknowledgement (NAK) based [6,7] protocols. The ACKbased protocols use a smlar concept to that of the uncast ACK and they requre each multcast member to send an explct ACK. Most of them can mgrate easly to n snce the sender performs the MAC layer recovery based on a trustworthy reply. However ther performance should be studed agan when used wth the new aggregaton feature. In the NAK-based protocols, the recever wll reply wth a NAK only f the frame s receved wth errors. In some proposals, the mplementaton of the protocol s joned wth the selecton of a leader for the multcast group, where the leader s the only responder wth an ACK n case of recepton success. The mplementaton of a NAK based protocol remans a challengng task as t requres resolvng two constrants. 1) Elmnatng cases where the leader s ACK sgnal strength may hde a multcast member s NAK, 2) Decdng whether or not a NAK should be sent, snce the receved nformaton wthn a /11/$ IEEE
3 faulty frame s not coherent and s not enough to buld the approprate feedback n a relable way. The former constrant may be resolved by selectng a leader on the bass of the lowest lnk qualty crteron [7]. The latter s resolved by usng addtonal control frames (RTS/CTS, CTS-To-Self) to carry the trustworthy nformaton whch wll be used to buld a feedback. Most of NAK-based protocols are napproprate for the A- MPDU aggregaton scheme snce a NAK s used to acknowledge only one MPDU. II-B. Aggregaton performance studes In the lterature, many works have studed the aggregaton performance of n [8-10]. In [8] authors evaluated the A- MSDU, the A-MPDU and the two-level aggregaton schemes,.e. when one or more of the aggregated MPDUs encapsulate an A-MSDU. They proved that the two-level scheme s the most effcent one. In [9], authors proposed a novel analytc model to compare A-MSDU and A-MPDU schemes wth UDP and TCP. However they lmted ther evaluaton of the A- MSDU scheme to the maxmum supported length of a sngle A-MSDU wthout consderng the two-level scheme. The second weakness of the model s the use of an nfnte retry lmt whch s not a realstc value n a real network. In [10], authors focused on the overhead s mpact on the used scheme. The major weakness of the paper s gnorng the overhead generated by channel contenton and feedbacks. All mentoned studes have nvestgated only the uncast transport. To our knowledge, the multcast mode has not been thoroughly studed, and the few papers whch have studed t, have manly focused on ncreasng ts relablty. Therefore, analyzng the mpact of the aggregaton scheme on the MAC effcency has been gnored for the multcast transport. In ths paper we fll ths gap and we ntroduce our analytcal model. To acheve our evaluaton of the MAC aggregaton schemes, we need a relable multcast transport allowng the source to retransmt when a recepton error occurs. However, no ACK polcy was defned for the multcast n the n. Hence we defne a new extenson for aa complant wth the n aggregaton schemes. We use ths extenson to develop our analytcal model. III. OVERVIEW OF THE N AND AA AMENDMENTS III-A. Presentaton of the n amendment The n s desgned to defne the new verson of Hgh Throughput (HT) Wreless Local Area Networks (WLAN). Its theoretcal PHY data rate may reach 600Mbps. Hence, many features were defned to enhance the performance of ths amendment compared to the standard. In ths paper we focus on the frame aggregaton feature only and we present both of the aggregaton schemes: A-MSDU and A-MPDU. The A-MSDU scheme allows the aggregaton of several MSDUs nto the same MPDU. The destnaton address (DA) and sender address (SA) of each aggregated MSDU must match wth the recever address (RA) and transmtter address (TA) of the MPDU MAC header. All MSDUs wthn an A- MSDU should belong to the same traffc dentfer (TID). The maxmum length of an A-MSDU s 7935 bytes. The A-MSDU aggregaton reduces the transmsson overhead snce only one MAC header s generated for all the aggregated MSDUs. However t becomes neffcent n nosy channels: f only one MSDU s corrupted, the entre A-MSDU s rejected and all the aggregated MSDUs are lost. The A-MPDU scheme allows the aggregaton of several MPDUs nto the same PHY layer frame (PPDU). The maxmum supported length for an A-MPDU s bytes. In an A-MPDU each MPDU s encapsulated wth ts MAC header and CRC. Hence the corrupton of an MPDU s separately detected and does not affect the entre A-MPDU. However, the A-MPDU aggregaton requres more overhead than A-MSDU whch becomes heavy for small MSDUs. In order to provde a relable uncast transport, both and n defne an Acknowledgement (ACK) polcy. Moreover, n allows the use of the mmedate Block ACK (BACK) polcy wth sngle PPDUs carryng an A-MPDU when the ACK polcy of the A-MPDU s set to Implct Block ACK (.e. the ACK polcy subfeld of at least one aggregated MPDU s set to Normal ACK ). The legacy ACK polcy s used wth frames encapsulatng a sngle MPDU (.e. MSDU or A-MSDU) and requrng an mmedate feedback. Unlke the uncast, the n multcast transport does not use any feedback polcy. Besdes, the n forbds non-access Pont (AP) statons (STAs) from transmttng group addressed frames and only the AP s allowed to transmt such frames. III-B. Presentaton of the aa amendment The aa amendment [3] defnes the More Relable Groupcast (MRG) servce n order to support a robust and relable multcast audo/vdeo streamng over the WLAN. Ths servce provdes three ACK polces: MRG- Unsolcted-Retry, MRG-Drected Multcast Servce (DMS) and MRG-Block-Ack. When usng the MRG-Unsolcted-Retry ACK polcy, the sender defnes a retry lmt, say N, and then transmts each multcast frame N tmes wthout watng for any feedback after each transmsson. Ths polcy generates a sgnfcant overhead partcularly when the value of N s hgh, and becomes useless when the channel qualty s good. The MRG-DMS sends each multcast frame n uncast mode to each multcast group member. Therefore, ths ACK polcy guarantees the same uncast relablty level to multcast traffc at the cost of the bandwdth. DMS can be used to stream a standard multcast traffc to a few recevers number. However t does not scale well for hgh throughput traffc lke Hgh Defnton (HD) TV streams. The MRG-Block-Ack feedback polcy s desgned to operate wth the block frame transfer. For such transfer, the recever s allowed to send a BACK only when t receves an explct Block ACK Request (BAR) frame. The MRG-Block-Ack feedback procedure s llustrated n Fg. 1.
4 AP Multcast member 1 Multcast member 2 Multcast member 3 Data Data Data BAR Snce MRG servce s defned for multcast transmssons, the MRG BAR s slghtly changed compared to that of the uncast n order to add the followng nformaton: the multcast members and the acknowledgement order. When a BAR s used as part of MRG-Block-Ack, a new feld wth a varable length called MRG BAR nformaton feld s added to the BAR. Ths feld allows the AP to ask for a feedback from up to 2008 assocated STAs. Thus, the feld s length may reach 253 bytes. Ths length may ntroduce a useless overhead snce multcast groups n a WLAN have lmted members typcally fewer than 8, and becomes annoyng when each multcast frame needs to be ndvdually acknowledged. Although MRG-Block-Ack provdes the best relablty to bandwdth rato among the three proposed ACK polces, t does not allow an optmzed utlzaton of the n frame aggregaton feature. Snce an A-MPDU has a sgnfcant supported length allowng the aggregaton of many MPDUs nto the same PPDU, t becomes more convenent to request a feedback per frame partcularly for real-tme traffc subject to low latency constrants. Concernng the multcast group ntalzaton, the aa amendment does not defne a partcular procedure, but proposes the use of IGMP [11] snoopng to acheve group membershp detecton. IV. THE MRG-IMPLICIT-BLOCK-ACK FEEDBACK POLICY In ths secton we ntroduce a new extenson to the aa called the MRG-Implct-Block-Ack (IBA) feedback polcy. As for A-MPDUs transmtted n uncast wth mplct ACK, the MRG-IBA s used to allow each A-MPDU to be acknowledged ndvdually and mmedately. In order to allow MRG-IBA to operate properly, 2 functons are requred: membershp management and ACK notfcaton. The membershp management functon allows the AP to attrbute a Membershp Identfer (MID) ndvdually to each new detected member. In ths paper we do not defne the frame format used to notfy the MID attrbuton for space constrants. The AP mantans a table called Group Membershp Table (GMT) per multcast sesson. Ths table contans all the attrbuted MIDs for a specfc sesson. An example of the GMT table wth 4 members s llustrated n Table 1. Table 1. GMT of a multcast sesson wth address 01:00:5E:00:00:01 Member address 00:20:4E:38:A1:9B 00:20:7F:74:4E:25 00:20:92:27:8A:75 00:20:A6:61:1F:2B BACK MID BACK BACK Fgure 1. Typcal frame exchange scenaro wth MRG-Block-Ack polcy When a multcast group contans 16 members or less, the hghest attrbuted MID value should not exceed 16. Gaps may exst between attrbuted MIBs, and ths may occur when a MIB s recovered after a member departure. If the members number s hgher than 16, all MIDs between 1 and 16 should be attrbuted. Thus, the AP performs MID reassgnment when a MID between 1 and 16 becomes free. The choce of the value of 16 wll be motvated n the remander of ths secton. The ACK notfcaton functon s mplemented to assgn an order for the feedbacks after each frame. In order to allow ths functon to operate properly we defne a new-two-bytes-nlength feld n the frame called the MRG-IBA Btmap feld. Ths feld s present n the MPDU header of a group addressed frame when both of the followng condtons are satsfed: the MRG-IBA polcy s used and the ACK polcy of the frame s set to Normal ACK. The new feld s nserted between the HT control feld and the data feld of the MPDU. Each bt of the MRG-IBA Btmap feld corresponds to a MID. Therefore, the AP requests that the member wth a MID equal to N to respond f the bt number N s set to 1 and to forbear otherwse. As the btmap feld s 16 bts n length, up to 16 members may reply. We beleve that a typcal multcast group sze n a WLAN does not exceed 16 members. However, when the sze s hgher than 16, the AP may choose between allowng only the frst 16 members to reply tll some partcpants leave the group, and swtchng to the MRG-Block- Ack polcy. When the MRG-IBA agreement s establshed, multcast PPDUs encapsulatng a sngle MPDU (.e MSDU or A-MSDU) are also acknowledged usng the MRG-IBA procedure. However, requested members reply wth ACK frames nstead of BACKs. V. MODEL DESCRIPTION In ths secton we evaluate the n aggregaton schemes n the nfrastructure mode. We buld a Basc Servce Set (BSS) of one AP and 8 assocated STAs. All nodes are n complant STAs. The AP delvers only one stream belongng to one multcast sesson and no traffc other than the multcast one s transmtted on the medum. All hgh level packets are delvered usng UDP. The MRG-IBA agreement s establshed at the begnnng of the sesson. We defne a retry lmt of 7 for each MPDU and we suppose that MPDUs falures wthn an A-MPDU are not correlated. All encapsulated MSDUs have 1500 bytes length (L). Hence an A-MPDU can aggregate at most 42 MPDUs encapsulatng a sngle MSDU, and an A-MSDU can carry no more than 5 MSDUs. To evaluate the A-MSDU scheme wth more than 5 aggregated MSDUs, we use the two-level aggregaton scheme where several A-MSDUs are aggregated wthn an A-MPDU. We assume that the PHY frame header s always receved correctly snce t has a small sze compared to the data part of the frame and s always transmtted at the lowest but the most robust avalable data rate. All feedbacks (BACK and ACK
5 frames) are transmtted at the same data rate used to delver the multcast frame. We also assume that an ACK/BACK frame s always receved correctly gven that t has a small sze compared to that of the data frame. Moreover, we consder that all PPDUs are transmtted durng transmsson opportuntes (TXOP) whch are contenton free perods. Hence, the backoff procedure s not performed before a frame transmsson. Results are obtaned for the followng 2 mandatory data rates: 6.5 and 130Mbps, and for the optonal data rate of 300Mbps. We consder that only the HT-greenfeld format s used for all transmtted PPDUs. V-A. Mathematcal tools: Let p() be the bt error rate for Member (M ), for =1..K, where K s the multcast group sze. We defne X as the number of transmsson attempts. The probablty for a gven member M to receve correctly a packet n any of the N frst transmssons s gven n Equaton (1): P X N = 1 (1 Ps()) N (1) Then we derve the probablty to serve all the K recevers n any of the N frst transmssons n Equaton (2): K P X N = =1 (1 (1 Ps()) N ) (2) where Ps() s the packet success rate for M. Therefore, Ps() s a functon of the data length n and p(), and s llustrated n Equaton (3): Ps = (1 p()) n (3) It s obvous that the probablty to receve correctly a packet n X = 0 attempts s null, hence P(X=0) = P (X=0) = 0. We also express the MAC layer effcency as follows: E = (data_length/phy_rate)/transmsson_tme (4) As the MAC effcency n the multcast transmsson mode may depend on the recever s channel qualty, we evaluate the AP MAC effcency as perceved by each multcast member. Hence, ths effcency as perceved by a gven member M s llustrated n Equaton (5): E = (total_receved_data /PHY_rate)/transmsson_tme (5) V-B. A-MPDU aggregaton performance: As we assumed that the PHY frame header s always receved correctly, MPDU losses wthn an A-MPDU are ndependent from each other. Consequently we calculate the overhead per aggregated MPDU as the sum of the MPDU s overhead and the A-MPDU s transmsson overhead dvded by the number of aggregated MPDUs. Ths assumpton s vald snce we are transmttng MPDUs of the same length. We obtan the average A-MPDU transmsson tme n Equaton (6) for a number of A MPDUs aggregated MPDUs and a retry lmt of 7: T A MPDU = A MPDUs. where: 7 N=1 T transmsson A MPDUs _over head + T MPDU. (1 P X N 1 ) (6) T transmsson _over head = SIFS + T PHY _header and: +K SIFS + T BACK (7) T MPDU = (MPDU_overhead + L)/R (8) We defne, n Equaton (9), the mean receved MPDUs for a gven member M, A MPDUs, n order to evaluate the AP MAC effcency as perceved by M. A MPDUs = A MPDUs. P (X 7) (9) Hence, we derve n Equaton (10), the effcency equaton for the A-MPDU scheme as perceved by M : E A MPDU = A MPDUs.L/R (10) T A MPDU V-C. A-MSDU aggregaton performance: We consder the two-level aggregaton scheme n order to evaluate the MAC effcency usng the A-MSDU scheme when the length of aggregated MSDUs exceeds the maxmum supported length of 7935 bytes of the A-MSDU. Thus, we consder two cases: A MSDUs 5 and A MSDUs 5, where A MSDUs s the number of aggregated MSDUs. In the frst case only one A- MSDU, s transmtted. When A MSDUs 5, the A-MPDU aggregaton scheme s used, and each MPDU encapsulates an A-MSDU. Therefore the maxmum supported length of an A- MSDU s lmted to 3839 bytes and no more than 2 MSDUs can be aggregated wthn an A-MSDU. For calculaton smplcty, for A MSDUs 5, we consder only even values of A MSDUs n order to obtan MPDUs wth equal szes. Case 1: A MSDUs 5 In the A-MSDU scheme, f an aggregated MSDU s receved wth errors, the entre A-MSDU s rejected. Besdes when the PHY frame carres only one A-MSDU, recevers wll reply wth ACK frames nstead of BACKs. We derve the average A-MSDU transmsson tme n Equaton (11) for A MSDUs aggregated MSDUs and a retry lmt of 7: T A MSDU = where: 7 N=1 T transmsson _over head + A MSDUs. T MSDU. (1 P(X N 1)) (11) T transmsson _over head = SIFS + T PHY _header and: +T MPDU _over head + K SIFS + T ACK (12) T MSDU = (MSDU_overhead + L)/R (13) The mean receved MSDUs for a gven member M, A MSDUs, s expressed n Equaton (14). Ths equaton s smlar to Equaton (9), however the value of P(X=N), N=1..7, wll be affected by the ncreased sze of the MPDU. A MSDUs = A MSDUs. P (X 7) (14)
6 In Equaton (15), we derve the effcency equaton for the A- MSDU scheme as perceved by M : E A MSDU = A MSDUs.L/R (15) T A MSDU Case 2: A MSDUs 5 A-MSDU evaluaton for A MSDUs 5, follows equatons defned for the A-MPDU scheme wth few changes. Thus the average A-MPDU transmsson tme s gven n Equaton (16): T A MSDU = A MSDUs 2 where:. 7 N=1 T transmsson _over h ead A MSDUs /2 + T MPDU. (1 P(X N 1)) (16) T MPDU = (T MPDU _over head + 2. T MSDU _over head + 2. L)/R (17) The expresson of T transmsson_overhead remans unchanged lke n Equaton (7). The values of A MSDUs and E A-MSDU follow Equaton (14) and Equaton (15) respectvely. V-D. Analytcal results: In Fg. 2 we evaluate the MAC layer effcency of the AP for dfferent szes of A-MSDU and A-MPDU wth three data rates: 6.5, 130 and 300Mbps. In Fg. 2 (a), (b) and (c) we consder an deal channel case (.e. bt error rate p=0). Except n Fg. 2 (a) where A-MSDU slghtly outperforms A-MPDU, both aggregaton schemes have almost the same effcency. Ths s explaned by the fact that the overhead dfference between the two schemes has no effect when usng hgh data rates. In a real channel however, the A-MPDU scheme has the hghest performance snce t carres MPDUs wth smaller szes than those carred usng the A-MSDU scheme. In Fg. 2 (g), (h) and (), when the bt error rate ncreases, ncreasng the sze of an MPDU ncreases the packet error rate and hence ncreases the average transmsson tme. Thus usng A-MSDU wth up to 5 MSDUs does not provde a real enhancement to the MAC effcency compared to the legacy mode (.e. one MSDU per frame). In Fg. 3 we show the evoluton of the MAC effcency when varyng the bt error rate. As depcted n Fg. 3 (a), when no aggregaton s used (only one MSDU per frame), the MAC layer has a reduced effcency when usng hgh data rates (130 and 300Mbps). Ths s explaned by the fact that the requred tme for transmttng the frame overhead and recevers feedbacks s mportant compared to that requred to delver the encapsulated data. Fg. 3 (b) shows that an A-MPDU behaves better than an A-MSDU wth 5 aggregated MSDUs n a bad channel condton. As depcted n Fg. 3 (d), the use of the aggregaton feature mproves the MAC effcency wth hgh data rates. Fgure 2. The AP MAC layer effcency vs. the number of aggregated frames for a multcast group of 8 members
7 Fgure 3. The AP MAC layer effcency vs. the channel bt error rate for a multcast group of 8 members VI. CONCLUSION In ths paper we ntroduced the unrelablty problem of the multcast wthn the IEEE standard and we manly focused on the aa soluton and ts extensons. We also presented both of the aggregaton schemes proposed by the n amendment, namely A-MSDU and A-MPDU. Then we hghlghted the weakness of aa extensons to provde a relable multcast delvery of aggregated frames. In order to enhance the aa amendment, we presented a new extenson for the MRG servce called MRG-IBA polcy. Ths extenson allows the amendment to take a full advantage of the n aggregaton feature. The second contrbuton of ths paper s defnng a new analytcal model to evaluate the performance of A-MSDU and A-MPDU aggregaton schemes. Ths model s defned for a relable multcast transport usng the MRG-IBA recovery polcy and allows the estmaton of the MAC layer effcency. Our model shows that both aggregaton schemes have almost the same performance. However, A-MPDU behaves better than A-MSDU n a bad channel condton. In ths study we lmted our evaluaton on the use of analytcal results. Nevertheless, valdatng our model through smulatons remans an mportant task whch s mssng n ths paper but wll be scheduled n our future works. REFERENCES [1] Wreless LAN Medum Access Control (MAC) and Physcal Layer (PHY) Specfcatons, IEEE std , [2] Wreless LAN Medum Access Control (MAC) and Physcal Layer (PHY) specfcatons: Enhancements for Hgher Throughput, IEEE std n, [3] Wreless LAN Medum Access Control (MAC) and Physcal Layer (PHY) specfcatons: MAC Enhancements for Robust Audo Vdeo Streamng, IEEE P802.11aa/D1.01, June [4] Xaol Wang, Lan Wang, Relable Multcast Mechansm n WLAN wth Extended Implct MAC Acknowledgment, IEEE VTC, [5] N. Cho, Y. Seok, T. Kwon, Y. Cho, Transparent Uncast Translaton to Improve Qualty of Multcast over Wreless LAN, IEEE CCNC, [6] N. Cho, Y. Seok, T. Kwon, Y. Cho, T. Kwon. Multcastng multmeda streams n IEEE networks: a focus on relablty and rate adaptaton, Sprnger Scence+Busness Meda, LLC [7] J. Mroll, Z. L and Th. Herfet, Wreless Feedback Cancellaton for Leader-Based MAC Layer Multcast Protocols, IEEE ICSE, [8] D. Skordouls, Q. N, H. Chen, A. Stephens, C. Lu, and A. Jamalpour, IEEE n MAC frame aggregaton mechansms for nextgeneraton hgh-throughput WLANs, IEEE Wreless Communcatons, [9] B. Gnzburg and A. Kesselman, Performance analyss of A-MSDU and A-MPDU aggregaton n IEEE n, IEEE SARNOFF, [10] A. Saf, M. Othman, S. Subramanam and N. AbdulHamd, Impact of aggregaton headers on aggregatng small MSDUs n n WLANs, ICCAIE, [11] B. Can et al., Internet Group Management Protocol, Verson 3, RFC 3376, 2002.
IEEE n Aggregation Performance Study for the Multicast
IEEE 802.11n Aggregation Performance Study for the Multicast Yousri Daldoul 1, 2, Toufik Ahmed 2, Djamal-Eddine Meddour 1 1 France Telecom - Orange Labs, France 2 LaBRI, University of Bordeaux 1, France
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationAnalysis of Collaborative Distributed Admission Control in x Networks
1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,
More informationReal-Time Guarantees. Traffic Characteristics. Flow Control
Real-Tme Guarantees Requrements on RT communcaton protocols: delay (response s) small jtter small throughput hgh error detecton at recever (and sender) small error detecton latency no thrashng under peak
More informationFast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems
Fast Retransmsson of Real-Tme Traffc n HIPERLAN/ Systems José A Afonso and Joaqum E Neves Department of Industral Electroncs Unversty of Mnho, Campus de Azurém 4800-058 Gumarães, Portugal {joseafonso,
More informationEfficient 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 informationVideo Proxy System for a Large-scale VOD System (DINA)
Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,
More informationRAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems:
Speed/RAP/CODA Presented by Octav Chpara Real-tme Systems Many wreless sensor network applcatons requre real-tme support Survellance and trackng Border patrol Fre fghtng Real-tme systems: Hard real-tme:
More informationVoice capacity of IEEE b WLANs
Voce capacty of IEEE 82.b WLANs D. S. Amanatads, V. Vtsas, A. Mantsars 2, I. Mavrds 2, P. Chatzmsos and A.C. Boucouvalas 3 Abstract-There s a tremendous growth n the deployment and usage of Wreless Local
More informationAchievable Bandwidth Estimation for Stations in Multi-Rate IEEE WLAN Cells
Achevable Bandwdth Estmaton for Statons n Mult-Rate IEEE 802. WLAN Cells Eduard Garca, Davd Vamonte, Rafael Vdal and Josep Paradells Wreless Networks Group - echncal Unversty of Catalona (UPC) {eduardg,
More informationPerformance 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 informationIEEE 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 informationCLPC: Cross-Layer Product Code for Video Multicast over IEEE
CLPC: Cross-Layer Product Code for Vdeo Multcast over IEEE 802.11 Khwan Cho and Sunghyun Cho School of Electrcal Engneerng and INMC, Seoul Natonal Unversty, Seoul, Korea E-mal: khcho@mwnl.snu.ac.kr, scho@snu.ac.kr
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationInterclass Collision Protection for IEEE e Wireless LANs
Interclass Collson Protecton for IEEE 82.e Wreless LANs Woon Sun Cho, Chae Y. Lee Dstrbuted Coordnaton Functon (DCF) n IEEE 82. and Enhanced Dstrbuted Channel Access (EDCA) n IEEE 82.e are contenton-based
More informationIR-HARQ vs. Joint Channel-Network coding for Cooperative Wireless Communication
Cyber Journals: ultdscplnary Journals n Scence and Technology, Journal of Selected Areas n Telecommuncatons (JSAT), August Edton, 2 IR-HARQ vs. Jont Channel-Network codng for Cooperatve Wreless Communcaton
More informationNetwork Coding as a Dynamical System
Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.
More informationEvaluation of an Enhanced Scheme for High-level Nested Network Mobility
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.
More informationWITH rapid improvements of wireless technologies,
JOURNAL OF SYSTEMS ARCHITECTURE, SPECIAL ISSUE: HIGHLY-RELIABLE CPS, VOL. 00, NO. 0, MONTH 013 1 Adaptve GTS Allocaton n IEEE 80.15.4 for Real-Tme Wreless Sensor Networks Feng Xa, Ruonan Hao, Je L, Naxue
More informationA Fair Access Mechanism Based on TXOP in IEEE e Wireless Networks
11 Internatonal Journal of Communcaton Networks and Informaton Securty (IJCNIS) Vol. 8, No. 1, Aprl 16 A Far Access Mechansm Based on TXOP n IEEE 8.11e Wreless Networks Marjan Yazdan 1, Maryam Kamal, Neda
More informationNetwork-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 informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationEFT: a high throughput routing metric for IEEE s wireless mesh networks
Ann. Telecommun. (2010) 65:247 262 DOI 10.1007/s12243-009-0130-1 EFT: a hgh throughput routng metrc for IEEE 802.11s wreless mesh networks Md. Sharful Islam Muhammad Mahbub Alam Md. Abdul Hamd Choong Seon
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationMobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks
MobleGrd: Capacty-aware Topology Control n Moble Ad Hoc Networks Jle Lu, Baochun L Department of Electrcal and Computer Engneerng Unversty of Toronto {jenne,bl}@eecg.toronto.edu Abstract Snce wreless moble
More informationDESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT
DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,
More informationARTICLE IN PRESS. Signal Processing: Image Communication
Sgnal Processng: Image Communcaton 23 (2008) 754 768 Contents lsts avalable at ScenceDrect Sgnal Processng: Image Communcaton journal homepage: www.elsever.com/locate/mage Dstrbuted meda rate allocaton
More information3. CR parameters and Multi-Objective Fitness Function
3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft
More informationQoS-aware routing for heterogeneous layered unicast transmissions in wireless mesh networks with cooperative network coding
Tarno et al. EURASIP Journal on Wreless Communcatons and Networkng 214, 214:81 http://wcn.euraspournals.com/content/214/1/81 RESEARCH Open Access QoS-aware routng for heterogeneous layered uncast transmssons
More informationCS 268: Lecture 8 Router Support for Congestion Control
CS 268: Lecture 8 Router Support for Congeston Control Ion Stoca Computer Scence Dvson Department of Electrcal Engneerng and Computer Scences Unversty of Calforna, Berkeley Berkeley, CA 9472-1776 Router
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
More informationTHere are increasing interests and use of mobile ad hoc
1 Adaptve Schedulng n MIMO-based Heterogeneous Ad hoc Networks Shan Chu, Xn Wang Member, IEEE, and Yuanyuan Yang Fellow, IEEE. Abstract The demands for data rate and transmsson relablty constantly ncrease
More informationOptimum 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 informationVideo 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 informationMULTIHOP wireless networks are a paradigm in wireless
400 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 17, NO. 1, JANUARY 2018 Toward Optmal Dstrbuted Node Schedulng n a Multhop Wreless Network Through Local Votng Dmtros J. Vergados, Member, IEEE, Natala
More informationScheduling and queue management. DigiComm II
Schedulng and queue management Tradtonal queung behavour n routers Data transfer: datagrams: ndvdual packets no recognton of flows connectonless: no sgnallng Forwardng: based on per-datagram forwardng
More informationVIDEO streaming over multihop wireless networks has
IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 6, NO. 12, DECEMBER 2007 1343 Dstorton-Drven Vdeo Streamng over Multhop Wreless Networks wth Path Dversty Xaoln Tong, Yanns Andreopoulos, Member, IEEE, and Mhaela
More informationOn the Exact Analysis of Bluetooth Scheduling Algorithms
On the Exact Analyss of Bluetooth Schedulng Algorth Gl Zussman Dept. of Electrcal Engneerng Technon IIT Hafa 3000, Israel glz@tx.technon.ac.l Ur Yechal Dept. of Statstcs and Operatons Research School of
More informationThe 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 informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationA 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 informationRetransmission-Based Partially Reliable Transport Service: An Analytic Model *
Retransmsson-Based Partally Relable Transport Servce: An Analytc Model * Rahm Marasl Paul D. Amer Phllp T. Conrad Computer and nformaton Scence Department Unversty of Delaware, Newark, DE 19716 USA Emal:
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationA Fair MAC Algorithm with Dynamic Priority for e WLANs
29 Internatonal Conference on Communcaton Software and Networks A Far MAC Algorthm wth Dynamc Prorty for 82.e WLANs Rong He, Xumng Fang Provncal Key Lab of Informaton Codng & Transmsson, Southwest Jaotong
More informationTechnical 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 informationPerformance 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 informationSupport Strong Consistency for Mobile Dynamic Contents Delivery Network
Nnth IEEE Internatonal Symposum on Multmeda 27 Support Strong Consstency for Moble Dynamc Contents Delvery Networ Zhou Su, Jro Katto and Yasuho Yasuda Graduate School of Scence and Engneerng, Waseda Unversty,
More informationUBICC Publishers 2008 Ubiquitous Computing and Communication Journal
UBICC Journal Ubqutous Computng and Communcaton Journal 008 Volume 3. 008-04-30. ISSN 99-844 Specal Issue on Moble Adhoc Networks UBICC ublshers 008 Ubqutous Computng and Communcaton Journal Edted by Usman
More informationResearch Article. ISSN (Print) s k and. d k rate of k -th flow, source node and
Scholars Journal of Engneerng and Technology (SJET) Sch. J. Eng. Tech., 2015; 3(4A):343-350 Scholars Academc and Scentfc Publsher (An Internatonal Publsher for Academc and Scentfc Resources) www.saspublsher.com
More informationExtension and Comparison of QoS-Enabled Wi-Fi Models in the Presence of Errors
Extenson and Comparson of QoS-Enabled W-F Models n the Presence of Errors Ioanns Papapanagotou, Georgos S. Paschos*, Stavros A. Kotsopoulos** and Mchael Devetskots Electrcal and Computer Engneerng, North
More informationDesign 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 informationEnd-to-end Distortion Estimation for RD-based Robust Delivery of Pre-compressed Video
End-to-end Dstorton Estmaton for RD-based Robust Delvery of Pre-compressed Vdeo Ru Zhang, Shankar L. Regunathan and Kenneth Rose Department of Electrcal and Computer Engneerng Unversty of Calforna, Santa
More informationRouting in Degree-constrained FSO Mesh Networks
Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Routng n Degree-constraned FSO Mesh Networks Zpng Hu, Pramode Verma, and James Sluss Jr. School of Electrcal & Computer Engneerng
More informationA Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks
A Sem-Dstrbuted oad Balancng Archtecture and Algorthm for Heterogeneous reless Networks Md. Golam Rabul Ala Choong Seon Hong * Kyung Hee Unversty, Korea rob@networkng.khu.ac.kr, cshong@khu.ac.kr Abstract
More informationA Wireless MAC Protocol with Efficient Packet Recovery
A Wreless MAC Protocol wth Effcent Packet Recovery Muhammad Naveed Aman and Bplab Skdar Department of Electcal, Computer and Systems Engneeng, Rensselaer Polytechnc Insttute, Troy NY 8 USA Abstract Exstng
More informationScalable Video Streaming over P2P Networks: A Matter of Harmony?
211 IEEE 16th Internatonal Workshop on Computer Aded Modelng and Desgn of Communcaton Lnks and Networks (CAMAD) Scalable Vdeo Streamng over P2P Networks: A Matter of Harmony? Samr Medah 1, Toufk Ahmed
More informationChannel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7
Optmzed Regonal Cachng for On-Demand Data Delvery Derek L. Eager Mchael C. Ferrs Mary K. Vernon Unversty of Saskatchewan Unversty of Wsconsn Madson Saskatoon, SK Canada S7N 5A9 Madson, WI 5376 eager@cs.usask.ca
More informationEfficient Backoff Algorithm in Wireless Multihop Ad Hoc Networks
1 Chen-Mn Wu, 2 Hu-Ka Su, 3 Wang-Has Yang *1,Correspondng Author Nanhua Unversty, cmwu@mal.nhu.edu.tw 2 Natonal Formosa Unversty, hksu@nfu.edu.tw 3 Hsupng Insttute of Technology, yangwh@mal.ht.edu.tw do:10.4156/jact.vol3.
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationSolutions for Real-Time Communication over Best-Effort Networks
Solutons for Real-Tme Communcaton over Best-Effort Networks Anca Hangan, Ramona Marfevc, Gheorghe Sebestyen Techncal Unversty of Cluj-Napoca, Computer Scence Department {Anca.Hangan, Ramona.Marfevc, Gheorghe.Sebestyen}@cs.utcluj.ro
More informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More informationChannel-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 informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationTECHNICAL 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 informationBANDWIDTH 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 informationInter-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 informationSRB: Shared Running Buffers in Proxy to Exploit Memory Locality of Multiple Streaming Media Sessions
SRB: Shared Runnng Buffers n Proxy to Explot Memory Localty of Multple Streamng Meda Sessons Songqng Chen,BoShen, Yong Yan, Sujoy Basu, and Xaodong Zhang Department of Computer Scence Moble and Meda System
More informationContent 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 informationExtending the Functionality of RTP/RTCP Implementation in Network Simulator (NS-2) to support TCP friendly congestion control
Extendng the Functonalty of RTP/RTCP Implementaton n Network Smulator (NS-2) to support TCP frendly congeston control Chrstos Bouras Research Academc Computer Technology Insttute and Unversty of Patras
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationReducing 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 informationA new access point selection policy for multi-rate IEEE WLANs
Internatonal Journal of Parallel, Emergent and Dstrbuted Systems Vol. 23, No. 4, August 2008, 1 20 A new access pont selecton polcy for mult-rate IEEE 802.11 WLANs Murad Abusubah, Sven Wethoelter, James
More informationTransmit Power Control Algorithms in IEEE h Based Networks
Transmt Power Control Algorthms n IEEE 82.h Based Networks Andreas J. Könsgen, Zakr Hossan, Carmelta Görg Department of Communcaton Networks Center for Informaton and Communcaton Technology (IKOM) Unversty
More informationFAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks
2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng
More informationVirtual 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 informationSynchronous Distributed Wireless Network Emulator for High-Speed Mobility: Implementation and Evaluation
Synchronous Dstrbuted Wreless Network Emulator for Hgh-Speed Moblty: Implementaton and Evaluaton Mnoru Kozum, Tomoch Ebata Yokohama Research Laboratory, Htach, Ltd., 292 Yoshda-cho, Totsuka-ku, Yokohama,
More informationA Frame Packing Mechanism Using PDO Communication Service within CANopen
28 A Frame Packng Mechansm Usng PDO Communcaton Servce wthn CANopen Mnkoo Kang and Kejn Park Dvson of Industral & Informaton Systems Engneerng, Ajou Unversty, Suwon, Gyeongg-do, South Korea Summary The
More informationGoals and Approach Type of Resources Allocation Models Shared Non-shared Not in this Lecture In this Lecture
Goals and Approach CS 194: Dstrbuted Systems Resource Allocaton Goal: acheve predcable performances Three steps: 1) Estmate applcaton s resource needs (not n ths lecture) 2) Admsson control 3) Resource
More informationSLAM 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 informationA protocol for mixed-criticality management in switched Ethernet networks
A protocol for mxed-crtcalty management n swtched Ethernet networks Olver CROS, Laurent GEORGE Unversté Pars-Est, LIGM / ESIEE, France cros@ece.fr,lgeorge@eee.org Xaotng LI ECE Pars / LACSC, France xaotng.l@ece.fr
More informationPriority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks
Prorty-Based Schedulng Algorthm for Downlnk Traffcs n IEEE 80.6 Networks Ja-Mng Lang, Jen-Jee Chen, You-Chun Wang, Yu-Chee Tseng, and Bao-Shuh P. Ln Department of Computer Scence Natonal Chao-Tung Unversty,
More informationInternet Traffic Managers
Internet Traffc Managers Ibrahm Matta matta@cs.bu.edu www.cs.bu.edu/faculty/matta Computer Scence Department Boston Unversty Boston, MA 225 Jont work wth members of the WING group: Azer Bestavros, John
More informationOnline Policies for Opportunistic Virtual MISO Routing in Wireless Ad Hoc Networks
12 IEEE Wreless Communcatons and Networkng Conference: Moble and Wreless Networks Onlne Polces for Opportunstc Vrtual MISO Routng n Wreless Ad Hoc Networks Crstano Tapparello, Stefano Tomasn and Mchele
More informationUSER CLASS BASED QoS DIFFERENTIATION IN e WLAN
USER CLASS BASED QoS DIFFERENTIATION IN 802.11e WLAN Amt Kejrwal, Ratan Guha School of Computer Scence Unversty of Central Florda Orlando, FL-32816 USA E-mal: {kejrwal, guha}@cs.ucf.edu Manak Chatterjee
More informationPartial Restreaming Approach for Massive Graph Partitioning.
Partal Restreamng Approach for Massve Graph Parttonng. Ghzlane Echbarth, Hamamache Kheddouc To cte ths verson: Ghzlane Echbarth, Hamamache Kheddouc. Partal Restreamng Approach for Massve Graph Parttonng..
More informationAn Information theoretical problem in interactive Multi-View Video services
An Informaton theoretcal problem n nteractve Mult-Vew Vdeo servces Alne Roumy To cte ths verson: Alne Roumy. An Informaton theoretcal problem n nteractve Mult-Vew Vdeo servces. IEEE Communcatons Socety
More informationMobility Based Routing Protocol with MAC Collision Improvement in Vehicular Ad Hoc Networks
Moblty Based Routng Protocol wth MAC Collson Improvement n Vehcular Ad Hoc Networks Zhhao Dng, Pny Ren, Qnghe Du Shaanx Smart Networks and Ubqutous Access Rearch Center School of Electronc and Informaton
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationAdvanced radio access solutions for the new 5G requirements
Advanced rado access solutons for the new 5G requrements Soumaya Hamouda Assocate Professor, Unversty of Carthage Tuns, Tunsa Soumaya.hamouda@supcom.tn IEEE Summt 5G n Future Afrca. May 3 th, 2017 Pretora,
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationSteps 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 informationReal-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 informationNETWORK LIFETIME AND ENERGY EFFICIENT MAXIMIZATION FOR HYBRID WIRELESS NETWORK
NETWORK LIFETIME AND ENERGY EFFICIENT MAXIMIZATION FOR HYBRID WIRELESS NETWORK Prasana kumar. S 1, Deepak.N 2, Tajudeen. H 3, Sakthsundaram. G 4 1,2,3,4Student, Department of Electroncs and Communcaton,
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationPricing Network Resources for Adaptive Applications in a Differentiated Services Network
IEEE INFOCOM Prcng Network Resources for Adaptve Applcatons n a Dfferentated Servces Network Xn Wang and Hennng Schulzrnne Columba Unversty Emal: {xnwang, schulzrnne}@cs.columba.edu Abstract The Dfferentated
More informationAdaptive Energy and Location Aware Routing in Wireless Sensor Network
Adaptve Energy and Locaton Aware Routng n Wreless Sensor Network Hong Fu 1,1, Xaomng Wang 1, Yngshu L 1 Department of Computer Scence, Shaanx Normal Unversty, X an, Chna, 71006 fuhong433@gmal.com {wangxmsnnu@hotmal.cn}
More informationwith `ook-ahead for Broadcast WDM Networks TR May 14, 1996 Abstract
HPeR-`: A Hgh Performance Reservaton Protocol wth `ook-ahead for Broadcast WDM Networks Vjay Svaraman George N. Rouskas TR-96-06 May 14, 1996 Abstract We consder the problem of coordnatng access to the
More information6.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 informationDelay Analysis and Time-Critical Protocol Design for In-Vehicle Power Line Communication Systems
Delay Analyss and Tme-Crtcal Protocol Desgn for In-Vehcle Power Lne Communcaton Systems Zhengguo Sheng, Daxn Tan, Vctor C.M. Leung and Gaurav Bansal Abstract Wth the emergng automated tasks n vehcle doman,
More informationFibre-Optic AWG-based Real-Time Networks
Fbre-Optc AWG-based Real-Tme Networks Krstna Kunert, Annette Böhm, Magnus Jonsson, School of Informaton Scence, Computer and Electrcal Engneerng, Halmstad Unversty {Magnus.Jonsson, Krstna.Kunert}@de.hh.se
More information