EE 122 Final Exam - Solution Date: December 14, 2002

Size: px
Start display at page:

Download "EE 122 Final Exam - Solution Date: December 14, 2002"

Transcription

1 Name: SID: ee ogin: Day/Time of section you atten: EE Fina Exam - Soution Date: December 4, 00 Probem Points /0 /0 3 /0 4 /0 5 /0 6 /0 7 /0 8 /0 9 /0 0 /0 Tota /00

2 . Question (0 pt) (a) (5 pt) Expain briefy how the Reservation Protoco (RSVP) works. In particuar, what are the main messages an what o en-hosts an routers o upon receiving these messages? (b) (5 pt) How oes RSVP hane IP route changes? Give a simpe exampe to iustrate this point. Soution: a) RSVP is a signaing protoco that, in the context of Intserv, is use for amission contro an resource reservation. There are two main contro messages in RSVP: - Path message this message is sent by the sener to the receiver an is use to () carry the sener s traffic specifications, an () set up the path. Upon receiving this message each noe stores the previous noe aong the path. - Resv message this message is sent by the receiver to sener an is use to perform amission contro an resource reservation. Upon receiving such a message a noe checks whether it has enough resources to satisfy the receiver requirements. If yes, it reserves resources; if not, it marks the message to inicate that the reservation is enie. In both cases the noe forwars the message to the previous noe (set up by the Path message) towars the source. b) RSVP is a soft-state protoco, i.e., routers maintain state ony as ong as it is perioicay refreshe; when the state timeouts it is simpy remove. To refresh state on routers aong the path, the sener perioicay sens Path messages to the receiver an the receiver perioicay sens Resv messages to the sener. RSVP hanes IP route changes as foows. When the route changes, the next Path message is forware aong the new route an a new reverse path is set up. Then, when the next Resv message is sent by the receiver, the message traves the new route an reserves resources on that route. Eventuay, the resources on the o route are reease when they timeout. For an exampe, see the exampe in page 0 of the ecture Integrate Services.

3 . Question (0 pt) Answer each of the points beow as briefy as possibe: (a) (5 pt) Give two avantages of RED over Drop Tai. Expain. (b) (5 pt) Give one avantage of RED over Roun-Robin an one avantage of Roun-Robin over RED. Expain. Soution: (a) RED avois () TP fow synchronization an () arge bursts of osses. The main reason behin these avantages is the fact that RED starts to rop packets ranomy before the buffer is fu. This aows the router to sprea osses over a arger time interva, an signa the congestion to en-hosts earier. (b) RED can be impemente more efficienty since, unike Roun-Robin, it oes not require to maintain per fow buffers an perform per-fow scheuing; RED maintains ony one queue an performs FIFO scheuing. Roun-Robin can provie per-fow isoation. Whie with RED, a non-aaptive fow such as an UDP fow can hurt a TP fow if it sens traffic at more than its fair share, with Roun-Robin that fow can hurt ony itsef.

4 3. Question 3 (0 pt) (a) (5 pt) Describe the Assure service moe. (b) (5 pt) Describe how RIO (Re with In an Out) buffer management scheme works, an how it can be use to impement the Assure service moe. Soution: (a) The assure service provies a traffic profie (usuay characterize by tokenbucket) to each customer. The customer is promise that as ong as it sens assure traffic without exceeing its profie, it wi experience a ower packet oss than using the best-effort service. The traffic profie is efine inepenent of the estinations. (b) RIO is an extene version of RED that uses two threshos. When the queue size excees the first thresho, RIO starts to rop the best-effort packets. RIO starts to rop assure packets ony when the queue size of the assure traffic excees the secon thresho. Since the secon thresho is aways arger than the first one, RIO wi start to rop assure packets ony as a ast resort, i.e., if ropping a the best-effort packets wi not eiminate the congestion.

5 4. Question 4 (0 pt) (a) (5 pt) Expain how the fair max-min share is compute. (b) (5 pt) onsier 0 fows with the arriva rates of,,, 0 Mbps that traverse a ink of 45Mbps. ompute the fair share on this ink. What is the fair share if the ink capacity is 60 Mbps? Soution: (a) Let be the capacity of the congeste ink, S be set of a fows, n be the number of fows in S, an r i be the arriva rate of fow i. Then we can use the foowing iterative agorithm to compute the max-min fair share: () ompute f=/n () Let S(f) be the sub-set of fows from S consisting of a fows with arriva rates that are ess or equa to f. If S(f) not empty: = n = n size( S( f )); S = S S( f ); goto step r ; i S ( f ) i Otherwise, stop, an f is the max-min fair share; terminate (b) For =45Mbps we have: () Iteration : f = 45Mbps/0 = 4.5Mbps; S(f) = {,, 3, 4}. Thus, = 45Mbps 0Mbps = 35Mbps, n = 6, an S = {5, 6, 7, 8, 9, 0} () Iteration : f = 35Mbps/6 = 5.85 Mbps; S(f) consists of fow 5, =35Mbps 5Mbps = 30Mbps, n = 5, an S = {6, 7, 8, 9, 0} (3) Iteration 3: f = 30Mbps/5 = 6Mbps; S(f) is empty, thus max-min fair share is 6Mbps For =60Mbps note that the sum of a arriva rates is 0 = 55Mbps, which means that a fows wi get how much they requeste. In this case the fair rate is 0, the maximum arriva rate of a fows. (You can reach the same resut using the iterative agorithm above).

6 5. Question 5 (0 pt) Derive the reation between the minimum size of an Ethernet packet an maximum istance between two en-hosts on an Ethernet cabe. Denote the propagation spee of the signa in the communication meia (i.e., cabe) by c an the capacity of the cabe by B. Soution: See sie 8 from the ecture Ethernet an 80.. The fina resut is: = (*c)/(*b)

7 6. Question 6 (0 pt) onsier the network beow. Show the iterations foowe by noe A to compute the shortest paths from itsef to a the other noes using the Dijkstra agorithm. Assume A has areay coecte a ink state information in the network. B A 7 D F 4 E Soution: Step S D(B),p(B) D(),p() D(D),p(D) D(E),p(E) D(F),p(F) 0 A,A,A AB 4,B 9,B,A ABF 4,B 9,B 6,F 3 ABF 8, 6,F 4 ABFE 7,E 5 ABFED

