Efficient Algorithms For Optimizing Policy-Constrained Routing
|
|
- Jeffry West
- 6 years ago
- Views:
Transcription
1 Efficient Algorithms For Optimizing Policy-Constrined Routing Andrew R. Curtis Ross M. McConnell Dn Mssey Astrct Routing policies ply n essentil role in how trffic is forwrded cross the Internet. The network would not e commercilly vile without these routing policies, ut policies lso introduce inefficiencies nd fil to fully exploit the underlying network topology. Our work ssumes routes re selected ccording to some policy such s vlley-free routing policy. However, we pply policy t n ggregte trffic level nd don t require individul pckets to follow pths tht mtch the policy. Our pproch never reduces, nd usully increses, the connectivity nd cpcity of the network, nd does not infringe on the underlying motivtions tht led to the routing policy. By dopting this pproch, we lso provide polynomil lgorithms for otherwise NP-hrd prolems, including finding mximum policy-oserving routing cpcity etween two sets of AS s, minimumizing cuts seprting ll policy-oserving pths etween two sets of AS s, nd mximumizing sets of edge- or vertex-disjoint policy-oserving pths. I. INTRODUCTION In tody s Internet, routes re selected sed on comintion of network topology nd routing policies. The network topology is function of the physicl connections nd numer of studies hve ttempted to provide ccurte models or estimtions of the Internet topology. Given the network topology, one cn nswer sic grph theoretic prolems such s wht is the shortest pth etween source nd destintion or how mny disjoint pths exist etween given source nd destintion. But the topology is only prt of the story. The set of possile pths etween source nd destintion depends on oth the network topology nd the routing polices t nodes long these pths. Some pths tht exists in the topology my e disllowed due to routing polices. To identify the potentil routes etween given source nd destintion, one must consider oth the network topology nd the routing policies used in the network. As simple exmple of routing policy, suppose Colordo Stte University hs purchsed Internet service from AT&T nd Sprint. In the resulting network topology, there is link connecting Colordo Stte to AT&T nd link connecting to Colordo Stte to Sprint. The pth (AT&T, Colordo Stte, Sprint) exists in the topology nd could theoreticlly e used to forwrd pcket from n AT&T customer to Sprint customer. However, routing policy prevents n AT&T customer from using Colordo Stte s network to rech Sprint customer. Even if the Colordo Stte network hd sufficient resources to serve s n intermedite link etween AT&T nd Sprint, there is no economic incentive for Colordo Stte to provide this service. In fct, Colordo Stte purchsed connectivity from AT&T nd Sprint. AT&T cnnot use its customer Colordo Stte s trnsit network for other trffic. This simple exmple illustrtes how policies cn impct route selection. A comprehensive exmintion of Internet routing policies cn e found in [Go00] Routing policies re n essentil component of the Internet, ut routing policies cn lso led to oth prcticl nd theoreticl limittions. In this pper, we develop new theoreticl results out the impcts of policy on the vulnerility of network to filure, the cpcity nd efficiency of network, the efficiency of optiml routing lgorithms. We extend the discourging results of [EHPV05] to roder clss of optimiztion prolems. Moreover, we show tht the introduction of policy cn led to solutions tht fil to e preto-optiml, which is considered highly undesirle in economic theory, s it mens tht the costs for some ctors cn e reduced without incresing the cost for ny of the ctors, reflecting needless expenditure of resources tht is devoid of enefit for nyone. These results re not encourging nd would seem to suggest tht routing polices hve considerle prcticl nd theoreticl drwcks. However, our min result is to show tht if trivil chnge is mde not to the policies themselves, ut in minor detils out the wy they re executed, these negtive impcts cn e mde to vnish. The key chnge is to enforce policies t n ggregte level rther thn on individul pcket sis. Our work suggests tht individul pckets should e llowed to devite from the routing policy. By llowing pcket to devite from the routing policy, n individul node my e required to perform processing tht would not hve een necessry under the routing policy nd link my crry trffic tht would not hve een llowed under the routing policy. But the node or link is compensted for this cost y hving some other pcket devite from the routing policy. Overll, no node or link is worse off thn it would hve een under the policy, ut some nodes nd links gin nd the network s whole is etter off. Our primry result is to demonstrte the power of such n pproch nd motivte work on routing protocols tht follow wht we cll currency-level pproch to routing policies. Section II egin y formlly introducing the concepts of routing policies nd policy constrined network routing. Section III then shows the limittions of enforcing routing policies on pcket level sis. Section IV then introduces our currency-level pproch to enforcing routing policies nd
2 shows the how the limittions of pcket-level pproches re reduced. II. POLICY CONSTRAINED NETWORK ROUTING We egin this section y formlly defining wht is ment y routing policy nd then formlly define network routing. Our work is motivted y routing policies tht re used in tody s Internet, ut we lso seek model tht is generl enough to include wide vriety of routing policies. In prticulr, future Internet designs or other lrge-scle networks my devise policies unlike those in the current network nd we would like our results to hold under very rod clss of potentil routing policies. Towrd this end, we first introduce the strct notion of routing policy nd then show how this definition cn e used to cpture current Internet routing policy models nd then formlly define network routing A. Routing Policies Let G = (V, E) denote network topology where V represents the nodes nd E represents links etween the nodes. For exmple, the nodes in V my represent routers or my represent lrger entities such s n Internet Autonomous System. It does not mtter how the topology ws derived nd we do not ssume tht ny node or ny centrl uthority knows the full topology. The routing policy t node x V is defined s follows: Definition 1: A routing policy t node x is set of pirs {(E 1, E 1), (E 2, E 2),..., (E k, E k )}, where {E 1, E 2,..., E k } is prtition of incoming edges into x, nd where pcket coming into x on n edge E i cn e forwrded through ny edge in E i. The sets {E 1, E 2,..., E k } re distinct ut need not e disjoint, nd some E i cn e empty, mening tht x cnnot forwrd pckets coming in on n edge in E i. This generl model is intended to cover wide vriety of potentil polices nd explictly llows different policies t different nodes. For exmple, node x my represents n AS nd our model llows ech AS to independently selects its own routing policy. To see how this model pplies in the Internet, we show how the model cn e used to crete vlley-free routing policy. In the Internet, routing policies often reflect customerprovider reltionships etween Autonomous Systems. Tht is, given two ASes which re connected y link, one AS is customer of the other AS which must e the provider. In the vlley-free model, pcket cn never go from provider to customer nd then ck to provider gin. Such dip in the pth is clled vlley. Erlech et l. [EHPV05] formlize this customer-provider reltionship y modeling the AS grph s directed grph where edges point upwrds from customers to providers, tht is, if (x, y) is n edge in the grph G, then x is customer of y, nd we do not llow the nti-prrllel edge (y, x) to lso e n edge in G. A pth in this model is sid to e vlley free if it leds up from customers to providers nd then decreses from providers to customers. To cpture this in our model, ech vertex hs two policies: one for pckets coming from customers nd silings, nd one for pckets coming from providers nd peers. More formlly, the two policies t ech node re (E 1, E 1), nd (E 2, E 2), where E 1 is the set of edges coming from providers nd E 1 is the set of edges tht cn e used to forwrd pckets tht rrived from provider. Similrly, E 2 is the set of edges coming from customers, nd E 2 is the set of edges tht cn e used to forwrd pckets tht rrived from customers. Enforcing these constrints results in vlley-free model, where we cn view the restrictions plced on the pckets flowing to ech outgoing edge of node s policy. B. Network Routings In this section, we formlly define the concept of policy constrined network routing nd routing policies. Definition 2: Let us initilly define the prmeters to policy-constrined routing prolem, s follows. The inputs re the following: 1) A network, which is n undirected grph representing the communiction links; 2) A destintion vertex t, set s 1, s 2,..., s p of source vertices generting pckets destined for t, nd integer rtes i 1, i 2,..., i p reflecting the rtes t which these pckets re generted; 3) A (possily unounded) cpcity on ech edge, indicting the mximum rte t which pckets cn e routed through the edge or the vertex (useful for solving edgedisjoint pth prolems); 4) A cost per pcket on ech vertex, reflecting the cost of routing pcket through tht vertex; 5) A set of policies t ech vertex v, suject to the condition tht no two policies t v shre n incoming edge. And finlly, the following gives the definition of the prolem we would like to solve on policy-constrined routings. Definition 3: The following re defined in terms of the inputs to the policy-constrined routing prolem. A pcket routing is the set of pths, ech from some source s i, to t, where the pth is leled with the rte t which pckets follow tht pth. There cn e more thn one pth from single pth s i to t. The sum of rte lels of the pths is the rte of flow from {s 1, s 2,..., s p } to t (no pckets re unccounted for). A routing pth is fesile if it violtes no edge cpcity nd no pcket s pth violtes policy t ny node tht it trverses. III. LIMITATIONS PACKET-LEVEL ROUTING POLICIES In the ove model, the pth tken y pcket to does not violte the routing policy t ny node. We will refer to this conventionl enforcement of policies s pcket-level enforcement. In this section we show tht requiring every pcket to oey the policy results in numer of negtive consequences. Section III-A shows tht current routings in the Internet re not optiml when viewed under economic theory nd Section III-B then explores the computtionl properties of optimiztion prolems. The pcket level constrints result in oth prcticl nd theoreticl limittions.
3 s s' c d 2 2 t Fig. 1. In oth figures, lower-level nodes re customers of higher-level nodes, ie. s is customer of nd c. And, ll edges hve cpcity 1 except for c which hs cpcity 2. The first figure () depicts vlley-free flow from sources s nd s to destintion node t. (An edge tht goes from lower to higher node in the figure represents n edge from customer to provider.) The second figure () illustrtes n improvement otinle if nd c re llowed to trde identities of pckets tht they hndle through swpping of pcket envelopes. A. Policy Constrined Routings re Not Preto-Optiml Routing policies re typiclly motivted y economic concerns, ut the results often fil to e preto-optiml. A set of trnsctions mong set of ctors tht stisfies set of economic constrints is preto-optiml if every other fesile trnsction tht is preferred y ny ctor is strictly less preferle to t lest one other ctor. In other words, the trnsctions re preto optiml if no ctor cn e mde etter off without mking some other ctor worse off. Trnsctions tht re not preto-optiml re considered highly undesirle in economic theory: they cn e modified to increse the totl enefit of the trnsction to the ctors t no dditionl cost to ny of them, nd therefore wste resources. Theorem 1: It cn e the cse tht no fesile pcket routing is preto-optiml. Proof: An exmple for the cse when the policy is the vlley-free constrint t ll nodes is depicted in Figure 1. Suppose one pcket per time unit must e routed from s nd s to t nd ll edges hve cpcity of one, except for c, which hs cpcity of two. All solutions tht enforce the policy t the individul pcket level must route one unit of flow through ech of nd d nd two units through ech of nd c. The solution depicted in the (), which routes one unit of flow through ech of these four nodes without incresing the flow through ny node, is preto-optiml however. Our next result shows tht preto-optiml routing cn e found in polynomil time. Despite this, the pcket constrints prevent such routing from eing vlid. In Section IV, we show how to gin preto-optiml routings y relxing the constrint tht policy e enforced on ech individul pcket. Theorem 2: Given ny set of policies nd ny fesile routing, preto-optimiztion tht minimizes the sum of flow costs t the vertices cn e found in polynomil time. Proof: The proof is y reduction to the min-cost flow prolem [Chv83], where ech node v is replced y two nodes, v, which tkes ecomes the hed of the edges into v, v, which ecomes the til of ll edges out of v, nd n edge (v, v ). The cpcity of edge (v, v ) is the flow through v given y the routing, nd the cpcity of ech edge is the flow through the edge given y the routing. This construction is shown in Figure 2. The cost of edge (v, v ) is set to the s s' c d t c d v x y z Fig. 2. The construction of Theorem 2. Figure () shows the originl node v, nd () shows v split into two nodes so tht we cn constrin the mount of flow through it. The edge (v, v ) would e leled with the mount of flow through v. per-unit cost of flow through v, nd the cpcities nd costs of edges of the form (v, w ) (edges in the originl grph) re set to infinity nd 0, respectively. The cpcity constrint on edge (v, v ) ensures tht no more flow is routed through node v thn in the originl solution. The fct tht the sum of costs of flows through the nodes is minimized mens tht no flow cn e reduced through ny node without violting cpcity constrint, tht is, the constrint tht more flow e routed through some node thn in the originl routing. The limittions of pplying policy on pcket level sis cretes suoptiml scenrios such s the ones descried ove. In the next section, we consider how the pcket level policies impct theoreticl results nd optimiztion prolems. B. Optimiztion Prolems nd Policy Two pths in grph re edge-disjoint if they hve no edges in common, nd vertex-disjoint if they hve no vertices, except their endpoints, in common. Vertex-disjoint pths re edgedisjoint, ut the converse is not necessrily true. The rte t which pckets from source node to destintion node flow on different links is known s flow. The cpcity of link or node is the mximum rte t which it cn route pckets. If s nd t re nodes of network, n s-t cut is prtition of the nodes into set S contining s nd set T contining t. The cpcity of the cut is the sum of cpcities of the edges from S to T. A common mesure of the roustness of communiction from s to t in networks is minimum-crdinlity edge cut, tht is, minimum-sized set of edges tht must fil (or e sotged) in order to disconnect ll pths from s to t. Wht is of interest in studying routing nd roustness nd routing topology of the Internet, however, is the numer of edges tht must e removed in order to cut ll policy-stisfying pths from s to t, since the policies t the nodes dictte tht this will render t inccessile from s. A relted prolem, which occurs in mny pplictions is one where high premium is plced on the timely rrivl t t of messge from s. The strtegy of s is to decide in dvnce on set of edge disjoint pths to use in sending messges from s to t. The pths re chosen to e edge-disjoint so tht no one edge filure cn disrupt ny two pths; s seeks mximum set of such pths. In the sence of policy constrints, mximum c d v' v'' x y z
4 set of edge-disjoint pths from s to t cn e found efficiently using network flow lgorithms. Clerly, the numer of pths in mximum set P of edgedisjoint pths from s to t is lower ound on the size of minimum cut, since minimum requirement of ny s-t cut, which must cut ll pths from s to t, is tht it must cut every pth in P. Since the pths in P re edge-disjoint, n s-t cut must contin t lest one edge from ech memer of P. A fmous theorem in grph theory, known s Menger s theorem [Wes01] is tht the numer of edge in min s-t cut is equl to the mximum numer of edge-disjoint pths from s to t. According to this theorem, if there re no policy constrints, s my commit to set of stle edge-disjoint pths in dvnce, nd n intruder who knows these pths is not helped y this knowledge in deciding on set of links to undermine in order to hlt communiction from s to t; whether or not s is committed to prticulr mximum set of edgedisjoint pths, the intruder must undermine set of edges tht cuts ll s-t pths in order to cut this set of pths. Erlech et l. investigte severl of the these clssic prolems in the vlley-free pth model, nd find they re no longer vlid in the vlley-free model. Their results show tht vlley-free policy hs striking effect on the roustness nd connectivity of the internet nd re summrized s the following [EHPV05]: 1) Menger s theorems no longer pply when policy constrints re introduced. In prticulr, under the vlleyfree model, the mximum numer of edge or (vertex) disjoint pths from s to t cn e s smll s hlf the minimum numer of edges (vertices) whose removl disconnects ll fesile s-t pths. 2) Finding the minimum numer of edges (vertices) whose removl disconnects ll fesile pths from s to t is NP-hrd, s is finding the mximum numer of edge- (vertex-) disjoint pths from s to t. 3) There exists n efficient pproximtion lgorithm tht finds set of edge disjoint fesile pths whose numer is t lest hlf the mximum numer, nd n pproximtion lgorithm tht finds set of edges whose removl disconnects ll fesile pths tht is t most twice s lrge s the minimum numer required. 4) Unless P = NP, no etter worst-cse pproximtion cn e found in polynomil time. While Erlech et l. showed tht the roustness nd connectivity of the internet is negtively impcted y policy, they did not show tht policy impirs the network s ility to find flows tht mximize the utiliztion of the links etween s nd t. We will now extend their results to network flows. Let mximum fesile policy s-t flow e mximum flow from s to t tht respects the network s pcket constrints, ie. in vlley-free flow ll pths in the flow cn never contin vlley. In network setting, the mximum fesile policy s- t flow is n upper ound on the mount of trffic tht cn flow from s to t if policy is respected. In clssicl grph theory, it s well known tht the minimum edge cut is equl to the mximum flow. This is the celerted min-cut, mxflow theorem [Chv83]. We show tht the min-cut, mx-flow theorem no longer holds when policy is enforced t the pcket level in Theorem 4. Before showing this, however, we show tht the ddition of policy mkes it intrctle to compute the mximum fesile policy flow etween two nodes, ssuming P NP. Theorem 3: It is NP-hrd to find mximum fesile policy s-t flow under the pcket model, nd this is true in the specil cse of vlley-free flows. Proof: Erelech, et. l. show tht it is NP-hrd to find mximum set of edge-disjoint vlley-free pths from vertex s to vertex t in grph where the customerprovider nd peer-to-peer reltionships re mrked on the edges. Therefore, the question of whether there exists set of k edge-disjoint vlley-free vlley free pths on such grph is NP-complete. However, this question cn e solved in polynomil time if there exists polynomil-time lgorithm for the pth-constrined routing prolem, s follows. Give ech node two policies reflecting the vlley-free constrints (one for customers nd silings nd one for providers nd peers), ssign cpcity of one to ech edge, let s e the only source vertex nd t e the destintion vertex, nd ssign s n output rte of k. This policy-constrined routing prolem is fesile if nd only if the given prolem hs k edge-disjoint vlley-free pths. The following shows tht policy cn lower the overll throughput of network. Theorem 4: Given network with ritrry edge cpcities nd policies t the nodes, the mximum fesile policy s-t flow under the pcket constrints cn e strictly smller thn the minimum-cpcity policy cut, nd this is true in the specil cse of vlley-free flows. Proof: (Sketch) Erelech, et. l. show tht the numer of pths in mximum set of edge-disjoint pths cn e s smll s hlf the numer of edges in minimum policy edge cut. The reduction similr to tht of Theorem 3: for network where the minimum crdinlity edge cut is 2k nd the mximum numer of disjoint pths is k. Estlish corresponding flow prolem where the edges ll hve cpcity equl to one. A mximum set consisting of k edge-disjoint pths constitutes mximum pcket-constrined flow of size k, nd minimum policy cut constitutes policy cut of minimum totl cpcity, which is 2k. While our theorem is theoreticl result, we clim tht it is pplicle to the rel-world Internet. For instnce in [GW02], the degree to which the lengths of routing pths re incresed due to policies, clled pth infltion, is studied nd evidence is provided tht it is significnt. Thus fr, we hve pointed the finger t policy for ll of our negtive results; however, the negtive computtionl nd economic effects we hve shown do not rise s result of policy. Insted, these effects rise s result of enforcing policy t the pcket level. We next propose new method of policy enforcement tht llows ASes to keep the ility to specify ritrry policy, ut
5 does not hve ny of the negtive effects we hve shown here tht rise when policy is enforced t the pcket-level. IV. CURRENCY-ENFORCEMENT OF POLICY By pcket constrints, we men the constrints tht n individul pcket must oey on vlid pth. This definition, which mtches the wy policy is currently enforced on the Internet, implies tht ech pcket hs n individul identity. To llevite the negtive effects of pcket-level enforcement, we remove this notion of pcket identity. Tht is, y the currency constrints, let us denote the constrints tht must e oeyed when one is llowed to find solution tht oeys the pcket constrints, nd then reduce the flow through some nodes without incresing the flow through ny node y ignoring the identities of individul pckets. As n exmple of the currency constrints, consider the two flows shown in Figure 1. Assume tht oth flows re equl in size. In Figure 1(), the nodes nd c route pckets etween ech other ecuse their policies dictte how ech pcket from the previous hop must e routed, ie. in the cse of c, its policy dicttes tht ny pcket rriving from s must e routed to if ct is sturted. Let s consider wht hppens under the currency constrints. Nodes nd c notice 1 tht they cn cncel out flow etween them y violting the pcket constrints. Both nodes reduce the flow through them y enforcing policy t currency-level rther thn t the pcket-level. In Figure 1(), no node hs n incresed mount of flow going through it, ut nodes nd c re etter off since they ech hve less flow going through them. We cn now chieve routings tht re preto-optiml with respect to the costs re ech node. Once gin, consider the exmple given in Figure 1. It s cler tht the flows in Figure 1() crete costs tht re not preto-optiml; however, under the pcket constrints, there is no other wy the pckets cn e routed (recll tht edge ct hs cpcity 1). As just discussed, with the currency constrints the flow shown in Figure 1() is now vlid. Thus, the currency constrints llow the routing to ecome preto-optiml. Furthermore, this preto-optimiztion ws done with only n greement etween nd c. We clim tht, in generl, preto-optimiztions under the currency constrints cn e found with only pirwise greements etween nodes. In order to prove routing results out the currency constrint model, we need to construct grph tht cptures ll policy informtion of the network we re given, the next section gives this construction. A. Policy Constrint Grph For policy-constrined routing prolem, we sy its policy constrint grph is directed grph where ech directed pth in the policy constrint grph is vlid pth in the policyconstrined routing. We ll now give constructions of the policy constrint grph in the cses where the edges hve unounded 1 For now, we ssume tht the nodes hve mechnism to detect this optimiztion. We discuss this further in Section VI s 1 s' 1 s 2 s' d 1 c d 2 c 2 Fig. 3. The unounded policy constrint grph of the network shown in Figure 2. cpcities nd then for the slightly trickier cse when the edges hve ounded cpcity. For now, let s ssume tht ll edges in the given network hve unounded cpcity. Let the policies t x e {(E 1, E 1),..., (E kx, E k x }. Then, in the unounded policy-constrint grph, x is split into k x vertices, sy x 1, x 2,..., x kx. Vertex x i then hs incoming edges E i nd outgoing edges E i. As simple exmple, Figure 3 shows the unounded policy constrint grph of the exmple network in Figure 1 where the network follows the vlley-free policy model. In Figure 3, it s cler tht once pth hs provider to customer edge, it cn never go ck up to provider. In order to construct the more generl ounded policy constrint grph, let the cpcity of n edge xy e c(xy). As efore, let the policies t x e {(E 1, E 1),..., (E kx, E k x }, nd let x 1, x 2,..., x kx e the vertices representing ech policy of x. For ech edge x i y j in the unounded policy constrint grph, where 1 i k x nd j is fixed, we need to insert dummy node tht llows us to ound to overll flow from ll x i s to y j. So, we redirect the edges from ech x i to y j so tht they ll point to new node d xy, nd we give them n unounded cpcity. Then, in order to retin the cpcity of xy in the originl network, we dd the edge d xy y j with cpcity c(d xy y j ) = c(xy). This edges limits the mount of flow tht cn trvel from ny x i to y j ut does not specify how the flows should e distriuted mongst the vrious outgoing policies of x (hence it does wy with the notion of n individul pcket identity which is precisely wht we defined the currency constrints s doing). An exmple of ounded constrin grph is shown in Figure 4. There, ech vertex hs three policies, so the constrint grph hs three versions of ech vertex. Note how xzy is pth in the originl network on in (), nd it is still possile to get from x to y in the constrint grph shown in (), ut the pth reflects the policies of ech node. t 1 t 2
6 x y 3 5 z x 1 x 2 x 3 y 1 Fig. 4. Incorporting edge cpcity constrints into the unounded policy constrint grph. In figure () re two edges xz nd yz of network with cpcities 3 nd 5 respectively. Ech vertex hs three policies: xz is n output edge for x s first two policies; zx is n output edge for z s first policy; yz is n output edge for y s first nd third policy; zy is n output edge for z s second nd third policy. Figure () shows how these constrints re modeled in the ounded constrint grph: Ech dummy node d uv hs one outgoing directed edge tht enforces the cpcity constrint of the edge uv in the network. The directed edges from copies of node u to dummy node d uv enforce the policy constrints; there is no such edge from copy u i if uv is not n outgoing edge for u s i th policy. y 2 y 3 d xz B. Currency-Constrined Routing Results The following theorems show tht the discourging computtionl results of Section III-B out policy dispper when policy is enforced t the currency-level rther thn the pcket level. Theorem 5: Under the currency constrints, it tkes polynomil time to find n s-t flow tht is s lrge s the minimum s-t policy cut, nd the lgorithm cn e implemented to run in polynomil time on distriuted model, using only pirwise greements etween djcent nodes, where ech of the two prties enefits from the greement. Proof: Let type 1 edge in the ounded policy constrint construction e one tht goes from dummy vertex node to copy of network node, ie. Figure 4 hs four type 1 edges d xz z 2, d zx x 3, d yz z 2, nd d zy y 2. And let type 2 edge e one tht goes from copy of network node to dummy node. The type 2 edges hve unounded cpcities, so minimumcpcity cut consists exclusively of type 1 edges. If set of edges go from set of copies x 1, x 2,..., x k of node x to dummy vertex, let us denote the dummy vertex y x. Let the imge of type 1 edge (x, y j ) in the network e the link xy tht gve rise to it in the construction. Note tht (x, y j ) nd (y, x h ) oth mp to the sme imge for some 1 h, k, where k is the mximum numer of policies. Becuse j is the unique policy t y for pckets coming into y on xy nd h is the unique policy t x for pckets coming into x on xy, these re the only two edges tht re inverse imges of xy. Let s i denote the copy of s tht corresponds to the policy for pckets originting t s in the network. A pth from s to t is policy-respecting pth if nd only if it is the imge of type 1 edges on pth from s i to copy t j in the constrint 3 d zx 5 d yz 3 d zy 5 z 1 z 2 z 3 grph. By min-cpcity s-t pth in the constrint grph we denote minimum edge cut tht severs ll such pths in the constrint grph. Suppose tht this hs totl cpcity of c. The imge of this cut in the constrint grph hs cpcity t lest c/2, since ech edge of the imge is the imge of t most two edges of the cut. This cuts the imges of ll pths from s i to t in the constrint grph, so it cuts ll policy pths in the network. By the mx-flow min-cut theorem, there is flow from s i to copies of t of mgnitude c. The imge of this flow is flow in the network where link xy of cpcity c i cn hve flow of t most 2c i on it: t most c i units from x to y nd t most c i units from y to x. The currency model llows the minimum of these two flows to e cnceled y n equl portion of the flow in the other direction, yielding flow of t most c on the edge. Since this resolution cn e performed t ll edges of the network where the flow exceeds the cpcity, the finl flow stisfies the cpcity. Ech resolution of cpcity violtion is n optimiztion permitted under the currency model, ut not under the pcket model. Moreover, ech resolution requires n greement etween two djcent nodes x nd y, nd the greement reduces the routing costs for oth x nd y. Theorem 6: It tkes polynomil time to find set of edge disjoint pths under the currency constrints tht is s lrge s the numer of edges in minimum policy edge cut, nd the lgorithm cn e implemented on distriuted model using only pirwise greements etween djcent nodes, where ech of the two prties enefits from the greement. Proof: (Sketch) The proof is y reduction to Theorem 5, y ssigning unit edge cpcities to the links of the network. V. NEW ALGORITHMS FOR PACKET-CONSTRAINED OPTIMIZATION PROBLEMS In this section, we once gin consider optimiztion prolems under the pcket constrints. Now rmed with our powerful policy constrint grph construction, we re le to find n efficient lgorithm to find shortest policy-oserving pths in Theorem 7. And finlly in Lemm 1, we use our construction to find k-pproximtion lgorithm for the edgedisjoint policy pths, where k is the numer of policies t ech node. Theorem 7: Given network with n nodes nd m links nd t most k ritrry policies t ech node of the form given in Definition 2, point 5 t ech node, it tkes O(k(n + m)) time to find the shortest policy-oserving pths from every node to given destintion node. Proof: The construction of the unounded constrint grph cretes t most k copies of ech vertex, so the numer of vertices is t most kn. The key to ounding the numer of edges is the fct tht the incoming edges for different policies t node v re disjoint. Thus, for ny edge uv, there is t most one copy v j of v tht receives incoming directed edges from copies of u. An edge uv of the network mps to t most
7 k edges of the form (u i, v j ) nd t most k edges of the form (v h, u l ), for totl of t most 2k edges. Let s i e the copy of s in the grph tht corresponds to the policy for pckets originting t s. Let the imge of n edge (x i, y j ) in the network e link xy. A pth in the network is policy pth if nd only if it is the imge of the sequence of edges in pth from s i to copy of t. Run redth-first serch from s i. For ech node x, find the copy x i of x tht hs minimum distnce lel, nd the prent y j of this node in the redth-first serch tree; let the prent of x in the network e node the node y tht is the imge of y j. The prent reltion is tree rooted t s such tht the unique tree pth from s to ny node x is shortest policy pth. A somewht tighter ound is O(k 1 n+k 2 m), where k 1 is the sum, over ll vertices of the numer of policies t the vertex, nd k 2 is the sum, over ll edges, of the numer of policies t the endpoints of the edge. Lemm 1: There is k-pproximtion lgorithm for finding edge-disjoint policy pths under the pcket constrints, given network with t most k policies t ech node. Proof: (Sketch) Let the imge in the network of vertex x i in the unounded policy grph e the node x tht gve rise to it in the construction. By n rgument nlogous to the one in the proof of Theorem 7, set of vertices is n s-t policy cut in the network if it cuts ll pths from the copy s i of s tht hndles pckets originting t s from ll copies of t. The imge such set in the network is t lest 1/k times s lrge, since ech node of the network is the imge of t most k vertices of the cut. The result of Erlech et. l. is therefore specil cse of our Lemm, reflecting the fct tht vlley-free consists of two policies t ech node, one for providers nd peers, nd one for customers nd silings. Erlech et. l. lso show tht, unless P = NP, no etter pproximtion ound is possile, ut we do not yet know whether this result generlizes to Lemm 1. VI. DISCUSSION The results presented here show we cn gin gret del y enforcing policies on currency-level rther thn on pcket level. This suggests new direction in developing routing lgorithms. A trditionl routing lgorithm such s BGP computes networks routes ccording some routing policy. Once the routes hve een computed, second phse monitors trffic nd looks for optimiztions where pckets my e forwrded on pths tht do not comply with the policy. These optimiztions cn e performed on loclized sis nd need not require coopertion of ll nodes in the network. Nodes which fil to cooperte continue to use the pths computed y the trditionl protocol such s BGP. Nodes which choose to cooperte cn gin y greeing to diverting pckets onto non-policy compliment routes in return for similr ctions y other nodes in the network. One possile protocol for tking dvntge of the currency relxtion involves dvertising of pths. Senders send groups of k pckets ccompnied y smll envelope tht indictes the pths tht the pckets re expected to follow. One my set k to e lrge to mke the cost of forwrding envelopes trivil compred to the cost of forwrding pckets. The ctors gree tht pckets cnnot proceed without n ccompnying envelope, ut tht it is cceptle to swp the contents of two envelopes tht re ound for the sme destintion. One consequence is tht, fter optimiztion, some envelopes my trvel empty for some portions of their pth. Work remins to explore prcticl implementtions of these protocols, s well s to find distriuted lgorithms tht mke optiml use of them. One immedite concern is pcket looping. A trditionl routing protocol such s BGP computes the policy complint routes nd prevents the formtion of long lsting routing loops. But our pproch llows pcket to devite from the policy complint route nd thus loop freedom is no longer gurnteed. We first rgue tht ny loops will not cuse prolems t the ggregte trffic level. Since the improvement is n optimiztion of flow tht is indistinguishle from one tht oserves the policy t the level of the pckets, there is no dnger tht cycling of pckets will increse the trffic in the network. But this gurntee is of little comfort to pcket tht my ecome permnently stuck in loop. One pproch under the currency model is to tke dvntge of nondeterminism in deciding which of two indistinguishle pckets t node to route to two distinct next hops. This mkes the proility of pcket cycling k times vnish exponentilly s k increses. A second more deterministic pproch is keep count of how mny times pcket is diverted. The sender sets n initil vlue in DivertsLeft field nd this field specifies how mny times the pcket my e diverted from onto non-policy complint route. DivertsLef t is decremented ech time the pcket is forwrded out n interfce tht does not mtch the interfce of the policy complint route. When DivertsLef t reches zero, the pcket cn no longer e diverted from the policy complint route. Since the policy complint route is ssumed to e loop free, the pcket is now forwrd long this loop free pth. VII. CONCLUSIONS AND FUTURE WORK This pper considered the impct of routing policy nd showed how enforcing routing policies on pcket level results in severl prcticl nd theoreticl limittions. The prolem however is not with the routing policies, ut rther with the policies re enforced. The prolems occur when policies re enforced on ech pcket. By insted tking currency level pproch to enforcement, one cn still meet the rod gols of the routing nd eliminte the prolems. These results suggest tht future work on routing protocols should consider dopting currency pproch where individul pckets cn violte the routing policy s long s the overll system still meets the policy. [Chv83] REFERENCES V. Chvtl. Liner Progrmming. W. H. Freemn, New York, 1983.
8 [EHPV05] T. Erlech, A. Hll, A. Pnconesi, nd D. Vukdinovic. Cuts nd disjoint pths in the vlley-free pth model of internet gp routing. Lecture Notes in Computer Science, 3405:49 62, [Go00] L. Go. On inferring utonomous system reltionships in the internet, [GW02] L. Go nd F. Wng. The extent of s pth infltion y routing [Tr83] policies. IEEE Glol Internet Symposium, R. E. Trjn. Dt Structures nd Network Algorithms. Society for Industril nd Applied Mth., Phildelphi, [Wes01] D. B. West. Introduction to Grph Theory. Prentice Hll, Englewood Cliffs, New Jersey, 2001.
If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.
Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online
More informationCOMP 423 lecture 11 Jan. 28, 2008
COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring
More informationLecture 10 Evolutionary Computation: Evolution strategies and genetic programming
Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting
More informationMa/CS 6b Class 1: Graph Recap
M/CS 6 Clss 1: Grph Recp By Adm Sheffer Course Detils Adm Sheffer. Office hour: Tuesdys 4pm. dmsh@cltech.edu TA: Victor Kstkin. Office hour: Tuesdys 7pm. 1:00 Mondy, Wednesdy, nd Fridy. http://www.mth.cltech.edu/~2014-15/2term/m006/
More informationA dual of the rectangle-segmentation problem for binary matrices
A dul of the rectngle-segmenttion prolem for inry mtrices Thoms Klinowski Astrct We consider the prolem to decompose inry mtrix into smll numer of inry mtrices whose -entries form rectngle. We show tht
More information2 Computing all Intersections of a Set of Segments Line Segment Intersection
15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design
More informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
More informationMa/CS 6b Class 1: Graph Recap
M/CS 6 Clss 1: Grph Recp By Adm Sheffer Course Detils Instructor: Adm Sheffer. TA: Cosmin Pohot. 1pm Mondys, Wednesdys, nd Fridys. http://mth.cltech.edu/~2015-16/2term/m006/ Min ook: Introduction to Grph
More informationToday. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search.
CS 88: Artificil Intelligence Fll 00 Lecture : A* Serch 9//00 A* Serch rph Serch Tody Heuristic Design Dn Klein UC Berkeley Multiple slides from Sturt Russell or Andrew Moore Recp: Serch Exmple: Pncke
More informationNetwork Interconnection: Bridging CS 571 Fall Kenneth L. Calvert All rights reserved
Network Interconnection: Bridging CS 57 Fll 6 6 Kenneth L. Clvert All rights reserved The Prolem We know how to uild (rodcst) LANs Wnt to connect severl LANs together to overcome scling limits Recll: speed
More informationBefore We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):
Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters
More information9 Graph Cutting Procedures
9 Grph Cutting Procedures Lst clss we begn looking t how to embed rbitrry metrics into distributions of trees, nd proved the following theorem due to Brtl (1996): Theorem 9.1 (Brtl (1996)) Given metric
More informationA Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards
A Tutology Checker loosely relted to Stålmrck s Algorithm y Mrtin Richrds mr@cl.cm.c.uk http://www.cl.cm.c.uk/users/mr/ University Computer Lortory New Museum Site Pemroke Street Cmridge, CB2 3QG Mrtin
More informationWhat are suffix trees?
Suffix Trees 1 Wht re suffix trees? Allow lgorithm designers to store very lrge mount of informtion out strings while still keeping within liner spce Allow users to serch for new strings in the originl
More informationF. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997.
Forced convex n-gons in the plne F. R. K. Chung y University ofpennsylvni Phildelphi, Pennsylvni 19104 R. L. Grhm AT&T Ls - Reserch Murry Hill, New Jersey 07974 Mrch 2,1997 Astrct In seminl pper from 1935,
More informationFig.25: the Role of LEX
The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing
More informationPresentation Martin Randers
Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes
More informationCS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis
CS143 Hndout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexicl Anlysis In this first written ssignment, you'll get the chnce to ply round with the vrious constructions tht come up when doing lexicl
More informationMATH 25 CLASS 5 NOTES, SEP
MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid
More informationCS311H: Discrete Mathematics. Graph Theory IV. A Non-planar Graph. Regions of a Planar Graph. Euler s Formula. Instructor: Işıl Dillig
CS311H: Discrete Mthemtics Grph Theory IV Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mthemtics Grph Theory IV 1/25 A Non-plnr Grph Regions of Plnr Grph The plnr representtion of
More informationCS321 Languages and Compiler Design I. Winter 2012 Lecture 5
CS321 Lnguges nd Compiler Design I Winter 2012 Lecture 5 1 FINITE AUTOMATA A non-deterministic finite utomton (NFA) consists of: An input lphet Σ, e.g. Σ =,. A set of sttes S, e.g. S = {1, 3, 5, 7, 11,
More informationSlides for Data Mining by I. H. Witten and E. Frank
Slides for Dt Mining y I. H. Witten nd E. Frnk Simplicity first Simple lgorithms often work very well! There re mny kinds of simple structure, eg: One ttriute does ll the work All ttriutes contriute eqully
More informationFig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.
Answer on Question #5692, Physics, Optics Stte slient fetures of single slit Frunhofer diffrction pttern. The slit is verticl nd illuminted by point source. Also, obtin n expression for intensity distribution
More informationPointwise convergence need not behave well with respect to standard properties such as continuity.
Chpter 3 Uniform Convergence Lecture 9 Sequences of functions re of gret importnce in mny res of pure nd pplied mthemtics, nd their properties cn often be studied in the context of metric spces, s in Exmples
More informationTries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries
Tries Yufei To KAIST April 9, 2013 Y. To, April 9, 2013 Tries In this lecture, we will discuss the following exct mtching prolem on strings. Prolem Let S e set of strings, ech of which hs unique integer
More informationMTH 146 Conics Supplement
105- Review of Conics MTH 146 Conics Supplement In this section we review conics If ou ne more detils thn re present in the notes, r through section 105 of the ook Definition: A prol is the set of points
More informationGraphs with at most two trees in a forest building process
Grphs with t most two trees in forest uilding process rxiv:802.0533v [mth.co] 4 Fe 208 Steve Butler Mis Hmnk Mrie Hrdt Astrct Given grph, we cn form spnning forest y first sorting the edges in some order,
More informationSolving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence Winter 2016
Solving Prolems y Serching CS 486/686: Introduction to Artificil Intelligence Winter 2016 1 Introduction Serch ws one of the first topics studied in AI - Newell nd Simon (1961) Generl Prolem Solver Centrl
More informationP(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have
Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using
More informationAnnouncements. CS 188: Artificial Intelligence Fall Recap: Search. Today. Example: Pancake Problem. Example: Pancake Problem
Announcements Project : erch It s live! Due 9/. trt erly nd sk questions. It s longer thn most! Need prtner? Come up fter clss or try Pizz ections: cn go to ny, ut hve priority in your own C 88: Artificil
More information4452 Mathematical Modeling Lecture 4: Lagrange Multipliers
Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl
More informationDefinition of Regular Expression
Definition of Regulr Expression After the definition of the string nd lnguges, we re redy to descrie regulr expressions, the nottion we shll use to define the clss of lnguges known s regulr sets. Recll
More informationAnnouncements. CS 188: Artificial Intelligence Fall Recap: Search. Today. General Tree Search. Uniform Cost. Lecture 3: A* Search 9/4/2007
CS 88: Artificil Intelligence Fll 2007 Lecture : A* Serch 9/4/2007 Dn Klein UC Berkeley Mny slides over the course dpted from either Sturt Russell or Andrew Moore Announcements Sections: New section 06:
More informationMeaningful Change Detection in Structured Data.
Meningful Chnge Detection in Structured Dt Sudrshn S. Chwthe Hector Grci-Molin Computer Science Deprtment, Stnford University, Stnford, Cliforni 94305 fchw,hectorg@cs.stnford.edu Astrct Detecting chnges
More informationThe Greedy Method. The Greedy Method
Lists nd Itertors /8/26 Presenttion for use with the textook, Algorithm Design nd Applictions, y M. T. Goodrich nd R. Tmssi, Wiley, 25 The Greedy Method The Greedy Method The greedy method is generl lgorithm
More informationMobile IP route optimization method for a carrier-scale IP network
Moile IP route optimiztion method for crrier-scle IP network Tkeshi Ihr, Hiroyuki Ohnishi, nd Ysushi Tkgi NTT Network Service Systems Lortories 3-9-11 Midori-cho, Musshino-shi, Tokyo 180-8585, Jpn Phone:
More informationCSCI 3130: Formal Languages and Automata Theory Lecture 12 The Chinese University of Hong Kong, Fall 2011
CSCI 3130: Forml Lnguges nd utomt Theory Lecture 12 The Chinese University of Hong Kong, Fll 2011 ndrej Bogdnov In progrmming lnguges, uilding prse trees is significnt tsk ecuse prse trees tell us the
More informationRethinking Virtual Network Embedding: Substrate Support for Path Splitting and Migration
Rethinking Virtul Network Emedding: Sustrte Support for Pth Splitting nd Migrtion Minln Yu, Yung Yi, Jennifer Rexford, Mung Ching Computer Science, Princeton University, Emil: {minlnyu,jrex}@cs.princeton.edu
More informationNetwork Layer: Routing Classifications; Shortest Path Routing
igitl ommuniction in the Modern World : Routing lssifictions; Shortest Pth Routing s min prolem: To get efficiently from one point to the other in dynmic environment http://.cs.huji.c.il/~com com@cs.huji.c.il
More informationOUTPUT DELIVERY SYSTEM
Differences in ODS formtting for HTML with Proc Print nd Proc Report Lur L. M. Thornton, USDA-ARS, Animl Improvement Progrms Lortory, Beltsville, MD ABSTRACT While Proc Print is terrific tool for dt checking
More information10.5 Graphing Quadratic Functions
0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions
More informationMisrepresentation of Preferences
Misrepresenttion of Preferences Gicomo Bonnno Deprtment of Economics, University of Cliforni, Dvis, USA gfbonnno@ucdvis.edu Socil choice functions Arrow s theorem sys tht it is not possible to extrct from
More informationCS 268: IP Multicast Routing
Motivtion CS 268: IP Multicst Routing Ion Stoic April 5, 2004 Mny pplictions requires one-to-mny communiction - E.g., video/udio conferencing, news dissemintion, file updtes, etc. Using unicst to replicte
More informationLecture 7: Integration Techniques
Lecture 7: Integrtion Techniques Antiderivtives nd Indefinite Integrls. In differentil clculus, we were interested in the derivtive of given rel-vlued function, whether it ws lgeric, eponentil or logrithmic.
More informationSolving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence
Solving Prolems y Serching CS 486/686: Introduction to Artificil Intelligence 1 Introduction Serch ws one of the first topics studied in AI - Newell nd Simon (1961) Generl Prolem Solver Centrl component
More informationPremaster Course Algorithms 1 Chapter 6: Shortest Paths. Christian Scheideler SS 2018
Premster Course Algorithms Chpter 6: Shortest Pths Christin Scheieler SS 8 Bsic Grph Algorithms Overview: Shortest pths in DAGs Dijkstr s lgorithm Bellmn-For lgorithm Johnson s metho SS 8 Chpter 6 Shortest
More informationΕΠΛ323 - Θεωρία και Πρακτική Μεταγλωττιστών
ΕΠΛ323 - Θωρία και Πρακτική Μταγλωττιστών Lecture 3 Lexicl Anlysis Elis Athnsopoulos elisthn@cs.ucy.c.cy Recognition of Tokens if expressions nd reltionl opertors if è if then è then else è else relop
More informationEECS150 - Digital Design Lecture 23 - High-level Design and Optimization 3, Parallelism and Pipelining
EECS150 - Digitl Design Lecture 23 - High-level Design nd Optimiztion 3, Prllelism nd Pipelining Nov 12, 2002 John Wwrzynek Fll 2002 EECS150 - Lec23-HL3 Pge 1 Prllelism Prllelism is the ct of doing more
More information1.1. Interval Notation and Set Notation Essential Question When is it convenient to use set-builder notation to represent a set of numbers?
1.1 TEXAS ESSENTIAL KNOWLEDGE AND SKILLS Prepring for 2A.6.K, 2A.7.I Intervl Nottion nd Set Nottion Essentil Question When is it convenient to use set-uilder nottion to represent set of numers? A collection
More informationPosition Heaps: A Simple and Dynamic Text Indexing Data Structure
Position Heps: A Simple nd Dynmic Text Indexing Dt Structure Andrzej Ehrenfeucht, Ross M. McConnell, Niss Osheim, Sung-Whn Woo Dept. of Computer Science, 40 UCB, University of Colordo t Boulder, Boulder,
More informationTyping with Weird Keyboards Notes
Typing with Weird Keyords Notes Ykov Berchenko-Kogn August 25, 2012 Astrct Consider lnguge with n lphet consisting of just four letters,,,, nd. There is spelling rule tht sys tht whenever you see n next
More informationAlgorithm Design (5) Text Search
Algorithm Design (5) Text Serch Tkshi Chikym School of Engineering The University of Tokyo Text Serch Find sustring tht mtches the given key string in text dt of lrge mount Key string: chr x[m] Text Dt:
More information1 Quad-Edge Construction Operators
CS48: Computer Grphics Hndout # Geometric Modeling Originl Hndout #5 Stnford University Tuesdy, 8 December 99 Originl Lecture #5: 9 November 99 Topics: Mnipultions with Qud-Edge Dt Structures Scribe: Mike
More informationEfficient Rerouting Algorithms for Congestion Mitigation
2009 IEEE Computer Society Annul Symposium on VLSI Efficient Rerouting Algorithms for Congestion Mitigtion M. A. R. Chudhry*, Z. Asd, A. Sprintson, nd J. Hu Deprtment of Electricl nd Computer Engineering
More informationOn Achieving Optimal Throughput with Network Coding
In IEEE INFOCOM On Achieving Optiml Throughput with Network Coding Zongpeng Li, Bochun Li, Dn Jing, Lp Chi Lu Astrct With the constrints of network topologies nd link cpcities, chieving the optiml end-to-end
More information3.5.1 Single slit diffraction
3..1 Single slit diffrction ves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. e will consider this lter. Tke
More informationOn Computation and Resource Management in Networked Embedded Systems
On Computtion nd Resource Mngement in Networed Embedded Systems Soheil Ghisi Krlene Nguyen Elheh Bozorgzdeh Mjid Srrfzdeh Computer Science Deprtment University of Cliforni, Los Angeles, CA 90095 soheil,
More information2014 Haskell January Test Regular Expressions and Finite Automata
0 Hskell Jnury Test Regulr Expressions nd Finite Automt This test comprises four prts nd the mximum mrk is 5. Prts I, II nd III re worth 3 of the 5 mrks vilble. The 0 Hskell Progrmming Prize will be wrded
More informationAn evolutionary approach to inter-session network coding
An evolutionry pproch to inter-session network coding The MIT Fculty hs mde this rticle openly ville. Plese shre how this ccess enefits you. Your story mtters. Cittion As Pulished Pulisher Kim, M. et l.
More informationFrom Dependencies to Evaluation Strategies
From Dependencies to Evlution Strtegies Possile strtegies: 1 let the user define the evlution order 2 utomtic strtegy sed on the dependencies: use locl dependencies to determine which ttriutes to compute
More informationA New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method
A New Lerning Algorithm for the MAXQ Hierrchicl Reinforcement Lerning Method Frzneh Mirzzdeh 1, Bbk Behsz 2, nd Hmid Beigy 1 1 Deprtment of Computer Engineering, Shrif University of Technology, Tehrn,
More informationCompression Outline :Algorithms in the Real World. Lempel-Ziv Algorithms. LZ77: Sliding Window Lempel-Ziv
Compression Outline 15-853:Algorithms in the Rel World Dt Compression III Introduction: Lossy vs. Lossless, Benchmrks, Informtion Theory: Entropy, etc. Proility Coding: Huffmn + Arithmetic Coding Applictions
More informationCSEP 573 Artificial Intelligence Winter 2016
CSEP 573 Artificil Intelligence Winter 2016 Luke Zettlemoyer Problem Spces nd Serch slides from Dn Klein, Sturt Russell, Andrew Moore, Dn Weld, Pieter Abbeel, Ali Frhdi Outline Agents tht Pln Ahed Serch
More information3.5.1 Single slit diffraction
3.5.1 Single slit diffrction Wves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. We will consider this lter.
More informationSUPPLEMENTARY INFORMATION
Supplementry Figure y (m) x (m) prllel perpendiculr Distnce (m) Bird Stndrd devition for distnce (m) c 6 prllel perpendiculr 4 doi:.8/nture99 SUPPLEMENTARY FIGURE Confirmtion tht movement within the flock
More informationApproximation of Two-Dimensional Rectangle Packing
pproximtion of Two-imensionl Rectngle Pcking Pinhong hen, Yn hen, Mudit Goel, Freddy Mng S70 Project Report, Spring 1999. My 18, 1999 1 Introduction 1-d in pcking nd -d in pcking re clssic NP-complete
More information12-B FRACTIONS AND DECIMALS
-B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn
More informationMATH 2530: WORKSHEET 7. x 2 y dz dy dx =
MATH 253: WORKSHT 7 () Wrm-up: () Review: polr coordintes, integrls involving polr coordintes, triple Riemnn sums, triple integrls, the pplictions of triple integrls (especilly to volume), nd cylindricl
More information1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)
Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric
More informationCS201 Discussion 10 DRAWTREE + TRIES
CS201 Discussion 10 DRAWTREE + TRIES DrwTree First instinct: recursion As very generic structure, we could tckle this problem s follows: drw(): Find the root drw(root) drw(root): Write the line for the
More informationUnit #9 : Definite Integral Properties, Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationUT1553B BCRT True Dual-port Memory Interface
UTMC APPICATION NOTE UT553B BCRT True Dul-port Memory Interfce INTRODUCTION The UTMC UT553B BCRT is monolithic CMOS integrted circuit tht provides comprehensive MI-STD- 553B Bus Controller nd Remote Terminl
More informationSection 3.1: Sequences and Series
Section.: Sequences d Series Sequences Let s strt out with the definition of sequence: sequence: ordered list of numbers, often with definite pttern Recll tht in set, order doesn t mtter so this is one
More informationMcAfee Network Security Platform
10/100/1000 Copper Active Fil-Open Bypss Kit Guide Revision E McAfee Network Security Pltform This document descries the contents nd how to instll the McAfee 10/100/1000 Copper Active Fil-Open Bypss Kit
More informationCSCI 104. Rafael Ferreira da Silva. Slides adapted from: Mark Redekopp and David Kempe
CSCI 0 fel Ferreir d Silv rfsilv@isi.edu Slides dpted from: Mrk edekopp nd Dvid Kempe LOG STUCTUED MEGE TEES Series Summtion eview Let n = + + + + k $ = #%& #. Wht is n? n = k+ - Wht is log () + log ()
More informationGrade 7/8 Math Circles Geometric Arithmetic October 31, 2012
Fculty of Mthemtics Wterloo, Ontrio N2L 3G1 Grde 7/8 Mth Circles Geometric Arithmetic Octoer 31, 2012 Centre for Eduction in Mthemtics nd Computing Ancient Greece hs given irth to some of the most importnt
More informationPPS: User Manual. Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, and Ayush Kanodia
PPS: User Mnul Krishnendu Chtterjee, Mrtin Chmelik, Rghv Gupt, nd Ayush Knodi IST Austri (Institute of Science nd Technology Austri), Klosterneuurg, Austri In this section we descrie the tool fetures,
More informationComplete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li
2nd Interntionl Conference on Electronic & Mechnicl Engineering nd Informtion Technology (EMEIT-212) Complete Coverge Pth Plnning of Mobile Robot Bsed on Dynmic Progrmming Algorithm Peng Zhou, Zhong-min
More informationΕΠΛ323 - Θεωρία και Πρακτική Μεταγλωττιστών. Lecture 3b Lexical Analysis Elias Athanasopoulos
ΕΠΛ323 - Θωρία και Πρακτική Μταγλωττιστών Lecture 3 Lexicl Anlysis Elis Athnsopoulos elisthn@cs.ucy.c.cy RecogniNon of Tokens if expressions nd relnonl opertors if è if then è then else è else relop è
More informationINTRODUCTION TO SIMPLICIAL COMPLEXES
INTRODUCTION TO SIMPLICIAL COMPLEXES CASEY KELLEHER AND ALESSANDRA PANTANO 0.1. Introduction. In this ctivity set we re going to introduce notion from Algebric Topology clled simplicil homology. The min
More informationAI Adjacent Fields. This slide deck courtesy of Dan Klein at UC Berkeley
AI Adjcent Fields Philosophy: Logic, methods of resoning Mind s physicl system Foundtions of lerning, lnguge, rtionlity Mthemtics Forml representtion nd proof Algorithms, computtion, (un)decidility, (in)trctility
More informationMidterm 2 Sample solution
Nme: Instructions Midterm 2 Smple solution CMSC 430 Introduction to Compilers Fll 2012 November 28, 2012 This exm contins 9 pges, including this one. Mke sure you hve ll the pges. Write your nme on the
More informationthis grammar generates the following language: Because this symbol will also be used in a later step, it receives the
LR() nlysis Drwcks of LR(). Look-hed symols s eplined efore, concerning LR(), it is possile to consult the net set to determine, in the reduction sttes, for which symols it would e possile to perform reductions.
More informationEvolutionary Approaches To Minimizing Network Coding Resources
This full text pper ws peer reviewed t the direction of IEEE Communictions Society suject mtter experts for puliction in the IEEE INFOCOM 2007 proceedings. Evolutionry Approches To Minimizing Network Coding
More informationNotes for Graph Theory
Notes for Grph Theory These re notes I wrote up for my grph theory clss in 06. They contin most of the topics typiclly found in grph theory course. There re proofs of lot of the results, ut not of everything.
More informationPARALLEL AND DISTRIBUTED COMPUTING
PARALLEL AND DISTRIBUTED COMPUTING 2009/2010 1 st Semester Teste Jnury 9, 2010 Durtion: 2h00 - No extr mteril llowed. This includes notes, scrtch pper, clcultor, etc. - Give your nswers in the ville spce
More informationOutline. Introduction Suffix Trees (ST) Building STs in linear time: Ukkonen s algorithm Applications of ST
Suffi Trees Outline Introduction Suffi Trees (ST) Building STs in liner time: Ukkonen s lgorithm Applictions of ST 2 3 Introduction Sustrings String is ny sequence of chrcters. Sustring of string S is
More informationEfficient K-NN Search in Polyphonic Music Databases Using a Lower Bounding Mechanism
Efficient K-NN Serch in Polyphonic Music Dtses Using Lower Bounding Mechnism Ning-Hn Liu Deprtment of Computer Science Ntionl Tsing Hu University Hsinchu,Tiwn 300, R.O.C 886-3-575679 nhliou@yhoo.com.tw
More information6.2 Volumes of Revolution: The Disk Method
mth ppliction: volumes by disks: volume prt ii 6 6 Volumes of Revolution: The Disk Method One of the simplest pplictions of integrtion (Theorem 6) nd the ccumultion process is to determine so-clled volumes
More information1.5 Extrema and the Mean Value Theorem
.5 Extrem nd the Men Vlue Theorem.5. Mximum nd Minimum Vlues Definition.5. (Glol Mximum). Let f : D! R e function with domin D. Then f hs n glol mximum vlue t point c, iff(c) f(x) for ll x D. The vlue
More informationA Heuristic Approach for Discovering Reference Models by Mining Process Model Variants
A Heuristic Approch for Discovering Reference Models by Mining Process Model Vrints Chen Li 1, Mnfred Reichert 2, nd Andres Wombcher 3 1 Informtion System Group, University of Twente, The Netherlnds lic@cs.utwente.nl
More informationAn Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization
An Efficient Divide nd Conquer Algorithm for Exct Hzrd Free Logic Minimiztion J.W.J.M. Rutten, M.R.C.M. Berkelr, C.A.J. vn Eijk, M.A.J. Kolsteren Eindhoven University of Technology Informtion nd Communiction
More informationMA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork
MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html
More informationA Sparse Grid Representation for Dynamic Three-Dimensional Worlds
A Sprse Grid Representtion for Dynmic Three-Dimensionl Worlds Nthn R. Sturtevnt Deprtment of Computer Science University of Denver Denver, CO, 80208 sturtevnt@cs.du.edu Astrct Grid representtions offer
More informationZZ - Advanced Math Review 2017
ZZ - Advnced Mth Review Mtrix Multipliction Given! nd! find the sum of the elements of the product BA First, rewrite the mtrices in the correct order to multiply The product is BA hs order x since B is
More informationON THE DEHN COMPLEX OF VIRTUAL LINKS
ON THE DEHN COMPLEX OF VIRTUAL LINKS RACHEL BYRD, JENS HARLANDER Astrct. A virtul link comes with vriety of link complements. This rticle is concerned with the Dehn spce, pseudo mnifold with oundry, nd
More informationUnion-Find Problem. Using Arrays And Chains. A Set As A Tree. Result Of A Find Operation
Union-Find Problem Given set {,,, n} of n elements. Initilly ech element is in different set. ƒ {}, {},, {n} An intermixed sequence of union nd find opertions is performed. A union opertion combines two
More informationCS 221: Artificial Intelligence Fall 2011
CS 221: Artificil Intelligence Fll 2011 Lecture 2: Serch (Slides from Dn Klein, with help from Sturt Russell, Andrew Moore, Teg Grenger, Peter Norvig) Problem types! Fully observble, deterministic! single-belief-stte
More informationJournal of Graph Algorithms and Applications
Journl of Grph Algorithms nd Applictions http://www.cs.brown.edu/publictions/jg/ vol. 5, no. 5, pp. 17 38 (2001) New Bounds for Oblivious Mesh Routing Kzuo Iwm School of Informtics Kyoto University Kyoto
More informationCS481: Bioinformatics Algorithms
CS481: Bioinformtics Algorithms Cn Alkn EA509 clkn@cs.ilkent.edu.tr http://www.cs.ilkent.edu.tr/~clkn/teching/cs481/ EXACT STRING MATCHING Fingerprint ide Assume: We cn compute fingerprint f(p) of P in
More information