Minimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Minimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures"

Transcription

1 Mnmal Codng Network Wth Combnatoral Structure For Instantaneous Recovery From Edge Falures Ashly Joseph 1, Mr.M.Sadsh Sendl 2, Dr.S.Karthk 3 1 Fnal Year ME CSE Student Department of Computer Scence Engneerng SNS College of Technology,Combatore. ashlyj89gmal.com 2 Professor,Department of Computer Scence Engneerng SNS College of Technology,Combatore. 3 HOD,Department of CSE, SNS College of Technology,Combatore, Abstract-Protectng nodes aganst lnk falures n communcaton networks(both uncast and multcast) s essental to ncrease robustness, accessblty, and relablty of data transmsson. The use of network codng algorthm offers, establshng relable uncast connectons across a communcaton network wth non-unform edge capabltes. The Proposed System addresses the task of multcast communcaton usng usng the concept of network codng n the presence of passve eavesdroppers and actve jammers. Despte the complexty ntroduced by dstrbuted network codng, recently, t has been shown that ths rate can also be acheved for multcastng to several snks provded that the ntermedate nodes are allowed to re-encode the nformaton they receve. Index Terms- Instantaneous recovery, network codng, relable communcaton, uncast,multcast. I.INTRODUCTION In today's practcal communcaton networks such as the Internet, end-to-end nformaton delvery s performed by routng,.e., by havng ntermedate nodes store and forward packets. Note though, routng does not encompass all operatons that can be performed at a node.the ssue of relably transportng data from a sngle orgnal source to multple nterested recpents, partcularly when the recever set s large, s one of growng promnence. Recently, the noton of network codng arses as a very mportant promsng generalzaton of routng.network codng refers to a scheme where a node s allowed to generate output data by encodng (.e., computng certan functons of) ts receved data. Thus, network codng allows nformaton to be mxed", n contrast to the tradtonal routng approach where each node smply forwards receved data. Potental advantages of ths generalty of network codng over routng are many fold: resource effcency, computatonal effcency, and robustness to network dynamcs.network codng s potentally applcable to many forms of network communcatons. Up to now, the best understood scenaro where network codng offers unque advantages s multcastng n a communcaton network. A sgnfcant effort has been devoted to mprovng the reslence of communcaton networks to falures and ncreasng ther survvablty. Edge falures are frequent n communcaton networks due to the nherent vulnerablty of the communcaton nfrastructure. Wth the dramatc ncrease n data transmsson rates, even a sngle falure may result n vast data losses and cause major servce dsruptons for many users. Accordngly, there s a sgnfcant nterest n mprovng network recovery mechansms that enable a contnuous flow of data from the source to the destnaton wth mnmal damage n the event of a falure. Edge falures may occur due to several reasons, such as physcal damage, msconfguraton, or a human error. Networks are typcally desgned to be wthstand aganst a sngle edge falure. Indeed, protecton from multple falures ncurs hgh costs n terms of network utlzaton, whch s usually not justfed by the rare occurrence of such falures. we consdered the problem of establshng relable uncast (sngle-source sngle-destnaton) connectons across a communcaton 674

2 network wth nonunform edge capactes. Our goal s to provde nstantaneous recovery from sngle edge falures. Here focus on two cases of practcal nterest: 1) Backup protecton of a sngle flow that can be splt up to two subflows; and 2) shared backup protecton of two uncast flows. The nstantaneous recovery mechansms ensure a contnuous flow of data from the source to the destnaton node, wth no nterrupton or data loss n the event of a falure. Such mechansms elmnate the need of retransmsson and reroutng. Instantaneous recovery s typcally acheved by addng redundant packets and by routng packets over multple paths n a way that ensures that the destnaton node can recover the data t needs form the receved packets. Instantaneous recovery s typcally acheved by addng redundant packets and by routng packets over multple paths n a way that ensures that the destnaton node can recover. Fg.2. Dversty-Codng method for h=2. The dversty codng technque extends the dedcated path protecton scheme by usng multple dsjont paths for sendng the data. Ths technque can be used for protectng a sngle uncast connecton or for shared backup protecton of two or more uncast connectons (Fg.2). In the case of a sngle uncast connecton, the nformaton flow s splt nto two or more subflows, and each subflow uses a separate path to reach the destnaton. Fg.1. Dedcated path protecton method There are several technques to acheve nstantaneous recovery. A standard approach s to use the 1+1 dedcated path protecton scheme. Ths approach requres provsonng of two dsjont paths p1 and p2 between s and t. Each packet generated by the source node s sent over both paths, p1 and p2(fg. 1). In the case of a sngle edge falure, at least one of the paths remans operatonal, hence the destnaton node wll be able to receve the data wthout nterrupton. Wth ths scheme, both p1 and p2 must be of capacty at least h. Sngle edge falure, at least one of the paths remans operatonal, hence the destnaton node wll be able to receve the data wthout nterrupton. Wth ths scheme, both p1 and p2 must be of capacty at least h. Whle the dedcated path protecton scheme s smple and easy to mplement, t ncurs hgh communcaton overhead due to the need to transmt two copes of each packet. The dedcated path protecton scheme s smple and easy to mplement, t ncurs hgh communcaton overhead due to the need to transmt two copes of each packet. In addton, t requres the exstence of two dsjont paths, each of capacty h between s and t. some examples shows a dversty codng scheme that uses three dsjont pathsp1, P2, and P3 of capacty one between s and t to protect a uncast flow of rate two packets per communcaton round. In ths example, the flow s splt nto two subflows that use paths P1 and P2 to send data to the destnaton, whle path P3 serves as a shared backup protecton for these subflows. The network codng approach generalzes both the dedcated protecton and the dversty codng approach. In partcular, t enables shared backup protecton of multple uncast connectons and does not requre multple lnkdsjont paths between the source and destnaton nodes. The network, edges (s,v1) and (s,v2)are of capacty two, whle all other edges are of unt capacty. Our goal s to establsh a uncast connecton that delvers two packets from s to t per communcaton round. Thus ths paper ncludes a robust network code for both uncast and multcast networks can be establshed through the standard network codng algorthm.by dvdng the smple network nto blocks,t s possble to route the packets effcently n the case when h=2 and also when h>2.some mprovements on the exstng network codng algorthm s done for effcently handlng the above mentoned functonaltes. We also address the problem of effcent allocaton of network resources for a robust codng network. 675

