Advanced Computer Networks

Size: px
Start display at page:

Download "Advanced Computer Networks"

Transcription

1 Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans a unque number that assocates ths exam wth your matrculaton number. Ths number s prnted both next to the QR code and to the sgnature feld n the attendance check lst. Advanced Computer Networks Module: IN97 Date: Examner: Prof. Dr.-Ing. Georg Carle Exam: Fnal exam P P P 3 P 4 P 5 Frst correcton Second correcton Left room from to from to Early submsson at Notes

2

3 Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Fnal exam Advanced Computer Networks Prof. Dr.-Ing. Georg Carle Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Frday, :3 9:3 Ths exam conssts of 6 pages wth a total of 5 problems and a two-sded prnted cheat sheet. Please make sure now that you receved a complete copy of the exam. Subproblems marked by * can be solved wthout results of prevous subproblems. Answers are only accepted f the soluton approach s documented. Gve a reason for each answer unless explctly stated otherwse n the respectve subproblem. Do not wrte wth red or green colors nor use pencls. The total amount of achevable credts n ths exam s 6. Allowed resources: a non-annotated, prnted vocabulary Englsh natve language. Physcally turn off all electronc devces, put them nto your bag and close the bag. Page / 6

4 Problem Quz ( credts) The followng questons cover multple topcs and can be solved ndependently of each other. a)* Connect the protocols to ther correspondng ISO/OSI layer as well as to ther correspondng term for ther PDU. Hnt: There may be terms where no/several parngs are possble. IP Frame Ethernet Segment 3 TCP Package b)* Add a sngle edge to the network n Fgure b) to ncrease the maxmum value of k when performng the k-core algorthm. A E F B D C c)* Gven the IP address and subnet mask , determne the correspondng network and broadcast addresses. d)* Longest prefx matchng s an algorthm commonly used n computer networks. Where s t used specfcally and how does t work? Page / 6

5 C k d g a b c e f h S S C C Fgure.: Software defned network topology Consder the software defned network n Fgure.. The network conssts of two clents C and C and an OpenFlow controller C. In between the clents two swtches S and S are nstalled. Each of the swtches s connected to a sngle clent, to the respectve other swtch and to the controller. There are two flow tables already nstalled on the swtches: Match felds dl_type = x8, nw_proto = x, nw_src = C _src_p Acton [port_c] Table.: Flow table of S Match felds dl_type = x8, nw_proto = x6, nw_src = C _src_p Acton [port_e] Table.: Flow table of S The standard acton for a packet f no rule matches s to transmt t to the controller. The default acton of the controller s to send ncomng packets back to the swtch and to nstruct t to forward the packet to all nterfaces except the orgnal source nterface and the management port. Explanaton for match felds: dl_type: used type of payload for the data lnk layer protocol (Hnt: see cheat sheet for values, secton Ethernet) nw_proto: used type of payload for the network layer protocol (Hnt: see cheat sheet for values, secton IPv4) nw_src: source address of network protocol e)* C pngs C. Lst all nterfaces an ICMP echo request packet travels through the topology n the correct order (only the request packet, not the answer packet). 3 Page 3 / 6

6 f)* Consder a swtch based on off-the-shelf hardware such as Open vswtch and a dedcated SDN swtch based on specalzed hardware. Lst two advantages for each of the swtches. Page 4 / 6

7 Problem Receve Sde Scalng (9 credts) Receve Sde Scalng (RSS) s a feature to dstrbute the network traffc to dfferent hardware queues assgned to dfferent CPU cores. Fgure. presents the sequence performed durng packet recepton on an RSS system. packet q q q n hash lookup lookup table Fgure.: Receve Sde Scalng a)* Why s the support for multple hardware queues benefcal for dstrbutng CPU load to dfferent cores nstead of usng a sngle queue. The followng calculatons use the XOR (exclusve or) and MOD (modulo) operators. The hash functon s appled on a gven IPv4 address A.B.C.D: hash(ipv4 src_addr ) = hash(a.b.c.d) = A XOR B XOR C XOR D After calculatng the hash a lookup n a hardware lookup table s performed. Ths determnes the hardware queue where packets are enqueued. CPU cores assgned to a queue process the packets afterwards. The lookup s calculated as follows: lookup(hash(ipv4 src_addr )) = hash(ipv4 src_addr ) mod n For ths problem: n = 3. b)* Perform a hash and a lookup operaton on the IP address 9... c) Determne the IP addresses of the 9... / 9 subnet for the followng mappngs Lookup table queue queue queue queue 3 queue 4 queue 5 queue 6 queue 7 Page 5 / 6

