Performance Evaluation of Multicast Video Streaming via P2P Networking
|
|
- Oswin Curtis
- 6 years ago
- Views:
Transcription
1 Secal Issue of Internatonal Journal of Comuter Alcatons ( ) on Electroncs, Informaton and Communcaton Engneerng - ICEICE o.4, Dec 20 erformance Evaluaton of Multcast Vdeo Streamng va 2 etworkng Rajesh Bhadada Brendra Ra Deartment of Electroncs& Communcaton Engneerng, M.B.M. Engneerng College, J..V.Unversty, Jodhur ABSTRACT In the ast few years, the multcast vdeo streamng va 2 networkng has become a very successful and ncreasngly oular n dstrbutng multmeda content by encouragng an mortant number of users to act as both clents and servers. Vdeo on demand (VoD) streamng one such servce where vdeos are delvered to asynchronous users wth mnmum delay and free nterconnectvty. The VoD s costly due to the lmted uload caacty of the vdeo server and tradtonal centralzed clent/server archtecture. eer-to-eer streamng technques are an aroach to allevate server load through eer-asssted sharng. roxy cachng s a key technque to reduce transmsson cost for on-demand multmeda streamng. Ths nnovatve aroach combnes the advantages of both roxy cachng and eer-to-eer clent communcatons. In ths aer, frstly we rovde a better understandng of the basc concet of multcast vdeo streamng, meda delvery structure, streamng meda storage sze, bandwdth requrement, vdeo streamng archtecture and then resent a novel aroach for the erformance evaluaton of multcast vdeo streamng va 2 networkng usng servers and roxy servers stuated between local area networks (LAs). The results demonstrate the benefts of multcast vdeo streamng on the server-roxy aths. descrbes the overvew of the system and ts model. Secton 4 resents otmal roxy cache allocaton technque. The erformance evaluatons are resented n Secton 5, n whch the effect of roxy cachng on the transmsson cost and benefts of usng multcast from server to roxy are beng observed. Fnally Secton 6 summarses conclusons. 2. MEDIA DELIVERY The meda delvery structure s dected n Fgure. Meda data can be stored and delvered to a clent ether from the local fle system or from a remote server across the network by usng streamng technques [2,3]. Data from lve contnuous meda such as lve web cams are also streamed from server to clent. A clent may be a ersonal comuter or a smaller devce such as a handheld comuter, ersonal dgtal assstant (DA) or cellular telehone. Keywords eer-to-eer (2) networkng, roxy cachng, Vdeo Streamng, Local Area etwork (LA), Multcast, Vdeo on demand (VoD). ITRODUCTIO The multcast vdeo streamng va eer-to-eer (2) networkng archtectures have radly gan the oularty, where clents store the meda data after the streamng servce, and act as sulyng eers by streamng the meda data to other requestng clents (eers) n the near future[,2,4,6]. 2 networks overcome the setback of bottleneck around centralzed server due to ts dstrbuted desgn and archtecture. The man am of ths aer s to understand the concet of multcast vdeo streamng and study the benefts of usng multcast nstead of uncast on the serverroxy aths. roxy cachng s an mortant technque to reduce transmsson cost for multmeda streamng. A technque to determne the otmal cache allocaton at each roxy server among dfferent vdeos, and an effcent roxy-asssted transmsson scheme when server-clent aths are multcast caable are beng studed through ths aer [9, 0]. The rest of ths aer s organzed as follows. Secton 2 exlans the meda delvery structure, the requrement of streamng bandwdth and storage sace n uncast/multcast and lve streamng envronments and exlanaton of 2 network archtecture for sngle/multle source models. Secton 3 Fg.. Meda Delvery Structure Dagram In ths aer, we consder stored vdeo streamng and ts realtme transmsson. On-demand delvery of vdeo (stored) n the real-tme transmsson s the rme art of multmeda. There are two technques for transmsson of stored vdeo namely the rogressve download technque and real tme streamng technque va 2 networkng. () rogressve download technque: In ths technque a meda fle contanng audo or vdeo s down loaded and stored on the clents local fle system. As the fle beng downloaded, the clent can lay back the meda fle wthout wat for the fle to be down loaded comletely n ts entrety. Ths technque s more useful for relatvely small meda fles such as short vdeo cls. () Real tme streamng: When the meda fle s streamed to the clent but s only layed and not stored by the clent, t s called 32
2 Secal Issue of Internatonal Journal of Comuter Alcatons ( ) on Electroncs, Informaton and Communcaton Engneerng - ICEICE o.4, Dec 20 real tme streamng. As the meda fle s not stored on the clent system, real tme streamng s referred over the rogressve download for large meda fles. It elmnates need for storage on the user system, lke full vdeo Internet rado and TV broadcasts. 2. Streamng bandwdth and storage sace The storage sace for streamng meda s calculated from the streamng bandwdth and length (n seconds) of the meda by usng the formula as gven: umber of MBytes transferred = Length n seconds Bt rate n bt / seconds Examle: hour of vdeo encoded at 500 Kbt/s requres 3, ,000.e. aroxmately 25MBytes of storage If the fle s stored on a server for on-demand streamng and ths stream s vewed by 200 eole at the same tme, then the bandwdth requrement by usng uncast, multcast and lve streamng envronments wll be determned as follows: () Uncast Streamng: It requres multle connectons from the same streamng server even when t streams the same content as dected n Fgure 2. Uncast rotocols send a searate coy of the meda stream from the server to each recent [, 8]. Uncast s the norm for most nternet connectons, but does not scale well when many users want to vew the same rogram concurrently usng a uncast rotocol, the bandwdth requrement s: 500 Kbt/s 200 = 00,000 Kbt/s = 00 Mbt/s of bandwdth. Ths s equvalent to around 45 GByte/ hour. Fg.2. Uncast Streamng () Multcast Streamng: Multcastng broadcasts the same coy of the multmeda over the entre network to a grou of clents as dected n Fgure 3. Usng a multcast rotocol the server sends out only a sngle stream that s common to all users. Hence, such a stream would only use 500 Kbt/s of servng bandwdth. Multcast rotocols are develoed to reduce the data relcaton (and consequent server/network loads) that occurs when many recents receve uncast content streams ndeendently. These rotocols send a sngle stream from the source to a grou of recents Fg.3. Multcast Streamng () Lve streamng: The calculaton for lve streamng s smlar. Let us assume that the seed of the encoder be 000 Kbt/s. If the show duraton last for 3 hours, wth 200 vewers then the bandwdth requrement s calculated as follows : Encoder seed n Kbs o. of seconds o. of vewers Kbs hours 200 o. of vewers = 264 GBytes aroxmately. 2.2 eer-to-eer (2) systems: A eer s consdered to be a rovder and a consumer of resources along wth servng caacty nto the system. These systems sgnfcantly reduce the load n the server. Unlke centralzed server- clent based schemes, 2 systems are dstrbuted systems consstng of eers nterconnected wth each other, able to self organze nto network toologes n order to share resources lke content, bandwdth, CU cycles and storage. The 2 network streamng archtecture refers to the manner used for multmeda content transfer and the enttes whch are nvolved durng the streamng mechansm [8,5]. A gven eer can lay three dfferent roles n the ersectve of 2 streamng: Source: eer contanng the meda contents and ntended to share wth other eers. eer can store whole or a art of a gven content Intermedate: An ntermedate eer, receve a gven content and then transmt t to the next ntermedate eer. Intermedate eer serves as a transort node to facltate the streamng mechansm Destnaton: It s the clent who requests for the content. Clent eer can obtaned meda contents from one or more sender eers deendng on the archtecture. We defne two knds of network archtectures namely sngle source and multle source () Sngle source: In ths case, the multmeda content s stored nto only one source eer n the network [8]. The content eer starts transmttng the content to all clent eers requestng for t and the ntermedate nodes can lay a more mortant role. Fgure 4 gves an examle of sngle source streamng towards two eer clents 33
3 Secal Issue of Internatonal Journal of Comuter Alcatons ( ) on Electroncs, Informaton and Communcaton Engneerng - ICEICE o.4, Dec 20 entrety at the roxy server, then makes the contact wth the remotely located server for the suffx of the stream. The server multcasts the requred suffx to the roxy servers, and the roxy servers multcasts the ncomng data to the clents that request the vdeo. System Model: To rovde a formal model of the system, Table ntroduces the notatons and the man concets that wll be used n ths aer. Suerscrt and subscrt have been used to reresent the ndex of the roxy and the vdeo [5,7,9,0,]. TABLE : otatons used Fg.4. Sngle-Source 2 streamng model () Multle sources: In ths case each clent eer receves ackets of a multmeda content from multle sender eers whle each sender eer can send ackets to one or multle clent eers. Fg.5. Mult-Source 2 streamng model The contents can be retreved from several eers nto the network smultaneously as dected n Fgure 5. The role of ntermedate eer s lmted to the transfer of the receved acket towards the destnaton eer. 3. OVERVIEW OF THE SYSTEM Archtecture of streamng vdeo n the nternet as shown n fgure 6 has been consdered, where a server and a set of roxes are connected [9, 3, 4, 5]. arameter V n b c c β A s v S v C ( v ) Defnton umber of vdeos Length of vdeo (unts) umber of roxes Cachng gran (smallest unt of cache allocaton) Sace of vdeo (unts) Mean bandwdth of vdeo (bts er sec.) Transmsson cost from server to roxy (er bt) Transmsson cost from roxy to ts clent (er bt) The multcast scalng factor Access robablty of vdeo at roxy Request rate for vdeo at roxy Aggregate request arrval rate for vdeos at roxy Aggregate request arrval rate for vdeo at all roxes The cache sace (unts) of roxy Length (sec) of cached refx for vdeo at roxy Storage vector of vdeos,,, v ) v =( v, v, Transmsson cost er unt tme for vdeo when the storage vector for vdeo s 2 v 3 v Fg.6: Streamng vdeo n the Internet The each roxy server s held resonsble for multle clents and they are closely located wth relatvely low communcatons costs. The server s located n remote from clents, and the communcatons among them ncur much hgher costs. We consder multcast s avalable from server to roxy and vce versa. We assume that clents always request layback from the begnnng of a vdeo. The roxy server ntercets the clents request and, f a refx of the vdeo s resent locally, streams the refx drectly to the clents. If the vdeo s not stored n ts A server wth a reostory of Constant-Bt-Rate (CBR) vdeos and roxes has been consdered. Let A be the access robablty and be the access rate of vdeo at roxy resectvely. It s assumed that the access robablty of all vdeo and the aggregate access ratet to the vdeo reostory are known a ror. Hence A and let be the aggregate request arrval rate for vdeo at all the roxy server, then. Let be the aggregate access rate to the vdeo reostory at roxy then = A. It s also assumed that 34
4 Secal Issue of Internatonal Journal of Comuter Alcatons ( ) on Electroncs, Informaton and Communcaton Engneerng - ICEICE o.4, Dec 20 cachng gran of sze u to be the smallest unt of cache allocaton and all allocatons are n multles of ths unt. The cachng gran can be one bt or one mnute of data, etc. We exress the sace of vdeo and the cache sace at each roxy server n multles as the cachng gran. Vdeo has layback bandwdth b bs, length V seconds, and sace n unts, u n = b V. roxy can store S unts where S The storage vector n. v =( v, v, v,, 2 3 v ) secfes that a refx of length v seconds for each vdeo s cached at roxy, I =,2,3,.,. It may be noted that the vdeos cached at the roxy server cannot exceed the storage lmtaton of the roxy server, that s b v S. For smlcty of exoston, etwork roagaton latency s gnored by us. On recevng a clent request for a vdeo, the roxy server determnes a transmsson schedule that deends on the transmsson scheme n use. Ths transmsson schedule secfes, for each vdeo frame, when and on what transmsson channel (uncast or multcast connecton) t wll be transmtted by the roxy server. The roxy server also determnes and requests the suffx from the server. A receton schedule s transmtted from the roxy server to the clent. It secfes, for each frame n the vdeo, when and from whch transmsson channel the clent should receve that frame. ote that a clent may need to receve data from multle transmsson channels smultaneously. Frames receved ahead of ther layback tmes are stored n a clent-sde work ahead buffer. For smlcty, we shall assume the clent has suffcent buffer sace to accommodate an entre vdeo cl. Let c s and c be the cost assocated wth transmttng one bt of vdeo data from server to roxy server and roxy server to ts clent resectvely usng uncast. To mnmze the mean transmsson cost er unt tme s aggregated over all vdeos n the reostory,.e. where C ( v C (v ) ) s the transmsson cost er unt tme for vdeo when a refx of length v of the vdeo s cached at the roxy server. When a roxy server and ts clents are located n a local area network (LA) envronment, the bandwdth requred to send one bt from the roxy to multle clents usng multcast s stll one bt. Therefore, the transmsson cost to send one bt from the roxy to multle clents s stll from server to roxy server aths, we assume the cost to transmt a bt of data from the server to m roxes usng multcast s mc s where (, ) and s m referred to as the multcast scalng factor. The mnmum value for β s n whch case the cost of transmttng a bt of data m from the server to m roxes s c s same as n a LA envronment. The cost when usng multcast n a wde area network deends on a varety of factors ncludng the multcast tree toology and the sze of the multcast grou. We make t a note that when c = 0 and mc s = the transmsson cost reduces to be the server bandwdth usage. When c = and c s = 0, the transmsson cost reduces to be the amount of outgong traffc at the roxy server. 4. OTIMAL ROXY CACHE ALLOCATIO A general technque to determne the otmal roxy refx cache allocaton for any gven roxy asssted transmsson scheme has been roosed. Let A = m {0 m refxes for vdeo, where n } denotes the set of ossble m unts s the sace and m b seconds s the length of a ossble refx of vdeo. For a gven transmsson scheme, the average transmsson cost er unt of tme for vdeo, at the roxy, 0 C ( v v ( m ), where m = ( ) s a functon of the refx V cached V. We defne savng m, m, m, m ), to be the savng n 2 the transmsson cost when storng m unts of refx of vdeo at roxy server over the cost when vdeo s not stored at the roxy server, =, 2, 3... Our man am s to maxmze the aggregate savngs and, hence, mnmze the aggregate transmsson cost over all the vdeo. The otmzaton roblem can therefore be formulated as maxmze: s.t. ( ) S, m m 3 A, ( },. savng( m ) Let B be a two-dmensonal matrx, where entry B(, j j, and ), where =( j, j 2,., j ) reresents the maxmum savng n the transmsson cost when usng vdeos and j unts of storage are allocated at roxy server, (0 ) and j (0 j S ) unts of the roxy cache. 0, = 0 B (, j ) = Max {B (-, j ), B (, j )}, > 0 Where, B, ) j ) = max {B(-, j - m ) + savng ( m )}.Ths matrx s flled n row-order startng from B (0, j = 0;, S The value B(, S ) ), j s the maxmum savng n 35
5 Secal Issue of Internatonal Journal of Comuter Alcatons ( ) on Electroncs, Informaton and Communcaton Engneerng - ICEICE o.4, Dec 20 transmsson cost when all vdeos have been used. The mnmum transmsson cost s C (0) B( S ) Snce the savng s relatve to storng nothng at the roxy. The otmal cache allocaton can now be comuted as follows. For each entry, we store a onter to an entry from whch ths current entry s comuted. By tracng back the onters from the entry B(, S ) the otmal allocaton s obtaned. 5. ERFORMACE EVALUATIO The erformance of multcast vdeo Streamng va 2 etworkng s evaluated n ths secton. The man ont s ncurred transmsson cost reducton by ntroducng roxes and clent s co-oeraton, under assumtons as follows. The vdeo storage sace n the server contans =00 CBR (constant Bt Rate) vdeos cls each of 52 Kbs rate. Ther lengths are unformly dstrbuted n between 00 and 40 mnutes; the mean (20 mnutes) s a tycal length of a move. We assume the access robabltes of the vdeos follow a Zf dstrbuton wth skew factor θ = The cache gran (unt) s set to the sze of one mnute vdeo data. All the cache saces dscussed n ths secton are normalzed by the total sace of the vdeo reostory, and the transmsson costs are normalzed by the corresondng cost of a system wth no cache. The transmsson cost s normalzed by both the vdeo bandwdth and the value of cs. That s, the normalzed transmsson cost C s (v ) / (c b ) Let ĉ = c /c s. In ths secton, we assume ĉ (0, ). It s observed that ĉ =0 corresonds to c =0 and ĉ = corresonds c = c s.we reresent the roxy cache sace as a ercentage r, reresents sace of the vdeo reostory. Fg.7. Relatve reducton of transmsson cost over no refx Cachng Furthermore, the reducton s more mressve for ĉ = 0 and ĉ = 0.3.Ths s because, for lower values of the savngs from transmttng drectly from the roxy cache to the clents s more mressve. Fnally, we observe smlar characterstcs for other request arrval rates. ()Benefts of usng multcast from server to roxy server ath: Fgure 8 dects the transmsson cost when usng multcast and uncast on the server to roxy server aths as a functon of the roxy server cache sace for =50/mnute and β = 0.4. Usng multcast on the server to roxy server aths leads to a sgnfcant savng of transmsson cost for small and medum roxy server cache sace only. We observe that by usng multcast the transmsson cost reduces by 32% and 9% over that usng uncast for ĉ = 0 and ĉ = 0.3 resectvely and uncast archtecture, when usng β= 0.4 & =50/mnute Homogeneous roxy servers have been consdered that s, the confguratons for all the roxy servers are the same, ncludng roxy cache sace, vdeo access robabltes, aggregate arrval rate,67 c s and c, etc. We assume that the aggregate arrval rate ranges from 0 to 500 requests er mnute. The total number of roxes = 0 or 00. The multcast scalng factor ranges n (, ). The erformance trends under =0 and =00 are smlar, hence n ths aer =00 has been assumed. () The effect of roxy cachng on the transmsson cost: We observe that the roxy server cachng leads to lower network transmsson cost n all the settngs. Ths s exected snce data from the server ass the roxy server and hence transmttng a stream drectly from a roxy ncurs less cost than from the server. We defne the relatve reducton under otmal roxy cache allocaton over no roxy cachng to be the dfference n the costs under these two settngs dvded by the cost wthout roxy cachng. Fgure 7 lots the relatve reducton thus defned when the aggregate arrval rate to a roxy s 50 er mnute and β ranges from 0.2 to 0.8. It s observed that a relatvely small roxy cache (%-0% of the vdeo reostory) s suffcent to realze substantal savngs n transmsson cost and the roxy cache sze has a dmnshng effect on the cost savngs. Fg.8. Comarson of the transmsson cost between multcast As the roxy cache ncreases, more contents are transmtted from the roxy servers cache drectly and the cost on the server-roxy aths becomes less domnant n the total cost. That exlans why transmsson costs usng multcast and uncast on the server to roxy server aths become close for large roxy cache saces. We observe that the cost savngs from usng multcast on serverroxy aths are more sgnfcant for small values of ĉ. Ths s because, n that case, the cost on the server to roxy server aths s more domnant n the total cost and the benefts of usng multcast are more obvous. 36
6 Secal Issue of Internatonal Journal of Comuter Alcatons ( ) on Electroncs, Informaton and Communcaton Engneerng - ICEICE o.4, Dec COCLUSIO Revew of the basc concet of meda delvery structure, storage sace and bandwdth requrement of uncast/multcast/lve streamng envronment, 2 streamng model as sngle source and multle source and roxy server-clent catchng system that combnes the best features of roxy cachng and eer-to-eer networkng has been carred. Technques for dstrbutng vdeo streamng among the roxy server and clent are surveyed. The erformance has been evaluated under varous system confguratons. The man fndngs can be summarzed as follows () roxy server based archtecture sgnfcantly reduces the transmsson cost for on demand vdeo streamng () for the same roxy sze, use of refx cachng for a set of vdeos result n sgnfcantly lower transmsson costs comared to entre-object cachng olces () under otmal refx cachng, a relatvely small roxy cache (%-0% of the vdeo reostory) s suffcent to realze substantal savngs n transmsson cost (v)the allocaton under otmal refx cachng s senstve to the transmsson scheme, the aggregate arrval rate and the value of ĉ. The benefts of usng multcast from server to roxy server ath have been consdered. Fnally t can be seen that the combnaton of these technques and 2 networkng for multcast vdeo streamng has otental to fulfll future meda nternet challenges. Future nternet ntatves should be taken to take nto consderatons these technques whle desgnng new archtectures and rotocols to enable future ersonalzed alcatons and servces, oeratng under hgh heterogeneous and dynamc envronments for maxmzng the QoS of the users. 7. REFERECES [] Jagadeesh M. Dyaber, Karthk Kannan, and Vjay S. a, Storage Otmzaton for a eer-to-eer Vdeo-on-Demand etwork, MMSys 0, February 22 23, 200, [2] Yfeng He, Ivan Lee and Lng Guan, Dstrbuted Throughut Maxmzaton n 2 VoD Alcatons IEEE TRASACTIOS O MULTIMEDIA, VOL., O.3, ARIL 2009 [3] Brendra Ra and Rajesh Bhadada, Futurstc Scoe of Automated Vdeo on demand System: Vson and Desgn Internatonal Conference on Emergng & Futurstc System and Technology, at LIET, Alwar (Raj.), Arl 2009 [4] Alvaro Chalar Zúñga, Deartamento Arqutectura decomutadoresy Sstemas Oeratvos, Unversdad Autónoma de Barcelona, System Analyss of a eer-to-eer Vdeo-on- Demand Archtecture Kangaroo, 2008 [5] Weqang Sun, Kan Ln and Yang Guan, erformance Analyss of a Fnte Duraton Multchannel Delvery Metho n ITV IEEE TRASACTIOS O BROADCASTIG, VOL. 54, O. 3, SETEMBER 2008 [6] Bn Cheng, Xu zheng Lu, Zheng Zhang, Ha Jn,Lex Sten, Xaofe Lao, Evaluaton and otmzaton of a eer- to-eer vdeo-on-demand system, Journal of Systems Archtecture 54 (2008) , December 2007 [7] Thoun F. and Coates M., Vdeo-on-Demand etworks: Desgn Aroaches and Future Challenges, n IEEE etwork, Volume 2, Issue 2, ages 42-48, March Arl [8] D. Meddour, M. Mushtaqm, and T. Ahmed. Oen Issues n 2 Multmeda Streamng. MULTICOMM. Istambul. Jun [9] B. Wang, S. Sen, M. Adlerand D. Towsley, Usng Multcast for streamng vdeos across wde area networks, Tech. Re , Deartment of Comuter Scence, Unversty of Massachusetts, Amherst, 2003 [0] B.Wang, S. Sen, M. Adler and D. Towsley, Otmal roxy Cache allocaton for effcent streamng meda dstrbuton, n ro. IEEE IFOCOM, [] J. C. I. Chuang and M.A. Srb, rcng Multcast Communcaton: Acost-based aroach, Telecommuncaton Systems, vol. 7, no.3, , 200. [2] Daeng Wu, Ywe Thomas Hou, Wenwu Zhu, Ya-Qn Zhang, and Jon M. eha, Streamng Vdeo over the Internet: Aroaches and Drectons IEEE Transactons on Crcuts and Systems for Vdeo Technology, Vol., o. 3, , March 200 [3] D. Wu,Y. T. Hou,and Y.-Q.Zhang, Transortng Real- Tme Vdeo over the Internet: Challenges and Aroaches, roceedngs of the IEEE, vol. 88, no. 2, Dec [4] L. Gao and D. Towsley, Threshold-based multcast for Contnuous meda delvery, IEEE Transactons on Multmeda, vol. 3, , December 200. [5] Bruce A.Mah, Srnvasan Seshan, Kmberly Keeton, Randy H. Katz, Domenco Ferrar, rovdng etwork Vdeo Servce to Moble Clents, Aeared n roceedngs of the Fourth Worksho on Workstaton Oeratng Systems, aa, CA, October
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 informationEfficient Caching of Video Content to an Architecture of Proxies according to a Frequency-Based Cache Management Policy
Effcent Cachng of Vdeo Content to an Archtecture of Proxes accordng to a Frequency-Based Cache Management Polcy Anna Satsou, Mchael Pateraks Laboratory of Informaton and Comuter Networks Deartment of Electronc
More informationA Scheduling Algorithm of Periodic Messages for Hard Real-time Communications on a Switched Ethernet
IJCSNS Internatonal Journal of Comuter Scence and Networ Securty VOL.6 No.5B May 26 A Schedulng Algorthm of Perodc Messages for Hard eal-tme Communcatons on a Swtched Ethernet Hee Chan Lee and Myung Kyun
More informationKeywords: Cloud Computing, Resource Allocation, Queueing Theory, Performance Measures.
Volume, Issue 9, Setember ISSN: 77 8X Internatonal Journal of Advanced Research n Comuter Scence and Software Engneerng Research Paer Avalable onlne at: wwwjarcssecom Resource Allocaton n Cloud Comutng
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 informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationLoad-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 informationSecurity Enhanced Dynamic ID based Remote User Authentication Scheme for Multi-Server Environments
Internatonal Journal of u- and e- ervce, cence and Technology Vol8, o 7 0), pp7-6 http://dxdoorg/07/unesst087 ecurty Enhanced Dynamc ID based Remote ser Authentcaton cheme for ult-erver Envronments Jun-ub
More informationII. RELATED WORK AND BACKGROUND
Comarson of Bluetooth Interconnecton Methods usng BlueProbe Sewook Jung, Alexander Chang, and Maro Gerla Deartment of Comuter Scence Unversty of Calforna, Los Angeles {sewookj, acmchang, gerla}@cs.ucla.edu
More informationBroadcast Time Synchronization Algorithm for Wireless Sensor Networks Chaonong Xu 1)2)3), Lei Zhao 1)2), Yongjun Xu 1)2) and Xiaowei Li 1)2)
Broadcast Tme Synchronzaton Algorthm for Wreless Sensor Networs Chaonong Xu )2)3), Le Zhao )2), Yongun Xu )2) and Xaowe L )2) ) Key Laboratory of Comuter Archtecture, Insttute of Comutng Technology Chnese
More informationOverview. CSC 2400: Computer Systems. Pointers in C. Pointers - Variables that hold memory addresses - Using pointers to do call-by-reference in C
CSC 2400: Comuter Systems Ponters n C Overvew Ponters - Varables that hold memory addresses - Usng onters to do call-by-reference n C Ponters vs. Arrays - Array names are constant onters Ponters and Strngs
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 informationAn Approach for Congestion Control in Sensor Network Using Priority Based Application*
An Aroach for Congeston Control n Sensor Network Usng Prorty Based Alcaton* Md. Obadur Rahman Muhammad Mostafa Monowar Byung Goo Cho Choong Seon Hong Deartment of Comuter Engneerng, Kyung Hee Unversty
More informationMOBILITY-BASED MULTICAST ROUTING ALGORITHM FOR WIRELESS MOBILE AD-HOC NETWORKS: A LEARNING AUTOMATA APPROACH
بسم االله الرحمن الرحيم (الهي همه چيز را به تو مي سپارم ياريم كن) MOBILITY-BASED MULTICAST ROUTING ALGORITHM FOR WIRELESS MOBILE AD-HOC NETWORKS: A LEARNING AUTOMATA APPROACH JAVAD AKBARI TORKESTANI Deartment
More informationShared Running Buffer Based Proxy Caching of Streaming Sessions
Shared Runnng Buffer Based Proxy Cachng of Streamng Sessons Songqng Chen, Bo Shen, Yong Yan, Sujoy Basu Moble and Meda Systems Laboratory HP Laboratores Palo Alto HPL-23-47 March th, 23* E-mal: sqchen@cs.wm.edu,
More 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 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 informationConcurrent Apriori Data Mining Algorithms
Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng
More informationBayesian Networks: Independencies and Inference. What Independencies does a Bayes Net Model?
Bayesan Networks: Indeendences and Inference Scott Daves and Andrew Moore Note to other teachers and users of these sldes. Andrew and Scott would be delghted f you found ths source materal useful n gvng
More informationTraffic Classification Method Based On Data Stream Fingerprint
5th nternatonal Conference on Advanced Materals and Comuter Scence (CAMCS 6) Traffc Classfcaton Method Based On Data Stream Fngerrnt Kefe Cheng, a, Guohu We,b and Xangjun Ma3,c College of Comuter Scence
More informationQuantifying Performance Models
Quantfyng Performance Models Prof. Danel A. Menascé Department of Computer Scence George Mason Unversty www.cs.gmu.edu/faculty/menasce.html 1 Copyrght Notce Most of the fgures n ths set of sldes come from
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationE-DEEC- Enhanced Distributed Energy Efficient Clustering Scheme for heterogeneous WSN
21 1st Internatonal Conference on Parallel, Dstrbuted and Grd Comutng (PDGC - 21) E-DEEC- Enhanced Dstrbuted Energy Effcent Clusterng Scheme for heterogeneous WSN Parul San Deartment of Comuter Scence
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 informationOptimized Query Planning of Continuous Aggregation Queries in Dynamic Data Dissemination Networks
WWW 007 / Trac: Performance and Scalablty Sesson: Scalable Systems for Dynamc Content Otmzed Query Plannng of Contnuous Aggregaton Queres n Dynamc Data Dssemnaton Networs Rajeev Guta IBM Inda Research
More informationIMRT workflow. Optimization and Inverse planning. Intensity distribution IMRT IMRT. Dose optimization for IMRT. Bram van Asselen
IMRT workflow Otmzaton and Inverse lannng 69 Gy Bram van Asselen IMRT Intensty dstrbuton Webb 003: IMRT s the delvery of radaton to the atent va felds that have non-unform radaton fluence Purose: Fnd a
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 Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
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 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 informationAdvanced LEACH: A Static Clustering-based Heteroneous Routing Protocol for WSNs
Advanced LEACH: A Statc Clusterng-based Heteroneous Routng Protocol for WSNs A. Iqbal 1, M. Akbar 1, N. Javad 1, S. H. Bouk 1, M. Ilah 1, R. D. Khan 2 1 COMSATS Insttute of Informaton Technology, Islamabad,
More informationTime-based Adaptive Retry for Wireless Video Streaming 1
Tme-based Adatve etry for Wreless Vdeo Streamng 1 Me-Hsuan Lu, Peter Steenkste, and Tsuhan Chen Electrcal and Comuter Engneerng Deartment Carnege Mellon Unversty 5000 Forbes Avenue, Pttsburgh PA 15213-3890,
More informationAnalytical Performance Analysis of Network- Processor-Based Application Designs
Analytcal Performance Analyss of Networ- Processor-Based Alcaton Desgns e Lu BMC Software Inc. Waltham, MA e Wang Unversty of Massachusetts Lowell, MA Abstract Networ rocessors (NP) are desgned to rovde
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 informationApplication of Genetic Algorithms in Graph Theory and Optimization. Qiaoyan Yang, Qinghong Zeng
3rd Internatonal Conference on Materals Engneerng, Manufacturng Technology and Control (ICMEMTC 206) Alcaton of Genetc Algorthms n Grah Theory and Otmzaton Qaoyan Yang, Qnghong Zeng College of Mathematcs,
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
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 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 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 informationOptimized caching in systems with heterogeneous client populations
Performance Evaluaton 42 (2000) 163 185 Optmzed cachng n systems wth heterogeneous clent populatons Derek L. Eager a,, Mchael C. Ferrs b, Mary K. Vernon b a Department of Computer Scence, Unversty of Saskatchewan,
More informationTHE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY
Proceedngs of the 20 Internatonal Conference on Machne Learnng and Cybernetcs, Guln, 0-3 July, 20 THE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY JUN-HAI ZHAI, NA LI, MENG-YAO
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
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 informationA Base Station-Coordinated Contention Resolution for IEEE PMP Networks
A Base Staton-Coordnated Contenton Resoluton for IEEE 802.6 PMP Networks Wenyan Lu, Weja Ja,2, Wenfeng Du, and Ldong Ln 2 School of Informaton Scence & Engneerng, Central South Unversty, Changsha, 40083,
More informationDynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 008 proceedngs. Dynamc Bandwdth Provsonng wth Farness and Revenue Consderatons
More informationA Low-Overhead Routing Protocol for Ad Hoc Networks with selfish nodes
A Low-Oerhead Routng Protocol for Ad Hoc Networks wth selfsh nodes Dongbn Wang 1, Xaofeng Wang 2, Xangzhan Yu 3, Kacheng Q 1, Zhbn Xa 1 1 School of Software Engneerng, Bejng Unersty of Posts and Telecommuncatons,100876,
More informationVRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More 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 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 informationDistortion-Memory Tradeoffs in Cache-Aided Wireless Video Delivery
Dstorton-Memory Tradeoffs n Cache-Aded Wreless Vdeo Delvery P. Hassanzadeh, E. Erkp, J. Llorca, A. Tulno arxv:1511.03932v1 [cs.it] 12 Nov 2015 Abstract Moble network operators are consderng cachng as one
More informationModeling TCP Throughput: A Simple Model and its Empirical Validation
Modelng TCP Throughut: A Smle Model and ts mrcal Valdaton Jtendra Padhye, Vctor Frou, Don Towsley, Jm Kuros 0-09-9 Presenter: Ognjen Vukovc Modelng TCP Throughut: A Smle Model and ts mrcal Valdaton Motvaton
More informationA Novel TCP with Dynamic Burst-Contention Loss Notification over OBS Networks
A Novel TCP wth Dynamc Burst-Contenton Loss Notfcaton over OB Networks Basem hhada 1 and Pn-Han Ho 1, 1 D. R. Chraton chool of Comuter cence, Unversty of Waterloo, Waterloo, Canada Deartment of Electrcal
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 informationWightman. Mobility. Quick Reference Guide THIS SPACE INTENTIONALLY LEFT BLANK
Wghtman Moblty Quck Reference Gude THIS SPACE INTENTIONALLY LEFT BLANK WIGHTMAN MOBILITY BASICS How to Set Up Your Vocemal 1. On your phone s dal screen, press and hold 1 to access your vocemal. If your
More informationDEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS
DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS Arun Avudanayagam Yuguang Fang Wenjng Lou Department of Electrcal and Computer Engneerng Unversty of Florda Ganesvlle, FL 3261
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 informationScalable Download Protocols
Scalable Download Protocols A Thess Submtted to the College of Graduate Studes and Research In Partal Fulfllment of the Requrements For the Degree of Doctor of Phlosophy In the Department of Computer Scence
More informationVISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
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 informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationIEEE n Aggregation Performance Study for the Multicast
IEEE 802.11n 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 802.11n Aggregaton
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 informationGentle Early Detection Algorithm
Gentle Early etecton Algorthm Hussen Abdel-jaber 1, Mahmoud Abdeljaber 2, Hussen Abu Mansour 1, Malak El-Amr 1 1 Faculty of Comuter Studes, eartment of Informaton Technology and Comutng, Arab Oen Unversty,
More informationUSEFUL AUTHENTICATION MECHANISM FOR IEC BASED SUBSTATIONS
USEFUL AUTHENTICATION MECHANISM FOR IEC 61850-BASED SUBSTATIONS Nastaran Abar M.H.Yaghmaee Davod Noor S.Hedaat Ahbar abar.nastaran@gmal.com yaghmaee@eee.org Hed_lan@yahoo.com ABSTRACT By ncreasng the use
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More 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 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 informationAdvanced Computer Networks
Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans
More 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 informationMaking Name-Based Content Routing More Efficient than Link-State Routing
Makng Name-Based Content Routng More Effcent than Lnk-State Routng Ehsan Hemmat and J.J. Garca-Luna-Aceves, Comuter Engneerng Deartment, UC Santa Cruz, Santa Cruz, CA 95064 PARC, Palo Alto, CA 94304 {
More informationACCURATE BIT ALLOCATION AND RATE CONTROL FOR DCT DOMAIN VIDEO TRANSCODING
ACCUATE BIT ALLOCATION AND ATE CONTOL FO DCT DOMAIN VIDEO TANSCODING Zhjun Le, Ncolas D. Georganas Multmeda Communcatons esearch Laboratory Unversty of Ottawa, Ottawa, Canada {lezj, georganas}@ mcrlab.uottawa.ca
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 informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationAdaptive Power-Aware Prefetch in Wireless Networks
Adaptve Power-Aware Prefetch n Wreless Networks Langzhong Yn, Student Member, IEEE, and Guohong Cao, Member, IEEE Abstract Most of the prefetch technques used n the current cache management schemes do
More informationCombined 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 informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 35, NO. 3, MARCH
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 35, NO. 3, MARCH 07 7 A Game Theoretc Aroach for Dstrbuted Resource Allocaton and Orchestraton of Softwarzed Networks Salvatore D Oro, Student Member,
More informationA Model for System Resources in Flexible Time-Triggered Middleware Architectures
A Model for System Resources n Flexble Tme-Trggered Mddleware Archtectures Adran Noguero 1, Isdro Calvo 2, Lus Almeda 3, and Una Gangot 2 1 Tecnala, Software Systems Engneerng Unt, Parque Tecnológco de
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 informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
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 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 informationA Traffic Aware Routing Protocol for Congestion Avoidance in Content-Centric Network
, pp.69-80 http://dx.do.org/10.14257/jmue.2014.9.9.08 A Traffc Aware Routng Protocol for Congeston Avodance n Content-Centrc Network Jung-Jae Km 1, Mn-Woo Ryu 2*, S-Ho Cha 3 and Kuk-Hyun Cho 1 1 Dept.
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationA new Algorithm for Lossless Compression applied to two-dimensional Static Images
A new Algorthm for Lossless Comresson aled to two-dmensonal Statc Images JUAN IGNACIO LARRAURI Deartment of Technology Industral Unversty of Deusto Avda. Unversdades, 4. 48007 Blbao SPAIN larrau@deusto.es
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 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 informationAvailable online at ScienceDirect. Procedia Computer Science 94 (2016 )
Avalable onlne at www.scencedrect.com ScenceDrect Proceda Comuter Scence 94 (2016 ) 176 182 The 13th Internatonal Conference on Moble Systems and Pervasve Comutng (MobSPC 2016) An Effcent QoS-aware Web
More informationI 2 C: A Holistic Approach to Prolong the Sensor Network Lifetime
: A Holstc Aroach to Prolong the Sensor Network Lfetme Yang Peng, Z L, Da Qao, and Wensheng Zhang Iowa State Unversty, Ames, IA 511 {yangeng, zl, da, wzhang}@astate.edu Abstract We resent a novel holstc
More informationRemote Sensing Image Retrieval Algorithm based on MapReduce and Characteristic Information
Remote Sensng Image Retreval Algorthm based on MapReduce and Characterstc Informaton Zhang Meng 1, 1 Computer School, Wuhan Unversty Hube, Wuhan430097 Informaton Center, Wuhan Unversty Hube, Wuhan430097
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 Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationA 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 informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationSample Solution. Advanced Computer Networks P 1 P 2 P 3 P 4 P 5. Module: IN2097 Date: Examiner: Prof. Dr.-Ing. Georg Carle Exam: Final exam
Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans
More 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 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 informationOptimal Rate Allocation for ISP-friendly P2P VoD Systems
JOURNAL OF NETWORKS, VOL. 9, NO. 7, JULY 0 7 Optmal Rate Allocaton for ISP-frendly PP VoD Systems Yun He, Zhongyang Xong, and Xaoln Tan Department of Computer Scence, Chongqng Unversty, Chongqng 000, Chna
More informationNeeded Information to do Allocation
Complexty n the Database Allocaton Desgn Must tae relatonshp between fragments nto account Cost of ntegrty enforcements Constrants on response-tme, storage, and processng capablty Needed Informaton to
More informationGame Based Virtual Bandwidth Allocation for Virtual Networks in Data Centers
Avaable onlne at www.scencedrect.com Proceda Engneerng 23 (20) 780 785 Power Electroncs and Engneerng Applcaton, 20 Game Based Vrtual Bandwdth Allocaton for Vrtual Networks n Data Centers Cu-rong Wang,
More information