8 7. Question 7 (0 pt) onsier a source A that uses TP to transfer a fie of 8KB to estination B. Each packet has a payoa of KB. Assume that ony two packets are ost uring the transfer: the 4 th ata packet an the acknowegment of the 6 th ata packet. Draw the time iagram of the entire fie transfer. Assume that retransmission timeout (RTO) is 4*RTT. How many RTTs oes it take to transfer the entire fie? Note: The transfer time represents the interva between the time the acknowegement of the ast packet was receive by A an the time the first packet is transmitte by A. Ignore the connection setup, processing an transmission times. Fast retransmission an fast recovery are triggere after receiving 3 upicate acknowegements. Soution: The answer is 8 RTTs: 0 RTT RTT 4 RTT ack ack ack 3 ack 3 ack 3 ack 3 RTT RTT 3 7 ack 7 ack 8

9 Some peope assume that upicate acknowegements open the congestion winow. TP, as escribe in cass, oes not o this, but it is a reasonabe thing for it to o, so we i not euct points for this. 3 points for getting the first RTT from 3 packets in sow start points for having the sener recognize that packet 3 an 5 are unacke points for ony retransmitting packet 3 3 for having correct RTO (in soution given above) or Fast Retransmit (in aternate soution)

10 8. Question 8 (0 pt) onsier the arriva traffic characterize by a token bucket with parameters r (average rate) = Mbps, R (maximum rate) = Mbps, an b (token epth) = 00Kb. What is the minimum rate r a that nees to be aocate by a router in orer to guarantee a eay no arger than 50 ms? bits Arriva curve br R r service curve br R r R Maximum eay (50ms) Time Soution: The minimum rate of the service curve is the sope of the service curve. From the iagram, that sope is br R r br R r 50ms R = = 00Kb * Mb / s Mb / s Mb / s 00Kb * Mb / s Mb / s Mb / s 50ms Mb / s 00Kb 00Kb 50ms Mb / s

11 00Kb = 50ms =.3Mb/s br for having the correct y-intercept R r for ientifying the 50ms separation between the arriva curve an the service curve at the correct point br for having the correct eay unti the bucker is emptie R r R 4 for assembing it into the correct fina equation

12 9. Question 9 (0 pt) onsier a hor ring consisting of 0 noes with ientifiers,, 5, 3, 3, 40, 45, 5, 60, an 63, respectivey. Assume the hor ring spans the ientifier space (a) (3 pt) Give the routing (finger) tabes of noes with ientifiers, 40, an 45. (b) (4 pt) Assume noe with ientifier initiates a query for the item with i = 55. Give the routing steps to resove this query in the case of iterative routing. (c) (3 pt) Give two avantages of the iterative routing over recursive routing. Briefy expain. Soution: a) Noe s finger tabe inex Expecte i Actua i 0 = =3 4=5 3 8=9 4 6= =33 40 Noe 40 s finger tabe inex Expecte i Actua i 0 40= = = = = =7 mo 64 = 8 Noe 45 s finger tabe inex Expecte i Actua i 0 45= = = = = =77 mo 64 = 3 5 for each correct tabe b)

13 ->40, 40-> has responsibiity for i for the right answer (a or nothing) c) Iterative querying is more faut toerant because intermeiate noes o not have to be up for the entire query; they ony have to be up ong enough to receive an answer a query. Iterative querying is aso more resistant to enia-of-service attacks because they o not have to ho state uring queries for each right answer (max 3)

14 0. Question 0 (0 pt) onsier a path consisting of three inks A-B--D where the capacities of inks (A, B) an (, D) are an the capacity of ink (B, ) is. Assume noe A sens two packets at times t an t, respectivey, to noe D. Both packets have the same ength. (a) (5 pt) What is the inter-arriva time between the two packets at noe D? (b) (5 pt) Assume <. Give a simpe metho to measure the capacity base on the inter-arriva time an the packets ength. Notes: Assume there is no cross-traffic; the two packets are the ony ones in the network. The eparture time of a packet is the time when the ast bit of the packet is transmitte. The arriva time of a packet is the time when the ast bit of the packet is receive. With a store-an-forwar router a packet is forware ony after the ast bit of the packet was receive. The inter-arriva time is equa to the arriva time of the secon packet minus the arriva time of the first packet at noe D. Soution: We cacuate the arriva time of the first packet an then the arriva time of the secon packet. arriva time of packet = initia transmission time fixe eay on AB transmission eay on AB fixe eay on B transmission eay on B fixe eay on D transmission eay on D = t The arriva time of packet two epens on whether it queues behin packet. Assuming it never queues behin packet one, it arrives at D at t.therefore, the interarriva time is ( t ) ( t ) = t t If there is queueing, one possibiity is that the secon packet queues behin the first at B: t < t Simpifying, we have t t <. This is shown in the foowing figure:

15 As a resut, packet arrives at at t an subsequenty at D at t. The interarriva time is then t t = Another possibiity is that packet queues at. However, for this to happen, t t <, which simpifies to t t <. This can t happen because it contraicts the efinition of packet eparture times which states that t t. A B D queueing eay

16 for ientifying queueing at the B ink as the istinguishing conition b) From part a), we know that if t t < measure s banwith, we ensure t t <, then the packet interarriva time is an take =.. To

CS 349/449 Internet Protocols Final Exam Winter /15/2003. Name: Course:

CS 349/449 Internet Protocols Final Exam Winter /15/2003. Name: Course: CS 349/449 Internet Protocols Final Exam Winter 2003 12/15/2003 Name: Course: Instructions: 1. You have 2 hours to finish 2. Question 9 is only for 449 students 3. Closed books, closed notes. Write all

More information

No connection establishment Do not perform Flow control Error control Retransmission Suitable for small request/response scenario E.g.

No connection establishment Do not perform Flow control Error control Retransmission Suitable for small request/response scenario E.g. UDP & TCP 2018/3/26 UDP Header Characteristics of UDP No connection estabishment Do not perform Fow contro Error contro Retransmission Suitabe for sma request/response scenario E.g., DNS Remote Procedure

More information

Message Transport With The User Datagram Protocol

Message Transport With The User Datagram Protocol Message Transport With The User Datagram Protocol User Datagram Protocol (UDP) Use During startup For VoIP an some vieo applications Accounts for less than 10% of Internet traffic Blocke by some ISPs Computer