8 The lookup table has a fxed sze of 8. All cells of the lookup table must be flled at all tmes. As the cores should have a smlar utlzaton, the ncomng packets should be dstrbuted n a unform manner among the cores. You can assume that the source IP addresses are unformly dstrbuted whch leads to a unform dstrbuton for hash and lookup functon alke. d)* Gve the content of a lookup table f three queues/cores are n use. Try to approxmate the unform dstrbuton as closely as possble. MOD result Queue number e) Calculate the relatve probablty of packet dstrbuton for each core n percent. f) What would be the deal value and how bg s the maxmum devaton. g)* Dependng on n, how many CPU cores/queues should be used f the dstrbuton should be met as accurately as possble? Page 6 / 6

9 Problem 3 BGP (7 credts) Fgure 3. shows a small AS topology ncludng border routers R, R and R3. AS and AS77 are costumers of AS. AS and AS77 have a peerng agreement,. e., they exchange traffc for free. AS and AS77 own prefxes that are announced to ther customers/peerng partners. AS77 owns the prefx /, AS owns the prefx /6. AS Owned Prefxes: 5.7../ R R4 AS R R AS77 Owned Prefxes: / Fgure 3.: AS topology a)* There exst two flavors of BGP. Whch ones are used between the lsted routers? Between R4 and R3: Between R and R3: b)* Create the routng table entry/entres for the border router of A (R) for the owned prefxes of AS77. Network destnaton Subnetmask Next hop IP address Page 7 / 6

10 An attacker controllng AS wants to snff the traffc that s exchanged between AS and AS77 for ther respectve prefxes 5.7../6 and /. Therefore, ths traffc shall be routed through AS,.e., AS performs a man-n-the-mddle attack. c)* Descrbe what the attacker has to do to perform the man-n-the-mddle attack. d) Lst the new routng table entry/entres for the border router of AS (R) after a successful man-n-themddle attack of AS wth as lttle entres as possble. Network destnaton Subnetmask Next hop IP address 3 Page 8 / 6

11 Problem 4 Wreshark (4 credts) We consder the IP packet depcted n Fgure 4. as hexdump n network byte order. IHL TOS Total Length Identfcaton Flags/FragOffset TTL 45 c 5c d4 f6 3f 6e 6c C A ae Fgure 4.: Partal hexdump of an IP packet n network byte order The topology of the network for ths problem s gven n Fgure 4.. A clent C wants to connect from ts local network to a server S on the Internet va the NAT router R. Note: To solve ths problem use the cheat sheet that s handed out separately. R.eth MAC: ::5E::53: IP:... R.eth MAC: ::5E::53: IP: 9... C.eth MAC: ::5E::53: IP:... S.eth MAC: ::5E::53:3 IP: 9... Fgure 4.: The network topology n whch the packet was recorded a)* Mark and name the header felds n Fgure 4.. b)* Argue from whch nterface to whch nterface the packet (see Fgure 4.) was transferred. c)* Argue what protocol s contaned n the payload of the IP packet n Fgure 4.. Page 9 / 6

12 The IP packet n Fgure 4. contans an ncomplete ICMP message startng at offset x4. d)* Argue whch knd of ICMP message t s and why ths message could be generated. Ths ICMP message was receved after clent C tred to open an SSH connecton to S. Wth ths nformaton t s possble to recreate the mssng payload of the ICMP message. e) Name the protocol(s) contaned n the payload of the ICMP message. f)* Create a hexdump of the mssng payload for the ICMP message of Fgure 4.. Hnt: The calculaton of correct checksums s not necessary, fll n xff blocks f needed. Not all lsted headers mght be used for SSH. IPv4-Header B x5 x x x4 3 4 B xca x6 x x 4 8 B 5 B 6 B UDP-Header B 4 B TCP-Header B 4 B 8 B B 6 B Page / 6