3 by removng an edge or decreasng the capacty of an edge s no longer feasble. It s easy to verfy that the capacty of each edge n a mnmal network s bounded by h. Related work The network codng technque has been ntroduced n the semnal paper of Ahlswede et al. [3]. Intal work on network codng has focused on multcast connectons. It was shown n [3] that the maxmum rate of a multcast network s equal to the mnmum total capacty of a cut that separates the source from a termnal. Ths maxmum rate can be acheved by usng lnear network codes [8]. Ho et al. [9] showed that the maxmum rate can be acheved by usng random lnear network codes. Jagg et al. [10] proposed a determnstc polynomal-tme algorthm for fndng feasble network codes n multcast networks. They showed that f the network has a suffcent capacty to recover from each falure scenaro (e.g., by reroutng) then nstantaneous recovery from each falure scenaro can be acheved by employng lnear network codes. A. Our contrbuton In ths paper we propose effcent algorthms for constructon of robust network codes over small fnte felds. We consder two major cases. In the frst case, we assume that all edges of the network have unform capacty, whle n the second case the capacty of network edges can vary. For the frst case we present an effcent network codng algorthm that dentfes a robust network code over a small feld. The algorthm takes advantage of specal propertes of Maxmum Rank Dstance (MRD) codes [13]. For the second case, we focus on settngs n whch the source node needs to delver two packets per tme unt to all termnals. We show that n ths case, a specal topologcal propertes of robust codng networks can be exploted for constructng a network code over a small fnte feld. II MODEL A. Multcast Network A multcast network N that uses a drected acyclc graph G(V,E) to send data from source s to a set T of k destnaton nodes {t1,..., tk} V. The data s delvered n packets. We assume that each packet s an element of a fnte feld Fq = GF(q). We also assume that the data exchange s performed n rounds, such that each edge e E can transmt c(e) packets per communcaton round. We assume that c(e) s an nteger number and refer to t as the capacty of edge e. At each communcaton round, the source node needs to transmt h packets R = (p1, p2,..., ph) T from the source node s V to each destnaton node t T. We refer to h as the rate of the multcast connecton. It was shown n [3] and [8] that the maxmum rate of the network,.e., the maxmum number of packets that can be sent from the source s to a set T of termnals per tme unt, s equal to the mnmum capacty of a cut that separates the source s from a termnal t T. Accordngly, we say that a multcast network N s feasble f any cut that separates s and a termnal t T has at least h edges. We say that a codng network N s mnmal f any network formed from N B. Codng Networks For clarty of presentaton, we defne an auxlary graph ˆG(V,A) formed by the network graph G(V,E) by substtutng each edge e E by c(e) parallel arcs that have the same tal and head nodes as e; each arc can transmt one packet per communcaton round. We denote by A(e) A the set of arcs that correspond to edge e. In what follows we only refer to packets sent at the current communcaton round. The packets sent n the subsequent rounds are handled n a smlar manner. C. Robust Codng Networks Snce a faled edge e cannot transmt packets, we assume that the encodng functon fa of each arc a A(e) s dentcally equal to zero,.e., fa 0. To guarantee nstantaneous recovery, t s suffcent to ensure that for each edge falure there exsts a set of h lnearly ndependent packets receved by t. We dstngush between two types of robust networks codes. In strongly robust network codes the local encodng coeffcents of all arcs n A reman the same, except for the arcs A(e) that correspond to the faled edge e whch are assgned zero encodng coeffcents. In weakly robust network codes, the arcs that are located downstream of the faled edge e are allowed to change ther encodng coeffcents, whle all the encodng coeffcents that correspond to other edges must reman the same. III. STRONGLY ROBUST CODES FOR NETWORKS WITH UNIFORM CAPACITIES All edges are of the network have unform capacty c,.e., each edge can send exactly c packets per tme unt. We present an effcent algorthm that can construct a robust network code over a fnte feld of sze O(k). We observe that wthout loss of generalty, we can assume that the capacty of each edge s one unt. Indeed, a feasble network code for unt capacty edges can be extended nto the case n whch the capacty of each edges s equal to c by combnng c communcaton rounds nto a sngle round. In [10] t was shown that communcaton at rate h wth nstantaneous recovery from sngle edge falures s possble f and only f for each edge e E, t holds that the network G (V,E ) formed from G(V,E) by removng e, contans at least h edge-dsjont paths from source s to each termnal node t T. Ths mples that a necessary and suffcent condton for the feasblty of network N s the exstence of h+1 edgedsjont paths between s and each t T. Our approach can be summarzed as follows. Frst, we generate a specal party check packet, referred to as ph+1. Ths packet s a lnear combnaton of the orgnal packets and s constructed as descrbed n Secton III-A. Then, we use a standard network codng algorthm due to Jagg et al. [10] for sendng ˆR = {p1, p2,..., ph, ph+1} 676