More information

CSE120 Principles of Operating Systems. Prof Yuanyuan (YY) Zhou Scheduling

CSE120 Principles of Operating Systems. Prof Yuanyuan (YY) Zhou Scheduling CSE120 Principes of Operating Systems Prof Yuanyuan (YY) Zhou Scheduing Announcement Homework 2 due on October 25th Project 1 due on October 26th 2 CSE 120 Scheduing and Deadock Scheduing Overview In discussing

More information

Lecture outline Graphics and Interaction Scan Converting Polygons and Lines. Inside or outside a polygon? Scan conversion.

Lecture outline Graphics and Interaction Scan Converting Polygons and Lines. Inside or outside a polygon? Scan conversion. Lecture outine 433-324 Graphics and Interaction Scan Converting Poygons and Lines Department of Computer Science and Software Engineering The Introduction Scan conversion Scan-ine agorithm Edge coherence

More information

Announcements. Program #2 regrades requests due by 11:00 today HW #2 was collected at the start of class Reading

Announcements. Program #2 regrades requests due by 11:00 today HW #2 was collected at the start of class Reading Announcements Program #2 regrades requests due by 11:00 today HW #2 was coected at the start of cass Reading Today: 6.3-6.4 Thursday: 3.1 CMSC 417 - F97 (ect 16) copyright 1997 Jeffrey K. Hoingsworth 1

More information

ECE544: Communication Networks-II, Spring Transport Layer Protocols Sumathi Gopal March 31 st 2006

ECE544: Communication Networks-II, Spring Transport Layer Protocols Sumathi Gopal March 31 st 2006 ECE544: Communication Networks-II, Spring 2006 Transport Layer Protocos Sumathi Gopa March 31 st 2006 Lecture Outine Introduction to end-to-end protocos UDP RTP TCP Programming detais 2 End-To-End Protocos

More information

Solutions to the Final Exam

Solutions to the Final Exam CS/Math 24: Intro to Discrete Math 5//2 Instructor: Dieter van Mekebeek Soutions to the Fina Exam Probem Let D be the set of a peope. From the definition of R we see that (x, y) R if and ony if x is a

More information

Self-Control Cyclic Access with Time Division - A MAC Proposal for The HFC System

Self-Control Cyclic Access with Time Division - A MAC Proposal for The HFC System Sef-Contro Cycic Access with Time Division - A MAC Proposa for The HFC System S.M. Jiang, Danny H.K. Tsang, Samue T. Chanson Hong Kong University of Science & Technoogy Cear Water Bay, Kowoon, Hong Kong

More information

TSR: Topology Reduction from Tree to Star Data Grids

TSR: Topology Reduction from Tree to Star Data Grids 03 Seventh Internationa Conference on Innovative Mobie and Internet Services in biquitous Computing TSR: Topoogy Reduction from Tree to Star Data Grids Ming-Chang Lee #, Fang-Yie Leu *, Ying-ping Chen

More information

Resource Optimization to Provision a Virtual Private Network Using the Hose Model

Resource Optimization to Provision a Virtual Private Network Using the Hose Model Resource Optimization to Provision a Virtua Private Network Using the Hose Mode Monia Ghobadi, Sudhakar Ganti, Ghoamai C. Shoja University of Victoria, Victoria C, Canada V8W 3P6 e-mai: {monia, sganti,

More information

EE122 MIDTERM EXAM: Scott Shenker, Ion Stoica

EE122 MIDTERM EXAM: Scott Shenker, Ion Stoica EE MITERM EXM: 00-0- Scott Shenker, Ion Stoica Last name Student I First name Login: ee- Please circle the last two letters of your login. a b c d e f g h i j k l m n o p q r s t u v w x y z a b c d e

More information

index.pdf March 17,

index.pdf March 17, index.pdf March 17, 2013 1 ITI 1121. Introduction to omputing II Marce Turcotte Schoo of Eectrica Engineering and omputer Science Linked List (Part 2) Tai pointer ouby inked ist ummy node Version of March

More information

Language Identification for Texts Written in Transliteration

Language Identification for Texts Written in Transliteration Language Identification for Texts Written in Transiteration Andrey Chepovskiy, Sergey Gusev, Margarita Kurbatova Higher Schoo of Economics, Data Anaysis and Artificia Inteigence Department, Pokrovskiy

More information

A Memory Grouping Method for Sharing Memory BIST Logic

A Memory Grouping Method for Sharing Memory BIST Logic A Memory Grouping Method for Sharing Memory BIST Logic Masahide Miyazai, Tomoazu Yoneda, and Hideo Fuiwara Graduate Schoo of Information Science, Nara Institute of Science and Technoogy (NAIST), 8916-5

More information

Load Balancing by MPLS in Differentiated Services Networks

Load Balancing by MPLS in Differentiated Services Networks Load Baancing by MPLS in Differentiated Services Networks Riikka Susitaiva, Jorma Virtamo, and Samui Aato Networking Laboratory, Hesinki University of Technoogy P.O.Box 3000, FIN-02015 HUT, Finand {riikka.susitaiva,

More information

Further Optimization of the Decoding Method for Shortened Binary Cyclic Fire Code

Further Optimization of the Decoding Method for Shortened Binary Cyclic Fire Code Further Optimization of the Decoding Method for Shortened Binary Cycic Fire Code Ch. Nanda Kishore Heosoft (India) Private Limited 8-2-703, Road No-12 Banjara His, Hyderabad, INDIA Phone: +91-040-3378222

More information

Computer Networks. College of Computing. Copyleft 2003~2018

Computer Networks. College of Computing.   Copyleft 2003~2018 Computer Networks Computer Networks Prof. Lin Weiguo Coege of Computing Copyeft 2003~2018 inwei@cuc.edu.cn http://icourse.cuc.edu.cn/computernetworks/ http://tc.cuc.edu.cn Attention The materias beow are

More information

Collaborative Approach to Mitigating ARP Poisoning-based Man-in-the-Middle Attacks

Collaborative Approach to Mitigating ARP Poisoning-based Man-in-the-Middle Attacks Coaborative Approach to Mitigating ARP Poisoning-based Man-in-the-Midde Attacks Seung Yeob Nam a, Sirojiddin Djuraev a, Minho Park b a Department of Information and Communication Engineering, Yeungnam

More information

Advanced Computer Networks

Advanced Computer Networks Advanced Computer Networks QoS in IP networks Prof. Andrzej Duda duda@imag.fr Contents QoS principles Traffic shaping leaky bucket token bucket Scheduling FIFO Fair queueing RED IntServ DiffServ http://duda.imag.fr

More information

Questions? Post on piazza, or Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)!

Questions? Post on piazza, or  Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)! EE122 Fall 2013 HW3 Instructions Recor your answers in a file calle hw3.pf. Make sure to write your name an SID at the top of your assignment. For each problem, clearly inicate your final answer, bol an

