5 Performance Evaluation

Size: px
Start display at page:

Download "5 Performance Evaluation"

Transcription

1 5 Performance Evalation his chapter evalates the performance of the compared to the MIP, and FMIP individal performances. We stdy the packet loss and the latency to restore the downstream and pstream of packets dring intra-domain and inter-domain handover time. We consider an hipotetical network environment with five different domains interconnected by a backbone. One of the domains is restricted to the stationary C and the others are visited by the M dring a session connection time. Each domain visited by the M is composed of a border roter (MAP entity and three ARs connected to it. Each AR is connected to an IEEE b access point (AP that provides wireless network access to the M. All APs are placed in geographical positions that provide the necessary intersection between cells to make seamless handover possible. Figre 18 illstrates the network environment scenario sed for the evalation. LRS5 ER5 AR5 C LRS1/HRS MAP1 LRS2 MAP2 LRS3 MAP3 LRS4 MAP4 AR11 AR12 AR13 AR21 AR22 AR23 AR31 AR32 AR33 AR41 AR42 AR43 M M Figre 18 etwork environment scenario sed for the evalation We also assme that the Media Independent Event Service (MIES is available and ready to notify the pper layers abot the L2-GoingDown, L2-

2 Performance Evalation 60 Down and L2-UP triggers. So, the M doesn t need to wait for the Roter Advertisement message of the new AR to detect an L3 handover. he M will initiate the L3 handover when the L2-GoingDown trigger is detected. Once notified abot the L2-UP trigger, the M will se the stateless ato-configration mechanism to avoid contacting any entity to obtain a new co-located CoA. hese measres contribte to redce the handover process dration. In order to analyze the performance of the mobility management of the protocols, we need to model the transmission delay of the signaling messages. Depending on the protocol, the signaling messages go throgh wireless links and wired links or jst throgh wired links. Also, some messages are local to a domain and others are originated at a domain and forwarded by intermediary hops to another domain. able 5 introdces the parameters that will be sed in the analysis. able 5 Parameters sed in the analysis Parameters s r Average session connection time Average cell resident time m Average nmber of movements dring a session (i.e., m = s / r S D x-y B w L w B wl L wl P t R d R L2 Average size of a signaling message Average nmber of hops between x and y Bandwidth of the wired link Latency of the wired link (propagation delay and link layer delay Bandwidth of the wireless link Latency of the wireless link (propagation delay and link layer delay Roting table lookp and processing delay Downstream transmission rate (packet transmission rate Upstream transmission rate (packet transmission rate ime interval for L2-handover (starts at L2-Down and ends at L2-UP

3 Performance Evalation 61 Let (S,D x-y denote the transmission delay of a message of size S sent from x (always an M to y via the wireless and wired links, as sggested by [16]. (S,D x-y can be expressed as follows: S S, Dx y Lwl Dx y Lw + B + + wl B = + 1 w ( Dx y + Pt Let (S,D x-y denote the transmission delay of a message of size S sent from x (never an M to y via the wired links. (S,D x-y can be expressed as follows:, Dx y = ( Dx y + 1 S B w + L w + Pt 5.1 Packet loss dring a session Packet loss (Pkt_Loss dring a session is defined as the sm of packets lost dring all handovers procedres while the M is receiving or sending data packets. o redce packet loss, some bffering mechanisms may be sed by both the M and the AR to store in-flight packets, bt these mechanisms sally reqire more signaling messages to be added to the protocols. hen, not all of the protocols spport bffering control of packets dring handover time. his is the case of both the MIP and the. he FMIP and the se signaling messages to enable the bffering and forwarding of in-flight packets from the PAR to the AR. We will denote the bffer size reqirement for downstream and pstream flows as a fnction of the packet transmission rate in section 5.4. For now, we assme that the size of the bffer is appropriate to store the in-flight packets. We also assme that the M is able to store all of its pstream packets and no packets are lost in this direction. So, to denote the total packet loss for the MIP and, we consider that in-flight packets are lost dring the whole L2-handover and L3-handover. he L2- handover starts when the L2-Down trigger is detected and ends when the L2-UP trigger is detected. he L3-handover starts right after the L2-handover is completed and is composed of procedres that depend on the protocol. For the MIP,

4 Performance Evalation 62 these procedres are: (i discovering of the network prefix (Roter Solicitation/Roter Advertisement; (ii registration at the HA; and (iii establishment of the bi-directional tnnel between the M and the HA. For the, the procedres depend on the type of L3-handover. For the intra-domain handover, the procedres are: (i discovering of the network prefix (Roter Solicitation/Roter Advertisement; (ii registration at the MAP; and (iii establishment of the bidirectional tnnel between the M and the MAP. For the inter-domain handover, besides the procedres of the intra-domain handover, more two procedres are exected by the M: (i registration at the HA; and (ii establishment of the bidirectional tnnel between the HA and the MAP. he total packet loss for the MIP and can be expressed as follows: Pkt _ Loss( MIP = [ L2 + ( M AR M HA ] R d m Pkt _ Loss( Intra = [ L2 + ( M AR M MAP ] R d m Pkt _ Loss( Inter = [ L2 + ( (3 + 3 M HA HA MAP M AR M MAP ] R d In the case of the FMIP and the, in-flight packets are lost till the bffering and forwarding mechanisms are initiated. he initialization of these mechanisms is exected as part of the L3-handover, based on the mode of operation of the protocols. Usally, the L2-GoingDown trigger is sed to initiate the L3- handover before the L2-handover. When the icipated mode is sed, the bffering and forwarding mechanisms are initiated before the L2-handover. Otherwise, in the ive mode, these mechanisms are initiated after the L2-handover. For the icipated mode of the FMIP, these mechanisms are initiated when the FBU message, sent by the M, is received by the PAR before the L2- handover. So, packets will be lost only if the M is not able to send the FBU message before the L2-handover and, then, it will need to switch to operate in ive mode. In this circmstance, after the L2-handover, the M sends the FA message (encapslating the FBU to the AR over the wireless link and the AR m

5 Performance Evalation 63 sends the FBU message to the PAR over the wired links to initiate the forwarding mechanism. So, the total packet loss for the FMIP can be expressed as follows: Pkt _ Loss( FMIP Pkt _ Loss( FMIP = 0 = [ L2 + AR PAR M AR ] R d m he initialization of the bffering and forwarding mechanisms of the is very similar to the procedre exected by the FMIP. For the icipated mode of the, the bffering mechanism is initiated when the C2_HandoverInitiate message, sent by the M, is received by the PAR before the L2-handover starts (L2-Down trigger is fired. So, the packets are lost only if the M is not able to send the C2_HandoverInitiate message before the L2-handover starts. Under this circmstance, like FMIP does, the switches to operate in ive mode. his mode starts after the L2 handover is complete, when the M becomes able to send the C2_HandoverFinish message to the AR over the wireless link. In trn, the AR sends the 2_HandoverIndication message to the new LRS (LRS which relays the message to the previos LRS (PLRS. he PLRS relays the same message to the PAR which finally sends the 2_Handover Acknowledge message to the AR. o complete this phase, the AR also exchanges a pair of messages with the PAR over the wired links to reqest the packet forwarding. So, the total packet loss for the can be expressed as follows: Pkt _ Loss( Pkt _ Loss( = 0 = [ L LRS PLRS AR PAR M AR ] R d PLRS PAR m AR LRS 5.2 Average handover latency to restore the downstream flow dring a session Average handover latency to restore the downstream flow (Avg_Lat_Down dring a session is defined as the average time of all handovers of a session to restore the M s ability to receive packets of the ongoing downstream. o redce handover latency, some efforts were made to enhance the L2-handover and the L3-handover. Here, we focs on L3-handover analysis and assme a const vale L2 to express the L2-handover latency.

6 Performance Evalation 64 We assme that the roting optimization is sed to redce the latency of the packets sent/received by the M to/from the C. So, in order to restore the downstream, the M shold execte the retrn rotability procedre before sending the BU message to the C. his is the case of the MIP and inter. So, the latency to restore the downstream flow for the MIP and the inter can be expressed as follows: Lat _ Down( MIP = L2 Lat _ Down( + ( (2 + 2 int er + ( ( ( ( HA C = L2 HA C M AR M,C M HA HA MAP M C M HA M AR M MAP Becase of the hierarchical characteristic of the intra, the M does not need to execte the retrn rotability procedre to restore the downstream. his stream is restored jst after the bi-directional tnnel is established between the M and the MAP. So, the latency in this case can be expressed as follows: Lat _ Down( int ra = L2 + ( M AR M MAP Becase of the bffering and forwarding mechanisms of both the FMIP and, for these protocols, the M also does not need to execte the retrn rotability procedre to restore the downstream. he latency in these cases can be expressed as follows: Lat _ Down( FMIP Lat _ Down( FMIP Lat _ Down( = L2 + = L2 + = L2 + M AR AR PAR M AR M AR

7 Performance Evalation 65 Lat _ Down( = L LRS PLRS M AR AR PAR PLRS PAR AR LRS Finally, the average latency to restore the downstream dring a session can be expressed as follows: Avg _ Lat _ Down( MIP m Lat _ Downi ( MIP = 1 m Avg _ Lat _ Down( = p int ra + (1 p int ra int ra 1 Lat _ Down ( int er 1 i int ra i int er int ra Lat _ Down ( + int er where p intra is the intra-domain handover probability and m = intra + inter. Avg _ Lat _ Down( FMIP = p + (1 p 1 Lat _ Down ( FMIP 1 i i + Lat _ Down ( FMIP Avg _ Lat _ Down( = p + (1 p i= 1 Lat _ Down ( i= 1 i i Lat _ Down ( where p is the icipated mode probability, m = +, is the nmber of icipated operations and is the nmber of ive operations. 5.3 Average handover latency to restore the pstream flow dring a session Average handover latency to restore the pstream flow (Avg_Lat_Up dring a session is defined as the average time of all handovers of a session to restore

8 Performance Evalation 66 the M s ability to send packets of the ongoing pstream. o redce handover latency, some efforts were also made to enhance the L2-handover and the L3- handover. Here, we focs on L3-handover analysis and assme a const vale L2 to express the L2-handover latency. Once again, we assme that the roting optimization is sed to redce the latency of the packets sent/received by the M to/from the C. So, in order to restore the pstream, the M shold execte the retrn rotability procedre before sending the BU message to the C. his is the case of the MIP, inter and FMIP. So, the latency to restore the pstream of these protocols can be expressed as follows: Lat _ Up( MIP = Lat _ Down( MIP Lat _ Up( Lat _ Up( FMIP Lat _ Up( FMIP int er = Lat _ Down( = Lat _ Down( MIP = Lat _ Down( MIP Becase of the hierarchical characteristic of the intra, the M also does not need to execte the retrn rotability procedre to restore the pstream. his stream is also restored jst after the bi-directional tnnel is established between the M and the MAP. So, the latency in this case can be expressed as follows: Lat _ Up( = Lat _ Down( int ra he pstream restore procedre is one of the main advages of the. Dring the handover procedre, the network entities pdate the mobility binding cache of the AR of the C (or Cs on behalf of the M. So, when the M arrives at the new GA, it can restore the pstream jst after sending the C2_HandoverFinish message and receiving the 2C_HandoverAcknowledge message. he latency in this case can be expressed as follows: Lat _ Up( = L2 int er int ra M AR For the, the network entities can only pdate the mobility binding cache of the AR of the C (or Cs after the M has arrived at the new GA. In order to restore the pstream, the following procedre is exected: (i the M sends the C2_HandoverFinish message to the AR. (ii the AR sends the 2_HandoverIndication message to the LRS to reqest the handover context

9 Performance Evalation 67 of the M at the PAR; (iii the LRS relays the 2_HandoverIndication message to the PLRS; (iv the PRLS relays de 2_HandoverIndication message to the PAR; (v the PAR sends the 2_Handover Acknowledge message to the AR to transfer the handover context of the M; (vi the AR sends the 2_Bindingotification message to the LRS; (vii the LRS sends the 2_Bindingotification message to the LRS of the C; (viii the LRS of the C sends the 2_Bindingotification message to the AR of the C to pdate the binding of the M; and (ix the AR sends the 2_HandoverAcknowledge message to the M. So, the latency in this case can be expressed as follows: Lat _ Up( = L LRS PLRS PAR AR AR LRS C _ LRS C _ AR M AR PLRS PAR LRS C _ LRS Finally, the average latency to restore the pstream dring a session can be expressed as follows: Avg _ Lat _ UP( MIP = Avg _ Lat _ Down( MIP Avg _ Lat _ Up( = Avg _ Lat _ Up( FMIP = Avg _ Lat _ Down( Avg _ Lat _ Down( MIP Avg _ Lat _ UP( = p + (1 p i= 1 Lat _ Up ( i= 1 i i Lat _ Up ( where p is the icipated mode probability, m = +, is the nmber of icipated handovers and is the nmber of ive handovers.

10 Performance Evalation Bffer size reqirement for bffering and forwarding mechanisms Some of the mobility protocols spport bffering control of packets dring handover time. his is the case of both the icipated mode of operation of the FMIP and the. hese protocols se signaling messages to enable the bffering and forwarding of in-flight packets from the PAR to the AR. We will denote the bffer size reqirement for downstream (Bf_Size_Down and pstream (Bf_Size_Up as a fnction of the packet transmission rate, as follows. For the icipated mode of operation of the FMIP, both the PAR and the AR shold se bffers to store downstream in-flight packets. he PAR begins to store packets immediately after receiving the FBU message and remains bffering packets ntil the HAck message is received and the forwarding mechanism starts. In its trn, the AR begins to store packets when the first in-flight downstream packet (forwarded by the PAR is received and remains bffering packets ntil the FA message is received and the delivering of packets starts. In this case, the bffer size reqirement can be expressed as follows: Bf _ Size _ Down( FMIP = [ + [ L2 + M PAR AR PAR ] R M AR d + ] R d he bffering mechanism of the icipated mode of operation of the also stores in-flight downstream packets at both the PAR and the AR. he PAR begins to store packets immediately after receiving the C2_HandoverInitiate message and remains bffering packets ntil the 2_HandoverAcknowledge message is received, when the forwarding mechanism starts. In trn, the AR begins to store packets when the first in-flight downstream packet (forwarded by the PAR is received and remains bffering packets ntil the C2_HandoverFinish message is received, when the delivering of the bffered packets starts. So, for the, the bffer size reqirement can be expressed as follows: Bf _ SIze _ Down( = [ [ L2 + PLRS LRS M PAR AR PAR M AR ] R d + ] R d PAR PLRS LRS AR

11 Performance Evalation 69 In both the FMIP and the, the bffer size reqirement for the pstream flow shold be spported by the M. For the FMIP, the reqirement is independent from the mode of operation (icipated or ive and the pstream flow is restored after the retrn rotability and binding pdate procedres. For the, the bffer reqirement depends on the mode of operation. Under the icipated mode, the starts the bffering mechanism after the L2-Down trigger is fired by the link layer and finishes after the AR acknowledges the C2_HandoverFinish message sent by the M. his optimization is a reslt of the icipated registering of the M at the GA and the notification of the ARs of the Cs dring L2 handover. For the ive mode, the bffering mechanism also starts after the L2-Down trigger bt only finishes after the binding notification procedre finishes and the AR acknowledges the 2_HandoverFinish message sent by the M. So, for these protocols, the bffer size reqirement for the pstream can be expressed as follows: Bf _ Size _ Up( FMIP = [ L2 + ( ( HA C M C M AR M HA ] R Bf _ Size _ Up( = [ L2 ] R M AR Bf _ Size _ Up( = [ L2 + 2 AR LRS PLRS PAR LRS C _ LRS M AR PAR AR LRS PLRS C _ LRS C _ AR ] R 5.5 Reslt Analysis Or experiment ses the eqations of the performance parameters presented in sections 5.1, 5.2, 5.3 and 5.4 to analyze the mobility scenario illstrated in Figre 18. In this scenario, the M moves from the access network of the AR11 towards the access network of the AR43. We assme that the M establishes a bidirectional commnication session with the stationary C. his commnication session begins at the network of the AR11 and terminates when the M arrives at the network of the AR43. We also assme that the average movement speed of the

12 Performance Evalation 70 M is adeqate to allow the whole exection of the handover process between each access network. For each of the mobility protocols analyzed in or work, we sed the eqations to calclate the time to execte the intra-domain and inter-domain handover process. Along the path covered by the M, eleven handovers takes place, eight of which are intra-domain and three others are inter-domain. Or analysis of the handover process calclates the time to execte three parts of the handover: (i the time to start the bffering and forwarding mechanisms; (ii the time to restore the downstream flow of packets; and (iii the time to restore the pstream flow of packets. he time vales calclated for each part of the handover of the same mobility protocol considerably varies according to the location the handover takes place becase the signaling messages exchanged between the entities that controls the mobility of the M mst have to go throgh short or long paths to reach their destiny. So, for the first approach of or analysis, we calclated the time average vales to execte each of the three parts of the handover process, for each mobility protocol, along the path covered by the M. he vales of the parameters sed in the eqations are listed in able 6 and the D x-y vales (average nmber of hops between x and y sed are illstrated in Figre 19. he average time vales calclated are listed in able 7. he vale sed for the L2 handover time (L2 is the sm of the average time of the search and exection phases of the L2 handover process of for different commercial IEEE b cards with different chipsets, as described in [15]. he detection phase is discarded becase we assme that the MIES is available. So, this phase is sbstitted by the L2-GoingDown trigger. he L2-Down and L2- UP triggers are also available.

13 Performance Evalation 71 able 6 Parameters settings sed in the first approach of the analysis Parameter Vale S B w L w B wl L wl P t L2 48 bytes 100 Mbps 0.5 msec 11 Mbps 2 msec 0,001 msec 186 msec ARcn 0 C MAP MAP2 MAP3 MAP M 0 AR11 AR12 AR13 AR21 AR22 AR23 AR31 AR32 AR33 AR41 AR42 AR LRS1 LRS2 LRS3 LRS4 MAP4 0 LRS4 2 4 MAP3 0 LRS3 3 2 MAP1 2 MAP2 0 0 LRS1 LRS2 Figre 19 Dx-y vales sed in the analysis

14 Performance Evalation 72 he average time vales of able 7 demonstrate that the time to start the bffering and forwarding mechanisms in the FMIP and is qite similar in both modes of operation. his indicates (and will be frther demonstrated that the loss of downstream packets will be very similar. he reslts also demonstrate that the time to restore the downstream packets in the dring inter-domain handover is greater than the MIP. his is expected becase ses more signaling messages than the MIP to optimize the intra-domain handover, in which case the shows a better performance than the MIP. able 7 Average time vales calclated to the three parts of the handover process Average time vales calclated (ms Start bffering/ forwarding mechanism Restore downstream flow of packets Restore pstream flow of packets Intra Inter Intra Inter Intra Inter MIP A A A A FMIP icipated FMIP ive icipated ive Jst after the L2 handover, both the FMIP and are ready to restore the downstream flow. So, the average time of downstream reestablishment is almost the same as the time needed to complete L2 handover. heir performances are better than the MIP and becase they don t need to execte the retrn rotability procedre to restore the downstream flow. On the other hand, FMIP is reqired to execte this procedre to restore the pstream flow the same way they do. herefore, the FMIP pstream-flow restoration time is qite similar to the time calclated for the MIP and the. Here, we call attention to the first clear advage of the. When operating in the icipated mode, the registration

15 Performance Evalation 73 and binding notifications are exected by the AR and the LRS of the new GA on behalf of the M (dring the L2 handover process, which enables the M to restore the pstream flow of packets immediately after the L2 handover. Even when operating in the ive mode, this time is lower than the ones in the other protocols, which indicates that the binding notification procedre of the performs better than the binding pdate procedre. he second point of or analysis calclates the loss of packets of the downstream flow and the time reqired to restore the downstream and pstream flows for different transmission rate conditions. We also analyze the performance of these protocols for different probability occrrences of the intra-domain and interdomain handover, as well as of the icipated and ive mode of operations. We assme that the bidirectional commnication session between the M and the C takes 1000 seconds. he residence time of the M in each access network is 20 seconds. herefore, the nmber of movements between access networks dring a commnication session is 50. Each L3 handover between access networks is exected as an intra-domain handover with probability P intra and as an inter-domain handover with probability (1 P intra. In the same manner, when relev, the icipated mode of operation occrs with probability P ecipated while the ive mode of operation occrs with probability (1 P ecipated. able 8 Parameters settings sed in the second analysis Parameter Vale s r 1000 sec 20 sec m 50 R d R kbps kbps P intra 0 1 (defalt 0.8 P icipated 0 1 (defalt 0.8

16 Performance Evalation 74 he vales of the parameters sed in the eqations for this second analysis are the same sed for the first one pls the average time vales listed in able 7 and the parameters listed in able 8. Figre 20 shows the comparison of the total packet loss of the downstream flow for a commnication session. Becase of the absence of the bffering and forwarding mechanisms, MIP and loose a signific amont of packets if compared to FMIP and when the downstream transmission rate is above 64 Kbps. For the FMIP and, the loss of packets is eqivalent becase their bffering and forwarding mechanisms are essentially the same. hese protocols loose packets from the downstream flow dring handover only in the ive mode. In the icipated mode, we assme that the amont of bffers reqired to store packets are always available and none of the forwarding packets are lost. his analysis sed the following probabilities: P intra = 0.8 and P ecipated = 0.8. Downstream Packet Loss mber of Packets MIP FMIP Downstream ransmission Rate (Kbps Figre 20 Downstream flow packet loss verss transmission rate As shown in Figre 21, the average bffer size reqirement of the FMIP to store packets of the pstream flow is significly bigger than the one reqired for the. he FMIP reqires abot 38% more bffer area to store these packets becase, after the L2 handover, it is reqired to execte the retrn rotability procedre to notify the C abot the changing of the binding. So, it mst contine the bffering mechanism for an extra period ntil the procedre is finished. On the

17 Performance Evalation 75 other hand, the starts the forwarding mechanism immediately after the L2 handover, when the icipated mode of operation is in progress. Bffer Size Reqirement Bffer Size (KB FMIPdown down FMIPp p ransmission Rate (Kbps Figre 21 Bffer size reqirement for pstream/downstream flow Figre 22 shows the comparison of the latency to restore the downstream flow based on the probability of intra-domain handover and the operating probability of the icipated mode. his analysis demonstrates that most of the time the performs better than the MIP. he hierarchical fnctionality of the restores the commnication faster than the MIP becase, most of the time, the registering of the M and the establishment of the bidirectional tnnel is local to the access network. Unlike the, the MIP always registers the M and establishes the bidirectional tnnel with the HA. FMIP and perform significly better than both the other two. Basically, those protocols make se of the bffering and forwarding mechanisms to redce the latency. he performance of the FMIP is slightly better than the performance of the in the ive mode of operation. otice that the defines the protocol messages to se the service of the LRS to discover the address of the ARs based on the PoA-ID and to notify the PAR abot the handover process. hese messages take part in the handover process and are time consming. Althogh these tasks mst also be exected by the FMIP, there are no entities defined to execte them. So, they are implicitly exected by the AR itself which increases the complexity of this entity. Becase of this overbrden of the AR, the FMIP has fewer signaling messages than the which leads to a lower latency.

18 Performance Evalation 76 Average Downstream-Flow Restore Latency average latency (ms ,2 0,4 0,6 0,8 1 micromobility and ecipated mode probability MIP FMIP Figre 22 Average downstream-flow restore latency Average Upstream-Flow Restore Latency average latency (ms ,2 0,4 0,6 0,8 1 micromobility and ecipated mode probability MIP FMIP Figre 23 - Average pstream-flow restore latency In the following, we compare the latency to restore the pstream flow based on the probability of the intra-domain handover and the probability of the icipated mode. his analysis demonstrates that the MIP and the FMIP are eqivalent in this case. Here, the FMIP is reqired to register the M at the HA and to establish the bidirectional tnnel with the HA in order to execte the retrn rotability procedre. hese procedres are time consming and significly impact the performance of the FMIP. So, now, the reaches a better average performance

19 Performance Evalation 77 than the MIP and FMIP. Here, the advage of the icipated registering and binding notification procedres exected by the ARs and the LRSs on behalf of the M makes the difference in the performance of the.

POWER-OF-2 BOUNDARIES

POWER-OF-2 BOUNDARIES Warren.3.fm Page 5 Monday, Jne 17, 5:6 PM CHAPTER 3 POWER-OF- BOUNDARIES 3 1 Ronding Up/Down to a Mltiple of a Known Power of Ronding an nsigned integer down to, for eample, the net smaller mltiple of

More information

Multiple-Choice Test Chapter Golden Section Search Method Optimization COMPLETE SOLUTION SET

Multiple-Choice Test Chapter Golden Section Search Method Optimization COMPLETE SOLUTION SET Mltiple-Choice Test Chapter 09.0 Golden Section Search Method Optimization COMPLETE SOLUTION SET. Which o the ollowing statements is incorrect regarding the Eqal Interval Search and Golden Section Search

More information

IP Multicast Fault Recovery in PIM over OSPF

IP Multicast Fault Recovery in PIM over OSPF 1 IP Mlticast Falt Recovery in PIM over OSPF Abstract Relatively little attention has been given to nderstanding the falt recovery characteristics and performance tning of native IP mlticast networks.

More information

EEC 483 Computer Organization. Branch (Control) Hazards

EEC 483 Computer Organization. Branch (Control) Hazards EEC 483 Compter Organization Section 4.8 Branch Hazards Section 4.9 Exceptions Chans Y Branch (Control) Hazards While execting a previos branch, next instrction address might not yet be known. s n i o

More information

Cost Based Local Forwarding Transmission Schemes for Two-hop Cellular Networks

Cost Based Local Forwarding Transmission Schemes for Two-hop Cellular Networks Cost Based Local Forwarding Transmission Schemes for Two-hop Celllar Networks Zhenggang Zhao, Xming Fang, Yan Long, Xiaopeng H, Ye Zhao Key Lab of Information Coding & Transmission Sothwest Jiaotong University,

More information

Networks An introduction to microcomputer networking concepts

Networks An introduction to microcomputer networking concepts Behavior Research Methods& Instrmentation 1978, Vol 10 (4),522-526 Networks An introdction to microcompter networking concepts RALPH WALLACE and RICHARD N. JOHNSON GA TX, Chicago, Illinois60648 and JAMES

More information

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY On the Analysis of the Bluetooth Time Division Duplex Mechanism

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY On the Analysis of the Bluetooth Time Division Duplex Mechanism IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY 2007 1 On the Analysis of the Bletooth Time Division Dplex Mechanism Gil Zssman Member, IEEE, Adrian Segall Fellow, IEEE, and Uri Yechiali

More information

Lecture 4: Routing. CSE 222A: Computer Communication Networks Alex C. Snoeren. Thanks: Amin Vahdat

Lecture 4: Routing. CSE 222A: Computer Communication Networks Alex C. Snoeren. Thanks: Amin Vahdat Lectre 4: Roting CSE 222A: Compter Commnication Networks Alex C. Snoeren Thanks: Amin Vahdat Lectre 4 Overview Pop qiz Paxon 95 discssion Brief intro to overlay and active networking 2 End-to-End Roting

More information

On the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing

On the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing 1 On the Comptational Complexity and Effectiveness of N-hb Shortest-Path Roting Reven Cohen Gabi Nakibli Dept. of Compter Sciences Technion Israel Abstract In this paper we stdy the comptational complexity

More information

The Disciplined Flood Protocol in Sensor Networks

The Disciplined Flood Protocol in Sensor Networks The Disciplined Flood Protocol in Sensor Networks Yong-ri Choi and Mohamed G. Goda Department of Compter Sciences The University of Texas at Astin, U.S.A. fyrchoi, godag@cs.texas.ed Hssein M. Abdel-Wahab

More information

Prof. Kozyrakis. 1. (10 points) Consider the following fragment of Java code:

Prof. Kozyrakis. 1. (10 points) Consider the following fragment of Java code: EE8 Winter 25 Homework #2 Soltions De Thrsday, Feb 2, 5 P. ( points) Consider the following fragment of Java code: for (i=; i

More information

Making Full Use of Multi-Core ECUs with AUTOSAR Basic Software Distribution

Making Full Use of Multi-Core ECUs with AUTOSAR Basic Software Distribution Making Fll Use of Mlti-Core ECUs with AUTOSAR Basic Software Distribtion Webinar V0.1 2018-09-07 Agenda Motivation for Mlti-Core AUTOSAR Standard: SWC-Split MICROSAR Extension: BSW-Split BSW-Split: Technical

More information

Picking and Curves Week 6

Picking and Curves Week 6 CS 48/68 INTERACTIVE COMPUTER GRAPHICS Picking and Crves Week 6 David Breen Department of Compter Science Drexel University Based on material from Ed Angel, University of New Mexico Objectives Picking

More information

TDT4255 Friday the 21st of October. Real world examples of pipelining? How does pipelining influence instruction

TDT4255 Friday the 21st of October. Real world examples of pipelining? How does pipelining influence instruction Review Friday the 2st of October Real world eamples of pipelining? How does pipelining pp inflence instrction latency? How does pipelining inflence instrction throghpt? What are the three types of hazard

More information

Lecture 10. Diffraction. incident

Lecture 10. Diffraction. incident 1 Introdction Lectre 1 Diffraction It is qite often the case that no line-of-sight path exists between a cell phone and a basestation. In other words there are no basestations that the cstomer can see

More information

Lecture 10: Addressing

Lecture 10: Addressing Lectre 10: Addressing CSE 123: Compter Networks Alex C. Snoeren HW 2 de NEXT FRIDAY Lectre 10 Overview ICMP The other network-layer protocol IP Addresses Class-based addressing Sbnetting Classless addressing

More information

Constructing and Comparing User Mobility Profiles for Location-based Services

Constructing and Comparing User Mobility Profiles for Location-based Services Constrcting and Comparing User Mobility Profiles for Location-based Services Xihi Chen Interdisciplinary Centre for Secrity, Reliability and Trst, University of Lxemborg Jn Pang Compter Science and Commnications,

More information

The single-cycle design from last time

The single-cycle design from last time lticycle path Last time we saw a single-cycle path and control nit for or simple IPS-based instrction set. A mlticycle processor fies some shortcomings in the single-cycle CPU. Faster instrctions are not

More information

CS 153 Design of Operating Systems Spring 18

CS 153 Design of Operating Systems Spring 18 CS 153 Design of Operating Systems Spring 18 Lectre 11: Semaphores Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Last time Worked throgh software implementation

More information

The final datapath. M u x. Add. 4 Add. Shift left 2. PCSrc. RegWrite. MemToR. MemWrite. Read data 1 I [25-21] Instruction. Read. register 1 Read.

The final datapath. M u x. Add. 4 Add. Shift left 2. PCSrc. RegWrite. MemToR. MemWrite. Read data 1 I [25-21] Instruction. Read. register 1 Read. The final path PC 4 Add Reg Shift left 2 Add PCSrc Instrction [3-] Instrction I [25-2] I [2-6] I [5 - ] register register 2 register 2 Registers ALU Zero Reslt ALUOp em Data emtor RegDst ALUSrc em I [5

More information

CS 153 Design of Operating Systems

CS 153 Design of Operating Systems CS 53 Design of Operating Systems Spring 8 Lectre 6: Paging Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Some slides modified from originals by Dave

More information

EMC ViPR. User Guide. Version

EMC ViPR. User Guide. Version EMC ViPR Version 1.1.0 User Gide 302-000-481 01 Copyright 2013-2014 EMC Corporation. All rights reserved. Pblished in USA. Pblished Febrary, 2014 EMC believes the information in this pblication is accrate

More information

CS 153 Design of Operating Systems Spring 18

CS 153 Design of Operating Systems Spring 18 CS 153 Design of Operating Systems Spring 18 Lectre 9: Synchronization (1) Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Cooperation between Threads

More information

EXAMINATIONS 2003 END-YEAR COMP 203. Computer Organisation

EXAMINATIONS 2003 END-YEAR COMP 203. Computer Organisation EXAINATIONS 2003 COP203 END-YEAR Compter Organisation Time Allowed: 3 Hors (180 mintes) Instrctions: Answer all qestions. There are 180 possible marks on the eam. Calclators and foreign langage dictionaries

More information

Evaluating Influence Diagrams

Evaluating Influence Diagrams Evalating Inflence Diagrams Where we ve been and where we re going Mark Crowley Department of Compter Science University of British Colmbia crowley@cs.bc.ca Agst 31, 2004 Abstract In this paper we will

More information

(2, 4) Tree Example (2, 4) Tree: Insertion

(2, 4) Tree Example (2, 4) Tree: Insertion Presentation for se with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015 B-Trees and External Memory (2, 4) Trees Each internal node has 2 to 4 children:

More information

Maximum Weight Independent Sets in an Infinite Plane

Maximum Weight Independent Sets in an Infinite Plane Maximm Weight Independent Sets in an Infinite Plane Jarno Nosiainen, Jorma Virtamo, Pasi Lassila jarno.nosiainen@tkk.fi, jorma.virtamo@tkk.fi, pasi.lassila@tkk.fi Department of Commnications and Networking

More information

Tdb: A Source-level Debugger for Dynamically Translated Programs

Tdb: A Source-level Debugger for Dynamically Translated Programs Tdb: A Sorce-level Debgger for Dynamically Translated Programs Naveen Kmar, Brce R. Childers, and Mary Lo Soffa Department of Compter Science University of Pittsbrgh Pittsbrgh, Pennsylvania 15260 {naveen,

More information

Date: December 5, 1999 Dist'n: T1E1.4

Date: December 5, 1999 Dist'n: T1E1.4 12/4/99 1 T1E14/99-559 Project: T1E14: VDSL Title: Vectored VDSL (99-559) Contact: J Cioffi, G Ginis, W Y Dept of EE, Stanford U, Stanford, CA 945 Cioffi@stanforded, 1-65-723-215, F: 1-65-724-3652 Date:

More information

Isilon InsightIQ. Version 2.5. User Guide

Isilon InsightIQ. Version 2.5. User Guide Isilon InsightIQ Version 2.5 User Gide Pblished March, 2014 Copyright 2010-2014 EMC Corporation. All rights reserved. EMC believes the information in this pblication is accrate as of its pblication date.

More information

Computer User s Guide 4.0

Computer User s Guide 4.0 Compter User s Gide 4.0 2001 Glenn A. Miller, All rights reserved 2 The SASSI Compter User s Gide 4.0 Table of Contents Chapter 1 Introdction...3 Chapter 2 Installation and Start Up...5 System Reqirements

More information

NETWORK PRESERVATION THROUGH A TOPOLOGY CONTROL ALGORITHM FOR WIRELESS MESH NETWORKS

NETWORK PRESERVATION THROUGH A TOPOLOGY CONTROL ALGORITHM FOR WIRELESS MESH NETWORKS ETWORK PRESERVATIO THROUGH A TOPOLOGY COTROL ALGORITHM FOR WIRELESS MESH ETWORKS F. O. Aron, T. O. Olwal, A. Krien, Y. Hamam Tshwane University of Technology, Pretoria, Soth Africa. Dept of the French

More information

Review: Computer Organization

Review: Computer Organization Review: Compter Organization Pipelining Chans Y Landry Eample Landry Eample Ann, Brian, Cathy, Dave each have one load of clothes to wash, dry, and fold Washer takes 3 mintes A B C D Dryer takes 3 mintes

More information

Master for Co-Simulation Using FMI

Master for Co-Simulation Using FMI Master for Co-Simlation Using FMI Jens Bastian Christoph Claß Ssann Wolf Peter Schneider Franhofer Institte for Integrated Circits IIS / Design Atomation Division EAS Zenerstraße 38, 69 Dresden, Germany

More information

Understanding BGP Misconfiguration

Understanding BGP Misconfiguration Understanding BGP Misconfigration Ratl Mahajan David Wetherall Tom Anderson University of Washington Motivation BGP instabilities have widespread impact Misconfigrations can be a leading case of nreliability

More information

Bias of Higher Order Predictive Interpolation for Sub-pixel Registration

Bias of Higher Order Predictive Interpolation for Sub-pixel Registration Bias of Higher Order Predictive Interpolation for Sb-pixel Registration Donald G Bailey Institte of Information Sciences and Technology Massey University Palmerston North, New Zealand D.G.Bailey@massey.ac.nz

More information

AAA CENTER FOR DRIVING SAFETY & TECHNOLOGY

AAA CENTER FOR DRIVING SAFETY & TECHNOLOGY AAA CENTER FOR DRIVING SAFETY & TECHNOLOGY 2017 FORD MUSTANG PREMIUM CONVERTIBLE INFOTAINMENT SYSTEM* DEMAND RATING Very High Demand The Ford Mstang Convertible s SYNC 3 (version 2.20) infotainment system

More information

4.13 Advanced Topic: An Introduction to Digital Design Using a Hardware Design Language 345.e1

4.13 Advanced Topic: An Introduction to Digital Design Using a Hardware Design Language 345.e1 .3 Advanced Topic: An Introdction to Digital Design Using a Hardware Design Langage 35.e.3 Advanced Topic: An Introdction to Digital Design Using a Hardware Design Langage to Describe and odel a Pipeline

More information

Image Compression Compression Fundamentals

Image Compression Compression Fundamentals Compression Fndamentals Data compression refers to the process of redcing the amont of data reqired to represent given qantity of information. Note that data and information are not the same. Data refers

More information

Adaptive Local Route Optimization in Hierarchical Mobile IPv6 Networks

Adaptive Local Route Optimization in Hierarchical Mobile IPv6 Networks Adaptive Local Route Optimization in Hierarchical Mobile IPv6 Networks Sangheon Pack, Taekyoung Kwon, and Yanghee Choi School of Computer Science and Engineering Seoul National University, Seoul, Korea

More information

Review Multicycle: What is Happening. Controlling The Multicycle Design

Review Multicycle: What is Happening. Controlling The Multicycle Design Review lticycle: What is Happening Reslt Zero Op SrcA SrcB Registers Reg Address emory em Data Sign etend Shift left Sorce A B Ot [-6] [5-] [-6] [5-] [5-] Instrction emory IR RegDst emtoreg IorD em em

More information

Collision Avoidance and Resolution Multiple Access: First-Success Protocols

Collision Avoidance and Resolution Multiple Access: First-Success Protocols Collision Avoidance and Resoltion Mltiple Access: First-Sccess Protocols Rodrigo Garcés and J.J. Garcia-Lna-Aceves askin Center for Compter Engineering and Information Sciences University of California

More information

EXAMINATIONS 2010 END OF YEAR NWEN 242 COMPUTER ORGANIZATION

EXAMINATIONS 2010 END OF YEAR NWEN 242 COMPUTER ORGANIZATION EXAINATIONS 2010 END OF YEAR COPUTER ORGANIZATION Time Allowed: 3 Hors (180 mintes) Instrctions: Answer all qestions. ake sre yor answers are clear and to the point. Calclators and paper foreign langage

More information

CS 153 Design of Operating Systems Spring 18

CS 153 Design of Operating Systems Spring 18 CS 153 Design of Operating Systems Spring 18 Lectre 15: Virtal Address Space Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian OS Abstractions Applications

More information

What do we have so far? Multi-Cycle Datapath

What do we have so far? Multi-Cycle Datapath What do we have so far? lti-cycle Datapath CPI: R-Type = 4, Load = 5, Store 4, Branch = 3 Only one instrction being processed in datapath How to lower CPI frther? #1 Lec # 8 Spring2 4-11-2 Pipelining pipelining

More information

Fault Tolerance in Hypercubes

Fault Tolerance in Hypercubes Falt Tolerance in Hypercbes Shobana Balakrishnan, Füsn Özgüner, and Baback A. Izadi Department of Electrical Engineering, The Ohio State University, Colmbs, OH 40, USA Abstract: This paper describes different

More information

An Adaptive Strategy for Maximizing Throughput in MAC layer Wireless Multicast

An Adaptive Strategy for Maximizing Throughput in MAC layer Wireless Multicast University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering May 24 An Adaptive Strategy for Maximizing Throghpt in MAC layer Wireless Mlticast Prasanna

More information

A choice relation framework for supporting category-partition test case generation

A choice relation framework for supporting category-partition test case generation Title A choice relation framework for spporting category-partition test case generation Athor(s) Chen, TY; Poon, PL; Tse, TH Citation Ieee Transactions On Software Engineering, 2003, v. 29 n. 7, p. 577-593

More information

CAPL Scripting Quickstart

CAPL Scripting Quickstart CAPL Scripting Qickstart CAPL (Commnication Access Programming Langage) For CANalyzer and CANoe V1.01 2015-12-03 Agenda Important information before getting started 3 Visal Seqencer (GUI based programming

More information

The Impact of Avatar Mobility on Distributed Server Assignment for Delivering Mobile Immersive Communication Environment

The Impact of Avatar Mobility on Distributed Server Assignment for Delivering Mobile Immersive Communication Environment This fll text paper was peer reviewed at the direction of IEEE Commnications Society sbject matter experts for pblication in the ICC 27 proceedings. The Impact of Avatar Mobility on Distribted Server Assignment

More information

dss-ip Manual digitalstrom Server-IP Operation & Settings

dss-ip Manual digitalstrom Server-IP Operation & Settings dss-ip digitalstrom Server-IP Manal Operation & Settings Table of Contents digitalstrom Table of Contents 1 Fnction and Intended Use... 3 1.1 Setting p, Calling p and Operating... 3 1.2 Reqirements...

More information

CS 153 Design of Operating Systems

CS 153 Design of Operating Systems CS 153 Design of Operating Systems Spring 18 Lectre 3: OS model and Architectral Spport Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Last time/today

More information

Congestion-adaptive Data Collection with Accuracy Guarantee in Cyber-Physical Systems

Congestion-adaptive Data Collection with Accuracy Guarantee in Cyber-Physical Systems Congestion-adaptive Data Collection with Accracy Garantee in Cyber-Physical Systems Nematollah Iri, Lei Y, Haiying Shen, Gregori Calfield Department of Electrical and Compter Engineering, Clemson University,

More information

Functions of Combinational Logic

Functions of Combinational Logic CHPTER 6 Fnctions of Combinational Logic CHPTER OUTLINE 6 6 6 6 6 5 6 6 6 7 6 8 6 9 6 6 Half and Fll dders Parallel inary dders Ripple Carry and Look-head Carry dders Comparators Decoders Encoders Code

More information

EMC VNX Series. Problem Resolution Roadmap for VNX with ESRS for VNX and Connect Home. Version VNX1, VNX2 P/N REV. 03

EMC VNX Series. Problem Resolution Roadmap for VNX with ESRS for VNX and Connect Home. Version VNX1, VNX2 P/N REV. 03 EMC VNX Series Version VNX1, VNX2 Problem Resoltion Roadmap for VNX with ESRS for VNX and Connect Home P/N 300-014-335 REV. 03 Copyright 2012-2014 EMC Corporation. All rights reserved. Pblished in USA.

More information

The extra single-cycle adders

The extra single-cycle adders lticycle Datapath As an added bons, we can eliminate some of the etra hardware from the single-cycle path. We will restrict orselves to sing each fnctional nit once per cycle, jst like before. Bt since

More information

CS 4204 Computer Graphics

CS 4204 Computer Graphics CS 424 Compter Graphics Crves and Srfaces Yong Cao Virginia Tech Reference: Ed Angle, Interactive Compter Graphics, University of New Mexico, class notes Crve and Srface Modeling Objectives Introdce types

More information

Content Content Introduction

Content Content Introduction Content Content Introdction...................................................................... 3 Roles in the provisioning process............................................................... 4 Server

More information

A Wireless MAC Protocol comparison.

A Wireless MAC Protocol comparison. Doc: IEEE P82.1192S1 IEEE 82.11 Wireless Access Method and Physical Layer Specifications Title: Presented by: A Wireless MAC Protocol comparison. Wim Diepstraten NCR SEUtrecht NCRAT&T Network Prodct Grop

More information

MultiView: Improving Trust in Group Video Conferencing Through Spatial Faithfulness David T. Nguyen, John F. Canny

MultiView: Improving Trust in Group Video Conferencing Through Spatial Faithfulness David T. Nguyen, John F. Canny MltiView: Improving Trst in Grop Video Conferencing Throgh Spatial Faithflness David T. Ngyen, John F. Canny CHI 2007, April 28 May 3, 2007, San Jose, California, USA Presented by: Stefan Stojanoski 1529445

More information

Winter 2013 MIDTERM TEST #2 Wednesday, March 20 7:00pm to 8:15pm. Please do not write your U of C ID number on this cover page.

Winter 2013 MIDTERM TEST #2 Wednesday, March 20 7:00pm to 8:15pm. Please do not write your U of C ID number on this cover page. page of 7 University of Calgary Departent of Electrical and Copter Engineering ENCM 369: Copter Organization Lectre Instrctors: Steve Noran and Nor Bartley Winter 23 MIDTERM TEST #2 Wednesday, March 2

More information

Real-time mean-shift based tracker for thermal vision systems

Real-time mean-shift based tracker for thermal vision systems 9 th International Conference on Qantitative InfraRed Thermography Jly -5, 008, Krakow - Poland Real-time mean-shift based tracker for thermal vision systems G. Bieszczad* T. Sosnowski** * Military University

More information

Instruction fetch. MemRead. IRWrite ALUSrcB = 01. ALUOp = 00. PCWrite. PCSource = 00. ALUSrcB = 00. R-type completion

Instruction fetch. MemRead. IRWrite ALUSrcB = 01. ALUOp = 00. PCWrite. PCSource = 00. ALUSrcB = 00. R-type completion . (Chapter 5) Fill in the vales for SrcA, SrcB, IorD, Dst and emto to complete the Finite State achine for the mlti-cycle datapath shown below. emory address comptation 2 SrcA = SrcB = Op = fetch em SrcA

More information

Addressing in Future Internet: Problems, Issues, and Approaches

Addressing in Future Internet: Problems, Issues, and Approaches Addressing in Ftre Internet: Problems, Isses, and Approaches Mltimedia and Mobile commnications Laboratory Seol National University Jaeyong Choi, Chlhyn Park, Hakyng Jng, Taekyong Kwon, Yanghee Choi 19

More information

Pavlin and Daniel D. Corkill. Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003

Pavlin and Daniel D. Corkill. Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003 From: AAAI-84 Proceedings. Copyright 1984, AAAI (www.aaai.org). All rights reserved. SELECTIVE ABSTRACTION OF AI SYSTEM ACTIVITY Jasmina Pavlin and Daniel D. Corkill Department of Compter and Information

More information

VirtuOS: an operating system with kernel virtualization

VirtuOS: an operating system with kernel virtualization VirtOS: an operating system with kernel virtalization Rslan Nikolaev, Godmar Back SOSP '13 Proceedings of the Twenty-Forth ACM Symposim on Oper ating Systems Principles 이영석, 신현호, 박재완 Index Motivation Design

More information

Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN:

Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN: Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN: 1137-3601 revista@aepia.org Asociación Española para la Inteligencia Artificial España Zaballos, Lis J.; Henning, Gabriela

More information

A Recovery Algorithm for Reliable Multicasting in Reliable Networks

A Recovery Algorithm for Reliable Multicasting in Reliable Networks A Recovery Algorithm for Reliable Mlticasting in Reliable Networks Danyang Zhang Sibabrata Ray Dept. of Compter Science University of Alabama Tscaloosa, AL 35487 {dzhang, sib}@cs.a.ed Ragopal Kannan S.

More information

A sufficient condition for spiral cone beam long object imaging via backprojection

A sufficient condition for spiral cone beam long object imaging via backprojection A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral

More information

Efficient and Accurate Delaunay Triangulation Protocols under Churn

Efficient and Accurate Delaunay Triangulation Protocols under Churn Efficient and Accrate Delanay Trianglation Protocols nder Chrn Dong-Yong Lee and Simon S. Lam Department of Compter Sciences The University of Texas at Astin {dylee, lam}@cs.texas.ed November 9, 2007 Technical

More information

ECEN Final Exam Fall Instructor: Srinivas Shakkottai

ECEN Final Exam Fall Instructor: Srinivas Shakkottai ECEN 424 - Final Exam Fall 2013 Instructor: Srinivas Shakkottai NAME: Problem maximum points your points Problem 1 10 Problem 2 10 Problem 3 20 Problem 4 20 Problem 5 20 Problem 6 20 total 100 1 2 Midterm

More information

CS 153 Design of Operating Systems

CS 153 Design of Operating Systems CS 153 Design of Operating Systems Spring 18 Lectre 23: File Systems (2) Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Last time Abstractions for the

More information

CSE 141 Computer Architecture Summer Session I, Lectures 10 Advanced Topics, Memory Hierarchy and Cache. Pramod V. Argade

CSE 141 Computer Architecture Summer Session I, Lectures 10 Advanced Topics, Memory Hierarchy and Cache. Pramod V. Argade CSE 141 Compter Architectre Smmer Session I, 2004 Lectres 10 Advanced Topics, emory Hierarchy and Cache Pramod V. Argade CSE141: Introdction to Compter Architectre Instrctor: TA: Pramod V. Argade (p2argade@cs.csd.ed)

More information

arxiv: v1 [cs.cg] 26 Sep 2018

arxiv: v1 [cs.cg] 26 Sep 2018 Convex partial transversals of planar regions arxiv:1809.10078v1 [cs.cg] 26 Sep 2018 Vahideh Keikha Department of Mathematics and Compter Science, University of Sistan and Balchestan, Zahedan, Iran va.keikha@gmail.com

More information

Datawell Waverider Transmission Protocol

Datawell Waverider Transmission Protocol Datawell Waverider Transmission Protocol For the Mk4 boys Specifications Service & Sales Voltastraat 3 1704 RP Heerhgowaard The Netherlands +31 72 534 5298 +31 72 572 6406 www.datawell.nl 15 March 2017

More information

Pipelining. Chapter 4

Pipelining. Chapter 4 Pipelining Chapter 4 ake processor rns faster Pipelining is an implementation techniqe in which mltiple instrctions are overlapped in eection Key of making processor fast Pipelining Single cycle path we

More information

Content Safety Precaution... 4 Getting started... 7 Input method... 9 Using the Menus Use of USB Maintenance & Safety...

Content Safety Precaution... 4 Getting started... 7 Input method... 9 Using the Menus Use of USB Maintenance & Safety... STAR -1- Content 1. Safety Precation... 4 2. Getting started... 7 Installing the cards and the Battery... 7 Charging the Battery... 8 3. Inpt method... 9 To Shift Entry Methods... 9 Nmeric and English

More information

Method to build an initial adaptive Neuro-Fuzzy controller for joints control of a legged robot

Method to build an initial adaptive Neuro-Fuzzy controller for joints control of a legged robot Method to bild an initial adaptive Nero-Fzzy controller for joints control of a legged robot J-C Habmremyi, P. ool and Y. Badoin Royal Military Academy-Free University of Brssels 08 Hobbema str, box:mrm,

More information

EECS 487: Interactive Computer Graphics f

EECS 487: Interactive Computer Graphics f Interpolating Key Vales EECS 487: Interactive Compter Graphics f Keys Lectre 33: Keyframe interpolation and splines Cbic splines The key vales of each variable may occr at different frames The interpolation

More information

Fast Location Opposite Update Scheme for Minimizing Handover Latency over Wireless/Mobile Networks

Fast Location Opposite Update Scheme for Minimizing Handover Latency over Wireless/Mobile Networks Fast Location Opposite Update Scheme for Minimizing Handover Latency over Wireless/Mobile Networks Sunguk Lee Research Institute of Industrial Science and Technology Pohang, Gyeongbuk, 790-330, S.KOREA

More information

Review. A single-cycle MIPS processor

Review. A single-cycle MIPS processor Review If three instrctions have opcodes, 7 and 5 are they all of the same type? If we were to add an instrction to IPS of the form OD $t, $t2, $t3, which performs $t = $t2 OD $t3, what wold be its opcode?

More information

OPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 9 Fall, 2018

OPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 9 Fall, 2018 OPTI-502 Optical Design and Instrmentation I John E. Greivenkamp Assigned: 10/31/18 Lectre 21 De: 11/7/18 Lectre 23 Note that in man 502 homework and exam problems (as in the real world!!), onl the magnitde

More information

Resolving Linkage Anomalies in Extracted Software System Models

Resolving Linkage Anomalies in Extracted Software System Models Resolving Linkage Anomalies in Extracted Software System Models Jingwei W and Richard C. Holt School of Compter Science University of Waterloo Waterloo, Canada j25w, holt @plg.waterloo.ca Abstract Program

More information

Virtual Hierarchical Architecture Integrating Mobile IPv6 and MANETs for Internet Connectivity

Virtual Hierarchical Architecture Integrating Mobile IPv6 and MANETs for Internet Connectivity Virtual Hierarchical Architecture Integrating Mobile IPv6 and MANETs for Internet Connectivity Hyemee Park, Tae-Jin Lee, and Hyunseung Choo School of Information and Communication Engineering Sungkyunkwan

More information

CS 251, Winter 2018, Assignment % of course mark

CS 251, Winter 2018, Assignment % of course mark CS 25, Winter 28, Assignment 3.. 3% of corse mark De onday, Febrary 26th, 4:3 P Lates accepted ntil : A, Febrary 27th with a 5% penalty. IEEE 754 Floating Point ( points): (a) (4 points) Complete the following

More information

Illumina LIMS. Software Guide. For Research Use Only. Not for use in diagnostic procedures. Document # June 2017 ILLUMINA PROPRIETARY

Illumina LIMS. Software Guide. For Research Use Only. Not for use in diagnostic procedures. Document # June 2017 ILLUMINA PROPRIETARY Illmina LIMS Software Gide Jne 2017 ILLUMINA PROPRIETARY This docment and its contents are proprietary to Illmina, Inc. and its affiliates ("Illmina"), and are intended solely for the contractal se of

More information

Multi-lingual Multi-media Information Retrieval System

Multi-lingual Multi-media Information Retrieval System Mlti-lingal Mlti-media Information Retrieval System Shoji Mizobchi, Sankon Lee, Fmihiko Kawano, Tsyoshi Kobayashi, Takahiro Komats Gradate School of Engineering, University of Tokshima 2-1 Minamijosanjima,

More information

PART I: Adding Instructions to the Datapath. (2 nd Edition):

PART I: Adding Instructions to the Datapath. (2 nd Edition): EE57 Instrctor: G. Pvvada ===================================================================== Homework #5b De: check on the blackboard =====================================================================

More information

Cautionary Aspects of Cross Layer Design: Context, Architecture and Interactions

Cautionary Aspects of Cross Layer Design: Context, Architecture and Interactions Cationary Aspects of Cross Layer Design: Context, Architectre and Interactions Vikas Kawadia and P. R. Kmar Dept. of Electrical and Compter Engineering, and Coordinated Science Lab University of Illinois,

More information

EEC 483 Computer Organization

EEC 483 Computer Organization EEC 483 Compter Organization Chapter 4.4 A Simple Implementation Scheme Chans Y The Big Pictre The Five Classic Components of a Compter Processor Control emory Inpt path Otpt path & Control 2 path and

More information

Nortel DECT Handset 4025 User Guide

Nortel DECT Handset 4025 User Guide DECT 4025 Nortel DECT Handset 4025 User Gide Revision history Revision history October 2005 Standard 2.00. This docment is p-issed to spport Nortel Commnication Server 1000 Release 4.5. Febrary 2005 Standard

More information

A Hybrid Weight-Based Clustering Algorithm for Wireless Sensor Networks

A Hybrid Weight-Based Clustering Algorithm for Wireless Sensor Networks Open Access Library Jornal A Hybrid Weight-Based Clstering Algorithm for Wireless Sensor Networks Cheikh Sidy Mohamed Cisse, Cheikh Sarr * Faclty of Science and Technology, University of Thies, Thies,

More information

A GENERIC MODEL OF A BASE-ISOLATED BUILDING

A GENERIC MODEL OF A BASE-ISOLATED BUILDING Chapter 5 A GENERIC MODEL OF A BASE-ISOLATED BUILDING This chapter draws together the work o Chapters 3 and 4 and describes the assembly o a generic model o a base-isolated bilding. The irst section describes

More information

CAN FD. An Introduction V

CAN FD. An Introduction V CAN FD An Introdction V.02 208-0- Agenda Why CAN FD? What is CAN FD? CAN FD Use Cases Atomotive Application Domains CAN FD Controller CAN FD Performance CAN FD Devices CAN FD Standardization Smmary References

More information

ABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS

ABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS Proceedings th FIG Symposim on Deformation Measrements Santorini Greece 00. ABSOUTE DEFORMATION PROFIE MEASUREMENT IN TUNNES USING REATIVE CONVERGENCE MEASUREMENTS Mahdi Moosai and Saeid Khazaei Mining

More information

CS 153 Design of Operating Systems Spring 18

CS 153 Design of Operating Systems Spring 18 CS 53 Design of Operating Systems Spring 8 Lectre 2: Virtal Memory Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Recap: cache Well-written programs exhibit

More information

Lecture 11: IPv6. CSE 123: Computer Networks Alex C. Snoeren. HW 2 due FRIDAY

Lecture 11: IPv6. CSE 123: Computer Networks Alex C. Snoeren. HW 2 due FRIDAY Lectre 11: IPv6 CSE 123: Compter Networks Alex C. Snoeren HW 2 de FRIDAY IP Address Problem (1991) Address space depletion In danger of rnning ot of classes A and B Why? Class C too small for most organizations

More information

Chapter 5 Network Layer

Chapter 5 Network Layer Chapter Network Layer Network layer Physical layer: moe bit seqence between two adjacent nodes Data link: reliable transmission between two adjacent nodes Network: gides packets from the sorce to destination,

More information

Broadcasting XORs: On the Application of Network Coding in Access Point-to-Multipoint Networks

Broadcasting XORs: On the Application of Network Coding in Access Point-to-Multipoint Networks Broadcasting XORs: On the Application of Network Coding in Access Point-to-Mltipoint Networks The MIT Faclty has made this article openly available Please share how this access benefits yo Yor story matters

More information

arxiv: v1 [cs.cg] 27 Nov 2015

arxiv: v1 [cs.cg] 27 Nov 2015 On Visibility Representations of Non-planar Graphs Therese Biedl 1, Giseppe Liotta 2, Fabrizio Montecchiani 2 David R. Cheriton School of Compter Science, University of Waterloo, Canada biedl@waterloo.ca

More information