On the Energy Efficiency of Content Delivery Architectures
|
|
- Christine Evans
- 6 years ago
- Views:
Transcription
1 On the Energy Efficiency of Delivery Architectures Kyle Guan, Gary Atkinson, an Daniel C. Kilper Bell Las, Acatel-Lucent, 79 Holmel Roa, Holmel, NJ Ece Gulsen MIT, 77 Mass. Ave., Camrige, MA 039 Astract We examine the energy consumption of content elivery architectures, with a focus on the enefit of content centric networking (CCN an ynamic optical ypass. For each case, we uil energy moels ase on the energy consumption of current network equipment an evices. We further analyze the energy traeoff among key networking resources. By optimizing the placement of content accoring to its popularity, CCNs achieve goo scalaility in energy consumption, i.e., the per-it energy ecreases as the ownloa rate increases. The relative energy enefit from CCNs epens on numerous factors such as content popularity, equipment energy efficiency, an network topology. As such, we provie initial assessments of the operational regimes in which CCNs are avantageous. The comparison etween CCN an ynamic optical ypass suggests that CCN is more energy efficient in elivering popular content while ynamic optical ypass is more energy efficient in serving less popular content. Inex Terms content istriution network (CDN, content centric networking (CCN, optical ypass, energy efficiency I. INTRODUCTION istriution accounts for a significant portion of toay s internet usage as a result of the increasing popularity of sharing user generate ata (e.g., YouTue an elivering multi-meia content (e.g., Netflix []. The content an service proviers are rapily expaning ata centers as user eman grows. Concerns over the energy requirements for these ata centers an associate network equipment have rawn attention recently []. In the coming ecae, the improvement in networking energy efficiency is anticipate to increasingly lag traffic growth [3] [4]. As such, the energy consumption is preicte to increase sustantially unless the efficiency of the network, oth in terms of equipment an the associate architectures, improves proportionately. Motivate y uiling greener networks, in this paper we evaluate an compare the potential energy saving of ifferent approaches to content istriution an issemination. Legacy content istriution network (CDN architectures are host-oriente: content is elivere to en users through host servers that are centrally manage in a few ata centers. With the growing eman of large multimeia content, the energy consumption of a host-oriente architecture ecomes prolematic ue to factors such as over-provisioning (to satisfy the peak traffic an heat issipation requirements []. Moreover, as all content is store in a few fixe locations inepenent of the relative popularity, elivering especially popular content from a centralize location to the en users Storage Data Center server Ege Networks (a Storage Data Center server Ege/ Access Networks Ege Ege server Least popular Networks (c Most popular Networks ( Ege/ Access Networks Optical Bypass Ege/ Access Networks Fig.. elivery architectures: (a conventional an ecentralize server-ase CDN, ( CCN, an (c centralize server-ase CDN using ynamic optical ypass. increases anwith-mileage an often incurs unnecessary yet significant transport energy cost [5]. Decentralize CDNs [] [5], originally conceive to improve throughput an elay performance, ease the transport energy consumption. To reuce transit traffic an consequently the associate energy consumption, numerous micro or nano ata centers are eploye at multiple locations of core networks (Fig. (a. As such, a ecentralize CDN pushes the content closer to the network ege an en users. Recently content centric networking (CCN [] was propose to increase content elivery efficiency y using name ase routing, which enales popular content to e tracke an store at intermeiate noes. From the energy perspective, CCNs rely on content routers, which are roughly an orer of magnitue more energy efficient than content servers use in a conventional CDN []. In aition, CCNs further save energy through proportional computing an networking. As content caching is etermine y the frequency of which content is requeste, the more popular content is store close to the en users (as shown in Fig. (. Therefore, transport energy can e greatly reuce. Optical ypass is a physical layer approach in managing transport energy [5] [6]. Static optical ypass is commonly use in reconfigurale optical a-rop multiplexer (ROADM ase networks to transparently patch signals through a noe. With ynamic optical ypass, a connection is provisione on request to eliver content on eman across the network mostly via transparent optical connections, thus circumventing intermeiate core routers, as shown in Fig. (c. The ynamic capaility is necessary ecause eicate transparent path //$ IEEE
2 woul e impractical to eploy toay. At the same time, ynamic optical ypass faces the technical challenges in setting up an en-to-en wavelength route rapily on eman over long-haul istances. Since optical transmission harware is an orer of magnitue more energy efficient than core routers, using ynamic optical ypass can yiel a significant energy savings especially for elivering content over a large numer of network hops. Our ojective in this work is to aress the very question of how to achieve energy efficiency y traing off the consumption of various networking resources. In particular, we evaluate the energy cost of a CCN an optical ypass approach use in CDN architectures. For these techniques, we set up transaction-ase energy consumption moels [6], which take into consieration of important factors such as network topology, content popularity, equipment capacity, an power consumption. As energy consumption of conventional CDNs an optical ypass has een stuie efore [5][6], here we focus on evaluating the potential energy saving of CCNs, consiering oth conventional CDNs an ynamic optical ypass-ase networks. In particular, we examine how key networking, content, an equipment parameters impact the traeoff etween the transport an caching energy. Our results inicate that, y strategically placing popular content close to the network ege, CCNs are scalale in energy consumption, i.e, the per-it energy ecreases as the rate of requests (ownloas for the content increases. In other wors, CCNs are extremely efficient in elivering highly popular contents. However, in comparison to CCNs, ynamic optical ypass is more energy efficient in elivering infrequently accesse content, ue to the reuction (via ypass of power consuming routers. The comparison etween CCNs an conventional server-ase CDNs inicates that their relative energy performances epens on the content catalog size as well as the popularity istriution. Our initial results suggest that CCNs consume less energy in elivering a small size catalog; while conventional server ase CDNs consumes less energy in elivering a large size catalog. In this work, we also explicitly moel an evaluate the impact of the unerlying logical/physical topology on the energy consumption. The topological aspect has een mostly overlooke in previous work []-[6]. Specifically, we set up a power law moel that relates the numer of replicas (caching/storage energy to the average hop istance (transport energy. The en result provies insights into the topological structure that can lea to improve energy efficiency of content elivery. The rest of the paper is organize as follows. In Section II, we provie the network an content istriution moels. In Section III, we set up energy moels for ifferent content elivery architectures. Optimization formulations an analyses that evaluate energy efficiency of ifferent architectures are presente in Section IV. In Section V, we present the results of case stuies an iscuss their implications. (a Fig.. The placement of copies on a 5 5 gri topology. (a The optimal placement of copy; ( the optimal placement of 4 copies Fig. 3. Deploye networks: (a the prototype IP ackone network, with N =4an Δ =3.6; ( the European optical network (EON, with N = 9 an Δ =3.9. The mean noe egree of the network, Δ, isgiveny Δ =L/N. II. NETWORK AND CONTENT DISTRIBUTION MODELS In this section, we escrie the network an traffic moels to provie the necessary ackgroun an notation for the moeling an analyses in Sections III an IV, respectively. A. Network Moel We focus on core networks, which in this paper are assume to consist of oth long-haul an metropolitan networks. We follow the convention of representing the core network as a graph G(N,L, with N an L enoting the numer of noes (representing core routers or s an the numer of iirectional eges (representing links, respectively. In the context of CCN, a total of n replicas of the same content are cache in n content routers. That is, N n noes in the core network have to traverse through one or more hops to access a copy. As such, the average hop istance to a replica, H r, is an important measure of the placement efficiency. More importantly, H r rives the traeoff etween the caching an the transport energy, as will e seen in Sections III an IV. The exact form of H r epens on oth the network topology an the replica placement algorithm. In this paper, we stuy H r for oth symmetric an eploye networks. Among topologies with symmetric structures, we consier oth ring an gri topologies. For a ring topology of N noes, the optimal placement is achieve y maximizing the hop istance among the replicas. Base on this, an analytical expression ( of H r can e erive an approximate as H r (n N 4 n. For an M M gri topology, Hr can e 9 We use interchangealy with ROADM. We use the terms replica, copy, an cache content interchangealy herein. (
3 estimate as follows. When n =, the optimal placement of the copy is at the center of the gri, as shown in Fig. (a. An expression for H r ( can e erive an approximate as H r ( N.Forn>, them M gri is ivie into n su-gris with (almost equal size. It can e shown 3 that the optimal placement is to put each of the n copies at the center of each su-gri, as shown in Fig. (. H r for n> can ( thus e estimate as H r (n N n. As representations of the topological characteristics of eploye networks, we use a prototype IP ackone network an the European optical network (EON [7], as shown in Fig. 3 (a an (, respectively. For these two networks, we take a semi-analytical approach in eriving H r as a power law function of n. We first numerically compute the average hop istance to a replica 4. We next fit the compute ata to the function H r (n A ( N α, n with α>0. For the prototypical IP ackone network, H r can e estimate as 0.35(N/n 0.57 ; while for EON, H r has the form of 0.3(N/n Note that a smaller α inicates a etter efficiency in caching placement: fewer copies are require to achieve a given H r. B. Popularity Distriution Moel We assume that a content provier has a content catalog of size F, ranke from to F ase on popularity ( represents the most popular. Letting the total numer of requests in a given time uration t e R, the numer of requests for the content of popularity k, R k, follows a Zipf istriution as k β R k = R = R F k β. ( k= k β a 0 A large β inicates a relatively small set of very popular content. Typical values of β range etween 0.5 an.0 (e.g., for IPTV channels, β [8]. III. ENERGY CONSUMPTION MODELS In preparation for the analysis an optimization in Section IV, we set up energy consumption moels for a CCN, a conventional CDN, an a centralize CDN using ynamic optical ypass. We use a transaction ase moel in which the total energy is calculate y aing up the consumption incurre y all the equipment use to eliver a given service on a mean transaction asis [5]. For clarity of iscussion, we summarize the notation of the key parameters in Tale I. A. Energy Moel for a CCN For a CCN, we consier an iealize case in which content routers carry out the tasks of the content servers []. As content servers are infrequently accesse, their energy consumption is not consiere. As such, the total consume energy Etot CCN consists of two parts: the transport energy E tr an the caching energy E ca. The transport energy, in turn, inclues the energy consumption in the core, ege, an access networks, enote as Etr, c Etr, e an Etr, a respectively. We assume that in a 3 The proof is omitte in the paper ue to the limitation of the space. 4 A genetic algorithm approach is use to fin optimal or near-optimal placement of replicas. Due to space limitation, the etail is omitte here. TABLE I NOTATIONS AND VALUES OF THE KEY PARAMETERS Symols Notations Values N No. of noes Multiple values t Time uration 3600 secons R k No. of requests of the Multiple values kth-most popular content B k Size of the kth-most popular content Multiple values p r Power ensity of a core router. 0 8 J/it p wm Power ensity of a link J/it p oxc Power ensity of an J/it p ca Power of caching in router uffer 0 9 W/it p e Power ensity of an Ethernet switch J/it p g Power ensity of a gateway router J/it p pe Power ensity of a provier ege router J/it p st Power of storage (har isk W/it p s Power ensity of a server J/it n No. of caching replicas Multiple values H r Average numer of hops to a replica Multiple values uration t, the kth-most popular content (of size B k is ownloae R k times. Similar to the moels use in [5], E c tr an E e tr are expresse as an Etr(H c r =4B k R k [(p r + p oxc (H r ++p wm H r ] ( Etr e =4B k R k [3p e + p g +ppe ], (3 respectively. Note that a factor of four is use to account for reunancy an overhea [5]. Similar to the moeling in [5], we assume that the access networks are passive optical networks (PON whose energy consumption is inepenent of traffic loa an therefore only as an ientical constant to each case. As such, Etr a is not inclue in the analysis. If n copies of a particular content are cache in router uffers [], the energy consume y caching nb k its is given y E ca (n =B k tp ca n =(Btp ca A /α N/H α r, (4 since the network topologies use in our analysis all follow the power law scaling as H r (n =A(N/n α. Comining oth the transport an caching energy, we have E CCN tot = E c tr(h r +E e tr + E ca (H r. (5 B. Energy Moel for a Conventional CDN In a conventional CDN architecture, the total energy consumption Etot CDN consists of that consume y ata storage E st, transport E tr, an servers E sr. We assume that there are n micro or nano ata centers. Each content, inepenent of its relative popularity, is replicate n times in n storage evices. For a time of uration t, the storage energy is given y E st (n =B k tp st n, (6 where p st enotes the power of storage evices. The moeling of transport energy is similar to that for CCN. Since H r (n =A( N n α, the transport energy can e expresse
4 as E tr = 4B k R k [(p r + p oxc (A( N n α ++p wm A( N n α ] + 4B k R k (3p e + p g +ppe. (7 In aition, the server energy E sr nees to e consiere: E sr = B k R k p s. (8 By comining the transport, storage, an server energy, we have E CDN tot = E c tr + E e tr + E st + E sr. (9 C. Energy Moel for a Centralize CDN Using Dynamic Optical Bypass In ynamic optical ypass, the content is elivere y a server that is attache to a core router an transporte across the core network mostly via transparent optical connections. We assume that on average a noe is Hr s hops away from the server. The total energy Etot, p which consists of the transport, server, an storage energy, can e expresse as: E p tot = Etr(H c r s +Etr e + E sr + E st = 4B k R k [(p oxc (Hr s ++p wm Hr s +p r ] + Etr e + B k R k p s + B k tp st. (0 In the aove equation, H s r can e estimate as H s r = H r ( = AN α. Note that the implementation of ynamic optical ypass requires overhea of oth signaling an physical reconfiguration of the network elements. This overhea increases the wavelength switching time an thus reuces the utilization of wavelength capacity. This, in turn, will increase the effective energy consumption per ownloa. For simplicity, we o not inclue an uner-utilization factor in our moel y assuming that the wavelength is fully utilize. IV. PROBLEM FORMULATIONS AND SOLUTIONS In this section, we first fin the minimal energy consumption of content elivery using a CCN via the optimization of content placement. Next we analyze how the energy efficiency of a CCN, a conventional CDN, an a centralize CDN with optical ypass are affecte y network topology, content popularity, an equipment energy efficiency. A. Energy Optimization for CCN For a CCN, a close examination of equations ( an (4 shows that H r generally rives the transport energy in an increasing irection an the caching energy in a ecreasing irection. This is epicte in Fig. 4. To fin the optimal traeoff etween transport an caching energy, we formulate the following optimization prolem: minimize : H r Etot CCN (H r suject to 0 H r H max. ( Energy per it, E it (J/it.4 x , Transport, Caching, Total Avg. Hop Distance to a Replica, H r Fig. 4. The traeoff etween caching an transport energy for CCN. A ring topology with 64 noes (N =64isuse. Here H max enotes the maximal hop istance. Oserve that Etot CCN is a convex function of H r. As such, optimal solutions exist. The optimal values Hr an n can e solve as 5 [ ] Hr A α α+ α Ntp ca = 4R k (p r + poxc + p wm ( an n = [ 4ARk (p r + poxc tp ca + p wm ] α+ N α α+. (3 The expressions for Hr an n show how the relative power consumption of transport an caching affects the placement of content. As the ratio (p r + poxc + p wm /p ca increases, more copies of the content are cache across the network. This results in a ecreasing hop istance to access a copy. The expressions also show that the more popular content (with large R k is replicate more often an is therefore closer to the en user (smaller Hr. We also erive the expression of Hr in terms of the popularity inex k. By sustituting equation ( into (, we have [ ] Hr A α α a 0 Ntp cach k β α+ = 4R(p r + poxc + p wm. (4 That is, Hr scales with k in the form of Hr k αβ α+. Therefore the popular (low k content is place close to the en users. The optimal energy consumption is foun to e: Etot = E CCN tot + c 0 B k Rk (H r =E e tr +4B k R k p r +α (tp can α+ α (p r + poxc + p wm α+ (5, where c 0 = ( α+3 A α+. The energy per it E CCN can e otaine y iviing Etot CCN y the total numer of its ownloae R k B K. Thus, the per-it energy consumption for accessing content k is given y E = E tot =4[p r R k B +3pe + pg +ppe ] K + c 0 R +α α k (tp can α+ α [(p r + poxc + p wm ] 5 We only consier the cases for which H r <H max. α+. (6
5 We note that as R k, lim R k B ECCN =4[p r +3p e + p g +ppe ]. (7 K This can e explaine as follows. When the request rate is low for a particular content, only a few copies are cache across the core network. Thus, the energy consumption is ominate y transport energy. When a particular content is accesse more frequently, more copies are cache. As a result, the transport energy is reuce. As R k increases aove a certain value, copies are cache on every noe of the network (n = N, i.e, caching energy is maximize. In this case, the transport energy is reuce to the minimum, i.e., only the core router that connects to the ege networks contriutes to the transport energy consumption. Hence, though the caching energy is maximize, it is amortize y the ever increasing R k. B. Per-Bit Energy Benefit of a CDN with Dynamic Optical Bypass The per-it energy consumption of a centralize CDN using ynamic optical ypass E p can e expresse as E p = E p tot =4[(p oxc (Hr s ++p wm Hr s ] B k R k + 4[p r +3p e + p g +ppe ]+ps. (8 Note that E p is inepenent of R k. By comparison, the optimal per-it energy for a CCN is a ecreasing function of R k. By comparing the expression of lim Rk B K E (equation (7 with that of E p, we oserve that lim R k B ECCN <E p. (9 K That is, at sufficiently high access rates, CCN is more energy efficient than a centralize CDN using ynamic optical ypass. At a low access rates, the use of ynamic optical ypass is more energy efficient than CCN. The request rate at which CCN an optical ypass consume the same amount of energy, enote as Rk, can e otaine y numerically solving E (R k =E p. (0 C. Average Per Bit-Energy Performance of a CCN an CDN For F availale content items, we assume that the relative request frequency of the kth-most popular content is f(k. The numer of requests R k is Rf(k. The average per-it energy (over F ifferent content items for a CCN (enote as E CCN is F E CCN = E CCN (R k f(k. ( k= The energy per it for a CDN, E CDN, can e otaine y iviing E tot (equation (9 with B k R k : E CDN = ECDN tot B k R k + ntpst R k =4[(p r + poxc (A( N n α ++p wm A( N n α ] +3p e + pg +ppe + ps. ( The average per it energy (over F ifferent content items for CDN (enote as E CDN is F E CDN = E CDN (R k f(k. (3 k= In general, it is ifficult to carry out an analytical comparison of the average per-it energy of a CCN an a conventional CDN. As such, we mostly resort to a numerical approach, as illustrate in Section V. V. RESULTS AND DISCUSSIONS In this section, we evaluate the energy traeoff of ifferent content istriution architectures using various case stuies. We use the same values of the key parameters as those in [] [6], as shown in Tale I. To unerstan the placement strategy for content with ifferent popularity, we consier the case of elivering a catalog of size 00 (F = 00. The popularity of the content follows a Zipf istriution (equation ( with β =0.6. InFig. 5we plot the optimal hop istance to a copy H r as a function of popularity inex k for four ifferently topologies: a 64-noe ring, a 8 8 gri, the representative IP ackone, an EON. As shown in the plot, the more popular content is cache closer to the en users (smaller value of Hr. We oserve that the placements for topologies with higher average noe egree (gri, IP ackone, an EON show a clear cut off at a certain popularity inex. Only the top 5 0% most popular content is cache close to the en users; the rest of the content is place in the center of the topology. We next compare the energy efficiency of a CCN an a centralize CDN with ynamic optical ypass. In Fig. 6, we plot the optimal energy per it as a function of the request rate for oth a CCN an the ynamic optical ypass case. The same four ifferent topologies as efore are use for the comparison. The plot shows that ynamic optical ypass is more energy efficient in elivering infrequently accesse content, while a CCN is more energy efficient in elivering frequently accesse content. With a low R k, the energy for a CCN is ominate y transport energy. Optical ypass saves energy y avoiing the use of intermeiate routers, which accounts for the majority of the transport energy consumption. The enefit of optical ypass iminishes as the content is accesse more frequently ue to the high power consumption of the content server. In comparison, placing the popular content across the network for a CCN not only reuces the transport energy, ut also allows for efficient utilization of the caching energy. We note that the request rate at which a CCN an optical ypass consume the same amount of energy, Rk, is affecte y the topology. The plot shows a tren that Rk ecreases with the increasing average network connectivity. We also compare the energy efficiency of a CCN with that of a conventional CDN. In particular, we evaluate the influence of content popularity an catalog size on the energy consumption. In Fig. 7 we plot the ratio etween the per-it energy of a CCN an a conventional CDN as a function of
6 Fig. 5. Avg Hop Dist. to a Replica, H r X8 Gri, N=64 IP Backone, N=4 EON, N= Popularity Inex, k Hr for the kth-most popular content for ifferent network topologies. The Per Bit Energy Ratio Between CCN an CDN X8 Gri, N=64 IP Backone, N=4 EON, N= β in Zipf like Distriution F=50 The Per Bit Energy Ratio Between CCN an CDN X8 Gri, N=64 IP Backone, N=4 EON, N=9 CCN β in Zipf like Distriution, F=500 The Per Bit Energy Ratio Between CCN an CDN X8 Gri, N=64 IP Backone, N=4 EON, N= β in Zipf like Distriution F=000 Fig. 7. The ratio of optimal energy per it (J/it as a function of β an F, etween CCN an conventional CDN. Optimal Energy per it, E it (J/it.4 x , CCN, Bypass 8X8 Gri, N=64, CCN 8X8 Gri, N=64, Bypass IP Backone, N=4, CCN IP Backone, N=4, Bypass EON, N=9, CCN EON, N=9, Bypass No. of Requests, R k Fig. 6. Comparison of optimal energy per it (J/it as a function of R k, etween CCN an optical ypass. oth the content catalog size (the value of F an the content popularity istriution (the value of β in Zipf istriution. The total numer of requests R is set at 0,000. An immeiate oservation from the plot shows that with the same R, a CCN is more energy efficient serving a small size catalog while a conventional CDN is more efficient if serving a large size catalog. We also note that the ratio etween the per-it energy of CCN an conventional CDN ecreases with the increasing value of β, aleit the ifference etween low an high β values is insignificant except for the ring topology with F = 500 an F = 000. The impact of topology, manifeste through oth N an α, is evient. CCNs implemente on topologies with smaller N an higher α (e.g., IP ackone an EON have etter energy efficiency for all the values of F an β use in the evaluation. As our main focus in this work is to illustrate the tren an scaling of energy efficiency of ifferent content elivery approaches, we have ase the moels an analyses on iealize scenarios an have employe simplifying assumptions. Some practical issues, such as wavelength switching time for ynamic optical ypass, are not inclue in the moeling. We also note that except for the ring topology, the network topologies use in this work have relatively small average hop istance etween noes (3-6 hops. In comparison, ata flows in toay s Internet may go through 5 or more router hops [3][5]. As such, we expect that the energy enefit of CCNs on eploye networks will e more pronounce. To generate more accurate results, we plan to aress these issues in our future work y proviing more refine an realistic energy consumption moels. VI. CONCLUSIONS We have analyze the energy consumption of several content elivery approaches a CCN, a conventional server ase CDN, an a centralize server ase CDN with ynamic optical ypass. Given the energy consumption level of current network equipment an evices, our results show that CCNs are more energy efficient in elivering popular content; while the approach with optical ypass is more energy efficient in elivering infrequently accesse content. The relative energy enefit of CCNs an conventional CDNs is more complicate, since the energy performance also epens on factors such as content popularity an catalog size. Our results suggest that a hyri architecture a synergy of CCN, server-ase CDN, an ynamic optical ypass architectures may further improve the energy efficiency especially in serving content with heterogeneous popularity. REFERENCES [] U. Lee, I. Rimac, an V. Hilt, Greening the Internet with Centric Networking, ACM First International Conference on Energyefficient Computing an Networking (e-energy 0, Passau, Germany, Apr. 3-5, 00. [] V. Valancius, et al., Greening the Internet with Nano Data Centers, CoNext 009, Rome, Italy, Dec [3] D. Kilper, G. Atkinson, S. K. Korotky, S. Goyal, P. Vetter, D.Suvakovic, an O. Blume, Power Trens in Communication Networks, accepte for pulication in IEEE Journal on Selecte Topics in Quantum Electronics 0 Green Communication Issue. [4] O. Tamm, C. Hermsmeyer, an A. M. Rush, Eco-sustainale System an Network Architectures for Future Transport Networks, Bell Las Technical Journal, vol. 4, pp. 3-37, 00. [5] J. Baliga, R. Ayre, K. Hinton, an R. Tucker, Architectures for Energy- Efficient IPTV Networks, Optical Fier Communication Conference (OFC, San Diego, CA, Mar [6] J. Baliga, R. Ayre, K. Hinton, W. V. Sorin, an R. S. Tucker, Energy Consumption in Optical IP Networks, Journal of Lightwave Technology, vol. 7, pp , 009. [7] Network Topology Lists, last accesse Sept. 00. [8] M. Cha et al., Watching Television over an IP network, Proc. ACM Internet Measurement Conference, Vouliagmeni, Greece, Oct. 008.
Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks
Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication
More informationAlmost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control
Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract
More informationSURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH
SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway
More informationOffloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization
1 Offloaing Cellular Traffic through Opportunistic Communications: Analysis an Optimization Vincenzo Sciancalepore, Domenico Giustiniano, Albert Banchs, Anreea Picu arxiv:1405.3548v1 [cs.ni] 14 May 24
More informationStudy of Network Optimization Method Based on ACL
Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department
More informationMORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks
: a Movement-Base Routing Algorithm for Vehicle A Hoc Networks Fabrizio Granelli, Senior Member, Giulia Boato, Member, an Dzmitry Kliazovich, Stuent Member Abstract Recent interest in car-to-car communications
More informationImproving Spatial Reuse of IEEE Based Ad Hoc Networks
mproving Spatial Reuse of EEE 82.11 Base A Hoc Networks Fengji Ye, Su Yi an Biplab Sikar ECSE Department, Rensselaer Polytechnic nstitute Troy, NY 1218 Abstract n this paper, we evaluate an suggest methos
More informationOn the Placement of Internet Taps in Wireless Neighborhood Networks
1 On the Placement of Internet Taps in Wireless Neighborhoo Networks Lili Qiu, Ranveer Chanra, Kamal Jain, Mohamma Mahian Abstract Recently there has emerge a novel application of wireless technology that
More informationParticle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base
More informationArchitecture Design of Mobile Access Coordinated Wireless Sensor Networks
Architecture Design of Mobile Access Coorinate Wireless Sensor Networks Mai Abelhakim 1 Leonar E. Lightfoot Jian Ren 1 Tongtong Li 1 1 Department of Electrical & Computer Engineering, Michigan State University,
More informationRobust PIM-SM Multicasting using Anycast RP in Wireless Ad Hoc Networks
Robust PIM-SM Multicasting using Anycast RP in Wireless A Hoc Networks Jaewon Kang, John Sucec, Vikram Kaul, Sunil Samtani an Mariusz A. Fecko Applie Research, Telcoria Technologies One Telcoria Drive,
More informationOnline Appendix to: Generalizing Database Forensics
Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that
More informationLecture 1 September 4, 2013
CS 84r: Incentives an Information in Networks Fall 013 Prof. Yaron Singer Lecture 1 September 4, 013 Scribe: Bo Waggoner 1 Overview In this course we will try to evelop a mathematical unerstaning for the
More informationAnyTraffic Labeled Routing
AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,
More informationHOW DO SECURITY TECHNOLOGIES INTERACT WITH EACH OTHER TO CREATE VALUE? THE ANALYSIS OF FIREWALL AND INTRUSION DETECTION SYSTEM
HOW O SECURTY TECHNOLOGES NTERACT WTH EACH OTHER TO CREATE VALUE? THE ANALYSS O REWALL AN NTRUSON ETECTON SYSTEM Huseyin CAVUSOGLU Srinivasan RAGHUNATHAN Hasan CAVUSOGLU Tulane University University of
More informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More informationThreshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides
Threshol Base Data Aggregation Algorithm To Detect Rainfall Inuce Lanslies Maneesha V. Ramesh P. V. Ushakumari Department of Computer Science Department of Mathematics Amrita School of Engineering Amrita
More informationQuestions? Post on piazza, or Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)!
EE122 Fall 2013 HW3 Instructions Recor your answers in a file calle hw3.pf. Make sure to write your name an SID at the top of your assignment. For each problem, clearly inicate your final answer, bol an
More informationOn-path Cloudlet Pricing for Low Latency Application Provisioning
On-path Cloulet Pricing for Low Latency Application Provisioning Argyrios G. Tasiopoulos, Onur Ascigil, Ioannis Psaras, Stavros Toumpis, George Pavlou Dept. of Electronic an Electrical Engineering, University
More informationAdaptive Load Balancing based on IP Fast Reroute to Avoid Congestion Hot-spots
Aaptive Loa Balancing base on IP Fast Reroute to Avoi Congestion Hot-spots Masaki Hara an Takuya Yoshihiro Faculty of Systems Engineering, Wakayama University 930 Sakaeani, Wakayama, 640-8510, Japan Email:
More informationSocially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach
Socially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach Jian Zhao, Chuan Wu The University of Hong Kong {jzhao,cwu}@cs.hku.hk Abstract Peer-to-peer (P2P) technology is popularly
More informationMessage Transport With The User Datagram Protocol
Message Transport With The User Datagram Protocol User Datagram Protocol (UDP) Use During startup For VoIP an some vieo applications Accounts for less than 10% of Internet traffic Blocke by some ISPs Computer
More informationEDOVE: Energy and Depth Variance-Based Opportunistic Void Avoidance Scheme for Underwater Acoustic Sensor Networks
sensors Article EDOVE: Energy an Depth Variance-Base Opportunistic Voi Avoiance Scheme for Unerwater Acoustic Sensor Networks Safar Hussain Bouk 1, *, Sye Hassan Ahme 2, Kyung-Joon Park 1 an Yongsoon Eun
More informationImpact of FTP Application file size and TCP Variants on MANET Protocols Performance
International Journal of Moern Communication Technologies & Research (IJMCTR) Impact of FTP Application file size an TCP Variants on MANET Protocols Performance Abelmuti Ahme Abbasher Ali, Dr.Amin Babkir
More informationSpare Capacity Planning Using Survivable Alternate Routing for Long-Haul WDM Networks
Spare Capacity Planning Using Survivable lternate Routing for Long-Haul WDM Networks in Zhou an Hussein T. Mouftah Department of lectrical an Computer ngineering Queen s University, Kingston, Ontario,
More informationProvisioning Virtualized Cloud Services in IP/MPLS-over-EON Networks
Provisioning Virtualize Clou Services in IP/MPLS-over-EON Networks Pan Yi an Byrav Ramamurthy Department of Computer Science an Engineering, University of Nebraska-Lincoln Lincoln, Nebraska 68588 USA Email:
More informationLoop Scheduling and Partitions for Hiding Memory Latencies
Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:
More informationComparison of Methods for Increasing the Performance of a DUA Computation
Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,
More informationBackpressure-based Packet-by-Packet Adaptive Routing in Communication Networks
1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stolyar Abstract Backpressure-base aaptive routing
More informationNon-Uniform Sensor Deployment in Mobile Wireless Sensor Networks
01 01 01 01 01 00 01 01 Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks Mihaela Carei, Yinying Yang, an Jie Wu Department of Computer Science an Engineering Floria Atlantic University
More informationPAPER. 1. Introduction
IEICE TRANS. COMMUN., VOL. E9x-B, No.8 AUGUST 2010 PAPER Integrating Overlay Protocols for Proviing Autonomic Services in Mobile A-hoc Networks Panagiotis Gouvas, IEICE Stuent member, Anastasios Zafeiropoulos,,
More informationDivide-and-Conquer Algorithms
Supplment to A Practical Guie to Data Structures an Algorithms Using Java Divie-an-Conquer Algorithms Sally A Golman an Kenneth J Golman Hanout Divie-an-conquer algorithms use the following three phases:
More informationCaching Policies for In-Network Caching
Caching Policies for In-Network Caching Zhe Li, Gwendal Simon, Annie Gravey Institut Mines Telecom - Telecom Bretagne, UMR CNRS 674 IRISA Université Européenne de Bretagne, France {firstname.lastname}@telecom-retagne.eu
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science
More informationSkyline Community Search in Multi-valued Networks
Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h
More informationBackpressure-based Packet-by-Packet Adaptive Routing in Communication Networks
1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stoylar arxiv:15.4984v1 [cs.ni] 27 May 21 Abstract
More informationComputer Organization
Computer Organization Douglas Comer Computer Science Department Purue University 250 N. University Street West Lafayette, IN 47907-2066 http://www.cs.purue.eu/people/comer Copyright 2006. All rights reserve.
More informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 4, APRIL
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 1, NO. 4, APRIL 01 74 Towar Efficient Distribute Algorithms for In-Network Binary Operator Tree Placement in Wireless Sensor Networks Zongqing Lu,
More informationAn Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources
An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract
More informationParallel Directionally Split Solver Based on Reformulation of Pipelined Thomas Algorithm
NASA/CR-1998-208733 ICASE Report No. 98-45 Parallel Directionally Split Solver Base on Reformulation of Pipeline Thomas Algorithm A. Povitsky ICASE, Hampton, Virginia Institute for Computer Applications
More informationThroughput Characterization of Node-based Scheduling in Multihop Wireless Networks: A Novel Application of the Gallai-Edmonds Structure Theorem
Throughput Characterization of Noe-base Scheuling in Multihop Wireless Networks: A Novel Application of the Gallai-Emons Structure Theorem Bo Ji an Yu Sang Dept. of Computer an Information Sciences Temple
More informationPairwise alignment using shortest path algorithms, Gunnar Klau, November 29, 2005, 11:
airwise alignment using shortest path algorithms, Gunnar Klau, November 9,, : 3 3 airwise alignment using shortest path algorithms e will iscuss: it graph Dijkstra s algorithm algorithm (GDU) 3. References
More informationDisjoint Multipath Routing in Dual Homing Networks using Colored Trees
Disjoint Multipath Routing in Dual Homing Networks using Colore Trees Preetha Thulasiraman, Srinivasan Ramasubramanian, an Marwan Krunz Department of Electrical an Computer Engineering University of Arizona,
More informationAn Adaptive Routing Algorithm for Communication Networks using Back Pressure Technique
International OPEN ACCESS Journal Of Moern Engineering Research (IJMER) An Aaptive Routing Algorithm for Communication Networks using Back Pressure Technique Khasimpeera Mohamme 1, K. Kalpana 2 1 M. Tech
More informationClassifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means
Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu
More informationA Classification of 3R Orthogonal Manipulators by the Topology of their Workspace
A Classification of R Orthogonal Manipulators by the Topology of their Workspace Maher aili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S.
More informationAll-to-all Broadcast for Vehicular Networks Based on Coded Slotted ALOHA
Preprint, August 5, 2018. 1 All-to-all Broacast for Vehicular Networks Base on Coe Slotte ALOHA Mikhail Ivanov, Frerik Brännström, Alexanre Graell i Amat, an Petar Popovski Department of Signals an Systems,
More informationCMSC 430 Introduction to Compilers. Spring Register Allocation
CMSC 430 Introuction to Compilers Spring 2016 Register Allocation Introuction Change coe that uses an unoune set of virtual registers to coe that uses a finite set of actual regs For ytecoe targets, can
More informationYet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien
Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,
More informationComparison of Wireless Network Simulators with Multihop Wireless Network Testbed in Corridor Environment
Comparison of Wireless Network Simulators with Multihop Wireless Network Testbe in Corrior Environment Rabiullah Khattak, Anna Chaltseva, Laurynas Riliskis, Ulf Boin, an Evgeny Osipov Department of Computer
More informationComputer Organization
Computer Organization Douglas Comer Computer Science Department Purue University 250 N. University Street West Lafayette, IN 47907-2066 http://www.cs.purue.eu/people/comer Copyright 2006. All rights reserve.
More informationInuence of Cross-Interferences on Blocked Loops: to know the precise gain brought by blocking. It is even dicult to determine for which problem
Inuence of Cross-Interferences on Blocke Loops A Case Stuy with Matrix-Vector Multiply CHRISTINE FRICKER INRIA, France an OLIVIER TEMAM an WILLIAM JALBY University of Versailles, France State-of-the art
More informationNAND flash memory is widely used as a storage
1 : Buffer-Aware Garbage Collection for Flash-Base Storage Systems Sungjin Lee, Dongkun Shin Member, IEEE, an Jihong Kim Member, IEEE Abstract NAND flash-base storage evice is becoming a viable storage
More informationCoupling the User Interfaces of a Multiuser Program
Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces
More informationSpanheight, A Natural Extension of Bandwidth and Treedepth
Master s Thesis Spanheight, A Natural Extension of Banwith an Treeepth Author: N. van Roen Supervisor: Prof. r. Hans. L. Bolaener A thesis sumitte in fulfilment of the requirements for the egree of Master
More informationNon-Uniform Sensor Deployment in Mobile Wireless Sensor Networks
0 0 0 0 0 0 0 0 on-uniform Sensor Deployment in Mobile Wireless Sensor etworks Mihaela Carei, Yinying Yang, an Jie Wu Department of Computer Science an Engineering Floria Atlantic University Boca Raton,
More informationLearning Subproblem Complexities in Distributed Branch and Bound
Learning Subproblem Complexities in Distribute Branch an Boun Lars Otten Department of Computer Science University of California, Irvine lotten@ics.uci.eu Rina Dechter Department of Computer Science University
More informationAlgorithm for Intermodal Optimal Multidestination Tour with Dynamic Travel Times
Algorithm for Intermoal Optimal Multiestination Tour with Dynamic Travel Times Neema Nassir, Alireza Khani, Mark Hickman, an Hyunsoo Noh This paper presents an efficient algorithm that fins the intermoal
More informationOptimal Routing and Scheduling for Deterministic Delay Tolerant Networks
Optimal Routing an Scheuling for Deterministic Delay Tolerant Networks Davi Hay Dipartimento i Elettronica olitecnico i Torino, Italy Email: hay@tlc.polito.it aolo Giaccone Dipartimento i Elettronica olitecnico
More informationRandom Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation
DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,
More informationA SWARM INSPIRED MULTIPATH DATA TRANSMISSION WITH CONGESTION CONTROL IN MANETS USING PROBABILISTIC APPROACH
A SWARM INSPIRED MULTIPATH DATA TRANSMISSION WITH CONGESTION CONTROL IN MANETS USING PROBABILISTIC APPROACH Subhankar oarar 1, Vanana Bhattacheree 2 an Debasis Giri 1 1 Department of Computer Science an
More informationModifying ROC Curves to Incorporate Predicted Probabilities
Moifying ROC Curves to Incorporate Preicte Probabilities Cèsar Ferri DSIC, Universitat Politècnica e València Peter Flach Department of Computer Science, University of Bristol José Hernánez-Orallo DSIC,
More informationAn ECA-based Control-rule formalism for the BPEL Process Modularization *
Availale online at www.scienceirect.com Proceia Environmental Sciences 11 (2011) 511 517 An ECA-ase Control-rule formalism for the BPEL Process Moularization * Bang Ouyang, Farong Zhong **, Huan Liu Department
More informationQuestions? Post on piazza, or Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)!
EE122 Fall 2013 HW3 Instructions Recor your answers in a file calle hw3.pf. Make sure to write your name an SID at the top of your assignment. For each problem, clearly inicate your final answer, bol an
More informationPreamble. Singly linked lists. Collaboration policy and academic integrity. Getting help
CS2110 Spring 2016 Assignment A. Linke Lists Due on the CMS by: See the CMS 1 Preamble Linke Lists This assignment begins our iscussions of structures. In this assignment, you will implement a structure
More informationTop-down Connectivity Policy Framework for Mobile Peer-to-Peer Applications
Top-own Connectivity Policy Framework for Mobile Peer-to-Peer Applications Otso Kassinen Mika Ylianttila Junzhao Sun Jussi Ala-Kurikka MeiaTeam Department of Electrical an Information Engineering University
More informationBends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways
Ben, Jogs, An Wiggles for Railroa Tracks an Vehicle Guie Ways Louis T. Klauer Jr., PhD, PE. Work Soft 833 Galer Dr. Newtown Square, PA 19073 lklauer@wsof.com Preprint, June 4, 00 Copyright 00 by Louis
More informationTHE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE
БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:
More informationChalmers Publication Library
Chalmers Publication Library All-to-all Broacast for Vehicular Networks Base on Coe Slotte ALOHA This ocument has been ownloae from Chalmers Publication Library (CPL). It is the author s version of a work
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html
More informationA shortest path algorithm in multimodal networks: a case study with time varying costs
A shortest path algorithm in multimoal networks: a case stuy with time varying costs Daniela Ambrosino*, Anna Sciomachen* * Department of Economics an Quantitative Methos (DIEM), University of Genoa Via
More informationAn Introduction of BOM Modeling Framework
An Introuction of BOM Moeling Framework Qiang He, Ming-xin Zhang, an Jian-xing Gong Astract Component ase moeling has een a research hotpot in the area of Moeling an Simulation for a long time. In orer
More informationDemystifying Automata Processing: GPUs, FPGAs or Micron s AP?
Demystifying Automata Processing: GPUs, FPGAs or Micron s AP? Marziyeh Nourian 1,3, Xiang Wang 1, Xiaoong Yu 2, Wu-chun Feng 2, Michela Becchi 1,3 1,3 Department of Electrical an Computer Engineering,
More informationCoordinating Distributed Algorithms for Feature Extraction Offloading in Multi-Camera Visual Sensor Networks
Coorinating Distribute Algorithms for Feature Extraction Offloaing in Multi-Camera Visual Sensor Networks Emil Eriksson, György Dán, Viktoria Foor School of Electrical Engineering, KTH Royal Institute
More informationOptimal Distributed P2P Streaming under Node Degree Bounds
Optimal Distribute P2P Streaming uner Noe Degree Bouns Shaoquan Zhang, Ziyu Shao, Minghua Chen, an Libin Jiang Department of Information Engineering, The Chinese University of Hong Kong Department of EECS,
More informationContents on the Move: Content Caching and Delivery at the Wireless Network Edge
Contents on the Move: Content Caching an Delivery at the Wireless Network Ege Deniz Günüz Imperial College Lonon 20 June 2017 icore/ Commnet2 Joint Workshop: Content Caching an Distribute Storage for Future
More informationTwo Dimensional-IP Routing
Two Dimensional-IP Routing Mingwei Xu Shu Yang Dan Wang Hong Kong Polytechnic University Jianping Wu Abstract Traitional IP networks use single-path routing, an make forwaring ecisions base on estination
More informationState Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway
State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle
More informationBaring it all to Software: The Raw Machine
Baring it all to Software: The Raw Machine Elliot Waingol, Michael Taylor, Vivek Sarkar, Walter Lee, Victor Lee, Jang Kim, Matthew Frank, Peter Finch, Srikrishna Devabhaktuni, Rajeev Barua, Jonathan Babb,
More informationScalable Deterministic Scheduling for WDM Slot Switching Xhaul with Zero-Jitter
FDL sel. VOA SOA 100 Regular papers ONDM 2018 Scalable Deterministic Scheuling for WDM Slot Switching Xhaul with Zero-Jitter Bogan Uscumlic 1, Dominique Chiaroni 1, Brice Leclerc 1, Thierry Zami 2, Annie
More informationMODULE VII. Emerging Technologies
MODULE VII Emerging Technologies Computer Networks an Internets -- Moule 7 1 Spring, 2014 Copyright 2014. All rights reserve. Topics Software Define Networking The Internet Of Things Other trens in networking
More informationTopics. Computer Networks and Internets -- Module 5 2 Spring, Copyright All rights reserved.
Topics Internet concept an architecture Internet aressing Internet Protocol packets (atagrams) Datagram forwaring Aress resolution Error reporting mechanism Configuration Network aress translation Computer
More informationPolitecnico di Torino. Porto Institutional Repository
Politecnico i Torino Porto Institutional Repositor [Article] Scalale Algorithms for NFA Multi-Striing an NFA-Base Deep Packet Inspection on GPUs Original Citation: M. Avalle; F. Risso; R. Sisto (6). Scalale
More informationDynamic Capacity Allocation in OTN Networks
Communications an Network, 2015, 7, 43-54 Publishe Online February 2015 in SciRes. http://www.scirp.org/journal/cn http://x.oi.org/10.4236/cn.2015.71005 Dynamic Capacity Allocation in OTN Networks Maria
More informationSupporting Fully Adaptive Routing in InfiniBand Networks
XIV JORNADAS DE PARALELISMO - LEGANES, SEPTIEMBRE 200 1 Supporting Fully Aaptive Routing in InfiniBan Networks J.C. Martínez, J. Flich, A. Robles, P. López an J. Duato Resumen InfiniBan is a new stanar
More informationEfficient and Scalable Sequence-Based XML Filtering
Efficient an Scalale Sequence-Base XML Filtering Mariam Salloum University of California, Riversie, CA, USA msalloum@cs.ucr.eu ABSTRACT The uiquitous aoption of XML as the stanar of ata exchange over the
More informationImpact of changing the position of the tool point on the moving platform on the dynamic performance of a 3RRR planar parallel manipulator
IOSR Journal of Mechanical an Civil Engineering (IOSR-JMCE) e-issn: 78-84,p-ISSN: 0-4X, Volume, Issue 4 Ver. I (Jul. - Aug. 05), PP 7-8 www.iosrjournals.org Impact of changing the position of the tool
More informationAd-Hoc Networks Beyond Unit Disk Graphs
A-Hoc Networks Beyon Unit Disk Graphs Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger Department of Computer Science ETH Zurich 8092 Zurich, Switzerlan {kuhn, wattenhofer, zollinger}@inf.ethz.ch ABSTRACT
More informationNon-homogeneous Generalization in Privacy Preserving Data Publishing
Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h
More informationPerformance Modelling of Necklace Hypercubes
erformance Moelling of ecklace ypercubes. Meraji,,. arbazi-aza,, A. atooghy, IM chool of Computer cience & harif University of Technology, Tehran, Iran {meraji, patooghy}@ce.sharif.eu, aza@ipm.ir a Abstract
More informationA Metric for Routing in Delay-Sensitive Wireless Sensor Networks
A Metric for Routing in Delay-Sensitive Wireless Sensor Networks Zhen Jiang Jie Wu Risa Ito Dept. of Computer Sci. Dept. of Computer & Info. Sciences Dept. of Computer Sci. West Chester University Temple
More informationLab work #8. Congestion control
TEORÍA DE REDES DE TELECOMUNICACIONES Grao en Ingeniería Telemática Grao en Ingeniería en Sistemas e Telecomunicación Curso 2015-2016 Lab work #8. Congestion control (1 session) Author: Pablo Pavón Mariño
More informationA Duality Based Approach for Realtime TV-L 1 Optical Flow
A Duality Base Approach for Realtime TV-L 1 Optical Flow C. Zach 1, T. Pock 2, an H. Bischof 2 1 VRVis Research Center 2 Institute for Computer Graphics an Vision, TU Graz Abstract. Variational methos
More informationCharacterizing Decoding Robustness under Parametric Channel Uncertainty
Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric
More informationKinematic Analysis of a Family of 3R Manipulators
Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,
More informationOverview. Operating Systems I. Simple Memory Management. Simple Memory Management. Multiprocessing w/fixed Partitions.
Overview Operating Systems I Management Provie Services processes files Manage Devices processor memory isk Simple Management One process in memory, using it all each program nees I/O rivers until 96 I/O
More informationResearch Article REALFLOW: Reliable Real-Time Flooding-Based Routing Protocol for Industrial Wireless Sensor Networks
Hinawi Publishing Corporation International Journal of Distribute Sensor Networks Volume 2014, Article ID 936379, 17 pages http://x.oi.org/10.1155/2014/936379 Research Article REALFLOW: Reliable Real-Time
More informationInterference and diffraction are the important phenomena that distinguish. Interference and Diffraction
C H A P T E R 33 Interference an Diffraction 33- Phase Difference an Coherence 33-2 Interference in Thin Films 33-3 Two-Slit Interference Pattern 33-4 Diffraction Pattern of a Single Slit * 33-5 Using
More informationFog Computing May Help to Save Energy in Cloud Computing
Fog Computing May Help to Save Energy in Cloud Computing Fatemeh Jalali, Kerry Hinton, Robert Ayre, Tansu Alpcan, and Rodney S. Tucker IBM Research, Melbourne, Australia; the Centre for Energy-Efficient
More informationA Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition
ITERATIOAL JOURAL OF MATHEMATICS AD COMPUTERS I SIMULATIO A eural etwork Moel Base on Graph Matching an Annealing :Application to Han-Written Digits Recognition Kyunghee Lee Abstract We present a neural
More information