More information

A Design Method for Optimal Truss Structures with Certain Redundancy Based on Combinatorial Rigidity Theory

A Design Method for Optimal Truss Structures with Certain Redundancy Based on Combinatorial Rigidity Theory 0 th Word Congress on Structura and Mutidiscipinary Optimization May 9 -, 03, Orando, Forida, USA A Design Method for Optima Truss Structures with Certain Redundancy Based on Combinatoria Rigidity Theory

More information

A Fast Block Matching Algorithm Based on the Winner-Update Strategy

A Fast Block Matching Algorithm Based on the Winner-Update Strategy In Proceedings of the Fourth Asian Conference on Computer Vision, Taipei, Taiwan, Jan. 000, Voume, pages 977 98 A Fast Bock Matching Agorithm Based on the Winner-Update Strategy Yong-Sheng Chenyz Yi-Ping

More information

Delay Budget Partitioning to Maximize Network Resource Usage Efficiency

Delay Budget Partitioning to Maximize Network Resource Usage Efficiency Deay Budget Partitioning to Maximize Network Resource Usage Efficiency Kartik Gopaan Tzi-cker Chiueh Yow-Jian Lin Forida State University Stony Brook University Tecordia Technoogies kartik@cs.fsu.edu chiueh@cs.sunysb.edu

More information

Fastest-Path Computation

Fastest-Path Computation Fastest-Path Computation DONGHUI ZHANG Coege of Computer & Information Science Northeastern University Synonyms fastest route; driving direction Definition In the United states, ony 9.% of the househods

More information

A HIGH PERFORMANCE, LOW LATENCY, LOW POWER AUDIO PROCESSING SYSTEM FOR WIDEBAND SPEECH OVER WIRELESS LINKS

A HIGH PERFORMANCE, LOW LATENCY, LOW POWER AUDIO PROCESSING SYSTEM FOR WIDEBAND SPEECH OVER WIRELESS LINKS A HIGH PERFORMANCE, LOW LATENCY, LOW POWER AUDIO PROCESSING SYSTEM FOR WIDEBAND SPEECH OVER WIRELESS LINKS Etienne Cornu 1, Aain Dufaux 2, and David Hermann 1 1 AMI Semiconductor Canada, 611 Kumpf Drive,

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

Service Scheduling for General Packet Radio Service Classes

Service Scheduling for General Packet Radio Service Classes Service Scheduing for Genera Packet Radio Service Casses Qixiang Pang, Amir Bigoo, Victor C. M. Leung, Chris Schoefied Department of Eectrica and Computer Engineering, University of British Coumbia, Vancouver,

More information

Navigating and searching theweb

Navigating and searching theweb Navigating and searching theweb Contents Introduction 3 1 The Word Wide Web 3 2 Navigating the web 4 3 Hyperinks 5 4 Searching the web 7 5 Improving your searches 8 6 Activities 9 6.1 Navigating the web

More information

Defense against Low-rate TCP-targeted Denial-of-Service Attacks

Defense against Low-rate TCP-targeted Denial-of-Service Attacks Defense against Low-rate CP-targeted Denia-of-Service Attacks Guang Yang, Mario Gera and M. Y. Sanadidi Computer Science Department, UCLA Los Angees, CA 995 {yangg, gera, medy}@cs.uca.edu e: +-3-825-888,

More information

Computer Networks. College of Computing. Copyleft 2003~2018

Computer Networks. College of Computing.   Copyleft 2003~2018 Computer Networks Prof. Lin Weiguo Coege of Computing Copyeft 2003~2018 inwei@cuc.edu.cn http://icourse.cuc.edu.cn/computernetworks/ http://tc.cuc.edu.cn Internet Contro Message Protoco (ICMP), RFC 792

More information

Replication of Virtual Network Functions: Optimizing Link Utilization and Resource Costs