13 g)* Generate a hexdump of the Ethernet frame for the IP packet gven n Fgure 4.. The entre payload of the Ethernet packet may be abbrevated wth.... Hnt: The calculaton of correct checksums s not necessary, fll n xff blocks f needed. Page / 6

14 Problem 5 TCP (9 credts) TCP has the ablty to detect packet loss va tmeouts. Ths tmeout value, called RTO, must be adopted to the propertes of a TCP connecton to work properly. a)* What happens to the detecton of packet loss when the RTT of a TCP connecton s estmated too hgh? b)* What happens to the detecton of packet loss when the RTT of a TCP connecton s estmated too low? For a network experment the connectons S to C and S to C over router R as shown n Fgure 5. are tested. Durng the experment dfferent buffer confguratons for R shall be tested. The bandwdth of each depcted lnk s the same. S C R Fgure 5.: Network topology S Several actve TCP connectons try to use the full bandwdth avalable between S and C and between S and C. Addtonally a png from C to S s executed. The average RTT measured by png for a large buffer confguraton and a small buffer confguraton s plotted n Fgure Large Buffer Small Buffer Average RTT [ms] Tme [s] Fgure 5.: Latency wth dfferent buffer szes Page / 6

15 c) What s the nfluence of dfferent buffer szes on the accuracy of the RTO estmaton. Argue wth the results for the two buffer szes from Fgure d)* What happens to latency crtcal applcatons such as VoIP n the presence of large buffers? e) How can the stuaton for latency crtcal applcatons be mproved, wthout changng the buffer sze? To mprove the behavor of TCP wth large buffers an actve queue management s ntroduced. f)* Name and explan two dfferent dscard polces. Page 3 / 6

16 The algorthm appled s weghted far queung. For that three classes of traffc shall be consdered A, B and C wth ther correspondng weghts w A =, w B = 4, w C = 3. The weght of the traffc classes gves the maxmum burst sze whch s allowed for a certan traffc class. The algorthm starts to send a burst of A traffc, after the burst sze s exhausted or the queue for ths traffc class s empty, the same s done for the traffc class B and afterwards for traffc class C. At each tmeslot an arbtrary number of packets can be receved but only a sngle packet can be sent. g)* Calculate the overall possble bandwdth capacty for each traffc class n percent. Assume that enough packets for all three classes are avalable to always fll the respecve bursts. For the next problems consder the followng ncomng packets: Tmeslot A B C h) Compute whch packet s sent out at each tme slot. Addtonally, gve the content of the queues at ths tme. Hnt: Tmeslot s already computed, proceed accordngly. Tmeslot Queue A Queue B 3 Queue C Sent A In the followng a token bucket approach for QoS shall be appled. The ntal tokens are t A =, t B =, and t C =. An addtonal token s generated for the queue A at every fourth, queue B at every second, and queue C at every thrd tmeslot. Token handlng/checkng s done before makng the decson for sendng. )* Compute whch packet s sent out at each tme slot. Addtonally, gve the content of the queues and the avalable tokens for the respectve traffc class at ths tme. Hnt: Tmeslot s already computed, proceed accordngly. Tmeslot new Token B C A B B C A B C B A B C Queue A 3 Tokens A 4 5 Queue B Tokens B Queue C Tokens C Sent B Page 4 / 6

17 Addtonal space for solutons clearly mark the (sub)problem your answers are related to and strke out nvald solutons. Page 5 / 6

18 Page 6 / 6

19

20

Sample Solution. Advanced Computer Networks P 1 P 2 P 3 P 4 P 5. Module: IN2097 Date: Examiner: Prof. Dr.-Ing. Georg Carle Exam: Final exam

Sample Solution. Advanced Computer Networks P 1 P 2 P 3 P 4 P 5. Module: IN2097 Date: Examiner: Prof. Dr.-Ing. Georg Carle Exam: Final exam Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans

More information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) , VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

CS 268: Lecture 8 Router Support for Congestion Control

CS 268: Lecture 8 Router Support for Congestion Control CS 268: Lecture 8 Router Support for Congeston Control Ion Stoca Computer Scence Dvson Department of Electrcal Engneerng and Computer Scences Unversty of Calforna, Berkeley Berkeley, CA 9472-1776 Router

More information

Real-time interactive applications

Real-time interactive applications Real-tme nteractve applcatons PC-2-PC phone PC-2-phone Dalpad Net2phone vdeoconference Webcams Now we look at a PC-2-PC Internet phone example n detal Internet phone over best-effort (1) Best effort packet

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

Efficient Distributed File System (EDFS)

Efficient Distributed File System (EDFS) Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate

More information

Real-Time Guarantees. Traffic Characteristics. Flow Control

Real-Time Guarantees. Traffic Characteristics. Flow Control Real-Tme Guarantees Requrements on RT communcaton protocols: delay (response s) small jtter small throughput hgh error detecton at recever (and sender) small error detecton latency no thrashng under peak

More information

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,

More information

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,

More information

A Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics

A Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics A Hybrd Genetc Algorthm for Routng Optmzaton n IP Networks Utlzng Bandwdth and Delay Metrcs Anton Redl Insttute of Communcaton Networks, Munch Unversty of Technology, Arcsstr. 21, 80290 Munch, Germany

More information

Fibre-Optic AWG-based Real-Time Networks

Fibre-Optic AWG-based Real-Time Networks Fbre-Optc AWG-based Real-Tme Networks Krstna Kunert, Annette Böhm, Magnus Jonsson, School of Informaton Scence, Computer and Electrcal Engneerng, Halmstad Unversty {Magnus.Jonsson, Krstna.Kunert}@de.hh.se

More information

Quantifying Performance Models

Quantifying Performance Models Quantfyng Performance Models Prof. Danel A. Menascé Department of Computer Scence George Mason Unversty www.cs.gmu.edu/faculty/menasce.html 1 Copyrght Notce Most of the fgures n ths set of sldes come from

More information

Internet Traffic Managers

Internet Traffic Managers Internet Traffc Managers Ibrahm Matta matta@cs.bu.edu www.cs.bu.edu/faculty/matta Computer Scence Department Boston Unversty Boston, MA 225 Jont work wth members of the WING group: Azer Bestavros, John

More information

arxiv: v3 [cs.ds] 7 Feb 2017

arxiv: v3 [cs.ds] 7 Feb 2017 : A Two-stage Sketch for Data Streams Tong Yang 1, Lngtong Lu 2, Ybo Yan 1, Muhammad Shahzad 3, Yulong Shen 2 Xaomng L 1, Bn Cu 1, Gaogang Xe 4 1 Pekng Unversty, Chna. 2 Xdan Unversty, Chna. 3 North Carolna

More information

ELEC 377 Operating Systems. Week 6 Class 3

ELEC 377 Operating Systems. Week 6 Class 3 ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Quantifying Responsiveness of TCP Aggregates by Using Direct Sequence Spread Spectrum CDMA and Its Application in Congestion Control

Quantifying Responsiveness of TCP Aggregates by Using Direct Sequence Spread Spectrum CDMA and Its Application in Congestion Control Quantfyng Responsveness of TCP Aggregates by Usng Drect Sequence Spread Spectrum CDMA and Its Applcaton n Congeston Control Mehd Kalantar Department of Electrcal and Computer Engneerng Unversty of Maryland,

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Optimization of Local Routing for Connected Nodes with Single Output Ports - Part I: Theory

