Mobile IP route optimization method for a carrier-scale IP network

Size: px
Start display at page:

Download "Mobile IP route optimization method for a carrier-scale IP network"

Transcription

1 Moile IP route optimiztion method for crrier-scle IP network Tkeshi Ihr, Hiroyuki Ohnishi, nd Ysushi Tkgi NTT Network Service Systems Lortories Midori-cho, Musshino-shi, Tokyo , Jpn Phone: Fx: E-mil: Astrct The current Moile IP specifiction forces ll pckets forwrded to moile terminl (MT) to e routed vi tht terminl s Home Agent (), which often leds to tringulr routing, which in turn cuses dt trnsmission dely nd wstes network resources. IETF (Internet Engineering Tsk Force) is studying solution tht cn optimize the route length, ut this solution requires the implementtion of dditionl functions on ll correspondent nodes, so it will not e relistic. In this pper, we propose the use of Moile IP order gtewys (MBGs) to optimize the routing in crrier-scle network nd reduce the processing urden on the without dding more functions to the correspondent nodes, nd show the effect of reducing the route length nd the s lod. We lso propose hierrchicl rrngement of Foreign Agents (s) to reduce the processing urden on MBGs 1. Introduction In next-genertion moile dt networks, moility mngement tht enles moility t the IP level will e needed to improve terminl moility, provide semless roming etween fixed nd moile networks, nd llow new IP pplictions to e developed. Moile IP [1], which is the most promising technology studied y IETF, cn provide IP level moility. Moreover, 3GPP (Third Genertion Prtnership Project) [2] nd 3GPP2 [3], which re imed t estlishing regionl stndrds, re eginning to study the ppliction of Moile IP to the IMT-2000 core network s shown in Figure 1 [4]. Internet Moile IP GGSN GGSN HL SG SN SG SN GPS Internet Moile IP HL PD SN PD SN AN (M odel1) GPP Step1,Step2 (M odel2) GPP2,3G PP Step3 GPSGenerlPcketdio Service GGSNGtew y GPS SupportNode SG SN Serving GPS SupportNode HLHome Loction egister ANdio Access Network PDSNPcketDt Serving Node Home Agent Foreign Agent Figure 1. Next-genertion moile dt network pplying Moile IP However, Moile IP hs not een pplied to ny crrier-scle network, nd the tringulr routing in Moile IP cuses n dditionl lod on the Home Agent (), wstes network resources, nd increses the dely time. IETF is studying wy of optimizing the tringulr pth nd there hve een severl reports on route optimiztion y the IETF method [5]. However, this method requires tht specific functions e implemented on ll correspondent nodes, such s thousnds of WWW servers in the Internet, so it is not esy to chieve route optimiztion y this method. In this pper, we propose method for lrge network tht enles route optimiztion without modifying existing WWW servers [6]. This pper is orgnized s follows. Section 2 overviews the current Moile IP protocol nd its prolem concerning the route optimiztion procedure. Section 3 descries our route optimiztion method which uses Moile IP order gtewys (MBGs). Section 4 evlutes the effect of route optimiztion nd the reduction of the lod chieved y using MBGs. Section 5 clcultes the urden on n MBG when it is pplied to commercil Moile IP network nd hierrchicl rchitecture is proposed to reduce tht urden. Section 6 concludes this pper nd discusses technicl issues in future. 2. Overview of Moile IP 2.1 Bsic procedure Figure 2 () shows the loction registrtion procedure in Moile IP network. (1) A Moile Terminl (MT) moves from its home network to nother network (1). (2) The elonging to the visited network ssigns the cre-of ddress to the MT (2). (3) The MT reports its cre-of ddress to its (3). Figure 2 () shows the IP pcket uplink/downlink forwrding procedure in the Moile IP network. Uplink forwrding (from MT to correspondent node) IP pckets re forwrded directly to the correspondent node (U1). Downlink forwrding (from correspondent node to MT) (1) IP pckets re trnsferred to the home ddress of the MT (D1). (2) The intercepts the pckets destined for the MT tht is wy from the home network nd tunnels them to the MT s cre-of ddress (D2). (3) Pckets re detunneled nd delivered to the MT (D3).