4 IV. NETWORK WITH NON-UNIFORM CAPACITIES packets from s to T. The standard algorthm wll treat the packets n ˆR as generated by ndependent random processes. The algorthm ensures that n the normal network condtons, each destnaton node receves h + 1 ndependent lnear combnaton of the packets n ˆR. The followng lemma shows that after a sngle edge falure, each destnaton node receves at least h lnearly ndependent combnatons of packets n ˆR. Lemma 1: Upon an edge falure, each termnal t T receves at least h lnear combnatons of packets n ˆR. Proof: Snce we assume that all edges are of unt capacty, each edge n the network can be represented by a sngle arc. For each arc a A we defne the global encodng vector that captures the relaton between the packet pa transmtted on arc a and the orgnal packets n ˆR: h + 1 = 1 p = p γ e. e Let t be a termnal n T. We defne the transfer matrx Mt that captures the relaton between the orgnal packets R and the packets receved by the termnal node t T over ts ncomng edges. The dfferent network edges have dfferent capactes. We focus on a specal case n whch only two packets need to be delvered from the source to all termnals at each communcaton round. The desgn of robust network codes for h = 2 n the context of uncast connectons has been studed n [11]. In ths work, we buld on the results of [22] for constructng a robust network code for multcast connectons. Let G(V,E) be a mnmum robust codng network,.e, a feasble robust network such that the removal of an edge or a reducton n the capacty of an edge results n a volaton of ts feasblty. Note that the capacty of any edge e E s at most two. For each termnal t T let Gt(Vt,Et) to be a subgraph of G(V,E) that contans a mnmum codng network wth respect to termnal t. That s, Gt(Vt,Et) only contans edges of G(V,E) that are necessary to guarantee the condtons defned by Equaton 1 for termnal t. Furthermore, any reducton of the capacty of edges n Gt(Vt,Et) wll result n a volaton of ths condton for at least one of the (s, t) cuts. V. CONCLUSION A. Creatng party check packet Lemma 1 mples that n the event of any sngle edge falure, each termnal node receves at least h ndependent lnear combnatons of the packets n {p1, p2,..., ph, ph+1}. Snce packet ph+1 s a lnear combnaton of h orgnal packets R = {p1, p2,..., ph}, each destnaton nodes receves, n fact, h lnear combnatons of R. Accordngly, our goal s to construct packet ph+1 n such a way that each destnaton node receves h ndependent lnear combnatons of R. Ths wll allow each destnaton node to decode the orgnal packets. For clarty of presentaton we frst focus on the case of h = 2. In ths case we have two orgnal packets, p1 and p2, and one party check packet p3 = γ1 p1+γ2 p2. Suppose that a termnal t T receves two lnearly ndependent combnatons of p1, p2, and p3. B. General case We turn to consder a more general case of h > 2. Snce we need to only recover from a sngle falure, we need to fnd a (h + 1, h) MRD code. For ths case, we can use the party check matrx [13]: 2 h H = α, α, Kα,1 over the feld GF(qh+1), wth h p h + 1 = α p = 1 We summarze our results by the followng theorem: Theorem 1: The proposed scheme acheves an nstantaneous recovery from any sngle edge falure. Proof: Follows drectly from the propertes of MRD codes [13]. Ths paper addressed the problem of constructng robust network codes for uncast networks,.e., codes that enable nstantaneous recovery from sngle edge falures. There s need to obtan the same results for multcast connectons also. But the networks where the achevable rates obtaned by codng at ntermedate nodes are arbtrarly larger s not allowed. An effcent network codng algorthm based on the MRD codes that requres a small fnte feld O(k)can be used. For the case of nonunform capactes, we focused on a specal case of h = 2 and showed that t s also possble to construct a robust code over a small feld. Future research ncludes the constructon of network codes wth non-unform capactes and transmsson of more than two packets per communcaton round. REFERENCES [1] W.D.Grover.,Ho. lugmesh-based Survvable Transport Networks:Optons and Strateges ntented for Optcal,MPLS,SONET and ATM Networkng.Prentce- Hall,New York,NY,USA,2003 [2] E.Ayanoglu,C.L.I.R.D.Gtln And J.E.Mazo.Dversty codng for transparent self-healng and fault-tolerent communcaton networks. IEEE Transactons on communcatons,41,(11):1677, 1686,1993. [3] R.Ahlswede,N.Ca,S.Y.R.L,and R.w.Yeung.Network Informaton Flow,IEEE Transactons on Informaton Theory,46(4): ,

5 [4] R.Kotter and M.Medard.An Algebrac Approach to Network Codng.IEEE/ACM Transactons On Networkng, 11(5): ,2003. [5] T.Ho,M.Medara, and R.Koetter.An Informaton Theoretc vew of Network Management.IEEE Transactons on Informaton Theory,51(4),Aprl [6] Desmond S Lun,Murel Medard,Ralf Kotter, and Mchelle Effros.Further results on codng for Relable communcaton over packet networks. In IEEE Internatonal Symposum on Informaton Theory (ISIT 05),2005. [7] Desmond S.Lun,Murel Medard, and Mchelle Effros, On codng for relable communcaton Over packet networks.in Proc.42 nd Annual Allerton Conference on Communcaton, Control,And Computng,Sept- Oct.2004,Invted,2004. [8] S.Y.R.L,R.W.Yeung,and N.Ca.Lnear Network Codng, IEEE Transactons on Informaton Theory,49(2): ,2003 [9] T.Ho,R.Kotter,M.Medard,D.Karger, and M.Effros. The Benefts of Codng Over Routng n a Randomzed Settng, In Proceedngs of the IEEE Internatonal Symposum on Informaton Theory,2003. [10] S. Jagg, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jan, and L. Tolhuzen. Polynomal Tme Algorthms for Multcast Network Code Constructon. To appear n IEEE Transactons on Informaton Theory, [11] S. Jagg, M. Langberg, S. Katt, T. Ho, D. Katab, R.C.N.M. Medard, and M. Effros. Reslent Network Codng n the Presence of Byzantne Adversares. IEEE Transactons on Informaton Theory, 54(6): , June [12] D. Slva, F.R. Kschschang, and R. Koetter. A Rank- Metrc Approach to Error Control I Random Network Codng. Informaton Theory, IEEE Transactons on, 54(9): , Sept [13] E. Gabduln. Theory of codes wth maxmum rank dstance. Problems of Informaton Transmsson, 21(1):3 14, July

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

Availability-Based Path Selection and Network Vulnerability Assessment

Availability-Based Path Selection and Network Vulnerability Assessment Avalablty-Based Path Selecton and Network Vulnerablty Assessment Song Yang, Stojan Trajanovsk and Fernando A. Kupers Delft Unversty of Technology, The Netherlands {S.Yang, S.Trajanovsk, F.A.Kupers}@tudelft.nl

More information

Wireless Inter-Session Network Coding - An Approach Using Virtual Multicasts