Optimization of Local Routing for Connected Nodes with Single Output Ports - Part I: Theory U J.T. (: 33- (pr. 0 Optmzaton of Local Routng for Connected odes wth Sngle Output Ports - Part I: Theory Dobr tanassov Batovsk Faculty of Scence and Technology ssumpton Unversty Bangkok Thaland E-mal:

More information

Gateway Algorithm for Fair Bandwidth Sharing

Gateway Algorithm for Fair Bandwidth Sharing Algorm for Far Bandwd Sharng We Y, Rupnder Makkar, Ioanns Lambadars Department of System and Computer Engneerng Carleton Unversty 5 Colonel By Dr., Ottawa, ON KS 5B6, Canada {wy, rup, oanns}@sce.carleton.ca

More information

ATYPICAL SDN consists of a logical controller in the

ATYPICAL SDN consists of a logical controller in the IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 25, NO. 6, DECEMBER 2017 3587 Mnmzng Flow Statstcs Collecton Cost Usng Wldcard-Based Requests n SDNs Hongl Xu, Member, IEEE, Zhuolong Yu, Chen Qan, Member, IEEE,

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

K-means and Hierarchical Clustering

K-means and Hierarchical Clustering Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

A SYSTOLIC APPROACH TO LOOP PARTITIONING AND MAPPING INTO FIXED SIZE DISTRIBUTED MEMORY ARCHITECTURES

A SYSTOLIC APPROACH TO LOOP PARTITIONING AND MAPPING INTO FIXED SIZE DISTRIBUTED MEMORY ARCHITECTURES A SYSOLIC APPROACH O LOOP PARIIONING AND MAPPING INO FIXED SIZE DISRIBUED MEMORY ARCHIECURES Ioanns Drosts, Nektaros Kozrs, George Papakonstantnou and Panayots sanakas Natonal echncal Unversty of Athens

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

(1) The control processes are too complex to analyze by conventional quantitative techniques.

(1) The control processes are too complex to analyze by conventional quantitative techniques. Chapter 0 Fuzzy Control and Fuzzy Expert Systems The fuzzy logc controller (FLC) s ntroduced n ths chapter. After ntroducng the archtecture of the FLC, we study ts components step by step and suggest a

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

Concurrent Apriori Data Mining Algorithms

Concurrent Apriori Data Mining Algorithms Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng

More information

CACHE MEMORY DESIGN FOR INTERNET PROCESSORS

CACHE MEMORY DESIGN FOR INTERNET PROCESSORS CACHE MEMORY DESIGN FOR INTERNET PROCESSORS WE EVALUATE A SERIES OF THREE PROGRESSIVELY MORE AGGRESSIVE ROUTING-TABLE CACHE DESIGNS AND DEMONSTRATE THAT THE INCORPORATION OF HARDWARE CACHES INTO INTERNET

More information

Avoiding congestion through dynamic load control

Avoiding congestion through dynamic load control Avodng congeston through dynamc load control Vasl Hnatyshn, Adarshpal S. Seth Department of Computer and Informaton Scences, Unversty of Delaware, Newark, DE 976 ABSTRACT The current best effort approach

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

A fair buffer allocation scheme

A fair buffer allocation scheme A far buffer allocaton scheme Juha Henanen and Kalev Klkk Telecom Fnland P.O. Box 228, SF-330 Tampere, Fnland E-mal: juha.henanen@tele.f Abstract An approprate servce for data traffc n ATM networks requres

More information

Advanced Computer Networking. Please make sure now that you received a complete copy of the exam.

Advanced Computer Networking. Please make sure now that you received a complete copy of the exam. Chair of Network Architectures and Services Department of Informatics Technical University of Munich Note: During the attendance check a sticker containing a unique code will be put on this exam. This

More information

RAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems:

RAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems: Speed/RAP/CODA Presented by Octav Chpara Real-tme Systems Many wreless sensor network applcatons requre real-tme support Survellance and trackng Border patrol Fre fghtng Real-tme systems: Hard real-tme:

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

Categories and Subject Descriptors ABSTRACT. General Terms. Keywords 1. INTRODUCTION. C.2.1. [Computer-Communication Networks]: Network Architecture

Categories and Subject Descriptors ABSTRACT. General Terms. Keywords 1. INTRODUCTION. C.2.1. [Computer-Communication Networks]: Network Architecture On Desgnng Incentve-Compatble Routng and Forwardng Protocols n Wreless Ad-Hoc Networks An Integrated Approach Usng Game Theoretcal and Cryptographc Technques Sheng Zhong L (Erran) L Yanbn Grace Lu Yang

More information

Channel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7

Channel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7 Optmzed Regonal Cachng for On-Demand Data Delvery Derek L. Eager Mchael C. Ferrs Mary K. Vernon Unversty of Saskatchewan Unversty of Wsconsn Madson Saskatoon, SK Canada S7N 5A9 Madson, WI 5376 eager@cs.usask.ca

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

ARTICLE IN PRESS. Computer Networks xxx (2008) xxx xxx. Contents lists available at ScienceDirect. Computer Networks

ARTICLE IN PRESS. Computer Networks xxx (2008) xxx xxx. Contents lists available at ScienceDirect. Computer Networks Computer Networks xxx (28) xxx xxx Contents lsts avalable at ScenceDrect Computer Networks journal homepage: www.elsever.com/locate/comnet On applyng far queung dscplne to schedule requests at access gateway

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

A Sub-Critical Deficit Round-Robin Scheduler

A Sub-Critical Deficit Round-Robin Scheduler A Sub-Crtcal Defct ound-obn Scheduler Anton Kos, Sašo Tomažč Unversty of Ljubljana, Faculty of Electrcal Engneerng, Ljubljana, Slovena E-mal: anton.kos@fe.un-lj.s Abstract - A scheduler s an essental element

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

Comparisons of Packet Scheduling Algorithms for Fair Service among Connections on the Internet

Comparisons of Packet Scheduling Algorithms for Fair Service among Connections on the Internet Comparsons of Packet Schedulng Algorthms for Far Servce among Connectons on the Internet Go Hasegawa, Takahro Matsuo, Masayuk Murata and Hdeo Myahara Department of Infomatcs and Mathematcal Scence Graduate

More information

Analysis of Collaborative Distributed Admission Control in x Networks

Analysis of Collaborative Distributed Admission Control in x Networks 1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,

More information

Pricing Network Resources for Adaptive Applications in a Differentiated Services Network

Pricing Network Resources for Adaptive Applications in a Differentiated Services Network IEEE INFOCOM Prcng Network Resources for Adaptve Applcatons n a Dfferentated Servces Network Xn Wang and Hennng Schulzrnne Columba Unversty Emal: {xnwang, schulzrnne}@cs.columba.edu Abstract The Dfferentated

More information

Maximum Weight Matching Dispatching Scheme in Buffered Clos-Network Packet Switches

Maximum Weight Matching Dispatching Scheme in Buffered Clos-Network Packet Switches Maxmum Weght Matchng Dspatchng Scheme n Buffered Clos-Network Packet Swtches Roberto Roas-Cessa, Member, IEEE, E Ok, Member, IEEE, and H. Jonathan Chao, Fellow, IEEE Abstract The scalablty of Clos-network

More information

Balancing Energy Saving and QoS in the Mobile Internet: An Application-Independent Approach

Balancing Energy Saving and QoS in the Mobile Internet: An Application-Independent Approach Balancng Energy Savng and QoS n the Moble Internet: An Applcaton-Independent Approach Unv. of Psa, Dept. of Informaton Engneerng Va Dotsalv 2-5622 Psa, Italy {g.anastas, a.passarella}@et.unp.t, G. Anastas,

More information

MULTIHOP wireless networks are a paradigm in wireless

MULTIHOP wireless networks are a paradigm in wireless 400 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 17, NO. 1, JANUARY 2018 Toward Optmal Dstrbuted Node Schedulng n a Multhop Wreless Network Through Local Votng Dmtros J. Vergados, Member, IEEE, Natala

More information

Parameter estimation for incomplete bivariate longitudinal data in clinical trials

Parameter estimation for incomplete bivariate longitudinal data in clinical trials Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

Report on On-line Graph Coloring

Report on On-line Graph Coloring 2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

AP PHYSICS B 2008 SCORING GUIDELINES

AP PHYSICS B 2008 SCORING GUIDELINES AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for

More information

Connection-information-based connection rerouting for connection-oriented mobile communication networks

Connection-information-based connection rerouting for connection-oriented mobile communication networks Dstrb. Syst. Engng 5 (1998) 47 65. Prnted n the UK PII: S0967-1846(98)90513-7 Connecton-nformaton-based connecton reroutng for connecton-orented moble communcaton networks Mnho Song, Yanghee Cho and Chongsang

More information

IP Camera Configuration Software Instruction Manual

IP Camera Configuration Software Instruction Manual IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the

More information

Wireless Sensor Network Localization Research

Wireless Sensor Network Localization Research Sensors & Transducers 014 by IFSA Publshng, S L http://wwwsensorsportalcom Wreless Sensor Network Localzaton Research Lang Xn School of Informaton Scence and Engneerng, Hunan Internatonal Economcs Unversty,

More information

Goals and Approach Type of Resources Allocation Models Shared Non-shared Not in this Lecture In this Lecture

Goals and Approach Type of Resources Allocation Models Shared Non-shared Not in this Lecture In this Lecture Goals and Approach CS 194: Dstrbuted Systems Resource Allocaton Goal: acheve predcable performances Three steps: 1) Estmate applcaton s resource needs (not n ths lecture) 2) Admsson control 3) Resource

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