2 Figure 2. Moile IP procedure 2.2 oute optimiztion proposed y IETF D1 3 U1 D2 1 2 move D3 () lo ction register procedure () IP pcket uplink/dow nlink fo rw rd ing procedure The sic procedure illustrted in Figure 2 forces ll downlink forwrded pckets to e routed vi the MT s. In other words, such pckets cnnot e forwrded to the MT directly; insted, tringulr route pth is generted. This increses the concentrted lod on the, wstes network resources, nd lengthens the dely time. To solve this prolem, IETF hs proposed n extension, shown in Figure 3, clled oute Optimiztion in Moile IP (1) After receiving severl pckets destined for the MT, the performs tunneling opertion to the ssocited cre-of ddress, nd lso indictes the MT s cre-of ddress to the correspondent node when the terminl is wy from its home network (K1). (2) The correspondent node cn susequently send the trffic intended for the MT directly to its cre-of ddress y mens of tunneling mechnism (K2). This extension optimizes the routing, ut requires tht specific functions e implemented on ll the correspondent nodes, such s WWW servers in the Internet. It is not prcticl to tke such implementtion within the next two or three yers. K1 hom e network K2 visited network informtion s these two ddresses. Susequent pckets rriving from other networks cn e routed directly to the cre-of ddress ccording to the inding informtion. This method enles ll the pckets rriving from other networks to e routed directly to the MT. 2.notifiction the informtion MBG1 hom e network 1.route offirst few pckets MBG2 visited network MT 3.route of susequentpckets Figure 4. Moile IP order gtewy (MBG) For the pckets rriving from the MT within the Moile IP network, the existing IETF method descried in Section 2 cn e pplied ecuse MTs within the networks hve the required Moile IP functions. Usully IP networks hve few order gtewy routers (BG), so the numer of MBGs tht need to hve these specific functions cn e limited. In ddition, most MTs communicte with WWW servers in other networks more frequently, so it is very effective to optimize the downstrem rriving from the other networks. An locted t order gtewy (BG) cn lso forwrd the pckets to the MT directly (Figure 5). This model is clled the /BG model in this pper. However, the MBG model is etter thn the /BG model in two points. First, the /BG model cn t optimize the route when Moile IP network connects to severl other IP networks. Becuse the /BG node doesn t know the loction of n MT tht doesn t elong to the, the pckets re not forwrded to the MT directly. On the other hnd, n MBG cn forwrd pckets to the MT s loction ecuse ech MBG hs loction informtion concerning the MT. Second, the MBG model (Figure 6) enles route optimiztion in the Moile IP network nd nother IP network when the other IP network cn select the nerest BG from the correspondent node. This pointis fixed when MTs thtelong to 2 com m unicte w ith other networks. Itis impossile to forw rd the pcketto the MT2 loction. MT Figure 3. IETF route optimiztion in Moile IP /BG1 /BG2 3. oute optimiztion using MBGs /BG3 We propose route optimiztion method tht enles Moile IP network to optimize the downstrem route y using its Moile IP Border Gtewy (MBG) routers s shown in Figure 4. In this method, s notify the MBG of the cre-of ddress nd home ddress of ech MT fter few pckets re trnsferred through the s, then the MBG keeps the inding MT1 MT1 elongs to 2. MT2 MT2 elongs to 2. Figure 5. /BG model