Wireless Inter-Session Network Coding - An Approach Using Virtual Multicasts Wreless Inter-Sesson Network Codng - An Approach Usng Vrtual Multcasts Mchael Hendlmaer,DesmondS.Lun,DanalTraskov,andMurelMédard Insttute for Communcatons Engneerng CCIB RLE Technsche Unverstät München

More information

Proactive Secret Sharing Or: How to Cope With Perpetual Leakage

Proactive Secret Sharing Or: How to Cope With Perpetual Leakage Proactve Secret Sharng Or: How to Cope Wth Perpetual Leakage Paper by Amr Herzberg Stanslaw Jareck Hugo Krawczyk Mot Yung Presentaton by Davd Zage What s Secret Sharng Basc Idea ((2, 2)-threshold scheme):

More information

denote the location of a node, and suppose node X . This transmission causes a successful reception by node X for any other node

denote the location of a node, and suppose node X . This transmission causes a successful reception by node X for any other node Fnal Report of EE359 Class Proect Throughput and Delay n Wreless Ad Hoc Networs Changhua He changhua@stanford.edu Abstract: Networ throughput and pacet delay are the two most mportant parameters to evaluate

More information

DISTRIBUTED storage systems have been becoming increasingly

DISTRIBUTED storage systems have been becoming increasingly 268 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 28, NO. 2, FEBRUARY 2010 Cooperatve Recovery of Dstrbuted Storage Systems from Multple Losses wth Network Codng Yuchong Hu, Ynlong Xu, Xaozhao

More information

Priv-Code: Preserving Privacy Against Traffic Analysis through Network Coding for Multihop Wireless Networks

Priv-Code: Preserving Privacy Against Traffic Analysis through Network Coding for Multihop Wireless Networks Prv-Code: Preservng Prvacy Aganst Traffc Analyss through Networ Codng for Multhop Wreless Networs Zhguo Wan, Ka Xng, Yunhao Lu MOE Key Lab for Informaton System Securty, School of Software, Tsnghua Natonal

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

Fault tolerance in cloud technologies presented as a service

Fault tolerance in cloud technologies presented as a service Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance

More information

Optimization of network mesh topologies and link capacities for congestion relief

Optimization of network mesh topologies and link capacities for congestion relief Optmzaton of networ mesh topologes and ln capactes for congeston relef D. de Vllers * J.M. Hattngh School of Computer-, Statstcal- and Mathematcal Scences Potchefstroom Unversty for CHE * E-mal: rwddv@pu.ac.za

More information

taposh_kuet20@yahoo.comcsedchan@cityu.edu.hk rajib_csedept@yahoo.co.uk, alam_shihabul@yahoo.com

taposh_kuet20@yahoo.comcsedchan@cityu.edu.hk rajib_csedept@yahoo.co.uk, alam_shihabul@yahoo.com G. G. Md. Nawaz Al 1,2, Rajb Chakraborty 2, Md. Shhabul Alam 2 and Edward Chan 1 1 Cty Unversty of Hong Kong, Hong Kong, Chna taposh_kuet20@yahoo.comcsedchan@ctyu.edu.hk 2 Khulna Unversty of Engneerng

More information

A Constant Factor Approximation for the Single Sink Edge Installation Problem

A Constant Factor Approximation for the Single Sink Edge Installation Problem A Constant Factor Approxmaton for the Sngle Snk Edge Installaton Problem Sudpto Guha Adam Meyerson Kamesh Munagala Abstract We present the frst constant approxmaton to the sngle snk buy-at-bulk network

More information

PAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign

PAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of Illnos-Urbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng

More information

Secure Network Coding Over the Integers

Secure Network Coding Over the Integers Secure Network Codng Over the Integers Rosaro Gennaro Jonathan Katz Hugo Krawczyk Tal Rabn Abstract Network codng has receved sgnfcant attenton n the networkng communty for ts potental to ncrease throughput

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

Efficient Project Portfolio as a tool for Enterprise Risk Management

Efficient Project Portfolio as a tool for Enterprise Risk Management Effcent Proect Portfolo as a tool for Enterprse Rsk Management Valentn O. Nkonov Ural State Techncal Unversty Growth Traectory Consultng Company January 5, 27 Effcent Proect Portfolo as a tool for Enterprse

More information

An Alternative Way to Measure Private Equity Performance

An Alternative Way to Measure Private Equity Performance An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.

More information

"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *

Research Note APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES * Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC

More information

Energy Efficient Routing in Ad Hoc Disaster Recovery Networks

Energy Efficient Routing in Ad Hoc Disaster Recovery Networks Energy Effcent Routng n Ad Hoc Dsaster Recovery Networks Gl Zussman and Adran Segall Department of Electrcal Engneerng Technon Israel Insttute of Technology Hafa 32000, Israel {glz@tx, segall@ee}.technon.ac.l

More information

Master s Thesis. Configuring robust virtual wireless sensor networks for Internet of Things inspired by brain functional networks

Master s Thesis. Configuring robust virtual wireless sensor networks for Internet of Things inspired by brain functional networks Master s Thess Ttle Confgurng robust vrtual wreless sensor networks for Internet of Thngs nspred by bran functonal networks Supervsor Professor Masayuk Murata Author Shnya Toyonaga February 10th, 2014

More information

Enabling P2P One-view Multi-party Video Conferencing

Enabling P2P One-view Multi-party Video Conferencing Enablng P2P One-vew Mult-party Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract Mult-Party Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P

More information

A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks

A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks : An Adaptve, Anycast MAC Protocol for Wreless Sensor Networks Hwee-Xan Tan and Mun Choon Chan Department of Computer Scence, School of Computng, Natonal Unversty of Sngapore {hweexan, chanmc}@comp.nus.edu.sg

More information

Multi-Resource Fair Allocation in Heterogeneous Cloud Computing Systems

Multi-Resource Fair Allocation in Heterogeneous Cloud Computing Systems 1 Mult-Resource Far Allocaton n Heterogeneous Cloud Computng Systems We Wang, Student Member, IEEE, Ben Lang, Senor Member, IEEE, Baochun L, Senor Member, IEEE Abstract We study the mult-resource allocaton

More information

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedo-cho

More information

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS 21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech-2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS

More information

Recurrence. 1 Definitions and main statements

Recurrence. 1 Definitions and main statements Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

More information

Network-Wide Load Balancing Routing With Performance Guarantees

Network-Wide Load Balancing Routing With Performance Guarantees Network-Wde Load Balancng Routng Wth Performance Guarantees Kartk Gopalan Tz-cker Chueh Yow-Jan Ln Florda State Unversty Stony Brook Unversty Telcorda Research kartk@cs.fsu.edu chueh@cs.sunysb.edu yjln@research.telcorda.com

More information

J. Parallel Distrib. Comput.

J. Parallel Distrib. Comput. J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n

More information

Multi-Source Video Multicast in Peer-to-Peer Networks

Multi-Source Video Multicast in Peer-to-Peer Networks ult-source Vdeo ultcast n Peer-to-Peer Networks Francsco de Asís López-Fuentes*, Eckehard Stenbach Technsche Unverstät ünchen Insttute of Communcaton Networks, eda Technology Group 80333 ünchen, Germany

More information

DEFINING %COMPLETE IN MICROSOFT PROJECT

DEFINING %COMPLETE IN MICROSOFT PROJECT CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,

More information

A Secure Password-Authenticated Key Agreement Using Smart Cards

A Secure Password-Authenticated Key Agreement Using Smart Cards A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,

More information

AN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONS

AN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONS Internatonal Journal of Network Securty & Its Applcatons (IJNSA), Vol.5, No.3, May 2013 AN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONS Len Harn 1 and Changlu Ln 2 1 Department of Computer Scence

More information

An Interest-Oriented Network Evolution Mechanism for Online Communities

An Interest-Oriented Network Evolution Mechanism for Online Communities An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)

More information

Traffic State Estimation in the Traffic Management Center of Berlin

Traffic State Estimation in the Traffic Management Center of Berlin Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D-763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,

More information

Survey on Virtual Machine Placement Techniques in Cloud Computing Environment

Survey on Virtual Machine Placement Techniques in Cloud Computing Environment Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center

More information

A Lyapunov Optimization Approach to Repeated Stochastic Games

A Lyapunov Optimization Approach to Repeated Stochastic Games PROC. ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, OCT. 2013 1 A Lyapunov Optmzaton Approach to Repeated Stochastc Games Mchael J. Neely Unversty of Southern Calforna http://www-bcf.usc.edu/

More information

An Ad Hoc Network Load Balancing Energy- Efficient Multipath Routing Protocol

An Ad Hoc Network Load Balancing Energy- Efficient Multipath Routing Protocol 246 JOURNA OF SOFTWAR, VO. 9, NO. 1, JANUARY 2014 An Ad Hoc Network oad alancng nergy- ffcent Multpath Routng Protocol De-jn Kong Shanx Fnance and Taxaton College, Tayuan, Chna mal: dejnkong@163.com Xao-lng

More information

Dominant Resource Fairness in Cloud Computing Systems with Heterogeneous Servers

Dominant Resource Fairness in Cloud Computing Systems with Heterogeneous Servers 1 Domnant Resource Farness n Cloud Computng Systems wth Heterogeneous Servers We Wang, Baochun L, Ben Lang Department of Electrcal and Computer Engneerng Unversty of Toronto arxv:138.83v1 [cs.dc] 1 Aug

More information

+ + + - - This circuit than can be reduced to a planar circuit

+ + + - - This circuit than can be reduced to a planar circuit MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to

More information

Application of Multi-Agents for Fault Detection and Reconfiguration of Power Distribution Systems

Application of Multi-Agents for Fault Detection and Reconfiguration of Power Distribution Systems 1 Applcaton of Mult-Agents for Fault Detecton and Reconfguraton of Power Dstrbuton Systems K. Nareshkumar, Member, IEEE, M. A. Choudhry, Senor Member, IEEE, J. La, A. Felach, Senor Member, IEEE Abstract--The

More information

Relay Secrecy in Wireless Networks with Eavesdropper