Lecture 5: Probability Distributions. Random Variables

Lecture 5: Probability Distributions. Random Variables Lecture 5: Probablty Dstrbutons Random Varables Probablty Dstrbutons Dscrete Random Varables Contnuous Random Varables and ther Dstrbutons Dscrete Jont Dstrbutons Contnuous Jont Dstrbutons Independent

More information

ETAtouch RESTful Webservices

ETAtouch RESTful Webservices ETAtouch RESTful Webservces Verson 1.1 November 8, 2012 Contents 1 Introducton 3 2 The resource /user/ap 6 2.1 HTTP GET................................... 6 2.2 HTTP POST..................................

More information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On Some Entertaining Applications of the Concept of Set in Computer Science Course On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,

More information

Array transposition in CUDA shared memory

Array transposition in CUDA shared memory Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Integrated Congestion-Control Mechanism in Optical Burst Switching Networks

Integrated Congestion-Control Mechanism in Optical Burst Switching Networks Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subect matter experts for publcaton n the IEEE GLOBECOM 2005 proceedngs Integrated Congeston-Control Mechansm n Optcal Burst

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

Network-Driven Layered Multicast with IPv6

Network-Driven Layered Multicast with IPv6 Network-Drven Layered Multcast wth IPv6 Ho-pong Sze and Soung C. Lew Department of Informaton Engneerng, The Chnese Unversty of Hong Kong, Shatn, N.T., Hong Kong {hpsze8, soung}@e.cuhk.edu.hk Abstract.

