An effective hop-by-hop Interest shaping mechanism for CCN communications
|
|
- Beryl Harrington
- 6 years ago
- Views:
Transcription
1 An effective hop-by-hop Inteest shaping mechanism fo CCN communications Natalya Rozhnova, Sege Fdida To cite this vesion: Natalya Rozhnova, Sege Fdida. An effective hop-by-hop Inteest shaping mechanism fo CCN communications. INFOCOM NOMEN wokshop, Ma 2012, Olando, Floida, United States. pp , 2012, < /INFCOMW >. <hal > HAL Id: hal Submitted on 28 May 2014 HAL is a multi-disciplinay open access achive fo the deposit and dissemination of scientific eseach documents, whethe they ae published o not. The documents may come fom teaching and eseach institutions in Fance o aboad, o fom public o pivate eseach centes. L achive ouvete pluidisciplinaie HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau echeche, publiés ou non, émanant des établissements d enseignement et de echeche fançais ou étanges, des laboatoies publics ou pivés.
2 An effective hop-by-hop Inteest shaping mechanism fo CCN communications Natalya Rozhnova Univesité Piee et Maie Cuie (UPMC) Sobonne Univesité - CNRS Laboatoie d Infomatique de Pais 6 (LIP6) Pais, Fance natalya.ozhnova@lip6.f Sege Fdida Univesité Piee et Maie Cuie (UPMC) Sobonne Univesité - CNRS Laboatoie d Infomatique de Pais 6 (LIP6) Pais, Fance sege.fdida@lip6.f Abstact We intoduce a ate-based congestion contol mechanism fo Content-Centic Netwoking (CCN). It builds on the fact that one Inteest etieves at most one Data packet. Congestion can occu when aggegate convesations aive in excess and fill up the tansmission queue of a CCN oute. We compute the available capacity of each CCN oute in a distibuted way in ode to shape thei convesations Inteest ate and theefoe, adjust dynamically thei Data ate and tansmission buffe occupancy. We demonstate the convegence popeties of this Hop-by-hop Inteest Shaping mechanism (HoBHIS) and povide a pefomance analysis based on vaious scenaios using ou ns 2 simulation envionment. I. INTRODUCTION The inceasing impotance of content has tiggeed a temendous inteest fom the netwoking eseach community, moving away fom packets and getting close to the sevice deliveed to the use. In paticula, the achitectue of Content- Centic Netwoking (CCN) poposed by Van Jacobson and al. in [1] appeas as the most popula one. At this stage, CCN defines design pinciples and has developed a CCNx Open Souce Platfom. Howeve, many functionalities ae still at an ealy stage, o have been consideed in vey simple contexts. CCN decouples the sende fom the eceive in a mode that is simila to the Publish and Subscibe sevice model. Content names ae used instead of netwok addesses to convey the infomation to the inteested paties. The content might be located anywhee in the netwok thanks to extensive caching capabilities. Theefoe, the data is not necessaily associated with the content publishe as the content can be deliveed by any cache in the netwok. In CCN, the equest fom the content consume is called Inteest and the pat of the associated content is called a Chunk o Data. We will name a steam of Inteest/Chunk pais a Convesation. Taffic engineeing has been lightly addessed in CCN. Congestion might aise in such netwoks as chunks can satuate the tansmission buffe of a netwok face. It is thus necessay to egulate the steam of chunks, and theefoe, the associated steam of inteest in ode to avoid congestion and pefomance degadation. This poblem has not yet been fomalized and studied in CCN. In this pape, we popose a congestion contol mechanism fo CCN, based on hop-by-hop Inteest shaping. It elies on the assumption that any CCN oute can contol the futue ate of data-chunks it will eceive by shaping the ate of the Inteest it is cuently sending towads content povides, as one Inteest etieves at most one Data packet. We monito the level of Chunks stoed in the oute tansmission buffe in ode to dynamically adjust the associated Inteests ate that have geneated the Chunks in that buffe. We povide a simple analytical model to demonstate the convegence of ou algoithm, complemented by simulation esults to evaluate the behaviou of ou solution in moe complex settings. The emainde of the pape is oganized as follows: Section III is devoted to a bief desciption of a CCN node. We discuss congestion in CCN and intoduce taffic contol issues in section IV. Ou congestion contol algoithm is pesented in Section V. A simple mathematical model is deived in Section VI and VII in ode to highlight the convegence popeties of ou algoithm. The pefomance of ou solution is evaluated by ns 2 simulation and discussed in section VIII. Section IX concludes the pape and highlights futue wok. II. RELATED WORK Infomation Centic Netwoks (ICN) is widely studied [3] with solutions such as PSIRP [4] o DONA [5]. The CCN famewok was fist intoduced by Van Jacobson and the PARC eseach goup in [1], [2]. Vaious issues aising in CCN have been consideed such as content oute issues [6], data tansfe modelling [7] o chunk-level caching [8]. In [9] the authos have pesented the modelling and evaluation of caching policies based on Makov chains. CCN Congestion contol has not been studied yet, aguing that its hop-by-hop contol will enfoce a easonable level of pefomance. Some peliminay wok on a tanspot potocol fo CCN is pesented by S. Aianfa and al. in [13]. This potocol is based on the TCP congestion window pinciples but uses Data packets as acknowledgments to enfoce decisions to incease o decease the congestion window. Congestion can appea in CCN and theefoe, we pomote the utilization of an algoithm to contol the level of congestion of CCN outes filled by Data packets. We follow simila pinciples as in [14], whee the authos pesent ERAQLES, a ate contol mechanism fo Available Bit Rate (ABR) ATM communications, and define an analytical
3 Fig. 1. The CCN node model method to compute the advetised explicit ate to which the souces have to adapt. A simila wok is pesented in [15]. In [16], the authos descibe a ate-based hop-by-hop congestion contol mechanism in which a desied sevice ate is computed at each switch as a function of the taget queue occupancy. Feedback infomation is then exchanged between neighbo switches so that they can dynamically adjust the sevice ate fo each connection. III. CCN NODE MODEL In this section we descibe the CCN node model and discuss the most meaningful popeties of CCN fo ou wok. The geneal CCN node model was intoduced in [1]. A simple oute model is illustated in Figue 1. In this figue, we omit the fowading infomation base (FIB) and the pending inteest table (PIT). The fome is used to fowad Inteests towad the data souce while the late keeps tack of the fowaded Inteests so that the etuned Chunks can be sent to its equesto. We fist intoduce ou model of a CCN oute in ode to illustate whee congestion can appea. In [1] the authos advocate that CCN does not have FIFO queues between links but athe an LRU memoy (the cache). Howeve, in a CCN oute, it is impotant to diffeentiate the memoy allocated fo tansmiting packets fom the one used fo caching. If a single Content-Stoe was used to stoe both packets waiting fo tansmission and cached Data chunks, the whole cache will become congested by Data chunks waiting fo tansmission though the congested inteface and so it will penalize anothe convesation going though non-congested intefaces. Thus, it would be had to conceptualize the CCN node behaviou when thee is a congestion of a single output inteface. Anothe undesiable side is the huge delay induced by the filling of a vey lage cache used as a tansmission buffe, befoe congestion detection. Finally, it is cucial that at any given time, each output inteface schedules which packet is the next one to be tansmitted on the physical channel. This can be achieved with the use of pe-inteface queue athe than a single shaed cache. IV. TRAFFIC CONTROL IN CCN One key CCN popety is that one Inteest etieves at most one Data packet. This behaviou enfoces a flow balance that is maintained in the netwok and allows the communication between the diffeent machines and at diffeent speeds. The flow balance enables multiple Inteests to be issued at once. The CCN node behaviou is descibed theeafte; when a Data-chunk is eceived on one face o is etieved fom the cache by an incoming matching Inteest, it must be tansfeed to the output inteface(s). Depending on the esults of the PIT lookup, it is then queued on one o moe tansmission buffes. At the same time the Data chunk can also be stoed into the shaed cache to enable futhe etieving. Because some Data chunks will pesent vey few incentives fo being cached (shot-lived o non-popula Data chunk), the copy of data-chunks to the content stoe is not mandatoy. Caching decisions ae out-of-scope of this pape. Congestion in a CCN oute is defined as the oveflow of the buffe associated to an output inteface and manifests itself by the loss of data chunks. V. HOP-BY-HOP INTEREST SHAPING MECHANISM (HOBHIS) In this section, we pesent the hop-by-hop Inteest Shaping mechanism (HoBHIS). Evey CCN oute will contol the ate of individual Data chunks convesations by appopiately shaping the ate of the associated sending Inteests. The congestion contol scheme based on hop-by-hop inteest shaping was pefeed to an end-to-end mechanism such as TCP. Ou mechanism is poactive and the shae of the netwok capacity allocated to diffeent convesations is contolled by the algoithm implemented in each CCN node. Inteest shaping allows us to anticipate the dop of data packets due to buffe oveflow. This is anothe advantage ove TCP congestion contol scheme that stats to eact only afte the dop of one segment, unless a mechanism such as RED is used. In addition, using a hop-by-hop contol povides a feedback infomation moe quickly thanks to the smalle distances between hops. The system unde study consists of a set of CCN outes fowading Inteest packets issued by a consume. As a esponse, Data chunks ae fowaded back to the consume (namely, the souce of the Inteests). Once an Inteest has been issued by a given CCN oute, the coesponding Data chunk will be piggybacked to that oute afte a vaiable delay A(t) named Response Delay, assuming no loss. This paamete diffes fom the usual RTT fom TCP as the Data might be stoed in any cache on the path o at the publishe site (the souce of the Data). Thus, in such achitectue as CCN it is possible sometimes to obseve lage vaiations of A(t) that leads to the queue size oscillations. But thanks to the congestion contol mechanism, the queue size will be fast stabilized. We also infe that A(t) should not change dastically on shot time scales as it is likely that when the data is stoed in a given cache, it should stay thee fo some time, at least until the netwok and demand conditions have lagely evolved. The objective of HoBHIS is to avoid congestion in CCN tansmission queues by enfocing the queue size to convege to a given objective, defined as a pecentage of the capacity of that buffe. We achieve this objective by shaping the Inteest ate. In ode to avoid the losses of Inteests when shaping is enfoced we
4 TABLE I NOTATIONS C(t) C int (t) γ(t) A(t) e(t) B available bandwidth to send the chunks at time t available bandwidth to send the Inteests at time t shaping ate at time t delay fom Inteest to the elated content numbe of queued packets at time t buffe size queue theshold Fig. 2. Fig. 3. Repesentation of the system Repesentation of the model need some back-pessue mechanism which is out-of-scope of this pape and will be povided in futue wok. Upon aival of a Data chunk in the tansmission queue, the oute computes the Inteest ate based on the queue occupancy and the available esouces fo each convesation. It adjusts the Inteest ate accoding to this infomation. If the actual numbe of queued packets is less than some theshold value, then the oute can tempoaily incease the shaping ate. On the othe hand, if the numbe of queued packets is highe than, then the oute will decease its shaping ate. The system unde study is pesented in figue 2. The Shaping time component is esponsible fo the computation of the shaping delay that the Inteests packets will have to satisfy. Evey Inteest packet will be shaped accoding to the occupancy of the tansmission queue, as well as the paamete A(t). VI. SINGLE ROUTER MODEL Fo the pupose of the analysis, we conside the simplified model pesented in figue 3. It is chaacteized by a single convesation. In addition, all packets have the same size. The contol is applied to each chunk enteing the tansmission queue. We do not conside any caching policy o outing mechanism. The paametes and notations ae given in Table I. A. Computation of the shaping ate Let e(t) define the occupancy of a CCN oute tansmission queue expessed in numbe of chunks. We conside the following function that epesents the maximum shaping ate at time t, while still being able to contol the tansmission queue unde a feedback delay equal to A(t): γ(t) = C(t)+ B e(t),o (1) A(t) γ(t) = C(t)+h e(t), (2) A(t) whee h is a design paamete that aims to contol the dynamicity of ou scheme towads the objective. In the geneal case when thee ae F convesations flowing though a CCN node, we need to divide the available buffe capacity between all active convesations at time t. We allow each convesation to shae a pat equal to F of the total buffe capacity. If a convesation is using less than F, the emainde essouces may be used fo queue size oscillations caused by A(t) (cf. Section V). Let e i (t) be the numbe of packets fom convesation i waiting in the tansmission queue. The shaping ate fo convesation i is expessed as follows: γ i F (t) = C(t)+h e i(t), (3) A i (t) Note that the shaping ate is bounded by Cint(t) defined as the maximum capacity to send the Inteests at time t. The expession fo γ i (t) becomes: γ i F (t) = min[max[c(t)+h e i(t),0],c int (t)], (4) A i (t) It is possible fom equation (2) that the shaping ate becomes negative. In this situation, the Inteests ae blocked until eithe the tansmission queue size e(t) becomes less o equal to, o a Chunk aives at the queue and the Inteest shaping ate is e-evaluated. We use an exponential weighted moving aveage mechanism to estimate the value of A(t). B. Queue convegence In this section we demonstate that the tansmission queue length conveges to the objective. We assume a single convesation that can use the entie link capacity to send its Data. Let A j (espectively A j+1 ) be the Response Delay fo packet numbe j (espectively packet j +1). The queue evolution fo a single convesation is witten as follows: and e(t+1) = e(t)+γ(t).a j+1 C.A j+1 (5) γ(t) = C +h e(t 1) A, (6) j
5 TABLE II NOTATIONS Fig. 4. Based on above we can wite : e(t+1) = e(t) h. A j+1 A j This fomula can be simplified as with Repesentation of the model.e(t 1)+[h.. A j+1 A ] (7) j e i+1 = e i +α.e i 1 +β (8) α = h. A j+1 A, β = h.. A j+1 j A and e i 1 = e(t 1) (9) j We wite e i+1 as e i+1 = f i+1 β α (10) Then we obtain fi+1 = f i +α.f i 1, (11) which is the seies of Fibonacci. So, due to [12] we have whee z is the oot of equation Thus, we need that f i+1 = P.z i+1 (12) z = z 0 +α = 1+α (13) z < 1 (14) and if i tends to infinity then f i+1 conveges to 0. But the condition z < 1 will be tue only if : And finally, 0 < h < 2. A j A j+1 (15) lim e i = lim[ β i i α ] = (16) We found that the tansmission queue is conveging to as expected. We will obseve that we can face a bust of Data Chunks duing the initialization peiod. This is because ou algoithm stats only afte the eception of the fist data packet. Until then, the system sends the packets with the maximum available ate. This poblem is solved by limiting the initial sending ate accoding to the shaping ate fomula. We now conside F convesations. Ou shaping ate fomula is defined by: γ i F (t) = C(t)+h e i(t), (17) A i (t) It appeas that the queue size fo each convesation conveges to F. So, the total queue size will convege to as expected. λ c i aival Chunks ate to node i λ I x aival Inteests ate µ i sevice ate of node i γ i A i e i (t) B shaping ate of node i delay fom Inteest to the elated content fo node i numbe of queued packets at time t of node i buffe size queue theshold VII. NETWORK OF NODES We now extend ou simple initial scenaio to the case of a netwok of nodes. This model, descibed in Figue 4, consists of N nodes using HoBHIS. We have now a hop by hop congestion contol mechanisms using the shaping ate computed at each oute. The notations ae pesented in Table II. We stat with a single convesation flowing though the system. The Response Delay is defined by paamete A. The Chunks aive into the nodes with the ate λ c chunks/second. A. Response delay evaluation The Response Delay A of one node depends on downsteam nodes up to the oute caching the Data o the souce itself. Let s define A i and A i 1 the Response Delays fo nodes i and i 1 espectively. A i can be expessed as follows: A i = A i 1 + X 1 j=1 γ j i 1 + e i 1 µ i 1 (18) The Response Delay fo a given packet p in node i depends on the numbe of packets X queued fo tansmission ahead of p towads the downsteam node and also depends on the numbe of packets e i 1 queued befoe the esponse will be sent-back to node i. The quantity X j=1 1 γ j i 1 means that we ecompute the shaping ate γ i 1 fo each Chunk enteing the queue and hence the Inteests could be sent with diffeents ates. B. Convegence popety We have demonstated fo a single oute model that, if the minimal ate among all nodes is γ i, associated to node i, then the queue of node i conveges to. In addition, we know that lim t eγi i (t+1) = and lim t eγ k i (t+1) = (19) So, accoding to the limit inequality theoem we have: fo all othe outes shaing the same convesation s paths as oute i. VIII. PERFORMANCE EVALUATION The aim of this section is to analyze, though simulations, the pefomance of the CCN Inteest shaping mechanism. We have developed the CCN module in Netwok Simulato 2 (ns 2 ). Accoding to ou knowledge, thee is no vesion of CCN in ns 2 at the time of witing.
6 Fig. 5. Single convesation scenaio Fig. 7. Netwok topology Fig. 6. Multi convesation scenaio A. Simulation scenaio We stat with the single oute model. We conside both the single convesation and the multi-convesation scenaios pesented in Figue 5 and 6 espectively. As depicted in figue 5 and 6, ou netwok consists of the client, oute and seve components. The client sends the Inteests to the oute that takes the next decision accoding to the shaping mechanism. The seve ole is vey simple, as fo each eceived Inteest it esponds with the coesponding Chunk and sends it back to the oute. The shaping ate is computed accoding to the algoithm pesented in pevious sections. e(t) is the instantaneous measued value fo the numbe of Chunks at time t. The Inteest and Chunk packet sizes ae fixed on 500 and 1500 bytes espectively. The buffe paametes ae B=500 Chunks, = 100 Chunks, h = 0.1, 0.4 and 0.7. The clients geneate Inteests with ate Chunks/s. The links ates ae given in figue 5 and 6. The bottleneck is the 1Mb link between the client and the oute. Paamete A(t) is a andom value unifomly distibuted in [0,1] and it is geneated in the seve fo evey packet to take into account the vaiability of the path between the oute and the seve. The Netwok topology used fo the evaluation is pesented in figue 7. We conside two convesations fom clients 1 and 2 espectively. Data fo convesation 1 is in the cache of node 3. Convesation 2 flows fom Client 2 to the Seve. The inteest ate is 2500 Chunks/s fo each client. The paametes fo the buffes ae B=500 Chunks, =250 Chunks and h=0.7. The capacity of each link is 2500 Chunks. The convesation 2 stats befoe convesation 1 and afte some time it stops. We ae inteested in the buffe state fo node 3, as well as the ate fo each convesation ove time. B. Simulation esults The simulation esults fo the single convesation scenaio ae pesented in Figue 8. We have tested ou algoithm fo diffeent values of h. In Figue 8 we can see that the queue conveges to the objective as expected (cf. in Section VII). Fig. 8. Queue convegence fo single convesation scenaio The busts in these cuves ae due to the initialization peiod when the algoithm is not yet in opeation. The diffeent values of h illustates its influence fo the contol mode and convegence ate. The highehthe slowe the convegence ate towads the objective and the hade the contol. The situation epeats fo the multi convesation scenaio in Figue 9. The aveage queue size conveges to as expected (cf. Section VII). Figues 10 and 11 illustate the netwok scenaio. As we use the same capacities fo each link, the queue of evey node is empty until convesation 1 stats. Then, the queue fo node 3 stats to fill up and conveges to the objective. Figue 11 illustates the Chunks aival ates fo each convesation in Chunks/s. At time 20, convesation 1 becomes active. At time 60, convesation 2 becomes inactive. Between time 20 and 60, when the two convesations ae active, each of them eceives a faie shae of the oute esouces. The Chunks aival ate, shaed between the two convesations ae contolled by the minimal shaping ate. In figues 10 and 11 we see that ou congestion contol mechanism is able to adapt the ate and to maintain the queue length at the expected level as it was designed. IX. CONCLUSION We pesented (HoBHIS), the fist hop-by-hop Inteest shaping congestion contol mechanism designed to avoid the congestion that can occu in the output inteface of a CCN node. HoBHIS monitos the tansmission buffes of a CCN
7 Fig. 9. Queue convegence fo multi convesation scenaio Fig. 11. Chunks ates fo netwok scenaio Fig. 10. Queue state fo netwok scenaio oute to compute the Inteests ate that have poduced the associated Chunks filling these intefaces. We demonstated analytically the convegence popety of ou algoithm. In addition, we have developed a CCN implementation in ns 2. We pefomed vaious expeiments with diffeent settings and pogessive complexity. We analyzed the single and multiple convesation scenaios in a single oute model. Finally, a netwok case was studied to demonstate the behaviou of ou algoithm in moe complex conditions. We have seen that the shaping mechanism pefoms as designed. Futue wok will extend the analysis as well as the design of HoBHIS. We will conside the case whee the shaing of the esouces among competing convesations will be diffeent fom a fai shae in ode to favo impotant content. We will also exploe the complexity of ou algoithm and its scalability. Monitoing all convesations is fa too expensive but we will concentate on the active convesations only, those fo which packets ae queued in the buffe, to educe the numbe of states stoed in the oute. In addition, the inteaction with TCP will be consideed. Finally, we will study moe complex scenaios to bette assess the behaviou of ou solution. ACKNOWLEDGMENTS This wok is patly funded by the Fench national eseach agency (ANR), CONNECT poject. The authos would also like to thank Naceu Malouch fo many useful discussions and fo valuable comments. REFERENCES [1] Van Jacobson, Diana K. Smettes, James D. Thonton, Michael F. Plass, Nicholas H. Biggs, and Rebecca L. Baynad Netwoking named content. In Poceedings of the 5th intenational confeence on Emeging netwoking expeiments and technologies (CoNEXT 09). ACM, New Yok, NY, USA, [2] D. Smettes, V. Jacobson, Secuing Netwok Content, PARC Tech Repot, Octobe [3] Sege Fdida and Mohamed Diallo The netwok is a database. In Poceedings of the 4th Asian Confeence on Intenet Engineeing (AINTEC 08). ACM, New Yok, NY, USA, 1-6. [4] Publish-Subscibe Intenet Routing Paadigm (PSIRP) poject : [5] T. Koponen, M. Chawla, B. Chun, et al., A dataoiented (and beyond) netwok achitectue, ACM SIGCOMM Compute Communication Review, Volume 37, Issue 4, pp , Octobe [6] S. Aianfa, P. Nikande, and J. Ott. On content-centic oute design and implications. In Poc. of ACM ReAch 10. [7] G. Caofiglio, M. Gallo, L. Muscaiello, and D. Peino. Modeling data tansfe in content centic netwoking. In Poc. of 23d Intenational Teletafic Congess 2011 (ITC23). [8] G. Caofiglio, V. Gehlen, and D. Peino. Expeimental evaluation of stoage management in content-centic netwoking. In Poc. of IEEE ICC, [9] Ioannis Psaas, Richad G. Clegg, Raul Landa, Wei Koong Chai, and Geoge Pavlou Modelling and evaluation of CCN-caching tees. In Poceedings of the 10th intenational IFIP TC 6 confeence on Netwoking - Volume Pat I (NETWORKING 11), Jodi Domingo-Pascual, Pieto Manzoni, Ana Pont, Segio Palazzo, and Cateina Scoglio (Eds.), Vol. Pat I. Spinge-Velag, Belin, Heidelbeg, [10] J.-Y.Boudec. Rate adaptation, congestion contol and fainess: A tutoial. [11] C. Roche, S. Fdida, A Dynamic Resouce Management Mechanism fo LAN Inteconnection acoss High-Speed Netwoks, Infocom 94, Toonto, June [12] Fibonacci numbes and thei applications. Poceeding of the fist Intenational Confeence Numbes and thei Applications, Univesity of Patas, [13] S. Aianfa, J. Ott, L. Egget, P. Nikande, W. Wong. A Tanspot Potocol fo Content-centic Netwoks. Extended Abstact. 18th IEEE Intenational Confeence on Netwok Potocols (ICNP 10), Kyoto, Japan, [14] Moet, Y.; Fdida, S.; ERAQLES an efficient explicit ate algoithm fo ABR, Global Telecommunications Confeence, GLOBECOM 97., IEEE, vol.2, no., pp vol.2, 38 Nov 1997 [15] Popotional Diffeentiated Sevices: Delay Diffeentiation and Packet Scheduling. With Dimitios Stiliadis and Pamesh Ramanathan. In Poceedings of the 1999 ACM SIGCOMM confeence, Cambidge MA, Septembe [16] Patho P. Misha and Hemant Kanakia A hop by hop ate-based congestion contol scheme. In Confeence poceedings on Communications achitectues and potocols (SIGCOMM 92), David Oan (Ed.). ACM, New Yok, NY, USA, [17] CCNx poject
ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS
ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS Daniel A Menascé Mohamed N Bennani Dept of Compute Science Oacle, Inc Geoge Mason Univesity 1211 SW Fifth
More informationSlotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System
Slotted Random Access Potocol with Dynamic Tansmission Pobability Contol in CDMA System Intaek Lim 1 1 Depatment of Embedded Softwae, Busan Univesity of Foeign Studies, itlim@bufs.ac.k Abstact In packet
More informationIP Network Design by Modified Branch Exchange Method
Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management
More informationIP Multicast Simulation in OPNET
IP Multicast Simulation in OPNET Xin Wang, Chien-Ming Yu, Henning Schulzinne Paul A. Stipe Columbia Univesity Reutes Depatment of Compute Science 88 Pakway Dive South New Yok, New Yok Hauppuage, New Yok
More informationCommunication vs Distributed Computation: an alternative trade-off curve
Communication vs Distibuted Computation: an altenative tade-off cuve Yahya H. Ezzeldin, Mohammed amoose, Chistina Fagouli Univesity of Califonia, Los Angeles, CA 90095, USA, Email: {yahya.ezzeldin, mkamoose,
More informationAn Unsupervised Segmentation Framework For Texture Image Queries
An Unsupevised Segmentation Famewok Fo Textue Image Queies Shu-Ching Chen Distibuted Multimedia Infomation System Laboatoy School of Compute Science Floida Intenational Univesity Miami, FL 33199, USA chens@cs.fiu.edu
More informationConfiguring RSVP-ATM QoS Interworking
Configuing RSVP-ATM QoS Intewoking Last Updated: Januay 15, 2013 This chapte descibes the tasks fo configuing the RSVP-ATM QoS Intewoking featue, which povides suppot fo Contolled Load Sevice using RSVP
More informationThe Dual Round Robin Matching Switch with Exhaustive Service
The Dual Round Robin Matching Switch with Exhaustive Sevice Yihan Li, Shivenda S. Panwa, H. Jonathan Chao Abstact Vitual Output Queuing is widely used by fixed-length highspeed switches to ovecome head-of-line
More informationAchievable Catalog Size in Peer-to-Peer Video-on-Demand Systems
Achievable Catalog Size in Pee-to-Pee Video-on-Demand Systems Yacine Boufkhad, Fabien Mathieu, Fabien De Montgolfie, Diego Peino, Lauent Viennot To cite this vesion: Yacine Boufkhad, Fabien Mathieu, Fabien
More informationTHE THETA BLOCKCHAIN
THE THETA BLOCKCHAIN Theta is a decentalized video steaming netwok, poweed by a new blockchain and token. By Theta Labs, Inc. Last Updated: Nov 21, 2017 esion 1.0 1 OUTLINE Motivation Reputation Dependent
More informationJournal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012
2011, Scienceline Publication www.science-line.com Jounal of Wold s Electical Engineeing and Technology J. Wold. Elect. Eng. Tech. 1(1): 12-16, 2012 JWEET An Efficient Algoithm fo Lip Segmentation in Colo
More information(1) W tcp = (3) N. Assuming 1 P r 1. = W r (4) a 1/(k+1) W 2/(k+1)
1 Multi Path PERT Ankit Singh and A. L. Naasimha Reddy Electical and Compute Engineeing Depatment, Texas A&M Univesity; email: eddy@ece.tamu.edu. Abstact This pape pesents a new multipath delay based algoithm,
More informationControlled Information Maximization for SOM Knowledge Induced Learning
3 Int'l Conf. Atificial Intelligence ICAI'5 Contolled Infomation Maximization fo SOM Knowledge Induced Leaning Ryotao Kamimua IT Education Cente and Gaduate School of Science and Technology, Tokai Univeisity
More informationTowards Adaptive Information Merging Using Selected XML Fragments
Towads Adaptive Infomation Meging Using Selected XML Fagments Ho-Lam Lau and Wilfed Ng Depatment of Compute Science and Engineeing, The Hong Kong Univesity of Science and Technology, Hong Kong {lauhl,
More informationConversion Functions for Symmetric Key Ciphers
Jounal of Infomation Assuance and Secuity 2 (2006) 41 50 Convesion Functions fo Symmetic Key Ciphes Deba L. Cook and Angelos D. Keomytis Depatment of Compute Science Columbia Univesity, mail code 0401
More informationGravitational Shift for Beginners
Gavitational Shift fo Beginnes This pape, which I wote in 26, fomulates the equations fo gavitational shifts fom the elativistic famewok of special elativity. Fist I deive the fomulas fo the gavitational
More informationDynamic Topology Control to Reduce Interference in MANETs
Dynamic Topology Contol to Reduce Intefeence in MANETs Hwee Xian TAN 1,2 and Winston K. G. SEAH 2,1 {stuhxt, winston}@i2.a-sta.edu.sg 1 Depatment of Compute Science, School of Computing, National Univesity
More informationPerformance Optimization in Structured Wireless Sensor Networks
5 The Intenational Aab Jounal of Infomation Technology, Vol. 6, o. 5, ovembe 9 Pefomance Optimization in Stuctued Wieless Senso etwoks Amine Moussa and Hoda Maalouf Compute Science Depatment, ote Dame
More informationRANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES
RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES Svetlana Avetisyan Mikayel Samvelyan* Matun Kaapetyan Yeevan State Univesity Abstact In this pape, the class
More informationEE 6900: Interconnection Networks for HPC Systems Fall 2016
EE 6900: Inteconnection Netwoks fo HPC Systems Fall 2016 Avinash Kaanth Kodi School of Electical Engineeing and Compute Science Ohio Univesity Athens, OH 45701 Email: kodi@ohio.edu 1 Acknowledgement: Inteconnection
More informationThe Internet Ecosystem and Evolution
The Intenet Ecosystem and Evolution Contents Netwok outing: basics distibuted/centalized, static/dynamic, linkstate/path-vecto inta-domain/inte-domain outing Mapping the sevice model to AS-AS paths valley-fee
More informationAny modern computer system will incorporate (at least) two levels of storage:
1 Any moden compute system will incopoate (at least) two levels of stoage: pimay stoage: andom access memoy (RAM) typical capacity 32MB to 1GB cost pe MB $3. typical access time 5ns to 6ns bust tansfe
More informationModeling a shared medium access node with QoS distinction
Modeling a shaed medium access node with QoS distinction Matthias Gies, Jonas Geutet Compute Engineeing and Netwoks Laboatoy (TIK) Swiss Fedeal Institute of Technology Züich CH-8092 Züich, Switzeland email:
More informationAn Improved Resource Reservation Protocol
Jounal of Compute Science 3 (8: 658-665, 2007 SSN 549-3636 2007 Science Publications An mpoved Resouce Resevation Potocol Desie Oulai, Steven Chambeland and Samuel Piee Depatment of Compute Engineeing
More informationOn using circuit-switched networks for file transfers
On using cicuit-switched netwoks fo file tansfes Xiuduan Fang, Malathi Veeaaghavan Univesity of Viginia Email: {xf4c, mv5g}@viginia.edu Abstact High-speed optical cicuit-switched netwoks ae being deployed
More informationA Two-stage and Parameter-free Binarization Method for Degraded Document Images
A Two-stage and Paamete-fee Binaization Method fo Degaded Document Images Yung-Hsiang Chiu 1, Kuo-Liang Chung 1, Yong-Huai Huang 2, Wei-Ning Yang 3, Chi-Huang Liao 4 1 Depatment of Compute Science and
More informationAn Efficient Handover Mechanism Using the General Switch Management Protocol on a Multi-Protocol Label Switching Network
An Efficient andove Mechanism Using the Geneal Switch Management Potocol on a Multi-Potocol abel Switching Netwok Seong Gon hoi, yun Joo Kang, and Jun Kyun hoi Using the geneal switch management potocol
More informationModule 6 STILL IMAGE COMPRESSION STANDARDS
Module 6 STILL IMAE COMPRESSION STANDARDS Lesson 17 JPE-2000 Achitectue and Featues Instuctional Objectives At the end of this lesson, the students should be able to: 1. State the shotcomings of JPE standad.
More informationHierarchically Clustered P2P Streaming System
Hieachically Clusteed P2P Steaming System Chao Liang, Yang Guo, and Yong Liu Polytechnic Univesity Thomson Lab Booklyn, NY 11201 Pinceton, NJ 08540 Abstact Pee-to-pee video steaming has been gaining populaity.
More informationSimulation and Performance Evaluation of Network on Chip Architectures and Algorithms using CINSIM
J. Basic. Appl. Sci. Res., 1(10)1594-1602, 2011 2011, TextRoad Publication ISSN 2090-424X Jounal of Basic and Applied Scientific Reseach www.textoad.com Simulation and Pefomance Evaluation of Netwok on
More informationOn Adaptive Bandwidth Sharing with Rate Guarantees
On Adaptive Bandwidth Shaing with Rate Guaantees N.G. Duffield y T. V. Lakshman D. Stiliadis y AT&T Laboatoies Bell Labs Rm A175, 180 Pak Avenue Lucent Technologies Floham Pak, 101 Cawfods Cone Road NJ
More informationAnalysis of Wired Short Cuts in Wireless Sensor Networks
Analysis of Wied Shot Cuts in Wieless Senso Netwos ohan Chitaduga Depatment of Electical Engineeing, Univesity of Southen Califonia, Los Angeles 90089, USA Email: chitadu@usc.edu Ahmed Helmy Depatment
More informationWIRELESS sensor networks (WSNs), which are capable
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. XX, NO. XX, XXX 214 1 Lifetime and Enegy Hole Evolution Analysis in Data-Gatheing Wieless Senso Netwoks Ju Ren, Student Membe, IEEE, Yaoxue Zhang, Kuan
More informationPoint-Biserial Correlation Analysis of Fuzzy Attributes
Appl Math Inf Sci 6 No S pp 439S-444S (0 Applied Mathematics & Infomation Sciences An Intenational Jounal @ 0 NSP Natual Sciences Publishing o Point-iseial oelation Analysis of Fuzzy Attibutes Hao-En hueh
More informationarxiv: v2 [physics.soc-ph] 30 Nov 2016
Tanspotation dynamics on coupled netwoks with limited bandwidth Ming Li 1,*, Mao-Bin Hu 1, and Bing-Hong Wang 2, axiv:1607.05382v2 [physics.soc-ph] 30 Nov 2016 1 School of Engineeing Science, Univesity
More informationPOMDP: Introduction to Partially Observable Markov Decision Processes Hossein Kamalzadeh, Michael Hahsler
POMDP: Intoduction to Patially Obsevable Makov Decision Pocesses Hossein Kamalzadeh, Michael Hahsle 2019-01-02 The R package pomdp povides an inteface to pomdp-solve, a solve (witten in C) fo Patially
More informationOptical Flow for Large Motion Using Gradient Technique
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 3, No. 1, June 2006, 103-113 Optical Flow fo Lage Motion Using Gadient Technique Md. Moshaof Hossain Sake 1, Kamal Bechkoum 2, K.K. Islam 1 Abstact: In this
More informationDynamic Multiple Parity (DMP) Disk Array for Serial Transaction Processing
IEEE TRANSACTIONS ON COMPUTERS, VOL. 50, NO. 9, SEPTEMBER 200 949 Dynamic Multiple Paity (DMP) Disk Aay fo Seial Tansaction Pocessing K.H. Yeung, Membe, IEEE, and T.S. Yum, Senio Membe, IEEE AbstactÐThe
More informationModelling, simulation, and performance analysis of a CAN FD system with SAE benchmark based message set
Modelling, simulation, and pefomance analysis of a CAN FD system with SAE benchmak based message set Mahmut Tenuh, Panagiotis Oikonomidis, Peiklis Chachalakis, Elias Stipidis Mugla S. K. Univesity, TR;
More informationA Memory Efficient Array Architecture for Real-Time Motion Estimation
A Memoy Efficient Aay Achitectue fo Real-Time Motion Estimation Vasily G. Moshnyaga and Keikichi Tamau Depatment of Electonics & Communication, Kyoto Univesity Sakyo-ku, Yoshida-Honmachi, Kyoto 66-1, JAPAN
More informationAN ANALYSIS OF COORDINATED AND NON-COORDINATED MEDIUM ACCESS CONTROL PROTOCOLS UNDER CHANNEL NOISE
AN ANALYSIS OF COORDINATED AND NON-COORDINATED MEDIUM ACCESS CONTROL PROTOCOLS UNDER CHANNEL NOISE Tolga Numanoglu, Bulent Tavli, and Wendi Heinzelman Depatment of Electical and Compute Engineeing Univesity
More informationCombinatorial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registration in Mobile IP Environments
Wieless Netwoks 0, 3 32, 200 200 Kluwe Academic Publishes. Manufactued in The Nethelands. Combinatoial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registation in Mobile
More informationMapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma
apreduce Optimizations and Algoithms 2015 Pofesso Sasu Takoma www.cs.helsinki.fi Optimizations Reduce tasks cannot stat befoe the whole map phase is complete Thus single slow machine can slow down the
More informationImproved Utility-based Congestion Control for Delay-Constrained Communication
Impoved Utility-based Congestion Contol fo Delay-Constained Communication Stefano D Aonco, Laua Toni, Segio Mena, Xiaoqing Zhu, and Pascal Fossad axiv:5.2799v3 [cs.ni] 2 Jan 27 Abstact Due to the pesence
More informationADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM
ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM Luna M. Rodiguez*, Sue Ellen Haupt, and Geoge S. Young Depatment of Meteoology and Applied Reseach Laboatoy The Pennsylvania State Univesity,
More informationINFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM
INFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM LiLi Du Depatment of Civil, Achitectual, and Envionmental Engineeing Illinois Institute of Technology 3300
More informationA Recommender System for Online Personalization in the WUM Applications
A Recommende System fo Online Pesonalization in the WUM Applications Mehdad Jalali 1, Nowati Mustapha 2, Ali Mamat 2, Md. Nasi B Sulaiman 2 Abstact foeseeing of use futue movements and intentions based
More informationa Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives
SPARK: Soot Reseach Kit Ondřej Lhoták Objectives Spak is a modula toolkit fo flow-insensitive may points-to analyses fo Java, which enables expeimentation with: vaious paametes of pointe analyses which
More informationLifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks
788 IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. 12, NO. 2, APRIL 2016 Lifetime and Enegy Hole Evolution Analysis in Data-Gatheing Wieless Senso Netwoks Ju Ren, Student Membe, IEEE, Yaoxue Zhang,
More informationSpiral Recognition Methodology and Its Application for Recognition of Chinese Bank Checks
Spial Recognition Methodology and Its Application fo Recognition of Chinese Bank Checks Hanshen Tang 1, Emmanuel Augustin 2, Ching Y. Suen 1, Olivie Baet 2, Mohamed Cheiet 3 1 Cente fo Patten Recognition
More informationSegmentation of Casting Defects in X-Ray Images Based on Fractal Dimension
17th Wold Confeence on Nondestuctive Testing, 25-28 Oct 2008, Shanghai, China Segmentation of Casting Defects in X-Ray Images Based on Factal Dimension Jue WANG 1, Xiaoqin HOU 2, Yufang CAI 3 ICT Reseach
More informationAdaptation of TDMA Parameters Based on Network Conditions
Adaptation of TDMA Paametes Based on Netwok Conditions Boa Kaaoglu Dept. of Elect. and Compute Eng. Univesity of Rocheste Rocheste, NY 14627 Email: kaaoglu@ece.ocheste.edu Tolga Numanoglu Dept. of Elect.
More informationHISTOGRAMS are an important statistic reflecting the
JOURNAL OF L A T E X CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 D 2 HistoSketch: Disciminative and Dynamic Similaity-Peseving Sketching of Steaming Histogams Dingqi Yang, Bin Li, Laua Rettig, and Philippe
More informationFifth Wheel Modelling and Testing
Fifth heel Modelling and Testing en Masoy Mechanical Engineeing Depatment Floida Atlantic Univesity Boca aton, FL 4 Lois Malaptias IFMA Institut Fancais De Mechanique Advancee ampus De lemont Feand Les
More informationEmbeddings into Crossed Cubes
Embeddings into Cossed Cubes Emad Abuelub *, Membe, IAENG Abstact- The hypecube paallel achitectue is one of the most popula inteconnection netwoks due to many of its attactive popeties and its suitability
More informationDetection and Recognition of Alert Traffic Signs
Detection and Recognition of Alet Taffic Signs Chia-Hsiung Chen, Macus Chen, and Tianshi Gao 1 Stanfod Univesity Stanfod, CA 9305 {echchen, macuscc, tianshig}@stanfod.edu Abstact Taffic signs povide dives
More informationTCP Libra: Exploring RTT-Fairness for TCP
TCP Liba: Exploing RTT-Fainess fo TCP UCLA Compute Science Depatment Technical Repot #TR050037 Gustavo Mafia, Claudio Palazzi, Giovanni Pau, Maio Gela, M. Y. Sanadidi, Maco Roccetti, Compute Science Depatment
More informationRT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Driver
1 RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Dive Amit Jain Daji Qiao Kang G. Shin The Univesity of Michigan Ann Abo, MI 4819, USA {amitj,dqiao,kgshin@eecs.umich.edu Abstact The cuent
More informationLecture 8 Introduction to Pipelines Adapated from slides by David Patterson
Lectue 8 Intoduction to Pipelines Adapated fom slides by David Patteson http://www-inst.eecs.bekeley.edu/~cs61c/ * 1 Review (1/3) Datapath is the hadwae that pefoms opeations necessay to execute pogams.
More informationScaling Location-based Services with Dynamically Composed Location Index
Scaling Location-based Sevices with Dynamically Composed Location Index Bhuvan Bamba, Sangeetha Seshadi and Ling Liu Distibuted Data Intensive Systems Laboatoy (DiSL) College of Computing, Geogia Institute
More informationOn the Forwarding Area of Contention-Based Geographic Forwarding for Ad Hoc and Sensor Networks
On the Fowading Aea of Contention-Based Geogaphic Fowading fo Ad Hoc and Senso Netwoks Dazhi Chen Depatment of EECS Syacuse Univesity Syacuse, NY dchen@sy.edu Jing Deng Depatment of CS Univesity of New
More informationConservation Law of Centrifugal Force and Mechanism of Energy Transfer Caused in Turbomachinery
Poceedings of the 4th WSEAS Intenational Confeence on luid Mechanics and Aeodynamics, Elounda, Geece, August 1-3, 006 (pp337-34) Consevation Law of Centifugal oce and Mechanism of Enegy Tansfe Caused in
More informationEthernet PON (epon): Design and Analysis of an Optical Access Network.
Ethenet PON epon: Design and Analysis of an Optical Access Netwo. Glen Kame Depatment of Compute Science Univesity of Califonia, Davis, CA 9566, USA Tel:.530.297.527; Fax:.530.297.530 E-mail: ame@cs.ucdavis.edu
More informationA Stable Traffic Engineering Technique for Performance Enhancement of the Non-TCP Elastic Flows *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 30, 1115-1129 (2014) A Stable Taffic Engineeing Technique fo Pefomance Enhancement of the Non-TCP Elastic Flows * Ian Telecom Reseach Cente (ITRC) Tehan,
More informationErasure-Coding Based Routing for Opportunistic Networks
Easue-Coding Based Routing fo Oppotunistic Netwoks Yong Wang, Sushant Jain, Magaet Matonosi, Kevin Fall Pinceton Univesity, Univesity of Washington, Intel Reseach Bekeley ABSTRACT Routing in Delay Toleant
More information= dv 3V (r + a 1) 3 r 3 f(r) = 1. = ( (r + r 2
Random Waypoint Model in n-dimensional Space Esa Hyytiä and Joma Vitamo Netwoking Laboatoy, Helsinki Univesity of Technology, Finland Abstact The andom waypoint model (RWP) is one of the most widely used
More informationDecentralized Trust Management for Ad-Hoc Peer-to-Peer Networks
Decentalized Tust Management fo Ad-Hoc Pee-to-Pee Netwoks Thomas Repantis Vana Kalogeaki Depatment of Compute Science & Engineeing Univesity of Califonia, Riveside Riveside, CA 92521 {tep,vana}@cs.uc.edu
More informationTime-Constrained Big Data Transfer for SDN-Enabled Smart City
Emeging Tends, Issues, and Challenges in Big Data and Its Implementation towad Futue Smat Cities Time-Constained Big Data Tansfe fo SDN-Enabled Smat City Yuanguo Bi, Chuan Lin, Haibo Zhou, Peng Yang, Xuemin
More informationSYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH
I J C A 7(), 202 pp. 49-53 SYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH Sushil Goel and 2 Rajesh Vema Associate Pofesso, Depatment of Compute Science, Dyal Singh College,
More informationRoot Cause Analysis for Long-Lived TCP Connections
Root Cause Analysis fo Long-Lived TCP Connections M. Siekkinen, G. Uvoy-Kelle, E. W. Biesack, T. En-Najjay Institut Euécom BP 93, 694 Sophia-Antipolis Cedex, Fance Email: {siekkine,uvoy,ebi,ennajja}@euecom.f
More informationNumber of Paths and Neighbours Effect on Multipath Routing in Mobile Ad Hoc Networks
Numbe of Paths and Neighbous Effect on Multipath Routing in Mobile Ad Hoc Netwoks Oday Jeew School of Infomation Systems and Accounting Univesity of Canbea Canbea ACT 2617, Austalia oday.jeew@canbea.edu.au
More informationLoss-Cognizant Pricing in Feed-Forward Networks with Greedy Users
Loss-Cognizant Picing in Feed-Fowad Netwoks with Geedy Uses Ashaf Al Daoud and Muat Alanyali Depatment of Electical and Compute Engineeing Boston Univesity, Boston, MA 02215 Email: {ashaf, alanyali}@bu.edu
More informationEvent-based Location Dependent Data Services in Mobile WSNs
Event-based Location Dependent Data Sevices in Mobile WSNs Liang Hong 1, Yafeng Wu, Sang H. Son, Yansheng Lu 3 1 College of Compute Science and Technology, Wuhan Univesity, China Depatment of Compute Science,
More informationComputer Networks. TCP Libra: Derivation, analysis, and comparison with other RTT-fair TCPs
Compute Netwoks 54 (2010) 2327 2344 Contents lists available at ScienceDiect Compute Netwoks jounal homepage: www.elsevie.com/locate/comnet TCP Liba: Deivation, analysis, and compaison with othe RTT-fai
More informationIS-IS Protocol Hardware Implementation for VPN Solutions
IS-IS Potocol Hadwae Implementation fo VPN Solutions MOHAMED ABOU-GABAL, RAYMOND PETERKIN, DAN IONESCU School of Infomation Technology and Engineeing (SITE) Univesity of Ottawa 161 Louis Pasteu, P.O. Box
More informationData mining based automated reverse engineering and defect discovery
Data mining based automated evese engineeing and defect discovey James F. Smith III, ThanhVu H. Nguyen Naval Reseach Laboatoy, Code 5741, Washington, D.C., 20375-5000 ABSTRACT A data mining based pocedue
More informationShortest Paths for a Two-Robot Rendez-Vous
Shotest Paths fo a Two-Robot Rendez-Vous Eik L Wyntes Joseph S B Mitchell y Abstact In this pape, we conside an optimal motion planning poblem fo a pai of point obots in a plana envionment with polygonal
More informationPositioning of a robot based on binocular vision for hand / foot fusion Long Han
2nd Intenational Confeence on Advances in Mechanical Engineeing and Industial Infomatics (AMEII 26) Positioning of a obot based on binocula vision fo hand / foot fusion Long Han Compute Science and Technology,
More informationINDEXATION OF WEB PAGES BASED ON THEIR VISUAL RENDERING
INDEXATION OF WEB PAGES BASED ON THEIR VISUAL RENDERING Emmanuel Buno Univesité du Sud Toulon-Va / LSIS CNRS BP 20132, F-83957 La Gade buno@univ-tln.f Nicolas Faessel LSIS CNRS Domaine Univesitaie de Saint-Jéôme
More informationPrioritized Traffic Recovery over GMPLS Networks
Pioitized Taffic Recovey ove GMPLS Netwoks 2005 IEEE. Pesonal use of this mateial is pemitted. Pemission fom IEEE mu be obtained fo all othe uses in any cuent o futue media including epinting/epublishing
More informationi-pcgrid Workshop 2016 April 1 st 2016 San Francisco, CA
i-pcgrid Wokshop 2016 Apil 1 st 2016 San Fancisco, CA Liang Min* Eddy Banks, Bian Kelley, Met Kokali, Yining Qin, Steve Smith, Philip Top, and Caol Woodwad *min2@llnl.gov, 925-422-1187 LDRD 13-ERD-043
More informationA ROI Focusing Mechanism for Digital Cameras
A ROI Focusing Mechanism fo Digital Cameas Chu-Hui Lee, Meng-Feng Lin, Chun-Ming Huang, and Chun-Wei Hsu Abstact With the development and application of digital technologies, the digital camea is moe popula
More informationColor Correction Using 3D Multiview Geometry
Colo Coection Using 3D Multiview Geomety Dong-Won Shin and Yo-Sung Ho Gwangju Institute of Science and Technology (GIST) 13 Cheomdan-gwagio, Buk-ku, Gwangju 500-71, Republic of Koea ABSTRACT Recently,
More informationSecure Collaboration in Mediator-Free Environments
Secue Collaboation in Mediato-Fee Envionments Mohamed Shehab School of Electical and Compute Engineeing Pudue Univesity West Lafayette, IN, USA shehab@pudueedu Elisa Betino Depatment of Compute Sciences
More informationMANET QoS support without reservations
SECURITY AND COMMUNICATION NETWORKS Secuity Comm. Netwoks (2010) Published online in Wiley InteScience (www.intescience.wiley.com)..183 SPECIAL ISSUE PAPER MANET QoS suppot without esevations Soon Y. Oh,
More informationA Family of Distributed Deadlock Avoidance Protocols and their Reachable State Spaces
A Family of Distibuted Deadlock Avoidance Potocols and thei Reachable State Spaces Césa Sánchez, Henny B. Sipma, and Zoha Manna Compute Science Depatment Stanfod Univesity, Stanfod, CA 94305-9025 {cesa,sipma,manna}@cs.stanfod.edu
More informationMAC Protocol for Supporting QoS in All-IP HiperLAN2
MAC Potocol fo Suppoting QoS in All-IP HipeLAN Chistos E. Politis, Rahim Tafazolli Univesity of Suey Cente fo Communication Systems Reseach Guildfod, GU 7XH, Suey, UK Tel.: +44 483 683463, FAX: +44 483
More informationMultidimensional Testing
Multidimensional Testing QA appoach fo Stoage netwoking Yohay Lasi Visuality Systems 1 Intoduction Who I am Yohay Lasi, QA Manage at Visuality Systems Visuality Systems the leading commecial povide of
More informationTier-Based Underwater Acoustic Routing for Applications with Reliability and Delay Constraints
Tie-Based Undewate Acoustic Routing fo Applications with Reliability and Delay Constaints Li-Chung Kuo Depatment of Electical Engineeing State Univesity of New Yok at Buffalo Buffalo, New Yok 14260 Email:
More informationAccurate Diffraction Efficiency Control for Multiplexed Volume Holographic Gratings. Xuliang Han, Gicherl Kim, and Ray T. Chen
Accuate Diffaction Efficiency Contol fo Multiplexed Volume Hologaphic Gatings Xuliang Han, Gichel Kim, and Ray T. Chen Micoelectonic Reseach Cente Depatment of Electical and Compute Engineeing Univesity
More informationOn Error Estimation in Runge-Kutta Methods
Leonado Jounal of Sciences ISSN 1583-0233 Issue 18, Januay-June 2011 p. 1-10 On Eo Estimation in Runge-Kutta Methods Ochoche ABRAHAM 1,*, Gbolahan BOLARIN 2 1 Depatment of Infomation Technology, 2 Depatment
More informationMobility Pattern Recognition in Mobile Ad-Hoc Networks
Mobility Patten Recognition in Mobile Ad-Hoc Netwoks S. M. Mousavi Depatment of Compute Engineeing, Shaif Univesity of Technology sm_mousavi@ce.shaif.edu H. R. Rabiee Depatment of Compute Engineeing, Shaif
More informationFault-Tolerant Routing Schemes in RDT(2,2,1)/α-Based Interconnection Network for Networks-on-Chip Designs
Fault-Toleant Routing Schemes in RDT(,,)/α-Based Inteconnection Netwok fo Netwoks-on-Chip Designs Mei Yang, Tao Li, Yingtao Jiang, and Yulu Yang Dept. of Electical & Compute Engineeing Univesity of Nevada,
More informationDEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson
DEADLOCK AVOIDANCE IN BATCH PROCESSES M. Tittus K. Åkesson Univesity College Boås, Sweden, e-mail: Michael.Tittus@hb.se Chalmes Univesity of Technology, Gothenbug, Sweden, e-mail: ka@s2.chalmes.se Abstact:
More information(a, b) x y r. For this problem, is a point in the - coordinate plane and is a positive number.
Illustative G-C Simila cicles Alignments to Content Standads: G-C.A. Task (a, b) x y Fo this poblem, is a point in the - coodinate plane and is a positive numbe. a. Using a tanslation and a dilation, show
More informationMonte Carlo Simulation for the ECAT HRRT using GATE
Monte Calo Simulation fo the ECAT HRRT using GATE F. Bataille, C. Comtat, Membe, IEEE, S. Jan, and R. Tébossen Abstact The ECAT HRRT (High Resolution Reseach Tomogaph, CPS Innovations, Knoxville, TN, U.S.A.)
More informationIllumination methods for optical wear detection
Illumination methods fo optical wea detection 1 J. Zhang, 2 P.P.L.Regtien 1 VIMEC Applied Vision Technology, Coy 43, 5653 LC Eindhoven, The Nethelands Email: jianbo.zhang@gmail.com 2 Faculty Electical
More informationAPPLICATION OF STRUCTURED QUEUING NETWORKS IN QOS ESTIMITION OF TELECOMMUNICATION SERVICE
APPLICATION OF STRUCTURED QUEUING NETWORKS IN QOS ESTIMITION OF TELECOMMUNICATION SERVICE 1 YAROSLAVTSEV A.F., 2 Al-THUNEIBAT S.A., 3 AL TAWALBEH N.A 1 Depatment of Netwoking, SSUTI, Novosibisk, Russia
More informationOn the throughput-cost tradeoff of multi-tiered optical network architectures
1 On the thoughput-cost tadeoff of multi-tieed optical netwok achitectues Guy Weichenbeg, Vincent W. S. Chan, and Muiel Médad Laboatoy fo Infomation and Decision Systems Massachusetts Institute of Technology
More informationDynamic Processor Scheduling with Client Resources for Fast Multi-resolution WWW Image Browsing
Dynamic Pocesso Scheduling with Resouces fo Fast Multi-esolution WWW Image Bowsing Daniel Andesen, Tao Yang, David Watson, and Athanassios Poulakidas Depatment of Compute Science Univesity of Califonia
More information