Relay Secrecy in Wireless Networks with Eavesdropper Relay Secrecy n Wreless Networks wth Eavesdropper Parvathnathan Venktasubramanam, Tng He and Lang Tong School of Electrcal and Computer Engneerng Cornell Unversty, Ithaca, NY 14853 Emal : {pv45, th255,

More information

A Design Method of High-availability and Low-optical-loss Optical Aggregation Network Architecture

A Design Method of High-availability and Low-optical-loss Optical Aggregation Network Architecture A Desgn Method of Hgh-avalablty and Low-optcal-loss Optcal Aggregaton Network Archtecture Takehro Sato, Kuntaka Ashzawa, Kazumasa Tokuhash, Dasuke Ish, Satoru Okamoto and Naoak Yamanaka Dept. of Informaton

More information

Analysis of Energy-Conserving Access Protocols for Wireless Identification Networks

Analysis of Energy-Conserving Access Protocols for Wireless Identification Networks From the Proceedngs of Internatonal Conference on Telecommuncaton Systems (ITC-97), March 2-23, 1997. 1 Analyss of Energy-Conservng Access Protocols for Wreless Identfcaton etworks Imrch Chlamtac a, Chara

More information

BERNSTEIN POLYNOMIALS

BERNSTEIN POLYNOMIALS On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful

More information

Joint Scheduling of Processing and Shuffle Phases in MapReduce Systems

Joint Scheduling of Processing and Shuffle Phases in MapReduce Systems Jont Schedulng of Processng and Shuffle Phases n MapReduce Systems Fangfe Chen, Mural Kodalam, T. V. Lakshman Department of Computer Scence and Engneerng, The Penn State Unversty Bell Laboratores, Alcatel-Lucent

More information

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,

More information

A Novel Problem-solving Metric for Future Internet Routing Based on Virtualization and Cloud-computing

A Novel Problem-solving Metric for Future Internet Routing Based on Virtualization and Cloud-computing www.ijcsi.org 159 A Novel Problem-solvng Metrc for Future Internet Routng Based on Vrtualzaton and Cloud-computng Rujuan Zheng, Mngchuan Zhang, Qngtao Wu, Wangyang We and Haxa Zhao Electronc & Informaton

More information

Dynamic Resource Allocation and Power Management in Virtualized Data Centers

Dynamic Resource Allocation and Power Management in Virtualized Data Centers Dynamc Resource Allocaton and Power Management n Vrtualzed Data Centers Rahul Urgaonkar, Ulas C. Kozat, Ken Igarash, Mchael J. Neely urgaonka@usc.edu, {kozat, garash}@docomolabs-usa.com, mjneely@usc.edu

More information

LAMOR: Lifetime-Aware Multipath Optimized Routing Algorithm for Video Transmission over Ad Hoc Networks

LAMOR: Lifetime-Aware Multipath Optimized Routing Algorithm for Video Transmission over Ad Hoc Networks LAMOR: Lfetme-Aware Multpath Optmzed Routng Algorthm for Vdeo ransmsson over Ad Hoc Networks 1 Lansheng an, Lng Xe, Kng-m Ko, Mng Le and Moshe Zukerman Abstract Multpath routng s a key technque to support

More information

2008/8. An integrated model for warehouse and inventory planning. Géraldine Strack and Yves Pochet

2008/8. An integrated model for warehouse and inventory planning. Géraldine Strack and Yves Pochet 2008/8 An ntegrated model for warehouse and nventory plannng Géraldne Strack and Yves Pochet CORE Voe du Roman Pays 34 B-1348 Louvan-la-Neuve, Belgum. Tel (32 10) 47 43 04 Fax (32 10) 47 43 01 E-mal: corestat-lbrary@uclouvan.be

More information

A Performance Analysis of View Maintenance Techniques for Data Warehouses

A Performance Analysis of View Maintenance Techniques for Data Warehouses A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao

More information

Erasure Codes-based Storage-aware Protocol for Preserving Cloud Data under Correlation Failures

Erasure Codes-based Storage-aware Protocol for Preserving Cloud Data under Correlation Failures Internatonal Journal of Grd Dstrbuton Computng, pp.5-26 http://dx.do.org/0.4257/gdc.205.8.2. Erasure Codes-based Storage-aware Protocol for Preservng Cloud Data under Correlaton Falures Zhqang Ruan and

More information

Asynchronous Neighbor Discovery on Duty-cycled Mobile Devices: Integer and Non-Integer Schedules

Asynchronous Neighbor Discovery on Duty-cycled Mobile Devices: Integer and Non-Integer Schedules Asynchronous Neghbor Dscovery on Duty-cycled Moble Devces: Integer and Non-Integer Schedules Sxa Chen Central Connectcut State Unversty schen@ccsu.edu Yanyuan Qn Unversty of Connectcut yanyuan.qn@uconn.edu

More information

Approximation algorithms for allocation problems: Improving the factor of 1 1/e

Approximation algorithms for allocation problems: Improving the factor of 1 1/e Approxmaton algorthms for allocaton problems: Improvng the factor of 1 1/e Urel Fege Mcrosoft Research Redmond, WA 98052 urfege@mcrosoft.com Jan Vondrák Prnceton Unversty Prnceton, NJ 08540 jvondrak@gmal.com

More information

A Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing

A Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing A Replcaton-Based and Fault Tolerant Allocaton Algorthm for Cloud Computng Tork Altameem Dept of Computer Scence, RCC, Kng Saud Unversty, PO Box: 28095 11437 Ryadh-Saud Araba Abstract The very large nfrastructure

More information

Energy Conserving Routing in Wireless Ad-hoc Networks

Energy Conserving Routing in Wireless Ad-hoc Networks Energy Conservng Routng n Wreless Ad-hoc Networks Jae-Hwan Chang and Leandros Tassulas Department of Electrcal and Computer Engneerng & Insttute for Systems Research Unversty of Maryland at College ark

More information

A Parallel Architecture for Stateful Intrusion Detection in High Traffic Networks

A Parallel Architecture for Stateful Intrusion Detection in High Traffic Networks A Parallel Archtecture for Stateful Intruson Detecton n Hgh Traffc Networks Mchele Colajann Mrco Marchett Dpartmento d Ingegnera dell Informazone Unversty of Modena {colajann, marchett.mrco}@unmore.t Abstract

More information

RequIn, a tool for fast web traffic inference

RequIn, a tool for fast web traffic inference RequIn, a tool for fast web traffc nference Olver aul, Jean Etenne Kba GET/INT, LOR Department 9 rue Charles Fourer 90 Evry, France Olver.aul@nt-evry.fr, Jean-Etenne.Kba@nt-evry.fr Abstract As networked

More information

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange

More information

8 Algorithm for Binary Searching in Trees

8 Algorithm for Binary Searching in Trees 8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the

More information

Virtual Network Embedding with Coordinated Node and Link Mapping

Virtual Network Embedding with Coordinated Node and Link Mapping Vrtual Network Embeddng wth Coordnated Node and Lnk Mappng N. M. Mosharaf Kabr Chowdhury Cherton School of Computer Scence Unversty of Waterloo Waterloo, Canada Emal: nmmkchow@uwaterloo.ca Muntasr Rahan

More information

Efficient Bandwidth Management in Broadband Wireless Access Systems Using CAC-based Dynamic Pricing

Efficient Bandwidth Management in Broadband Wireless Access Systems Using CAC-based Dynamic Pricing Effcent Bandwdth Management n Broadband Wreless Access Systems Usng CAC-based Dynamc Prcng Bader Al-Manthar, Ndal Nasser 2, Najah Abu Al 3, Hossam Hassanen Telecommuncatons Research Laboratory School of

More information

A New Paradigm for Load Balancing in Wireless Mesh Networks

A New Paradigm for Load Balancing in Wireless Mesh Networks A New Paradgm for Load Balancng n Wreless Mesh Networks Abstract: Obtanng maxmum throughput across a network or a mesh through optmal load balancng s known to be an NP-hard problem. Desgnng effcent load

More information

QoS-Aware Active Queue Management for Multimedia Services over the Internet

QoS-Aware Active Queue Management for Multimedia Services over the Internet QoS-Aware Actve Queue Management for Multmeda Servces over the Internet I-Shyan Hwang, *Bor-Junn Hwang, Pen-Mng Chang, Cheng-Yu Wang Abstract Recently, the multmeda servces such as IPTV, vdeo conference

More information

Research of Network System Reconfigurable Model Based on the Finite State Automation

Research of Network System Reconfigurable Model Based on the Finite State Automation JOURNAL OF NETWORKS, VOL., NO. 5, MAY 24 237 Research of Network System Reconfgurable Model Based on the Fnte State Automaton Shenghan Zhou and Wenbng Chang School of Relablty and System Engneerng, Behang

More information

An Efficient Recovery Algorithm for Coverage Hole in WSNs

An Efficient Recovery Algorithm for Coverage Hole in WSNs An Effcent Recover Algorthm for Coverage Hole n WSNs Song Ja 1,*, Wang Balng 1, Peng Xuan 1 School of Informaton an Electrcal Engneerng Harbn Insttute of Technolog at Weha, Shanong, Chna Automatc Test

More information

An agent architecture for network support of distributed simulation systems

An agent architecture for network support of distributed simulation systems An agent archtecture for network support of dstrbuted smulaton systems Robert Smon, Mark Pullen and Woan Sun Chang Department of Computer Scence George Mason Unversty Farfax, VA, 22032 U.S.A. smon, mpullen,

More information

Traffic Engineering without Congestion Hot Spots in MPLS

Traffic Engineering without Congestion Hot Spots in MPLS Vol. 02, No. 07, 200, 2227-2233 Traffc Engneerng wthout Congeston Hot Spots n MPLS A.Padmaprya(Author) Assstant Professor Department of Computer Scence & Engneerng Alagappa Unversty, Karakud, Taml Nadu,

More information

A New Quality of Service Metric for Hard/Soft Real-Time Applications

A New Quality of Service Metric for Hard/Soft Real-Time Applications A New Qualty of Servce Metrc for Hard/Soft Real-Tme Applcatons Shaoxong Hua and Gang Qu Electrcal and Computer Engneerng Department and Insttute of Advanced Computer Study Unversty of Maryland, College

More information

Dynamic Routing in Self-Healing MPLS Networks

Dynamic Routing in Self-Healing MPLS Networks Dynamc Rng n Self-Healng MPS Networs Krzysztof Walowa Char of Systems and Computer Networs, Faculty of Electroncs, Wroclaw Unersty of Technology, Wybrzeze Wyspansego 27, 50-370 Wroclaw, Poland walowa@zss.pwr.wroc.pl

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.

More information

General Auction Mechanism for Search Advertising

General Auction Mechanism for Search Advertising General Aucton Mechansm for Search Advertsng Gagan Aggarwal S. Muthukrshnan Dávd Pál Martn Pál Keywords game theory, onlne auctons, stable matchngs ABSTRACT Internet search advertsng s often sold by an

More information

ABSTRACT. Categories and Subject Descriptors. General Terms. Keywords

ABSTRACT. Categories and Subject Descriptors. General Terms. Keywords On Desgnng Incentve-Compatble Routng and Forwardng Protocols n Wreless Ad-Hoc Networks An Integrated Approach Usng Game Theoretcal and Cryptographc Technques Sheng Zhong L (Erran) L Yanbn Grace Lu Yang

More information

Efficient Striping Techniques for Variable Bit Rate Continuous Media File Servers æ

Efficient Striping Techniques for Variable Bit Rate Continuous Media File Servers æ Effcent Strpng Technques for Varable Bt Rate Contnuous Meda Fle Servers æ Prashant J. Shenoy Harrck M. Vn Department of Computer Scence, Department of Computer Scences, Unversty of Massachusetts at Amherst

More information

Lecture 7 March 20, 2002

Lecture 7 March 20, 2002 MIT 8.996: Topc n TCS: Internet Research Problems Sprng 2002 Lecture 7 March 20, 2002 Lecturer: Bran Dean Global Load Balancng Scrbe: John Kogel, Ben Leong In today s lecture, we dscuss global load balancng

More information

Network Security Situation Evaluation Method for Distributed Denial of Service

Network Security Situation Evaluation Method for Distributed Denial of Service Network Securty Stuaton Evaluaton Method for Dstrbuted Denal of Servce Jn Q,2, Cu YMn,2, Huang MnHuan,2, Kuang XaoHu,2, TangHong,2 ) Scence and Technology on Informaton System Securty Laboratory, Bejng,