More information

Six-Band HDTV Camera System for Color Reproduction Based on Spectral Information

Six-Band HDTV Camera System for Color Reproduction Based on Spectral Information IS&T's 23 PICS Conference Sx-Band HDTV Camera System for Color Reproducton Based on Spectral Informaton Kenro Ohsawa )4), Hroyuk Fukuda ), Takeyuk Ajto 2),Yasuhro Komya 2), Hdeak Hanesh 3), Masahro Yamaguch

More information

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016) Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

A Frame Packing Mechanism Using PDO Communication Service within CANopen

A Frame Packing Mechanism Using PDO Communication Service within CANopen 28 A Frame Packng Mechansm Usng PDO Communcaton Servce wthn CANopen Mnkoo Kang and Kejn Park Dvson of Industral & Informaton Systems Engneerng, Ajou Unversty, Suwon, Gyeongg-do, South Korea Summary The

More information

Towards High Fidelity Network Emulation

Towards High Fidelity Network Emulation Towards Hgh Fdelty Network Emulaton Lanje Cao, Xangyu Bu, Sona Fahmy, Syuan Cao Department of Computer Scence, Purdue nversty, West Lafayette, IN, SA E-mal: {cao62, xb, fahmy, cao208}@purdue.edu Abstract

More information

Routing in Degree-constrained FSO Mesh Networks

Routing in Degree-constrained FSO Mesh Networks Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Routng n Degree-constraned FSO Mesh Networks Zpng Hu, Pramode Verma, and James Sluss Jr. School of Electrcal & Computer Engneerng