3 other IP ne tworks M B G 2 other IP ne tworks M BG 1 1 M BG 3 M BG depends on the loction of Ech M BG cn fo rw rd the pcketto the 2 loction. 1 1 elongs to elongs to 2. evlution might e very complicted. Therefore, we consider only the length of the link for the simplicity Network model We considered the two types of three-lyer hierrchicl network model shown in figure 8. In Model 1, the first nd second lyers oth hd ring topology. In Model 2, the first lyer hd ring topology nd the second lyer hd str topology. In oth models, third lyer hd str topology. The link lengths of the first, second, nd third lyers were, nd c respectively. 3.1 Procedure outline Figure 6. MBG model Figure 7 shows the detiled route optimiztion procedures. ) First few pckets sent to MT After sending the first few pckets to the MT, MBG2 sends messge to the. The messge includes the reltionship etween the MBG ID numer nd the pcket s source IP ddress to inform the of which MBG hndled the pcket (M1). ) Susequent pckets (1) The informs MBG2 of the MT s cre-of ddress (M2). (2) MBG2 cn susequently send pckets intended for the MT directly to its cre-of ddress y mens of tunneling mechnism (M3). M 1 Figure 7. oute optimiztion using MBGs 4. Evlution M BG 1 M BG 2 () First few pckets sent to M BG 1 M 2 The MBG method cn reduce the route length nd the lod. In this section, we evlute its effects y pplying MBG. 4.1 Efficiency of route length reduction M BG 2 We evluted the effects of route optimiztion using the MBG method from the viewpoints of network topology, network scle, nd the nd rrngement schemes. We use men route length s the indiction for the evlution of the proposed method. In clculting the route length, we consider the clcultion of shortest-pth used in OSPF, which considers the ndwidth nd link length in ddition to the numer of hops. In this pper, we wnt to do the evlution on simple condition s the first step. If we consider the ndwidth, use's trffic types (e.g., ndwidth, cll ttempt rte) should e vriles nd the M 3 ( ) Susequent pckets c c c gtew y 1 st lyer 2 nd lyer 3 rd lyer (A)Model Figure 8. Hierrchicl network model We exmined two rrngements for ech model to determine the etter nd rrngement. Cse 1: The s re locted in the first lyer nd the s re locted in the third lyer. Cse 2: The s re locted in the second lyer nd the s re locted in the third lyer Clcultion nd esults 1 st lyer 2 nd lyer 3 rd lyer (B)Model Figure 9 shows the reltionship etween the rtio () etween the scle of the first nd second of lyers nd the verge route length, where =/, is the network scle of the first lyer, is tht of the second lyer (0.1 to ), nd the network scle of the third lyer is ssumed to e c = 0.1. Other ssumptions mde for this evlution were s follows: - the pcket is trnsferred so s to minimize the route length in the ring topology network. - the distnce etween ech lyer is 0. Under these ssumptions, the verge route length (L) is clculted s n m L without MBG { min(route length from the gtewy i1 = j1 = node to the i) min(route length from i to j) }/(n m), (3) L with MBG min(route length from the gtewy node to the j) /m, (4) where i is the to which the MT elongs, j is the visited y the MT, n is the numer of s, nd m is the numer of s. gtew y :with MBG orwithoutmbg

4 Figure 9. tio () etween the scle of lyers 1 nd 2 nd verge route length The route length in cse 1 is shorter thn tht in cse 2 when MBGs re not used. On the other hnd, when MBGs re used, the route is the sme for oth models. So if MBGs re used, the cse 2 rrngement will reduce the urden on the without lengthening the route. If we show this result using the more understndle indiction, we cn clculte the link cost y *(link cost per unit length). 4.2 Efficiency of lod reduction In the erly stge of the introduction of Moile IP, the processing cpcity of my e not so high, nd multiple s should e deployed in the network. On such condition, mny tringulr route would e generted, nd the lod of would e high. Using MBGs cn reduce the lod of y providing direct route to the MT. In this section, we evlute the reltionship etween the numer of s nd effectiveness of the lod reduction of s y introducing MBG Network model We ssumed two-lyer hierrchicl networks model s shown in figure 10. The pckeths to pss through the H A w hen n M BG is notdeployed. Additionllods s 1 s BG s 1 s M BG The pcketcn e sent directly to the with n M B G. -All s connect to ech other. Under these ssumptions the lod is clculted s, Lod of i without MBG=(trffic generted y users within the i re) + (trffic generted y users who elong to the i ut re not in the home re), Lod of i with MBG=(trffic generted y users within the i re ), where the totl re of the network is 620 km2, the numer of terminls is 300,000, the MT velocity is 10 km/h, nd the rtio of trffic to nd from the externl network to ll trffic is 0.7. Figure 11. Normlized lod The normlized lod decresed s the numer of s incresed when the numer of s ws smll, ut reched constnt vlue when the numer of s ws lrge ecuse most of the users would not e in the home re. 5. educing the numer of registrtions to the MBGs All MTs communicting with other networks register their loction informtion with n MBG, ut the numer of registrtions should e reduced to decrese the urden on the MBGs. The hierrchicl rchitecture cn solve this prolem if we dd Gtewy Foreign Agents (Gs). Figure 12 shows hierrchicl rchitecture with Gs. In this rchitecture, n MT registers only when it moves to new G re. This reduces the numer of registrtions to the MBGs. M oile terminl does notregister G MBG These messges cn e reduced G elongs to 1 elongs to 1 Figure 10. Network models for evlution of lod reduction M oile terminl registers its creofddress (G ddress)to Clcultion nd esults Figure12. Hierrchicl rchitecture Figure 11 shows the reltionship etween the numer of s nd the normlized lod ( lod with n MBG / lod without n MBG). Assumptions -Ech elongs to only one. -An hs only one link. By pplying the hierrchicl rchitecture with Gs, the re of coverge of cn ecome virtully wider. The numer of registrtions to one is inversely proportionl to squred root of the numer of s connected to one G. On the other hnd, G should terminte the registrtion request messge nd forwrd it if necessry. Therefore, the processing lod on G could e more thn tht on trnsit router, which performs only