Replication of Virtual Network Functions: Optimizing Link Utilization and Resource Costs Repication of Virtua Network Functions: Optimizing Link Utiization and Resource Costs Francisco Carpio, Wogang Bziuk and Admea Jukan Technische Universität Braunschweig, Germany Emai:{f.carpio, w.bziuk,

More information

Further Concepts in Geometry

Further Concepts in Geometry ppendix F Further oncepts in Geometry F. Exporing ongruence and Simiarity Identifying ongruent Figures Identifying Simiar Figures Reading and Using Definitions ongruent Trianges assifying Trianges Identifying

More information

A Comparison of a Second-Order versus a Fourth- Order Laplacian Operator in the Multigrid Algorithm

A Comparison of a Second-Order versus a Fourth- Order Laplacian Operator in the Multigrid Algorithm A Comparison of a Second-Order versus a Fourth- Order Lapacian Operator in the Mutigrid Agorithm Kaushik Datta (kdatta@cs.berkeey.edu Math Project May 9, 003 Abstract In this paper, the mutigrid agorithm

More information

For Review Only. CFP: Cooperative Fast Protection. Bin Wu, Pin-Han Ho, Kwan L. Yeung, János Tapolcai and Hussein T. Mouftah

For Review Only. CFP: Cooperative Fast Protection. Bin Wu, Pin-Han Ho, Kwan L. Yeung, János Tapolcai and Hussein T. Mouftah Journa of Lightwave Technoogy Page of CFP: Cooperative Fast Protection Bin Wu, Pin-Han Ho, Kwan L. Yeung, János Tapocai and Hussein T. Mouftah Abstract We introduce a nove protection scheme, caed Cooperative

More information

A METHOD FOR GRIDLESS ROUTING OF PRINTED CIRCUIT BOARDS. A. C. Finch, K. J. Mackenzie, G. J. Balsdon, G. Symonds

A METHOD FOR GRIDLESS ROUTING OF PRINTED CIRCUIT BOARDS. A. C. Finch, K. J. Mackenzie, G. J. Balsdon, G. Symonds A METHOD FOR GRIDLESS ROUTING OF PRINTED CIRCUIT BOARDS A C Finch K J Mackenzie G J Basdon G Symonds Raca-Redac Ltd Newtown Tewkesbury Gos Engand ABSTRACT The introduction of fine-ine technoogies to printed

More information

A Near-Optimal Distributed QoS Constrained Routing Algorithm for Multichannel Wireless Sensor Networks

A Near-Optimal Distributed QoS Constrained Routing Algorithm for Multichannel Wireless Sensor Networks Sensors 2013, 13, 16424-16450; doi:10.3390/s131216424 Artice OPEN ACCESS sensors ISSN 1424-8220 www.mdpi.com/journa/sensors A Near-Optima Distributed QoS Constrained Routing Agorithm for Mutichanne Wireess

More information

Priority Queueing for Packets with Two Characteristics

Priority Queueing for Packets with Two Characteristics 1 Priority Queueing for Packets with Two Characteristics Pave Chuprikov, Sergey I. Nikoenko, Aex Davydow, Kiri Kogan Abstract Modern network eements are increasingy required to dea with heterogeneous traffic.

More information

Hour 3: The Network Access Layer Page 1 of 10. Discuss how TCP/IP s Network Access layer relates to the OSI networking model

Hour 3: The Network Access Layer Page 1 of 10. Discuss how TCP/IP s Network Access layer relates to the OSI networking model Hour 3: The Network Access Layer Page 1 of 10 Hour 3: The Network Access Layer At the base of the TCP/IP protoco stack is the Network Access ayer, the coection of services and specifications that provide

More information

Homework #4. Due: December 2, 4PM. CWND (#pkts)

Homework #4. Due: December 2, 4PM. CWND (#pkts) Homework #4 Due: December 2, 2009 @ 4PM EE122: Introduction to Communication Networks (Fall 2009) Department of Electrical Engineering and Computer Sciences College of Engineering University of California,

More information

Questions? Post on piazza, or Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)!

Questions? Post on piazza, or  Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)! EE122 Fall 2013 HW3 Instructions Recor your answers in a file calle hw3.pf. Make sure to write your name an SID at the top of your assignment. For each problem, clearly inicate your final answer, bol an

More information

Split Restoration with Wavelength Conversion in WDM Networks*

Split Restoration with Wavelength Conversion in WDM Networks* Spit Reoration with aveength Conversion in DM Networks* Yuanqiu Luo and Nirwan Ansari Advanced Networking Laborator Department of Eectrica and Computer Engineering New Jerse Initute of Technoog Universit

More information

Peer-Assisted Computation Offloading in Wireless Networks, Student Member, IEEE, and Guohong Cao, Fellow, IEEE

Peer-Assisted Computation Offloading in Wireless Networks, Student Member, IEEE, and Guohong Cao, Fellow, IEEE IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 17, NO. 7, JULY 2018 4565 Peer-Assisted Computation Offoading in Wireess Networks Yei Geng, Student Member, IEEE, and Guohong Cao, Feow, IEEE Abstract

More information

Supporting Fully Adaptive Routing in InfiniBand Networks

Supporting Fully Adaptive Routing in InfiniBand Networks XIV JORNADAS DE PARALELISMO - LEGANES, SEPTIEMBRE 200 1 Supporting Fully Aaptive Routing in InfiniBan Networks J.C. Martínez, J. Flich, A. Robles, P. López an J. Duato Resumen InfiniBan is a new stanar

More information

Improving QOS in IP Networks. Principles for QOS Guarantees

Improving QOS in IP Networks. Principles for QOS Guarantees Improving QOS in IP Networks Thus far: making the best of best effort Future: next generation Internet with QoS guarantees RSVP: signaling for resource reservations Differentiated Services: differential

More information

CS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007

CS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007 CS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007 Question 344 Points 444 Points Score 1 10 10 2 10 10 3 20 20 4 20 10 5 20 20 6 20 10 7-20 Total: 100 100 Instructions: 1. Question

More information

Ad Hoc Networks 11 (2013) Contents lists available at SciVerse ScienceDirect. Ad Hoc Networks

Ad Hoc Networks 11 (2013) Contents lists available at SciVerse ScienceDirect. Ad Hoc Networks Ad Hoc Networks (3) 683 698 Contents ists avaiabe at SciVerse ScienceDirect Ad Hoc Networks journa homepage: www.esevier.com/ocate/adhoc Dynamic agent-based hierarchica muticast for wireess mesh networks

More information

file://j:\macmillancomputerpublishing\chapters\in073.html 3/22/01

file://j:\macmillancomputerpublishing\chapters\in073.html 3/22/01 Page 1 of 15 Chapter 9 Chapter 9: Deveoping the Logica Data Mode The information requirements and business rues provide the information to produce the entities, attributes, and reationships in ogica mode.

More information

Link Registry Protocol Options