More information

OPTIMAL CONFIGURATION FOR NODES IN MIXED CELLULAR AND MOBILE AD HOC NETWORK FOR INET

OPTIMAL CONFIGURATION FOR NODES IN MIXED CELLULAR AND MOBILE AD HOC NETWORK FOR INET OPTIMAL CONFIGURATION FOR NODE IN MIED CELLULAR AND MOBILE AD HOC NETWORK FOR INET Olusola Babalola D.E. Department of Electrcal and Computer Engneerng Morgan tate Unversty Dr. Rchard Dean Faculty Advsor

More information

Dynamic Bandwidth Allocation Schemes in Hybrid TDM/WDM Passive Optical Networks

Dynamic Bandwidth Allocation Schemes in Hybrid TDM/WDM Passive Optical Networks Dynamc Bandwdth Allocaton Schemes n Hybrd TDM/WDM Passve Optcal Networks Ahmad R. Dhan, Chad M. Ass, and Abdallah Sham Concorda Insttue for Informaton Systems Engneerng Concorda Unversty, Montreal, Quebec,

More information

Brave New World Pseudocode Reference

Brave New World Pseudocode Reference Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be

More information

TECHNICAL REPORT AN OPTIMAL DISTRIBUTED PROTOCOL FOR FAST CONVERGENCE TO MAXMIN RATE ALLOCATION. Jordi Ros and Wei K Tsai

TECHNICAL REPORT AN OPTIMAL DISTRIBUTED PROTOCOL FOR FAST CONVERGENCE TO MAXMIN RATE ALLOCATION. Jordi Ros and Wei K Tsai TECHNICAL REPORT AN OPTIMAL DISTRIUTED PROTOCOL FOR FAST CONVERGENCE TO MAXMIN RATE ALLOCATION Jord Ros and We K Tsa Department of Electrcal and Computer Engneerng Unversty of Calforna, Irvne 1 AN OPTIMAL

More information

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION 24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Computer models of motion: Iterative calculations

Computer models of motion: Iterative calculations Computer models o moton: Iteratve calculatons OBJECTIVES In ths actvty you wll learn how to: Create 3D box objects Update the poston o an object teratvely (repeatedly) to anmate ts moton Update the momentum

More information

Using Memory and Random Sampling for Load Balancing in High-radix Switches

Using Memory and Random Sampling for Load Balancing in High-radix Switches Unversty of Toronto SNL Techncal Report TR-SN-UT-7--2. c Soudeh Ghorban Khaled et al. Usng Memory and Random Samplng for Load Balancng n Hgh-radx Swtches Soudeh Ghorban Khaled, Yashar Ganjal Department

More information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

Reclaiming the Brain: Useful OpenFlow Functions in the Data Plane

Reclaiming the Brain: Useful OpenFlow Functions in the Data Plane Reclamng the Bran: Useful OpenFlow Functons n the Data Plane Lron chff (Tel Avv Un, Israel) Mchael Borokhovch (UT Austn, Unted tates) tefan chmd (TU Berln & T-Labs, Germany) My Talk n One lde eparaton

More information

On Achieving Fairness in the Joint Allocation of Buffer and Bandwidth Resources: Principles and Algorithms

On Achieving Fairness in the Joint Allocation of Buffer and Bandwidth Resources: Principles and Algorithms On Achevng Farness n the Jont Allocaton of Buffer and Bandwdth Resources: Prncples and Algorthms Yunka Zhou and Harsh Sethu (correspondng author) Abstract Farness n network traffc management can mprove

More information

Active Contours/Snakes

Active Contours/Snakes Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

AADL : about scheduling analysis

AADL : about scheduling analysis AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng

More information

Response-Time Guarantees in ATM Networks

Response-Time Guarantees in ATM Networks Response-Tme Guarantees n ATM Networks Andreas Ermedahl Hans Hansson Mkael Sjödn Department of Computer Systems Uppsala Unversty Sweden E-mal: febbe,hansh,mcg@docs.uu.se Abstract We present a method for

More information