5 the rely of the messges. From the viewpoint of the processing lod on the totl network, the effectiveness y introducing the G is trde off etween the dditionl lod of G nd the reduction of, however, considering tht the concentrtion of lod on the is the min technicl issue for the ppliction of Moile IP for crrier-scle network, the hierrchicl rchitecture with Gs is effective solution ecuse it cn perform the lod distriution. 6. Conclusion We hve proposed route optimiztion mechnism feturing Moile IP order gtewys (MBGs). Using the MBGs cn reduce the route length nd the lod regrdless of the s loction. The numer of registrtions cn e reduced y enlrging the re covered y n nd pplying hierrchicl rchitecture. In future, the performnce of the Moile IP router nd the sclility of network under ctul geogrphicl nd trffic conditions, sed on commercil moile network, should e evluted. The MBG procedure should lso needs to e investigted in detil. eferences [1] C. Perkins, IETF FC 2002, IP Moility Support, [2] 3GPP home pge ( [3] 3GPP2 home pge ( [4] 3G T v1.2.0, Comined GSM nd Moile IP Moility Hndling in UMTS IP CN [5] C. Perkins nd D. B Johnson, oute Optimiztion in Moile IP (IETF internet-drft) [6] H. Ohnishi, T. Ihr, nd Y. Tkgi, Proposed scheme for route optimiztion on the Moile IP network, IEICE Society Conference, B-7-166, pp.259, (in Jpnese) [7] W. L. Tn, T. Chh nd M. C. Chuh, Moile IP Hierrchicl Moility Mngement, APSITT 99, 1999.

2 Computing all Intersections of a Set of Segments Line Segment Intersection

2 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 information

Presentation Martin Randers

Presentation 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 information

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):

Before 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 information

Network Interconnection: Bridging CS 571 Fall Kenneth L. Calvert All rights reserved

Network 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 information

EECS150 - Digital Design Lecture 23 - High-level Design and Optimization 3, Parallelism and Pipelining

EECS150 - 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 information

Performance analysis of QoS mechanisms in IP networks

Performance analysis of QoS mechanisms in IP networks University of Wollongong Reserch Online Fculty of Informtics - Ppers (Archive) Fculty of Engineering nd Informtion Sciences 2000 Performnce nlysis of QoS mechnisms in IP networks D. Ji University of Wollongong

More information

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming

Lecture 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 information

UT1553B BCRT True Dual-port Memory Interface

UT1553B 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 information

10.5 Graphing Quadratic Functions

10.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 information

Slides for Data Mining by I. H. Witten and E. Frank

Slides 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 information

CS 268: IP Multicast Routing

CS 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 information

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have

P(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 information

The Distributed Data Access Schemes in Lambda Grid Networks

The Distributed Data Access Schemes in Lambda Grid Networks The Distributed Dt Access Schemes in Lmbd Grid Networks Ryot Usui, Hiroyuki Miygi, Yutk Arkw, Storu Okmoto, nd Noki Ymnk Grdute School of Science for Open nd Environmentl Systems, Keio University, Jpn

More information

What are suffix trees?

What 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 information

1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)

1. 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 information

COMP 423 lecture 11 Jan. 28, 2008

COMP 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 information

OUTPUT DELIVERY SYSTEM

OUTPUT 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 information

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li

Complete 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

File Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment

File Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment File Mnger Quick Reference Guide June 2018 Prepred for the Myo Clinic Enterprise Khu Deployment NVIGTION IN FILE MNGER To nvigte in File Mnger, users will mke use of the left pne to nvigte nd further pnes

More information

Network Layer: Routing Classifications; Shortest Path Routing

Network 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 information

Registering as an HPE Reseller

Registering as an HPE Reseller Registering s n HPE Reseller Quick Reference Guide for new Prtners Mrch 2019 Registering s new Reseller prtner There re four min steps to register on the Prtner Redy Portl s new Reseller prtner: Appliction

More information

Performance enhancement of IEEE DCF using novel backoff algorithm

Performance enhancement of IEEE DCF using novel backoff algorithm Kuo et l. EURASIP Journl on Wireless Communictions nd Networking 212, 212:274 http://jis.eursipjournls.com/content/212/1/274 RESEARCH Open Access Performnce enhncement of IEEE 82.11 using novel ckoff lgorithm

More information

Announcements. CS 188: Artificial Intelligence Fall Recap: Search. Today. General Tree Search. Uniform Cost. Lecture 3: A* Search 9/4/2007

Announcements. 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 information

LECT-10, S-1 FP2P08, Javed I.

LECT-10, S-1 FP2P08, Javed I. A Course on Foundtions of Peer-to-Peer Systems & Applictions LECT-10, S-1 CS /799 Foundtion of Peer-to-Peer Applictions & Systems Kent Stte University Dept. of Computer Science www.cs.kent.edu/~jved/clss-p2p08

More information

Computer Arithmetic Logical, Integer Addition & Subtraction Chapter

Computer Arithmetic Logical, Integer Addition & Subtraction Chapter Computer Arithmetic Logicl, Integer Addition & Sutrction Chpter 3.-3.3 3.3 EEC7 FQ 25 MIPS Integer Representtion -it signed integers,, e.g., for numeric opertions 2 s s complement: one representtion for

More information

A Priority-based Distributed Call Admission Protocol for Multi-hop Wireless Ad hoc Networks

A Priority-based Distributed Call Admission Protocol for Multi-hop Wireless Ad hoc Networks A Priority-bsed Distributed Cll Admission Protocol for Multi-hop Wireless Ad hoc Networks un Sun Elizbeth M. Belding-Royer Deprtment of Computer Science University of Cliforni, Snt Brbr suny, ebelding

More information

Fig.25: the Role of LEX

Fig.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 information

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus

Unit #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 information

Passwords Passwords Changing Passwords... <New Passwords> 130 Setting UIM PIN... <UIM PIN/UIM PIN2> 130 Unlocking a Locked UIM...

Passwords Passwords Changing Passwords... <New Passwords> 130 Setting UIM PIN... <UIM PIN/UIM PIN2> 130 Unlocking a Locked UIM... Psswords Psswords... 128 Chnging Psswords... 130 Setting UIM PIN... 130 Unlocking Locked UIM... 131 Restricting the Hndset Opertions Locking Function... 131 Locking the

More information

IP: Network Layer. Goals and Tasks. Routing. Switching. Switching (cont.) Datagram v/s Virtual Circuit. Overview Addressing Routing

IP: Network Layer. Goals and Tasks. Routing. Switching. Switching (cont.) Datagram v/s Virtual Circuit. Overview Addressing Routing IP: Network Lyer Overview Addressing Routing Overview Gols nd Tsks Routing Switching Issues Bsic ides TOC IP TOC IP Overview Gols nd Tsks Gols of Network Lyer Guide pckets from source to destintion Use

More information

Agilent Mass Hunter Software

Agilent Mass Hunter Software Agilent Mss Hunter Softwre Quick Strt Guide Use this guide to get strted with the Mss Hunter softwre. Wht is Mss Hunter Softwre? Mss Hunter is n integrl prt of Agilent TOF softwre (version A.02.00). Mss

More information

Registering as a HPE Reseller. Quick Reference Guide for new Partners in Asia Pacific

Registering as a HPE Reseller. Quick Reference Guide for new Partners in Asia Pacific Registering s HPE Reseller Quick Reference Guide for new Prtners in Asi Pcific Registering s new Reseller prtner There re five min steps to e new Reseller prtner. Crete your Appliction Copyright 2017 Hewlett

More information

The Greedy Method. The Greedy Method

The 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 information

From Dependencies to Evaluation Strategies

From 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 information

Section 10.4 Hyperbolas

Section 10.4 Hyperbolas 66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Today. CS 188: Artificial Intelligence Fall Recap: Search. Example: Pancake Problem. Example: Pancake Problem. General Tree Search.

Today. 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 information

COMPUTER EDUCATION TECHNIQUES, INC. (MS_W2K3_SERVER ) SA:

COMPUTER EDUCATION TECHNIQUES, INC. (MS_W2K3_SERVER ) SA: In order to lern which questions hve een nswered correctly: 1. Print these pges. 2. Answer the questions. 3. Send this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following

More information

Symbol Table management

Symbol Table management TDDD Compilers nd interpreters TDDB44 Compiler Construction Symol Tles Symol Tles in the Compiler Symol Tle mngement source progrm Leicl nlysis Syntctic nlysis Semntic nlysis nd Intermedite code gen Code

More information

Engineer To Engineer Note

Engineer To Engineer Note Engineer To Engineer Note EE-169 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Midterm 2 Sample solution

Midterm 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 information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Stack Manipulation. Other Issues. How about larger constants? Frame Pointer. PowerPC. Alternative Architectures

Stack Manipulation. Other Issues. How about larger constants? Frame Pointer. PowerPC. Alternative Architectures Other Issues Stck Mnipultion support for procedures (Refer to section 3.6), stcks, frmes, recursion mnipulting strings nd pointers linkers, loders, memory lyout Interrupts, exceptions, system clls nd conventions

More information

Digital Signal Processing: A Hardware-Based Approach

Digital Signal Processing: A Hardware-Based Approach Digitl Signl Processing: A Hrdwre-Bsed Approch Roert Esposito Electricl nd Computer Engineering Temple University troduction Teching Digitl Signl Processing (DSP) hs included the utilition of simultion

More information

this grammar generates the following language: Because this symbol will also be used in a later step, it receives the

this 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 information

Revisiting the notion of Origin-Destination Traffic Matrix of the Hosts that are attached to a Switched Local Area Network

Revisiting the notion of Origin-Destination Traffic Matrix of the Hosts that are attached to a Switched Local Area Network Interntionl Journl of Distributed nd Prllel Systems (IJDPS) Vol., No.6, November 0 Revisiting the notion of Origin-Destintion Trffic Mtrix of the Hosts tht re ttched to Switched Locl Are Network Mondy

More information

McAfee Network Security Platform

McAfee Network Security Platform NTBA Applince T-200 nd T-500 Quick Strt Guide Revision B McAfee Network Security Pltform 1 Instll the mounting rils Position the mounting rils correctly nd instll them t sme levels. At the front of the

More information

Data Flow on a Queue Machine. Bruno R. Preiss. Copyright (c) 1987 by Bruno R. Preiss, P.Eng. All rights reserved.

Data Flow on a Queue Machine. Bruno R. Preiss. Copyright (c) 1987 by Bruno R. Preiss, P.Eng. All rights reserved. Dt Flow on Queue Mchine Bruno R. Preiss 2 Outline Genesis of dt-flow rchitectures Sttic vs. dynmic dt-flow rchitectures Pseudo-sttic dt-flow execution model Some dt-flow mchines Simple queue mchine Prioritized

More information

Announcements. CS 188: Artificial Intelligence Fall Recap: Search. Today. Example: Pancake Problem. Example: Pancake Problem

Announcements. 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 information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Engineer-to-Engineer Note

Engineer-to-Engineer Note Engineer-to-Engineer Note EE-204 Technicl notes on using Anlog Devices DSPs, processors nd development tools Visit our Web resources http://www.nlog.com/ee-notes nd http://www.nlog.com/processors or e-mil

More information

Position Heaps: A Simple and Dynamic Text Indexing Data Structure

Position 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 information

Simrad ES80. Software Release Note Introduction

Simrad ES80. Software Release Note Introduction Simrd ES80 Softwre Relese 1.3.0 Introduction This document descries the chnges introduced with the new softwre version. Product: ES80 Softwre version: 1.3.0 This softwre controls ll functionlity in the

More information

CS321 Languages and Compiler Design I. Winter 2012 Lecture 5

CS321 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 information

Chapter 7. Routing with Frame Relay, X.25, and SNA. 7.1 Routing. This chapter discusses Frame Relay, X.25, and SNA Routing. Also see the following:

Chapter 7. Routing with Frame Relay, X.25, and SNA. 7.1 Routing. This chapter discusses Frame Relay, X.25, and SNA Routing. Also see the following: Chpter 7 Routing with Frme Rely, X.25, nd SNA This chpter discusses Frme Rely, X.25, nd SNA Routing. Also see the following: Section 4.2, Identifying the BANDIT in the Network Section 4.3, Defining Globl

More information

McAfee Network Security Platform

McAfee 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 information

1.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. 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 information

Application-Level Traffic Monitoring and an Analysis on IP Networks

Application-Level Traffic Monitoring and an Analysis on IP Networks Appliction-Level Trffic Monitoring nd n Anlysis on IP Networks Myung-Sup Kim, Young J. Won, nd Jmes Won-Ki Hong Trditionl trffic identifiction methods bsed on wellknown port numbers re not pproprite for

More information

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.

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 information

vcloud Director Service Provider Admin Portal Guide vcloud Director 9.1

vcloud Director Service Provider Admin Portal Guide vcloud Director 9.1 vcloud Director Service Provider Admin Portl Guide vcloud Director 9. vcloud Director Service Provider Admin Portl Guide You cn find the most up-to-dte technicl documenttion on the VMwre website t: https://docs.vmwre.com/

More information

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork

MA1008. 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 information

Engineer To Engineer Note

Engineer To Engineer Note Engineer To Engineer Note EE-186 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit

More information

Hyperbolas. Definition of Hyperbola

Hyperbolas. Definition of Hyperbola CHAT Pre-Clculus Hyperols The third type of conic is clled hyperol. For n ellipse, the sum of the distnces from the foci nd point on the ellipse is fixed numer. For hyperol, the difference of the distnces

More information

An evolutionary approach to inter-session network coding

An 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 information

In the last lecture, we discussed how valid tokens may be specified by regular expressions.

In 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 information

View, evaluate, and publish assignments using the Assignment dropbox.

View, evaluate, and publish assignments using the Assignment dropbox. Blckord Lerning System CE 6 Mnging Assignments Competencies After reding this document, you will e le to: Crete ssignments using the Assignment tool. View, evlute, nd pulish ssignments using the Assignment

More information

Lab 1 - Counter. Create a project. Add files to the project. Compile design files. Run simulation. Debug results

Lab 1 - Counter. Create a project. Add files to the project. Compile design files. Run simulation. Debug results 1 L 1 - Counter A project is collection mechnism for n HDL design under specifiction or test. Projects in ModelSim ese interction nd re useful for orgnizing files nd specifying simultion settings. The

More information

A New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method

A 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 information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Distributed Systems Principles and Paradigms

Distributed Systems Principles and Paradigms Distriuted Systems Principles nd Prdigms Chpter 11 (version April 7, 2008) Mrten vn Steen Vrije Universiteit Amsterdm, Fculty of Science Dept. Mthemtics nd Computer Science Room R4.20. Tel: (020) 598 7784

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

CS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis

CS143 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 information

Rethinking Virtual Network Embedding: Substrate Support for Path Splitting and Migration

Rethinking 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 information

Engineer-to-Engineer Note

Engineer-to-Engineer Note Engineer-to-Engineer Note EE-295 Technicl notes on using Anlog Devices DSPs, processors nd development tools Visit our Web resources http://www.nlog.com/ee-notes nd http://www.nlog.com/processors or e-mil

More information

A Sparse Grid Representation for Dynamic Three-Dimensional Worlds

A 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 information

Tool Vendor Perspectives SysML Thus Far

Tool Vendor Perspectives SysML Thus Far Frontiers 2008 Pnel Georgi Tec, 05-13-08 Tool Vendor Perspectives SysML Thus Fr Hns-Peter Hoffmnn, Ph.D Chief Systems Methodologist Telelogic, Systems & Softwre Modeling Business Unit Peter.Hoffmnn@telelogic.com

More information

CSCI 3130: Formal Languages and Automata Theory Lecture 12 The Chinese University of Hong Kong, Fall 2011

CSCI 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 information

Routers implementations

Routers implementations Routers implementtions Switching Technology S38.65 http://www.netlb.hut.fi/opetus/s3865 L - Router implementtions Generl of routers Functions of n IP router Router rchitectures Introduction to routing

More information

Welch Allyn CardioPerfect Workstation Installation Guide

Welch Allyn CardioPerfect Workstation Installation Guide Welch Allyn CrdioPerfect Worksttion Instlltion Guide INSTALLING CARDIOPERFECT WORKSTATION SOFTWARE & ACCESSORIES ON A SINGLE PC For softwre version 1.6.6 or lter For network instlltion, plese refer to

More information

cisc1110 fall 2010 lecture VI.2 call by value function parameters another call by value example:

cisc1110 fall 2010 lecture VI.2 call by value function parameters another call by value example: cisc1110 fll 2010 lecture VI.2 cll y vlue function prmeters more on functions more on cll y vlue nd cll y reference pssing strings to functions returning strings from functions vrile scope glol vriles

More information

Lily Yen and Mogens Hansen

Lily Yen and Mogens Hansen SKOLID / SKOLID No. 8 Lily Yen nd Mogens Hnsen Skolid hs joined Mthemticl Myhem which is eing reformtted s stnd-lone mthemtics journl for high school students. Solutions to prolems tht ppered in the lst

More information

Pin-down Cache: A Virtual Memory Management Technique for Zero-copy Communication

Pin-down Cache: A Virtual Memory Management Technique for Zero-copy Communication Pin-down Cche: A Virtul Memory Mngement Technique for Zero-copy Communiction Hiroshi Tezuk, Frncis 0 Cnoll, Atsushi Hori, nd Yutk Ishikw Rel World Computing Prtnership { tezuk, ocrroll, hori, ishikw) @rwcp.or.jp

More information

Engineer To Engineer Note

Engineer To Engineer Note Engineer To Engineer Note EE-188 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit

More information

How to Design REST API? Written Date : March 23, 2015

How to Design REST API? Written Date : March 23, 2015 Visul Prdigm How Design REST API? Turil How Design REST API? Written Dte : Mrch 23, 2015 REpresenttionl Stte Trnsfer, n rchitecturl style tht cn be used in building networked pplictions, is becoming incresingly

More information

Premaster Course Algorithms 1 Chapter 6: Shortest Paths. Christian Scheideler SS 2018

Premaster 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

Deadlock-Free Fully Adaptive Routing in Irregular Networks without Virtual Channels

Deadlock-Free Fully Adaptive Routing in Irregular Networks without Virtual Channels Dedlock-Free Fully Adptive Routing in Irregulr Networks without Virtul Chnnels Dong Xing School of Softwre Tsinghu University Beijing 100084, Chin dxing@tsinghu.edu.cn Zhigng Yu Dept. of Computer Science

More information

What do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers

What do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers Wht do ll those bits men now? bits (...) Number Systems nd Arithmetic or Computers go to elementry school instruction R-formt I-formt... integer dt number text chrs... floting point signed unsigned single

More information

Tilt-Sensing with Kionix MEMS Accelerometers

Tilt-Sensing with Kionix MEMS Accelerometers Tilt-Sensing with Kionix MEMS Accelerometers Introduction Tilt/Inclintion sensing is common ppliction for low-g ccelerometers. This ppliction note describes how to use Kionix MEMS low-g ccelerometers to

More information

QEL 33A/35A, 98/99 Series

QEL 33A/35A, 98/99 Series *24908394* 24908394 Bseplte Conversion Kit QEL 33A/35A, 98/99 Series Instlltion Instructions 1. This kit converts ll 33/35A nd 98/99 series EL devices nd fire devices uilt prior to Oct. 2014 to quiet electric

More information

RIM: Router Interface Marking for IP Traceback

RIM: Router Interface Marking for IP Traceback RIM: Router Interfce Mrking for IP Trcebck Ruiling Chen *, Jung-Min Prk *, nd Rndolph Mrchny * Lbortory for Advnced Reserch in Informtion Assurnce nd Security (ARIAS) * Brdley Deprtment of Electricl nd

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

The Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline

The Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline CPSC 852 Internetworking The Network Lyer: Routing in the Internet Mihele Weigle Deprtment of Computer Siene Clemson University mweigle@s.lemson.edu http://www.s.lemson.edu/~mweigle/ourses/ps852 1 The

More information

What do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers

What do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers Wht do ll those bits men now? bits (...) Number Systems nd Arithmetic or Computers go to elementry school instruction R-formt I-formt... integer dt number text chrs... floting point signed unsigned single

More information

Parallel Square and Cube Computations

Parallel Square and Cube Computations Prllel Squre nd Cube Computtions Albert A. Liddicot nd Michel J. Flynn Computer Systems Lbortory, Deprtment of Electricl Engineering Stnford University Gtes Building 5 Serr Mll, Stnford, CA 945, USA liddicot@stnford.edu

More information

Questions About Numbers. Number Systems and Arithmetic. Introduction to Binary Numbers. Negative Numbers?

Questions About Numbers. Number Systems and Arithmetic. Introduction to Binary Numbers. Negative Numbers? Questions About Numbers Number Systems nd Arithmetic or Computers go to elementry school How do you represent negtive numbers? frctions? relly lrge numbers? relly smll numbers? How do you do rithmetic?

More information

On Achieving Optimal Throughput with Network Coding

On 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 information

PNC NC code PROGRAMMER'S MANUAL

PNC NC code PROGRAMMER'S MANUAL PNC-3200 NC code PROGRAMMER'S MANUAL Thnk you very much for purchsing the PNC-3200. To ensure correct nd sfe usge with full understnding of this product's performnce, plese be sure to red through this

More information

12-B FRACTIONS AND DECIMALS

12-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 information