More information

On Secrecy Capacity Scaling in Wireless Networks

On Secrecy Capacity Scaling in Wireless Networks On Secrecy Capacty Scalng n Wreless Networks O. Ozan Koyluoglu, Student Member, IEEE, C. Emre Koksal, Member, IEEE, and esham El Gamal, Fellow, IEEE arxv:0908.0898v [cs.it] 0 Apr 00 Abstract Ths work studes

More information

On the Interaction between Load Balancing and Speed Scaling

On the Interaction between Load Balancing and Speed Scaling On the Interacton between Load Balancng and Speed Scalng Ljun Chen, Na L and Steven H. Low Engneerng & Appled Scence Dvson, Calforna Insttute of Technology, USA Abstract Speed scalng has been wdely adopted

More information

Self-Motivated Relay Selection for a Generalized Power Line Monitoring Network

Self-Motivated Relay Selection for a Generalized Power Line Monitoring Network Self-Motvated Relay Selecton for a Generalzed Power Lne Montorng Network Jose Cordova and Xn Wang 1, Dong-Lang Xe 2, Le Zuo 3 1 Department of Electrcal and Computer Engneerng, State Unversty of New York

More information

Forecasting the Direction and Strength of Stock Market Movement

Forecasting the Direction and Strength of Stock Market Movement Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems

More information

When Network Effect Meets Congestion Effect: Leveraging Social Services for Wireless Services

When Network Effect Meets Congestion Effect: Leveraging Social Services for Wireless Services When Network Effect Meets Congeston Effect: Leveragng Socal Servces for Wreless Servces aowen Gong School of Electrcal, Computer and Energy Engeerng Arzona State Unversty Tempe, AZ 8587, USA xgong9@asuedu

