Questions? Post on piazza, or Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)!
|
|
- Prudence Sharp
- 5 years ago
- Views:
Transcription
1 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 unerline. You o not nee to explain your answer unless explicitly tol to o so. Submit your answers via your instructional account using submit hw3. This assignment is ue on Dec 2 n, 5pm. Questions? Post on piazza, or Rahika (rahika at eecs.berkeley) or Sameer (sa at berkeley)! Q1. DNS Lookup Your EECS instructional machine (@fuji.cs.berkeley.eu) has a utility calle ig that allows you to query Domain Name Service (DNS) servers aroun the Internet. You can simply run ig as follows: $> recor-type omain-name Here ns.server.name is the hostname of the DNS server you wish to query. The recor-type is the type of DNS recor you wish to retrieve (such as ANY, MX, A, CNAME etc.) an omain-name is the name of the host or omain you seek information on. For more information on how to use ig, please consult the man page an/or RFC1035. As we iscusse in class, there can be 2 types of DNS queries recursive or iterative. For a recursive DNS query, the name server attempts to completely resolve the name by following the naming hierarchy all the way to the authoritative name server. On the other han, for an iterative query, the name server simply gives a referral to another name server in the hierarchy that shoul be contacte next in orer to resolve the name. By efault, ig sets the RD (recursion esire) bit in the DNS query packet to inicate that it woul like to have the query resolve recursively. Not all servers support recursive queries from arbitrary resolvers. a) Basic Usage: Resolve the IP aress of using your efault name server. Attach the output of the ig query an explain each fiel of the ANSWER SECTION in the output. b) Iterative DNS Queries: Now, instea of using your efault name server, we woul like you to resolve using one of the root DNS servers (e.g., a.rootservers.net). Note that this server oesn t accept a recursive query from you, but it gives you the reference to the next name server that is to be querie in s hierarchy. Use ig to execute the sequence of iterative queries by
2 following the chain of referrals to obtain s aress 1. Attach the ig output an write own the sequence of name servers you querie in the process an specify the omain each server was responsible for. c) Recursive DNS Queries: ns1.iitkgp.ac.in an nsl.fujitsu.fr are two name servers in Inia an France that answer recursive DNS queries. Use these DNS servers to resolve Attach the ig output. Now compare the en-to-en latencies between your machine an the sets of IPs for google.com that were returne by these two DNS servers an by your efault DNS server in part (a). Why o we see a ifference in latency? ) DNS Spoofing: As the evil CTO of Garry realizes that the easiest way to efeat Google woul be to reirect all the users to his website by simply messing with the DNS servers. Having taken EE122, he recalls that servers cache A an NS recors from DNS replies an referrals an he can configure his own DNS server to return incorrect results for arbitrary omains. If the resolver caches Garry s malicious results, it will return ba results to future DNS queries. Help him complete his master plan to hijack Google s omain name by writing own exactly what woul Garry s name server returns upon a DNS query. What must a robust DNS server implementation o to counter this attack? 1 If a query returns multiple servers, just choose one amongst them at ranom. If a particular server times out, just choose an alternate one.
3 Q2. Content Delivery with HTTP We woul like to ownloa an article on the web. This involves two steps: Step 1: Downloa a master inex page of size B. This page contains links to four images. Step 2: Downloa the four images. Each image is also of size B Assumptions: Ignore all transmission elays Assume that HTTP responses fit in a single TCP packet. i.e., the HTTP response incluing the B bytes an the size of the HTTP heaer is smaller than the MSS of a single TCP packet We on t nee to wait for the HTTP responses to be acknowlege nor for the TCP connections to terminate Calculate the time taken to ownloa the article uner each of the following scenarios a) All files are store at a single origin server S. Our RTT to S is R. We use sequential requests with non-persistent TCP connections. Give your answer in terms of multiples of R. b) All files are store at a single origin server S. Our RTT to S is R. We use sequential requests with persistent TCP connections. Give your answer in terms of multiples of R. c) All files are store at a single origin server S. Our RTT to S is R. We use concurrent requests with non-persistent TCP connections. (Note that the master inex page is ownloae first, followe by concurrent ownloa of the images). Give your answer in terms of multiples of R. ) The content provier now signs up with a CDN for the elivery of its images. The master inex page is still serve from the origin server S with RTT equal to R. Our RTT to the closest CDN server is (R/2). We use sequential requests with nonpersistent TCP connections. Give your answer in terms of multiples of R. e) Repeat part () assuming sequential persistent connections f) Repeat part () assuming concurrent non-persistent connections g) The CDN tries to o some loa balancing an ifferent images are serve by ifferent CDN servers, at istances 3R/4, R/2, R/3 an R/4. The master inex page is still serve from the origin server S. We use sequential requests with non-persistent TCP connections. Give your answer in terms of multiples of R. h) Repeat part (g) assuming sequential persistent connections i) Repeat part (g) assuming concurrent non-persistent connections
4 Q3. Wireless D A E B C F Consier the above wireless network in which each noe has a raio range of istance. In the figure, two noes are in each-other s range, if there is an ege between them. Consier two collision resolution schemes: CS: This is a pure carrier sense scheme in which a noe oes not sen when it hears someone else transmitting, but otherwise can sen whenever it wants. MACA: No carrier sense. Noes wishing to communicate use an RTS-CTS-Data exchange. Noes overhearing an RTS wait to allow the CTS to be sent. If no CTS is hear, the noe can transmit. If a CTS is hear (even if no earlier RTS is hear), the noe is quiet for the entire uration of the ata transmission. Note: Treat each of the five parts of this question as inepenent scenarios a) Assume noe E is transmitting ata to noe B when a noe, say X ecies to transmit ata to another noe, say Y. You have the following three cases: Case 1: X = A, Y = B Case 2: X = F, Y = C Case 3: X = C, Y = A For each case, answer the following questions: i. If all noes use CS, can X transmit to Y? If NO: explain why. If YES: Is the transmission successful (i.e., will Y correctly receive the ata from X)? Is the original transmission (from E to B) impacte?
5 ii. If all noes use MACA, can X transmit to Y? If NO: explain why. If YES: is the transmission successful (i.e., will noe B receive the ata)? Is the original transmission (from E to B) impacte? b) Now assume noe B is transmitting ata to noe E when a noe, say X ecies to transmit ata to another noe, say Y. You have the same three cases: Case 1: X = A, Y = B Case 2: X = F, Y = C Case 3: X = C, Y = A For each case, answer the following questions: i. If all noes use CS, can X transmit to Y? If NO: explain why. If YES: Is the transmission successful (i.e., will Y correctly receive the ata from X)? Is the original transmission (from B to E) impacte? ii. If all noes use MACA, can X transmit to Y? If NO: explain why. If YES: is the transmission successful (i.e., will noe B receive the ata)? Is the original transmission (from B to E) impacte? c) Assume A is transmitting to B at the beginning of time. List the pair of noes (if any) that can successfully communicate: i. if all noes use CS ii. if all noes use MACA For this, consier each irection separately. i.e., list the pair (X, Y) if X can successfully sen ata to Y, irrespective of whether Y can successfully sen to X. We say that the ata is sent successfully if the sener is able to transmit it an the receiver is able to successfully receive it, without any interference. ) Noe D woul like to transmit to A, noe E to B an noe F to C. Can noes D, E an F transmit simultaneously using CS? What about with MACA (clearly list your assumptions with respect to the orering an timing of RTS/CTS)? e) Now assume biirectional communication between noe pairs (D, A), (E, B) an (F, C), i.e., for a noe pair (x,y), x has ata to sen y an y has ata to sen to x. In an ieal scenario, which pairs of noes can simultaneously communicate? Will CS allow this ieal scenario? What about MACA (clearly list your assumptions with respect to the orering an timing of RTS/CTS)?
6 Q4. Spanning Tree Protocol an Learning Switches Consier the above topology, with each noe representing an Ethernet switch. For simplicity assume that the MAC aress of a switch is represente by a single number as shown. a) Spanning Tree Protocol i. List the root an the eges of the spanning tree obtaine after running the Spanning Tree Protocol for Switche Ethernet on the above network. (You on t have to show how the algorithm procees, simply write the final result.). Ties are broken base on smaller i if multiple shortest paths to the root exist. ii. Suppose noe 0 fails. Ientify the new root an the eges of the new Spanning Tree that is constructe after the failure. b) Learning Switches Consier the original topology (before noe 0 fails) with en-hosts attache to them as shown below. Again, for simplicity, assume the MAC aresses of the en-hosts are represente by a single alphabet. The circular noes in the topology are Learning Switches.
7 a 0 2 c b g 1 3 e 4 5 f Consier the following packet transmissions occurring between a source-estination pair, in the given orer, one after another. For each packet transmission, list the switches an the en-hosts that receive the packet. Assume that you start with no entries in the forwaring table of any switch. Note: If a switch floos the packet, all the ajacent switches an en-host will receive it an may further floo or unicast it. If a switch unicasts a packet, then only the corresponing en host or switch woul receive the packet, which may further floo or unicast the packet. 1. b to c 2. c to b 3. to c 4. a to b 5. a to g c) Learning Switches with Limite Memory
8 Consier the case that the switches have a small memory cache with enough space to store only a single entry in the forwaring table an therefore, they store only the most recent entry. Assume that you start with no entries in the forwaring table of any switch. For each of the packet transmissions, in the given orer, write own whether switch 0 floos the packet or unicasts it. 1. b to c 2. a to b 3. c to b 4. b to c 5. a to b 6. c to b 7. b to c 8. a to b 9. c to b 10. b to c 11. a to b 12. c to b i. List for each pair amongst (a to b), (b to c) an (c to b), the fraction of packets that are flooe by the switch an the fraction of packets that are unicast out of the 4 packets transmitte for each pair. ii. How can you re-orer these packet transmissions, such that for all three sourceestination pairs, half of the packets are flooe an half are unicast? (Hint: you nee to make at most 2 swaps in the sequence of packet transmissions).
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 informationMessage 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 informationImproving Spatial Reuse of IEEE Based Ad Hoc Networks
mproving Spatial Reuse of EEE 82.11 Base A Hoc Networks Fengji Ye, Su Yi an Biplab Sikar ECSE Department, Rensselaer Polytechnic nstitute Troy, NY 1218 Abstract n this paper, we evaluate an suggest methos
More informationDisjoint Multipath Routing in Dual Homing Networks using Colored Trees
Disjoint Multipath Routing in Dual Homing Networks using Colore Trees Preetha Thulasiraman, Srinivasan Ramasubramanian, an Marwan Krunz Department of Electrical an Computer Engineering University of Arizona,
More informationEDOVE: Energy and Depth Variance-Based Opportunistic Void Avoidance Scheme for Underwater Acoustic Sensor Networks
sensors Article EDOVE: Energy an Depth Variance-Base Opportunistic Voi Avoiance Scheme for Unerwater Acoustic Sensor Networks Safar Hussain Bouk 1, *, Sye Hassan Ahme 2, Kyung-Joon Park 1 an Yongsoon Eun
More informationAlmost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control
Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract
More informationTopics. Computer Networks and Internets -- Module 5 2 Spring, Copyright All rights reserved.
Topics Internet concept an architecture Internet aressing Internet Protocol packets (atagrams) Datagram forwaring Aress resolution Error reporting mechanism Configuration Network aress translation Computer
More informationRobust PIM-SM Multicasting using Anycast RP in Wireless Ad Hoc Networks
Robust PIM-SM Multicasting using Anycast RP in Wireless A Hoc Networks Jaewon Kang, John Sucec, Vikram Kaul, Sunil Samtani an Mariusz A. Fecko Applie Research, Telcoria Technologies One Telcoria Drive,
More informationReview Materials: Set B EE122 Fall 2012
Review Materials: Set B EE122 Fall 2012 1. Lucky you re with AIMD Consider a generalized version of AIMD, where: for every window of data ACKed, the window size increases by a constant A when the window
More informationImpact 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 informationPreamble. Singly linked lists. Collaboration policy and academic integrity. Getting help
CS2110 Spring 2016 Assignment A. Linke Lists Due on the CMS by: See the CMS 1 Preamble Linke Lists This assignment begins our iscussions of structures. In this assignment, you will implement a structure
More informationFinal Review Fall 2017 Profs Peter Steenkiste & Justine Sherry
Final Review 15-441 Fall 2017 Profs Peter Steenkiste & Justine Sherry Facts The Final is next week. It mostly covers things after the midterm, but there is significant material from before. There were
More informationMODULE VII. Emerging Technologies
MODULE VII Emerging Technologies Computer Networks an Internets -- Moule 7 1 Spring, 2014 Copyright 2014. All rights reserve. Topics Software Define Networking The Internet Of Things Other trens in networking
More informationOverview : Computer Networking. IEEE MAC Protocol: CSMA/CA Internet mobility TCP over noisy links
Overview 15-441 15-441: Computer Networking 15-641 Lecture 24: Wireless Eric Anerson Fall 2014 www.cs.cmu.eu/~prs/15-441-f14 Internet mobility TCP over noisy links Link layer challenges an WiFi Cellular
More informationHomework 3 1 DNS. A root. A com. A google.com
Homework 3 1 DNS Suppose you have a Host C, a local name server L, and authoritative name servers A root, A com, and A google.com, where the naming convention A x means that the name server knows about
More informationMODULE V. Internetworking: Concepts, Addressing, Architecture, Protocols, Datagram Processing, Transport-Layer Protocols, And End-To-End Services
MODULE V Internetworking: Concepts, Aressing, Architecture, Protocols, Datagram Processing, Transport-Layer Protocols, An En-To-En Services Computer Networks an Internets -- Moule 5 1 Spring, 2014 Copyright
More informationHomework #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 informationUniversity of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences EE122 MIDTERM EXAMINATION Monday, 18 October 2010 Scott Shenker INSTRUCTIONS READ
More informationOnline Appendix to: Generalizing Database Forensics
Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that
More informationCS350 - Exam 4 (100 Points)
Fall 0 Name CS0 - Exam (00 Points).(0 points) Re-Black Trees For the Re-Black tree below, inicate where insert() woul initially occur before rebalancing/recoloring. Sketch the tree at ALL intermeiate steps
More informationHomework 4 assignment for ECE374 Posted: 04/06/15 Due: 04/13/15
ECE374: Homework 4 1 Homework 4 assignment for ECE374 Posted: 04/06/15 Due: 04/13/15 Note: In all written assignments, please show as much of your work as you can. Even if you get a wrong answer, you can
More informationMulticast 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 information15-441: Computer Networks Homework 3
15-441: Computer Networks Homework 3 Assigned: Oct 29, 2013 Due: Nov 12, 2013 1:30 PM in class Name: Andrew ID: 1 TCP 1. Suppose an established TCP connection exists between sockets A and B. A third party,
More informationArchitecture Design of Mobile Access Coordinated Wireless Sensor Networks
Architecture Design of Mobile Access Coorinate Wireless Sensor Networks Mai Abelhakim 1 Leonar E. Lightfoot Jian Ren 1 Tongtong Li 1 1 Department of Electrical & Computer Engineering, Michigan State University,
More information6.823 Computer System Architecture. Problem Set #3 Spring 2002
6.823 Computer System Architecture Problem Set #3 Spring 2002 Stuents are strongly encourage to collaborate in groups of up to three people. A group shoul han in only one copy of the solution to the problem
More informationCOMP3331/9331 XXXX Computer Networks and Applications Final Examination (SAMPLE SOLUTIONS)
COMP3331/9331 XXXX Computer Networks and Applications Final Examination (SAMPLE SOLUTIONS) Question 1 (X marks) (a) The one-way propagation delay between A and B is 100/1 = 100 seconds. The RTT will be
More informationLab work #8. Congestion control
TEORÍA DE REDES DE TELECOMUNICACIONES Grao en Ingeniería Telemática Grao en Ingeniería en Sistemas e Telecomunicación Curso 2015-2016 Lab work #8. Congestion control (1 session) Author: Pablo Pavón Mariño
More informationInternet Content Distribution
Internet Content Distribution Chapter 1: Introduction Jussi Kangasharju Chapter Outline Introduction into content distribution Basic concepts TCP DNS HTTP Outline of the rest of the course Kangasharju:
More informationDepartment of EECS - University of California at Berkeley EECS122 - Introduction to Communication Networks - Spring 2005 Final: 5/20/2005
Name: SID: Department of EECS - University of California at Berkeley EECS122 - Introduction to Communication Networks - Spring 2005 Final: 5/20/2005 There are 10 questions in total. Please write your SID
More informationOffloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization
1 Offloaing Cellular Traffic through Opportunistic Communications: Analysis an Optimization Vincenzo Sciancalepore, Domenico Giustiniano, Albert Banchs, Anreea Picu arxiv:1405.3548v1 [cs.ni] 14 May 24
More informationMedium Access Control. CSCI370 Lecture 5 Michael Hutt New York Institute of Technology
Medium Access Control CSCI370 Lecture 5 Michael Hutt New York Institute of Technology The Data Link Layer Logical Link Control (LLC) IEEE 802.2 Standard RFC 1042 Provides three service options Unreliable
More informationMORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks
: a Movement-Base Routing Algorithm for Vehicle A Hoc Networks Fabrizio Granelli, Senior Member, Giulia Boato, Member, an Dzmitry Kliazovich, Stuent Member Abstract Recent interest in car-to-car communications
More informationCSE 3214: Computer Network Protocols and Applications. Midterm Examination
Department of Computer Science and Engineering CSE 3214: Computer Network Protocols and Applications Midterm Examination Instructions: Instructor: Peter Lian Date: February 14, 2013 1. Examination time:
More informationMODULE II. Network Programming And Applications
MODULE II Network Programming An Applications Computer Networks an Internets -- Moule 2 1 Spring, 2014 Copyright 2014. All rights reserve. Topics Internet services an communication paraigms Client-server
More informationCascading Multi-Hop Reservation and Transmission in Underwater Acoustic Sensor Networks
Sensors 2014, 14, 18390-18409; oi:10.3390/s141018390 Article OPEN ACCESS sensors ISSN 1424-8220 www.mpi.com/journal/sensors Cascaing Multi-Hop Reservation an Transmission in Unerwater Acoustic Sensor Networks
More informationNetwork Address Translation (NAT)
Network Aress Translation (NAT) NAT Motivation IPv4 was running out of aresses ISPs only want to limit a customer to one IP aress at any time, but customers want multiple evices to be online Engineers
More informationStudent ID: CS457: Computer Networking Date: 5/8/2007 Name:
CS457: Computer Networking Date: 5/8/2007 Name: Instructions: 1. Be sure that you have 10 questions 2. Write your Student ID (email) at the top of every page 3. Be sure to complete the honor statement
More informationCS 161 Computer Security
Paxson Spring 2013 CS 161 Computer Security Homework 4 Due: Monday Apr 29, at 10:00PM Version 1.1 (Apr 19) Instructions. Submit your solution electronically via your class account by Monday Apr 29, at
More informationCoupling the User Interfaces of a Multiuser Program
Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces
More informationSURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH
SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway
More informationIntensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2
This paper appears in J. of Parallel an Distribute Computing 10 (1990), pp. 167 181. Intensive Hypercube Communication: Prearrange Communication in Link-Boun Machines 1 2 Quentin F. Stout an Bruce Wagar
More informationCS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing
CS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing Tim Roughgaren October 19, 2016 1 Routing in the Internet Last lecture we talke about elay-base (or selfish ) routing, which
More informationAn Adaptive Routing Algorithm for Communication Networks using Back Pressure Technique
International OPEN ACCESS Journal Of Moern Engineering Research (IJMER) An Aaptive Routing Algorithm for Communication Networks using Back Pressure Technique Khasimpeera Mohamme 1, K. Kalpana 2 1 M. Tech
More informationLecture 1 September 4, 2013
CS 84r: Incentives an Information in Networks Fall 013 Prof. Yaron Singer Lecture 1 September 4, 013 Scribe: Bo Waggoner 1 Overview In this course we will try to evelop a mathematical unerstaning for the
More informationThere are 10 questions in total. Please write your SID on each page.
Name: SID: Department of EECS - University of California at Berkeley EECS122 - Introduction to Communication Networks - Spring 2005 to the Final: 5/20/2005 There are 10 questions in total. Please write
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science
More informationEECS 122: Introduction to Computer Networks DNS and WWW. Internet Names & Addresses
EECS 122: Introduction to Computer Networks DNS and WWW Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley, CA 94720-1776 Internet
More informationWorksheet #2 EE122 Fall 2011
Worksheet #2 EE122 Fall 2011 You are not required to do these problems, and we are not asking you to hand them in. However, if you can t do these problems, then you will have trouble on the final. In fact,
More informationCS 161 Computer Security
Paxson Spring 2011 CS 161 Computer Security Homework 4 Due: Monday May 2, at 11:59pm Instructions. Submit your solution electronically via your class account by Monday May 2, at 11:59pm. You should upload
More information0 0& Basic Background. Now let s get into how things really work!
+,&&-# Department of Electrical Engineering and Computer Sciences University of California Berkeley Basic Background General Overview of different kinds of networks General Design Principles Architecture
More informationChapter 12 Multiple Access 12.1
Chapter 12 Multiple Access 12.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 12.2 Figure 12.1 Data link layer divided into two functionality-oriented sublayers
More informationProbabilistic Medium Access Control for. Full-Duplex Networks with Half-Duplex Clients
Probabilistic Meium Access Control for 1 Full-Duplex Networks with Half-Duplex Clients arxiv:1608.08729v1 [cs.ni] 31 Aug 2016 Shih-Ying Chen, Ting-Feng Huang, Kate Ching-Ju Lin, Member, IEEE, Y.-W. Peter
More informationCSE 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 informationAdaptive Load Balancing based on IP Fast Reroute to Avoid Congestion Hot-spots
Aaptive Loa Balancing base on IP Fast Reroute to Avoi Congestion Hot-spots Masaki Hara an Takuya Yoshihiro Faculty of Systems Engineering, Wakayama University 930 Sakaeani, Wakayama, 640-8510, Japan Email:
More informationComputer Network 2015 Mid-Term Exam.
Computer Network 2015 Mid-Term Exam. Question : ``Basic of Computer Networks and the Internet' Please fill into the blanks (15%) a) The amount of time required to push all of a packet s bits into a link
More informationDomain Name System.
Domain Name System http://xkcd.com/302/ CSCI 466: Networks Keith Vertanen Fall 2011 Overview Final project + presentation Some TCP and UDP experiments Domain Name System (DNS) Hierarchical name space Maps
More informationComputer Organization
Computer Organization Douglas Comer Computer Science Department Purue University 250 N. University Street West Lafayette, IN 47907-2066 http://www.cs.purue.eu/people/comer Copyright 2006. All rights reserve.
More informationDistributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs
IEEE TRANSACTIONS ON KNOWLEDE AND DATA ENINEERIN, MANUSCRIPT ID Distribute Line raphs: A Universal Technique for Designing DHTs Base on Arbitrary Regular raphs Yiming Zhang an Ling Liu, Senior Member,
More informationSupporting 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 informationProtocol Configuration
Configuration Protocol Configuration Many items must be set before protocols can be use IP aress of each network interface Aress mask for each network Initial values in the forwaring table Process is known
More informationProblem Set 10 Due: Start of class December 11
CS242 Computer Networks Handout # 20 Randy Shull December 4, 2017 Wellesley College Problem Set 10 Due: Start of class December 11 Reading: Kurose & Ross, Sections 7.1 7.3, 8.1 8.4 Wireshark Lab [16] Recall
More informationExam - Final. CSCI 1680 Computer Networks Fonseca. Closed Book. Maximum points: 100 NAME: 1. TCP Congestion Control [15 pts]
CSCI 1680 Computer Networks Fonseca Exam - Final Due: 11:00am, May 10th, 2012 Closed Book. Maximum points: 100 NAME: 1. TCP Congestion Control [15 pts] a. TCP Tahoe and Reno have two congestion-window
More informationRecitation Caches and Blocking. 4 March 2019
15-213 Recitation Caches an Blocking 4 March 2019 Agena Reminers Revisiting Cache Lab Caching Review Blocking to reuce cache misses Cache alignment Reminers Due Dates Cache Lab (Thursay 3/7) Miterm Exam
More informationCMPE150 Midterm Solutions
CMPE150 Midterm Solutions Question 1 Packet switching and circuit switching: (a) Is the Internet a packet switching or circuit switching network? Justify your answer. The Internet is a packet switching
More informationQ U E S T I O N 3 In the current version of IP (IPv4), the use of TCP and UDP headers differ in which of the following ways?
Preview Test: HW 2 Test Information Description Chapter 2 Instructions Due:Oct. 17 5 PM Multiple Attempts Not allowed. This test can only be taken once. Force Completion This test can be saved and resumed
More informationIP ADDRESSES, NAMING, AND DNS
IP ADDRESSES, NAMING, AND DNS George Porter Apr 9, 2018 ATTRIBUTION These slides are released under an Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0) Creative Commons license These
More informationDNS and HTTP. A High-Level Overview of how the Internet works
DNS and HTTP A High-Level Overview of how the Internet works Adam Portier Fall 2017 How do I Google? Smaller problems you need to solve 1. Where is Google? 2. How do I access the Google webpage? 3. How
More informationResearch Article REALFLOW: Reliable Real-Time Flooding-Based Routing Protocol for Industrial Wireless Sensor Networks
Hinawi Publishing Corporation International Journal of Distribute Sensor Networks Volume 2014, Article ID 936379, 17 pages http://x.oi.org/10.1155/2014/936379 Research Article REALFLOW: Reliable Real-Time
More informationLecture 24: CSE 123: Computer Networks Stefan Savage. HW4 due NOW
Lecture 24: 802.11 CSE 123: Computer Networks Stefan Savage HW4 due NOW About the final Similar in style to midterm Some combination of easy questions, short answer and more in-depth questions Sample final
More informationComparison of Wireless Network Simulators with Multihop Wireless Network Testbed in Corridor Environment
Comparison of Wireless Network Simulators with Multihop Wireless Network Testbe in Corrior Environment Rabiullah Khattak, Anna Chaltseva, Laurynas Riliskis, Ulf Boin, an Evgeny Osipov Department of Computer
More informationPAPER. 1. Introduction
IEICE TRANS. COMMUN., VOL. E9x-B, No.8 AUGUST 2010 PAPER Integrating Overlay Protocols for Proviing Autonomic Services in Mobile A-hoc Networks Panagiotis Gouvas, IEICE Stuent member, Anastasios Zafeiropoulos,,
More informationAnyTraffic Labeled Routing
AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,
More informationAN exam March
AN exam March 29 2018 Dear student This exam consists of 7 questions. The total number of points is 100. Read the questions carefully. Be precise and concise. Write in a readable way. Q1. UDP and TCP (25
More informationOn the Placement of Internet Taps in Wireless Neighborhood Networks
1 On the Placement of Internet Taps in Wireless Neighborhoo Networks Lili Qiu, Ranveer Chanra, Kamal Jain, Mohamma Mahian Abstract Recently there has emerge a novel application of wireless technology that
More informationChapter 4. The Medium Access Control Sublayer. Points and Questions to Consider. Multiple Access Protocols. The Channel Allocation Problem.
Dynamic Channel Allocation in LANs and MANs Chapter 4 The Medium Access Control Sublayer 1. Station Model. 2. Single Channel Assumption. 3. Collision Assumption. 4. (a) Continuous Time. (b) Slotted Time.
More informationAdditional Divide and Conquer Algorithms. Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication
Aitional Divie an Conquer Algorithms Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication Divie an Conquer Closest Pair Let s revisit the closest pair problem. Last
More informationLecture 25: CSE 123: Computer Networks Alex C. Snoeren. HW4 due NOW
Lecture 25: 802.11 CSE 123: Computer Networks Alex C. Snoeren HW4 due NOW Lecture 25 Overview 802.11 Wireless PHY layer overview Hidden Terminals Basic wireless challenge RTS/CTS Virtual carrier sense
More informationScribe Notes -- October 31st, 2017
Scribe Notes -- October 31st, 2017 TCP/IP Protocol Suite Most popular protocol but was designed with fault tolerance in mind, not security. Consequences of this: People realized that errors in transmission
More informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 4, APRIL
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 1, NO. 4, APRIL 01 74 Towar Efficient Distribute Algorithms for In-Network Binary Operator Tree Placement in Wireless Sensor Networks Zongqing Lu,
More informationDynamic Source Routing (DSR) [Johnson96] CSE 6811 : Lecture 5
ynamic Source Routing (SR) [Johnson96] S 6811 : Lecture 5 d Hoc Wireless Routing ifferent from routing in the wired world esirable properties of a wireless routing protocol istributed operation Loop freedom
More informationCSCI4211: Introduction to Computer Networks Fall 2017 Homework Assignment 1
CSCI4211: Introduction to Computer Networks Fall 2017 Homework Assignment 1 Due 11:59pm Friday October 6 Instructions: 1. Please submit your homework using the on-line electronic submission system (via
More informationAdjusted Probabilistic Packet Marking for IP Traceback
Ajuste Probabilistic Packet Marking for IP Traceback Tao Peng, Christopher Leckie, an Kotagiri Ramamohanarao 2 ARC Special Research Center for Ultra-Broaban Information Networks Department of Electrical
More informationRFC 2181 Ranking data and referrals/glue importance --- new resolver algorithm proposal ---
RFC 2181 Ranking data and referrals/glue importance --- new resolver algorithm proposal --- Kazunori Fujiwara fujiwara@jprs.co.jp Japan Registry Services Co., Ltd (JPRS) DNS-OARC Workshop 2016/10/16 Last
More informationUNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING
UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING ECE361 Computer Networks Midterm March 06, 2017, 6:15PM DURATION: 80 minutes Calculator Type: 2 (non-programmable calculators) Examiner:
More informationThreshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides
Threshol Base Data Aggregation Algorithm To Detect Rainfall Inuce Lanslies Maneesha V. Ramesh P. V. Ushakumari Department of Computer Science Department of Mathematics Amrita School of Engineering Amrita
More informationMedium Access Protocols
Medium Access Protocols Summary of MAC protocols What do you do with a shared media? Channel Partitioning, by time, frequency or code Time Division,Code Division, Frequency Division Random partitioning
More informationStudent ID: CS457: Computer Networking Date: 5/8/2007 Name:
CS457: Computer Networking Date: 5/8/2007 Name: Instructions: 1. Be sure that you have 10 questions 2. Write your Student ID (email) at the top of every page 3. Be sure to complete the honor statement
More informationNon-Uniform Sensor Deployment in Mobile Wireless Sensor Networks
01 01 01 01 01 00 01 01 Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks Mihaela Carei, Yinying Yang, an Jie Wu Department of Computer Science an Engineering Floria Atlantic University
More informationProblem Paper Atoms Tree. atoms.pas. atoms.cpp. atoms.c. atoms.java. Time limit per test 1 second 1 second 2 seconds. Number of tests
! " # %$ & Overview Problem Paper Atoms Tree Shen Tian Harry Wiggins Carl Hultquist Program name paper.exe atoms.exe tree.exe Source name paper.pas atoms.pas tree.pas paper.cpp atoms.cpp tree.cpp paper.c
More informationTrailing Mobile Sinks: A Proactive Data Reporting Protocol for Wireless Sensor Networks
Trailing Mobile Sinks: A Proactive Data Reporting Protocol for Wireless Sensor Networks Xinxin Liu, Han Zhao, Xin Yang Computer & Information Science & Eng. University of Floria Email:{xinxin,han,xin}@cise.ufl.eu
More informationQueueing 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 informationVoice Mail Information
Voice Mail Information Greeting Passwor Personal Verification Play Messages Compose Messages Forwar Messages Note: Anything in re is a new change to the Voice Mail Instructions To log on from your own
More informationBSc. (Hons) Web Technologies. Examinations for 2017 / Semester 1
BSc. (Hons) Web Technologies Cohort: BWT/17A/FT Examinations for 2017 / Semester 1 MODULE: NETWORK ESSENTIALS MODULE CODE: CAN 1104C Duration: 2 ½ hours Instructions to Candidates: 1. Answer ALL 4 (four)
More informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More informationComputer Networks - Midterm
Computer Networks - Midterm October 28, 2016 Duration: 2h15m This is a closed-book exam Please write your answers on these sheets in a readable way, in English or in French You can use extra sheets if
More informationStudy of Network Optimization Method Based on ACL
Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department
More informationState Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway
State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle
More informationINGI1341: Project 2 Analysis of a website
INGI3141:PROJECT 2 1 INGI1341: Project 2 Analysis of a website Sergio Alejandro Chávez Cárdenas Abstract The details of a remote website sopitas.com are analysed and its responses over the Internet are
More informationLecture 9: Bridging & Switching"
Lecture 9: Bridging & Switching" CSE 123: Computer Networks Alex C. Snoeren HW 2 due Wednesday! Lecture 9 Overview" Finishing up media access Contention-free methods (rings) Moving beyond one wire Link
More informationCSCE 463/612 Networks and Distributed Processing Spring 2018
CSCE 463/612 Networks and Distributed Processing Spring 2018 Application Layer III Dmitri Loguinov Texas A&M University February 8, 2018 Original slides copyright 1996-2004 J.F Kurose and K.W. Ross 1 Chapter
More information