Link Registry Protocol Options Link Registry Protoco Options Norman Finn, March 2017 HUAWEI TECHNOLOGIES CO., LTD. IEEE 802.1 TSN At east two obvious choices for P802.1CS Link Registration Protoco An IS-IS-ike protoco. TCP (Transmission

More information

Real-Time Protocol (RTP)

Real-Time Protocol (RTP) Real-Time Protocol (RTP) Provides standard packet format for real-time application Typically runs over UDP Specifies header fields below Payload Type: 7 bits, providing 128 possible different types of

More information

TIMELY INFERENCE OF LATE/LOST PACKETS IN REAL-TIME STREAMING APPLICATIONS. Ali C. Begen and Yucel Altunbasak

TIMELY INFERENCE OF LATE/LOST PACKETS IN REAL-TIME STREAMING APPLICATIONS. Ali C. Begen and Yucel Altunbasak TIMELY INFERENCE OF LTE/LOST PCKETS IN REL-TIME STREMING PPLICTIONS i C. Begen and Yuce tunbasak Schoo of Eectrica and Computer Engineering Georgia Institute of Technoogy, tanta, G US {acbegen,yuce}@ece.gatech.edu

More information

RDF Objects 1. Alex Barnell Information Infrastructure Laboratory HP Laboratories Bristol HPL November 27 th, 2002*

RDF Objects 1. Alex Barnell Information Infrastructure Laboratory HP Laboratories Bristol HPL November 27 th, 2002* RDF Objects 1 Aex Barne Information Infrastructure Laboratory HP Laboratories Bristo HPL-2002-315 November 27 th, 2002* E-mai: Andy_Seaborne@hp.hp.com RDF, semantic web, ontoogy, object-oriented datastructures

More information

UnixWare 7 System Administration UnixWare 7 System Configuration

UnixWare 7 System Administration UnixWare 7 System Configuration UnixWare 7 System Administration - CH 3 - UnixWare 7 System Configuration Page 1 of 8 [Figures are not incuded in this sampe chapter] UnixWare 7 System Administration - 3 - UnixWare 7 System Configuration

More information

Introduction P2P Models Prisoners Dilemma Strategy- Proof Mech. Entrance Fees Comparison BitTorrent Structured LCP Routing

Introduction P2P Models Prisoners Dilemma Strategy- Proof Mech. Entrance Fees Comparison BitTorrent Structured LCP Routing Procedure naysis Resuts (1) pproach that has been proposed. Subject of inspection: speed-critica user. P2P Modes iemma u Sift through code paths step by step (more specificay, composition of code paths

More information

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication

More information

Extended Node-Arc Formulation for the K-Edge-Disjoint Hop-Constrained Network Design Problem

Extended Node-Arc Formulation for the K-Edge-Disjoint Hop-Constrained Network Design Problem Extended Node-Arc Formuation for the K-Edge-Disjoint Hop-Constrained Network Design Probem Quentin Botton Université cathoique de Louvain, Louvain Schoo of Management, (Begique) botton@poms.uc.ac.be Bernard

More information

CSE 473 Introduction to Computer Networks. Exam 2. Your name here: 11/7/2012

CSE 473 Introduction to Computer Networks. Exam 2. Your name here: 11/7/2012 CSE 473 Introduction to Computer Networks Jon Turner Exam 2 Your name here: 11/7/2012 1. (10 points). The diagram at right shows a DHT with 16 nodes. Each node is labeled with the first value in its range

More information

Neural Network Enhancement of the Los Alamos Force Deployment Estimator

Neural Network Enhancement of the Los Alamos Force Deployment Estimator Missouri University of Science and Technoogy Schoars' Mine Eectrica and Computer Engineering Facuty Research & Creative Works Eectrica and Computer Engineering 1-1-1994 Neura Network Enhancement of the

More information

Computer Networking. Queue Management and Quality of Service (QOS)

Computer Networking. Queue Management and Quality of Service (QOS) Computer Networking Queue Management and Quality of Service (QOS) Outline Previously:TCP flow control Congestion sources and collapse Congestion control basics - Routers 2 Internet Pipes? How should you

More information

Outline. Parallel Numerical Algorithms. Forward Substitution. Triangular Matrices. Solving Triangular Systems. Back Substitution. Parallel Algorithm

Outline. Parallel Numerical Algorithms. Forward Substitution. Triangular Matrices. Solving Triangular Systems. Back Substitution. Parallel Algorithm Outine Parae Numerica Agorithms Chapter 8 Prof. Michae T. Heath Department of Computer Science University of Iinois at Urbana-Champaign CS 554 / CSE 512 1 2 3 4 Trianguar Matrices Michae T. Heath Parae

More information

QoS-Aware Data Transmission and Wireless Energy Transfer: Performance Modeling and Optimization

QoS-Aware Data Transmission and Wireless Energy Transfer: Performance Modeling and Optimization QoS-Aware Data Transmission and Wireess Energy Transfer: Performance Modeing and Optimization Dusit Niyato, Ping Wang, Yeow Wai Leong, and Tan Hwee Pink Schoo of Computer Engineering, Nanyang Technoogica

More information

CS244a: An Introduction to Computer Networks

CS244a: An Introduction to Computer Networks Do not write in this box MCQ 13: /10 14: /10 15: /0 16: /0 17: /10 18: /10 19: /0 0: /10 Total: Name: Student ID #: Campus/SITN-Local/SITN-Remote? CS44a Winter 004 Professor McKeown CS44a: An Introduction

More information

Quality of Service (QoS)

Quality of Service (QoS) Quality of Service (QoS) The Internet was originally designed for best-effort service without guarantee of predictable performance. Best-effort service is often sufficient for a traffic that is not sensitive

More information

Nearest Neighbor Learning

Nearest Neighbor Learning Nearest Neighbor Learning Cassify based on oca simiarity Ranges from simpe nearest neighbor to case-based and anaogica reasoning Use oca information near the current query instance to decide the cassification

More information

Data Communication Networks Final

Data Communication Networks Final Data Communication Networks Final Saad Mneimneh Visiting Professor Hunter College of CUNY NAME: This final test is take home... There are 8 Problems (but each problem has multiple parts, possibly on separate

More information

IrDA IrLAP Throughput Optimisation with Physical Layer Consideration

IrDA IrLAP Throughput Optimisation with Physical Layer Consideration IrDA IrLAP Throughput Optimisation with Physica Layer onsideration Abstract Barker, P. & Boucouvaas, A.. Mutimedia ommunications Research Group Schoo of Design, Engineering & omputing Bournemouth University,

More information

Application of Intelligence Based Genetic Algorithm for Job Sequencing Problem on Parallel Mixed-Model Assembly Line

Application of Intelligence Based Genetic Algorithm for Job Sequencing Problem on Parallel Mixed-Model Assembly Line American J. of Engineering and Appied Sciences 3 (): 5-24, 200 ISSN 94-7020 200 Science Pubications Appication of Inteigence Based Genetic Agorithm for Job Sequencing Probem on Parae Mixed-Mode Assemby

More information

CS519: Computer Networks. Lecture 5, Part 5: Mar 31, 2004 Queuing and QoS

CS519: Computer Networks. Lecture 5, Part 5: Mar 31, 2004 Queuing and QoS : Computer Networks Lecture 5, Part 5: Mar 31, 2004 Queuing and QoS Ways to deal with congestion Host-centric versus router-centric Reservation-based versus feedback-based Window-based versus rate-based

More information

CSE120 Principles of Operating Systems. Prof Yuanyuan (YY) Zhou Lecture 4: Threads

CSE120 Principles of Operating Systems. Prof Yuanyuan (YY) Zhou Lecture 4: Threads CSE120 Principes of Operating Systems Prof Yuanyuan (YY) Zhou Lecture 4: Threads Announcement Project 0 Due Project 1 out Homework 1 due on Thursday Submit it to Gradescope onine 2 Processes Reca that

More information

Congestion Control 3/16/09

Congestion Control 3/16/09 Congestion Control Outline Resource Allocation Queuing TCP Congestion Control Spring 009 CSE3064 Issues Two sides of the same coin pre-allocate resources so at to avoid congestion control congestion if

More information

As Michi Henning and Steve Vinoski showed 1, calling a remote

As Michi Henning and Steve Vinoski showed 1, calling a remote Reducing CORBA Ca Latency by Caching and Prefetching Bernd Brügge and Christoph Vismeier Technische Universität München Method ca atency is a major probem in approaches based on object-oriented middeware

More information

User Manual. ASeries A510

User Manual. ASeries A510 User Manua ASeries A510 Interface Converter Seria ó Parae The interfacing speciaists Version 6.00 August 1999 COPYRIGHTS A rights reserved. This document may not, in whoe or part, be copied, photocopied,

More information

Chapter Multidimensional Direct Search Method

Chapter Multidimensional Direct Search Method Chapter 09.03 Mutidimensiona Direct Search Method After reading this chapter, you shoud be abe to:. Understand the fundamentas of the mutidimensiona direct search methods. Understand how the coordinate

More information

Optimized Base-Station Cache Allocation for Cloud Radio Access Network with Multicast Backhaul

Optimized Base-Station Cache Allocation for Cloud Radio Access Network with Multicast Backhaul Optimized Base-Station Cache Aocation for Coud Radio Access Network with Muticast Backhau Binbin Dai, Student Member, IEEE, Ya-Feng Liu, Member, IEEE, and Wei Yu, Feow, IEEE arxiv:804.0730v [cs.it] 28

More information

Cross-layer Design for Efficient Resource Utilization in WiMedia UWB-based WPANs

Cross-layer Design for Efficient Resource Utilization in WiMedia UWB-based WPANs Cross-ayer Design for Efficient Resource Utiization in WiMedia UWB-based WPANs RAED AL-ZUBI and MARWAN KRUNZ Department of Eectrica and Computer Engineering. University of Arizona. Utra-wideband (UWB)

More information

Tutorial 8 : Congestion Control

Tutorial 8 : Congestion Control Lund University ETSN01 Advanced Telecommunication Tutorial 8 : Congestion Control Author: Antonio Franco Emma Fitzgerald Tutor: Farnaz Moradi December 18, 2015 Contents I Before you start 3 II Exercises

More information

An Introduction to Design Patterns

An Introduction to Design Patterns An Introduction to Design Patterns 1 Definitions A pattern is a recurring soution to a standard probem, in a context. Christopher Aexander, a professor of architecture Why woud what a prof of architecture

More information

FACULTY OF COMPUTING AND INFORMATICS

FACULTY OF COMPUTING AND INFORMATICS namibia UniVERSITY OF SCIEnCE AnD TECHnOLOGY FACULTY OF COMPUTING AND INFORMATICS DEPARTMENT OF COMPUTER SCIENCE QUALIFICATION: Bachelor of Computer Science {Honours) QUALIFICATION CODE: 08BCSH LEVEL:

More information

Impact of FTP Application file size and TCP Variants on MANET Protocols Performance

Impact of FTP Application file size and TCP Variants on MANET Protocols Performance International Journal of Moern Communication Technologies & Research (IJMCTR) Impact of FTP Application file size an TCP Variants on MANET Protocols Performance Abelmuti Ahme Abbasher Ali, Dr.Amin Babkir

More information

CS244a: An Introduction to Computer Networks

CS244a: An Introduction to Computer Networks Do not write in this box MCQ 9: /10 10: /10 11: /20 12: /20 13: /20 14: /20 Total: Name: Student ID #: CS244a Winter 2003 Professor McKeown Campus/SITN-Local/SITN-Remote? CS244a: An Introduction to Computer

More information

CSE 473 Introduction to Computer Networks. Midterm Exam Review

CSE 473 Introduction to Computer Networks. Midterm Exam Review CSE 473 Introduction to Computer Networks Midterm Exam Review John DeHart 10/12/2015 1. (10 points). A user in Chicago, connected to the internet via a 100 Mb/s (b=bits) connection retrieves a 250 KB (B=bytes)

More information

Infinity Connect Web App Customization Guide

Infinity Connect Web App Customization Guide Infinity Connect Web App Customization Guide Contents Introduction 1 Hosting the customized Web App 2 Customizing the appication 3 More information 8 Introduction The Infinity Connect Web App is incuded

More information

power-saving mode for mobile computing in Wi-Fi hotspots: Limitations, enhancements and open issues

power-saving mode for mobile computing in Wi-Fi hotspots: Limitations, enhancements and open issues DOI 10.1007/s11276-006-0010-9 802.11 power-saving mode for mobie computing in Wi-Fi hotspots: Limitations, enhancements and open issues G. Anastasi M. Conti E. Gregori A. Passarea C Science + Business

More information

l A set is a collection of objects of the same l {6,9,11,-5} and {11,9,6,-5} are equivalent. l There is no first element, and no successor of 9.

l A set is a collection of objects of the same l {6,9,11,-5} and {11,9,6,-5} are equivalent. l There is no first element, and no successor of 9. Sets & Hash Tabes Week 13 Weiss: chapter 20 CS 5301 Spring 2018 What are sets? A set is a coection of objects of the same type that has the foowing two properties: - there are no dupicates in the coection

More information

On Finding the Best Partial Multicast Protection Tree under Dual-Homing Architecture

On Finding the Best Partial Multicast Protection Tree under Dual-Homing Architecture On inding the est Partia Muticast Protection Tree under ua-homing rchitecture Mei Yang, Jianping Wang, Xiangtong Qi, Yingtao Jiang epartment of ectrica and omputer ngineering, University of Nevada Las

More information

Quality of Service Evaluations of Multicast Streaming Protocols *

Quality of Service Evaluations of Multicast Streaming Protocols * Quaity of Service Evauations of Muticast Streaming Protocos Haonan Tan Derek L. Eager Mary. Vernon Hongfei Guo omputer Sciences Department University of Wisconsin-Madison, USA {haonan, vernon, guo}@cs.wisc.edu

More information

Overview. Lecture 22 Queue Management and Quality of Service (QoS) Queuing Disciplines. Typical Internet Queuing. FIFO + Drop tail Problems

Overview. Lecture 22 Queue Management and Quality of Service (QoS) Queuing Disciplines. Typical Internet Queuing. FIFO + Drop tail Problems Lecture 22 Queue Management and Quality of Service (QoS) Overview Queue management & RED Fair queuing Khaled Harras School of Computer Science niversity 15 441 Computer Networks Based on slides from previous

More information

CSE 473 Introduction to Computer Networks. Final Exam. Your name here: 12/17/2012

CSE 473 Introduction to Computer Networks. Final Exam. Your name here: 12/17/2012 CSE 473 Introduction to Computer Networks Jon Turner Final Exam Your name here: 12/17/2012 1. (8 points). The figure below shows a network path connecting a server to a client. 200 km 2000 km 2 km X Y

More information

BGP-Based SPF IETF 96, Berlin. Keyur Patel, Cisco Acee Lindem, Cisco Derek Yeung, Cisco Abhay Roy, Cisco Venu Venugopal, Cisco

BGP-Based SPF IETF 96, Berlin. Keyur Patel, Cisco Acee Lindem, Cisco Derek Yeung, Cisco Abhay Roy, Cisco Venu Venugopal, Cisco BGP-Based SPF IETF 96, Berin Keyur Pate, Cisco Acee Lindem, Cisco Derek Yeung, Cisco Abhay Roy, Cisco Venu Venugopa, Cisco 1 Data Center Routing Routing Probem Space Routing scaing for Massivey Scaabe

More information

Real-Time Image Generation with Simultaneous Video Memory Read/Write Access and Fast Physical Addressing

Real-Time Image Generation with Simultaneous Video Memory Read/Write Access and Fast Physical Addressing Rea-Time Image Generation with Simutaneous Video Memory Read/rite Access and Fast Physica Addressing Mountassar Maamoun 1, Bouaem Laichi 2, Abdehaim Benbekacem 3, Daoud Berkani 4 1 Department of Eectronic,

More information

Buffer-aware Worst Case Timing Analysis of Wormhole Network On Chip

Buffer-aware Worst Case Timing Analysis of Wormhole Network On Chip 1 Buffer-aware Worst Case Timing Anaysis of Wormhoe Network On Chip Ahem Mifdaoui and Hamdi Ayed* University of Tououse -ISAE ahem.mifdaoui@isae.fr, hamdi.ayed@isae.fr arxiv:1602.01732v2 [cs.ni] 25 May

More information

Reference trajectory tracking for a multi-dof robot arm

Reference trajectory tracking for a multi-dof robot arm Archives of Contro Sciences Voume 5LXI, 5 No. 4, pages 53 57 Reference trajectory tracking for a muti-dof robot arm RÓBERT KRASŇANSKÝ, PETER VALACH, DÁVID SOÓS, JAVAD ZARBAKHSH This paper presents the

More information

Arithmetic Coding. Prof. Ja-Ling Wu. Department of Computer Science and Information Engineering National Taiwan University

Arithmetic Coding. Prof. Ja-Ling Wu. Department of Computer Science and Information Engineering National Taiwan University Arithmetic Coding Prof. Ja-Ling Wu Department of Computer Science and Information Engineering Nationa Taiwan University F(X) Shannon-Fano-Eias Coding W..o.g. we can take X={,,,m}. Assume p()>0 for a. The

More information

Multicast Routing : Computer Networking. Example Applications. Overview

Multicast Routing : Computer Networking. Example Applications. Overview Multicast outing 5-744: Computer Networking Unicast: one source to one estination Multicast: one source to many estinations Two main functions: Efficient ata istribution Logical naming of a group L-0 Multicast

More information

UNIT IV -- TRANSPORT LAYER

UNIT IV -- TRANSPORT LAYER UNIT IV -- TRANSPORT LAYER TABLE OF CONTENTS 4.1. Transport layer. 02 4.2. Reliable delivery service. 03 4.3. Congestion control. 05 4.4. Connection establishment.. 07 4.5. Flow control 09 4.6. Transmission

More information

COS 318: Operating Systems. Virtual Memory Design Issues: Paging and Caching. Jaswinder Pal Singh Computer Science Department Princeton University

COS 318: Operating Systems. Virtual Memory Design Issues: Paging and Caching. Jaswinder Pal Singh Computer Science Department Princeton University COS 318: Operating Systems Virtua Memory Design Issues: Paging and Caching Jaswinder Pa Singh Computer Science Department Princeton University (http://www.cs.princeton.edu/courses/cos318/) Virtua Memory:

More information

CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS

CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS 28 CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS Introduction Measurement-based scheme, that constantly monitors the network, will incorporate the current network state in the

More information

IBM Research Report. On the Tradeoff among Capacity, Routing Hops, and Being Peer-to-Peer in the Design of Structured Overlay Networks

IBM Research Report. On the Tradeoff among Capacity, Routing Hops, and Being Peer-to-Peer in the Design of Structured Overlay Networks RC355 (W5-4) February 4, 5 Computer Science IBM Research Report On the Tradeoff among Capacity, Routing Hops, and Being Peer-to-Peer in the Design of Structured Overay Networks Chunqiang Tang, Meissa J.

More information

An Adaptive Two-Copy Delayed SR-ARQ for Satellite Channels with Shadowing

An Adaptive Two-Copy Delayed SR-ARQ for Satellite Channels with Shadowing An Adaptive Two-Copy Deayed SR-ARQ for Sateite Channes with Shadowing Jing Zhu, Sumit Roy zhuj@ee.washington.edu Department of Eectrica Engineering, University of Washington Abstract- The paper focuses

More information

Joint disparity and motion eld estimation in. stereoscopic image sequences. Ioannis Patras, Nikos Alvertos and Georgios Tziritas y.

Joint disparity and motion eld estimation in. stereoscopic image sequences. Ioannis Patras, Nikos Alvertos and Georgios Tziritas y. FORTH-ICS / TR-157 December 1995 Joint disparity and motion ed estimation in stereoscopic image sequences Ioannis Patras, Nikos Avertos and Georgios Tziritas y Abstract This work aims at determining four

More information