More information

Robust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School

Robust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School Robust Desgn of Publc Storage Warehouses Yemng (Yale) Gong EMLYON Busness School Rene de Koster Rotterdam school of management, Erasmus Unversty Abstract We apply robust optmzaton and revenue management

More information

Packet Dispersion and the Quality of Voice over IP Applications in IP networks

Packet Dispersion and the Quality of Voice over IP Applications in IP networks acet Dsperson and the Qualty of Voce over I Applcatons n I networs Ham Zlatorlov, Hanoch Levy School of Computer Scence Tel Avv Unversty Tel Avv, Israel Abstract- Next Generaton Networs (NGN and the mgraton

More information

On Multi-controller Placement Optimization in Software Defined Networking - based WANs

On Multi-controller Placement Optimization in Software Defined Networking - based WANs On Mult-controller Placement Optmzaton n Software Defned Networkng - based WANs Eugen Borcoc, Radu Badea, Serban Georgca Obreja, Marus Vochn Unversty POLITEHNICA of Bucharest - UPB Bucharest, Romana eugen.borcoc@elcom.pub.ro,

More information

Generalizing the degree sequence problem

Generalizing the degree sequence problem Mddlebury College March 2009 Arzona State Unversty Dscrete Mathematcs Semnar The degree sequence problem Problem: Gven an nteger sequence d = (d 1,...,d n ) determne f there exsts a graph G wth d as ts

More information

Delay-Throughput Enhancement in Wireless Networks with Multi-path Routing and Channel Coding

Delay-Throughput Enhancement in Wireless Networks with Multi-path Routing and Channel Coding Delay-Throughput Enhancement n Wreless Networs wth Mult-path Routng and Channel Codng Kevan Ronas, Student Member, IEEE, Amr-Hamed Mohsenan-Rad, Member, IEEE, Vncent W.S. Wong, Senor Member, IEEE, Sathsh

More information

FORMAL ANALYSIS FOR REAL-TIME SCHEDULING

FORMAL ANALYSIS FOR REAL-TIME SCHEDULING FORMAL ANALYSIS FOR REAL-TIME SCHEDULING Bruno Dutertre and Vctora Stavrdou, SRI Internatonal, Menlo Park, CA Introducton In modern avoncs archtectures, applcaton software ncreasngly reles on servces provded

More information

FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES

FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES Zuzanna BRO EK-MUCHA, Grzegorz ZADORA, 2 Insttute of Forensc Research, Cracow, Poland 2 Faculty of Chemstry, Jagellonan

More information

On the Interaction between Load Balancing and Speed Scaling

On the Interaction between Load Balancing and Speed Scaling On the Interacton between Load Balancng and Speed Scalng Ljun Chen and Na L Abstract Speed scalng has been wdely adopted n computer and communcaton systems, n partcular, to reduce energy consumpton. An

More information

SEVERAL trends are opening up the era of Cloud

SEVERAL trends are opening up the era of Cloud 1 Towards Secure and Dependable Storage Servces n Cloud Computng Cong Wang, Student Member, IEEE, Qan Wang, Student Member, IEEE, Ku Ren, Member, IEEE, Nng Cao, Student Member, IEEE, and Wenjng Lou, Senor

More information

Politecnico di Torino. Porto Institutional Repository

Politecnico di Torino. Porto Institutional Repository Poltecnco d Torno Porto Insttutonal Repostory [Artcle] A cost-effectve cloud computng framework for acceleratng multmeda communcaton smulatons Orgnal Ctaton: D. Angel, E. Masala (2012). A cost-effectve

More information

To Fill or not to Fill: The Gas Station Problem

To Fill or not to Fill: The Gas Station Problem To Fll or not to Fll: The Gas Staton Problem Samr Khuller Azarakhsh Malekan Julán Mestre Abstract In ths paper we study several routng problems that generalze shortest paths and the Travelng Salesman Problem.

More information

On File Delay Minimization for Content Uploading to Media Cloud via Collaborative Wireless Network

On File Delay Minimization for Content Uploading to Media Cloud via Collaborative Wireless Network On Fle Delay Mnmzaton for Content Uploadng to Meda Cloud va Collaboratve Wreless Network Ge Zhang and Yonggang Wen School of Computer Engneerng Nanyang Technologcal Unversty Sngapore Emal: {zh0001ge, ygwen}@ntu.edu.sg

More information

Retailers must constantly strive for excellence in operations; extremely narrow profit margins

Retailers must constantly strive for excellence in operations; extremely narrow profit margins Managng a Retaler s Shelf Space, Inventory, and Transportaton Gerard Cachon 300 SH/DH, The Wharton School, Unversty of Pennsylvana, Phladelpha, Pennsylvana 90 cachon@wharton.upenn.edu http://opm.wharton.upenn.edu/cachon/

More information

Mining Multiple Large Data Sources

Mining Multiple Large Data Sources The Internatonal Arab Journal of Informaton Technology, Vol. 7, No. 3, July 2 24 Mnng Multple Large Data Sources Anmesh Adhkar, Pralhad Ramachandrarao 2, Bhanu Prasad 3, and Jhml Adhkar 4 Department of

More information

Efficient On-Demand Data Service Delivery to High-Speed Trains in Cellular/Infostation Integrated Networks

Efficient On-Demand Data Service Delivery to High-Speed Trains in Cellular/Infostation Integrated Networks IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. XX, NO. XX, MONTH 2XX 1 Effcent On-Demand Data Servce Delvery to Hgh-Speed Trans n Cellular/Infostaton Integrated Networks Hao Lang, Student Member,

More information

A Dynamic Energy-Efficiency Mechanism for Data Center Networks

A Dynamic Energy-Efficiency Mechanism for Data Center Networks A Dynamc Energy-Effcency Mechansm for Data Center Networks Sun Lang, Zhang Jnfang, Huang Daochao, Yang Dong, Qn Yajuan A Dynamc Energy-Effcency Mechansm for Data Center Networks 1 Sun Lang, 1 Zhang Jnfang,

More information