CS计算机代考程序代写 python Java flex distributed system Week 1-introduction 5416

Week 1-introduction 5416

Advanced Network Technologies
Introduction

Dr. Wei Bao | Lecturer
School of Computer Science

COMP 5416

› Title: Advanced Network Technologies
› UOS code: COMP5416
› Credit point: 6

– Wednesday 18:00-20:00, weeks 1-13
– Online

› Lab/Tutorial:
– Wednesday 20:00-21:00, weeks 1-13, starting from today
– Thursday 17:00-18:00, weeks 1-13

– Sydney time by default
– Note your time zone, especially ADST/AEST change in October.
– Online

People

› Wei Bao, Coordinator and Lecturer

– Weeks 1-13

– Office: J12-4W-425
– Phone: (02) 8627 4865

– wei. .au
– https://www.sydney.edu.au/engineering/about/our-people/academic-staff/wei-bao.html

– Office hour: By appointment, through Zoom
– Clearly note COMP5416 in the email title when you contact me

› Background

– Research: Networking, Mobile Computing, Internet of Things, Distributed Systems.

– Research Group: Centre for Distributed and High Performance Computing
(http://sydney.edu.au/distributed_computing/)

– University of Toronto

mailto:wei. .au
https://www.sydney.edu.au/engineering/about/our-people/academic-staff/wei-bao.html
http://sydney.edu.au/distributed_computing/

People

› Zhengjie Yang, Tutor

– Weeks 1-13

– Office: J12-West Wing
– zhengjie. .au
– Office hour: by appointment, through Zoom

› Background

– Research: Networking, mobile computing, distributed machine learning.

– 4-year experience in tutoring this UoS
› Da Xie, Tutor

– Weeks 1-13

– Office: J12-West Wing
– .edu.au
– Office hour: by appointment, through Zoom

Emergency procedures (on campus)

– In the unlikely event of an emergency we may need to
evacuate the building.

– If we need to evacuate, we will ask you to take your
belongings and follow the green exit signs .

– We will move a safe distance from the building and maintain
physical distancing whilst waiting until the emergency is over.

– In some circumstances, we might be asked to remain inside the
building for our own safety. We call this a lockdown or shelter-
in-place.

– Further information is available at
www.sydney.edu.au/emergency

http://www.sydney.edu.au/emergency

Keeping our community safe
We can all help reduce the spread of COVID-19 through following
good hygiene practices:

– Wash hands regularly, for at least 20 seconds with soap and
water, or use an alcohol-based hand rub.

– Cover your mouth when coughing and sneezing with a tissue
or a flexed elbow.

– Maintain a distance of at least 1.5m between yourself and
others, where possible.

– Avoid large gatherings, where possible.
– Avoid close contact with anyone with cold or flu symptoms,

e.g. fever, cough, runny nose or shortness of breath.

Keeping our community safe

– All students and staff who have cold or flu symptoms should
isolate themselves from others.

– If you are unwell with cold or flu symptoms please excuse
yourself from this class and we will support you to continue
the work remotely.

– Make sure you read the information on special consideration
in the unit outline.

Keeping our community safe

– The University is following advice from the government and
related public health authorities.

– For the latest information, see the advice on the University
website.

– In some classes, especially those involving use of shared
equipment, please follow additional advice from your
coordinators.

– Please take care of each other and yourselves and if you need
support reach out to your unit coordinator or the health and
wellbeing area of the Current Students website.

https://sydney.edu.au/study/coronavirus-infection-university-of-sydney-advice.html
https://sydney.edu.au/students/health-wellbeing.html

Tips for students joining online

– Remember that you are still in a space with other students.
– Mute your microphone when not speaking.
– Use earphones or headphones – the mic is better and you’ll

disturb others less.
– If you have a webcam, please switch it on so we can see you!
– If you are speaking to the camera, make eye contact with the

camera (and therefore your classmates and teacher).
– Try not to talk over someone else.
– Use the chat function to send messages to the teacher or

classmates during class.

Tips for students learning online

– For tips and guides on learning online and the tools you will use, refer to Learning
while off campus resources in Canvas.

https://canvas.sydney.edu.au/courses/4901/pages/learning-while-off-campus

Resources

Canvas: https://canvas.sydney.edu.au/
Login using Unikey and password
Link to Units website: https://sydney.edu.au/units/

Official schedule, list of learning outcomes, etc
Copies of slides
Lab instructions
Assignment instructions
Lecture videos

We intend to record the lectures, but the technology is not reliable
Submit official assignment work here;
see your grades; etc

https://canvas.sydney.edu.au/
https://sydney.edu.au/units/

Textbook and material

Computer Networking: ATopDown Approach 6th or 7th edition, Jim
Kurose and Keith Ross,

Some of the information on the slides of this course is taken from the
companion material of this textbook that is subject to copyright 1996-2012,
J.F Kurose and K.W. Ross, All Rights Reserved.

Expectations

Ø Students attend scheduled classes, and devote an extra 6-9 hrs per week
Ø doing assessments
Ø preparing and reviewing for classes
Ø revising and integrating the ideas
Ø practice and self-assess

Ø Students are responsible learners
Ø Participate in classes, constructively

Ø Respect for one another (criticize ideas, not people)
Ø Humility: none of us knows it all; each of us knows valuable things

Ø Check canvas site at least once a week!
Ø Notify academics whenever there are difficulties

Evaluation

› W6: Assignment 1, 20%
Covers W1—W6

› W12: Assignment 2, 20%

Covers W6—W12
› Exam period: Final exam, 60%

Covers everything

› School of CS policy: you must get at least 40% of the marks available on
the exam, in order to pass the unit. (40% barrier on exam, less than 40% in
the exam is automatically a FAIL.)

Special Consideration (University policy)

Ø If your performance on assessments is affected by illness or misadventure

Ø Follow proper bureaucratic procedures

Ø Have professional practitioner sign special USyd form

Ø Submit application for special consideration online, upload scans

Ø Note you have only a quite short deadline for applying

Ø http://sydney.edu.au/current_students/special_consideration/

Ø Also, notify coordinator by email as soon as anything begins to go wrong

Ø There is a similar process if you need special arrangements eg for religious
observance, military service, representative sports

http://sydney.edu.au/current_students/special_consideration/

Late assessments

Ø Suppose you hand in work after the deadline:

Ø Penalty of 5% per day late, e.g.:

Ø A good assignment that would normally get 9/10 and is 2 days late loses 10%
of the full 10 marks, i.e. new mark = 8/10

Ø An average assignment that would normally get 5/10 and is 5 days late loses
25% of the full 10 marks, i.e. new mark = 2.5/10

Ø Assignments more than 10 days late get 0.

Ø Warning: submission sites get very slow near deadlines.

Ø You can resubmit if there is time before the deadline. Only the latest version will be
marked.

Academic Integrity (University policy)

Ø “The University of Sydney is unequivocally opposed to, and intolerant of,
plagiarism and academic dishonesty.

Ø Academic dishonesty means seeking to obtain or obtaining academic
advantage for oneself or for others (including in the assessment or publication
of work) by dishonest or unfair means.

Ø Plagiarism means presenting another person’s work as one’s own work by
presenting, copying or reproducing it without appropriate acknowledgement of
the source.” [from site below]

Ø http://sydney.edu.au/elearning/student/EI/index.shtml

Ø Submitted work is compared against other work (from students, the internet etc)

Ø Turnitin

Ø Penalties for academic dishonesty or plagiarism can be severe

Ø Complete self-education AHEM1001

http://sydney.edu.au/elearning/student/EI/index.shtml

DISABILITY SERVICES

Do you have a disability?

You may not think of yourself as having a ‘disability’ but the definition under the
Disability Discrimination Act is broad and includes temporary or chronic medical
conditions, physical or sensory disabilities, psychological conditions and learning
disabilities.
The types of disabilities we see include:
anxiety, arthritis, asthma, asperger’s disorder, ADHD, bipolar disorder, broken bones, cancer, cerebral palsy, chronic
fatigue syndrome, crohn’s disease, cystic fibrosis, depression, diabetes, dyslexia, epilepsy, hearing impairment, learning
disability, mobility impairment, multiple sclerosis, post traumatic stress, schizophrenia , vision impairment, and much
more.

Students needing assistance must register with Disability Services –
it is advisable to do this as early as possible.

http://sydney.edu.au/study/academic-support/disability-support.html

http://sydney.edu.au/study/academic-support/disability-support.html

Other support

Learning support
http://sydney.edu.au/study/academic-support/learning-support.html

International students
http://sydney.edu.au/study/academic-support/support-for-international-students.html

Aboriginal and Torres Strait Islanders
http://sydney.edu.au/study/academic-support/aboriginal-and-torres-strait-islander-
support.html

Student organization (can represent you in academic appeals etc)
http://srcusyd.net.au/ or http://www.supra.net.au/

Please make contact, and get help
You are not required to tell anyone else about this
If you are willing to inform the unit coordinator, they may be able to work with other
support to reduce the impact on this unit

eg provide advice on which tasks are most significant

http://sydney.edu.au/study/academic-support/learning-support.html
http://sydney.edu.au/study/academic-support/support-for-international-students.html
http://sydney.edu.au/study/academic-support/aboriginal-and-torres-strait-islander-support.html

Home page

Home

Advice

Metacognition
Pay attention to the learning outcomes
Self-check that you are achieving each one
Think how each assessment task relates to these

Time management
Watch the due dates
Start work early, submit early

Networking and community-formation
Make friends and discuss ideas with them
Know your tutor, lecturer, coordinator
Keep them informed, especially if you fall behind

Don’t wait to get help
Enjoy the learning!

https://www.sydney.edu.au/units/COMP5416

Syllabus

1.Introduction, Network overview
2.Network performance, Application layer 1
3.Application 2
4.Transport 1
5.Transport 2
6.Network science: queues
7.Multimedia network 1
8.Multimedia network 2
9.Wireless and Mobile 1
10.Wireless and Mobile 2
11.Advance Network Protocols
12.Network science: Network optimization*
13.Recent advances in Network*, Review

1.Basic network performance analysis
2.Wireshark, HTTP packet sniffing
3.Python socket programming
4.Math foundations for network analysis
5.Transport layer and TCP
6.Network and queue simulator
7.Multimedia network
8.Real-time protocol
9.Scheduling and Queues
10.Network programming
11.Wireless and noise
12.Internet of Things Experiment
13.T: Review and Q&A

Goals

Facts/Knowledge

› How is information transported?

› How to make communications efficient?

› Why does it work in this way? (Differentiate this unit from basic-level units.)

Theory
› Tutorials: Use math to solve problems
› Why is math important?
Practice

› Labs: will require programming

› All programming will be done in Python (version 3.X)

You should be fine if you know Java/C

› Wireshark experiment

Layered Network

ISO/OSI model

› ISO: International Organization for Standardization

› OSI: Open Systems Interconnection

application
presentation

session
transport
network

link
physical

Network Layers

application
presentation

session
transport
network

link
physical

application

transport
network

link
physical

ISO/OSI model textbook

application

transport
network

link

Other textbooks

process

transport
internetwork

/Internet

network interface

hardware

Other names

Network Layers

Physical

How to organize data transfer among
adjacent network nodes?

How to transfer bits from one device to another?

Link

How to send message to non-adjacent nodes? Network

How to provide end-to-end connections for programs
running at different devices in the network?

How to provide network applications satisfies users?

Transport

Application

Physical Layer

Role: Transmitting raw bits over a physical link connecting network nodes.

http://www.eetimes.com/document.asp?doc_id=1276305

Link Layer

Role: data transfer between neighboring network elements.

Bit error detection:
Sender 010101, receiver 010100

Medium access control:
Two devices talking at the same time?

Link-layer addressing:
This information is for you.

Network Layer

Role: routing and forwarding packets from (every) source to (every) destination

Transport Layer

Role: manage program-program (process-process) data transfer

Application Layer

Role: support network applications

Video/Audio

Over TCP/UDP

network support for multimedia

Preview: Practice

application

transport

network

link

physical

HTTP, FTP, SMTP, DNS, P2P…

Wireless
network

TCP, UDP, Transport Protocol

Max min fairness

Preview: Theory

application

transport

network

link

physical

Network
Optimization

Queueing Theory

Principles
of

CDMA

Example:
Game Theory

Socket programming

Preview: Programming/Experiment

application

transport

network

link

physical

Wireshark

Queue simulator

Socket

Network analysis example

Two users competing for one channel

User 1

User 2

Two users competing for one channel

User 1

User 2

A collision happens! No one is successful!

Two users competing for one channel

Situations User 1’s
benefit

User 2’s
benefit

1 off, 2 off 0 0
1 on, 2 off 10 0
1 off, 2 on 0 10
1 on, 2 on -5 -5

Two users competing for one channel

Situations User 1’s
benefit

User 2’s
benefit

1 off, 2 off 0 0
1 on, 2 off 10 0
1 off, 2 on 0 10
1 on, 2 on -5 -5

In cellular network, for example, we can schedule 1 and 2 in a fair way.

In many other situations? Selfish users.

Two users competing for one channel

Situations User 1’s
benefit

User 2’s
benefit

1 off, 2 off 0 0
1 on, 2 off 10 0
1 off, 2 on 0 10
1 on, 2 on -5 -5

Solution: Game Theory!

Mathematical models of conflict and cooperation between
intelligent rational decision-makers!

Useful to solve many economical problems!

Also useful to analyse computer networks and the Internet!

Prisoner’s dilemma

Two members of a criminal gang are arrested

Each prisoner has no means of
communicating with the other

Each prisoner can:
1 confess
2 keep silent

Prisoner’s dilemma

Result

Both confess: both serve 5 years in prison

Both keep silent: both serve 1 year in prison

A confesses, B keeps silent (vice versa):
A is set free
B serves 10 years in prison

Prisoner’s dilemma

A’s decision

(A, B) utility

B’s decision

Confess Keep silent

Confess (-5,-5) (-10,0)

Keep silent (0,-10) (-1,-1)

Nash Equilibrium

A’s decision

(A, B) utility

B’s decision

Confess Keep silent

Confess (-5,-5) (-10,0)

Keep silent (0,-10) (-1,-1)

The tuple satisfies: no player has anything to gain by
changing only his own strategy

Nash Equilibrium

A’s decision

(A, B) utility

B’s decision

Confess Keep silent

Confess (-5,-5) (-10,0)

Keep silent (0,-10) (-1,-1)

The tuple satisfies: no player has anything to gain by
changing only his own strategy

A changes his/decision, loss

Nash Equilibrium

A’s decision

(A, B) utility

B’s decision

Confess Keep silent

Confess (-5,-5) (-10,0)

Keep silent (0,-10) (-1,-1)

The tuple satisfies: no player has anything to gain by
changing only his own strategy

B changes his/decision, loss

Nash Equilibrium

A’s decision

(A, B) utility

B’s decision

Confess Keep silent

Confess (-5,-5) (-10,0)

Keep silent (0,-10) (-1,-1)

The tuple satisfies: no player has anything to gain by
changing only his own strategy

Not a Nash
Equilibrium !

Back to our problem

User 1

User 2

Back to our problem

1’s decision

(1, 2) utility

2’s decision

Transmit Keep silent

Transmit (-5,-5) (0,10)

Keep silent (10,0) (0,0)

Nash Equilibrium?

Back to our problem

1’s decision

(1, 2) utility

2’s decision

Transmit Keep silent

Transmit (-5,-5) (0,10)

Keep silent (10,0) (0,0)

Two Nash Equilibria

Back to our problem

1’s decision

(1, 2) utility

2’s decision

Transmit Keep silent

Transmit (-5,-5) (0,10)

Keep silent (10,0) (0,0)

Two Nash Equilibria

Pure and mix strategy

This is still not ideal.
Solution: mixed strategy.
Each player can make probabilistic decision!
User 1: transmit with probability p1

keep silent with probability (1-p1)
User 2: transmit with probability p2

keep silent with probability (1-p2)

Back to our problem

1’s decision

(1, 2) utility

2’s decision

Transmit Keep silent

Transmit (-5,-5) (0,10)

Keep silent (10,0) (0,0)

p1*p2 (1-p1)*p2

p1*(1-p2) (1-p1)*(1-p2)

-5*p1*p2+10*p1*(1-p2)+0*(1-p1)*p2+0*(1-p1)*(1-p2)
= -5*p1*p2+10*p1*(1-p2)

So what?

Let’s try p2=2/3
User 1’s average utility
-5*p1*p2+10*p1*(1-p2)
=-5*p1*2/3+10*p1*1/3
=0
No matter how to change p1, user 1’s utility is 0

Similarly
If p1=2/3
No matter how to change p2, user 1’s utility is 0

So what?

p1=p2=2/3 is a Nash Equilibrium
Why?
User 1’s average utility
If p2=2/3
No matter how to change p1, user 1’s utility is 0
If p1=2/3
No matter how to change p2, user 1’s utility is 0

What happens if users are cooperative?

If the users are not selfish,

p1=p2=1/3 is the optimal solution
User 1’s average utility is 5/3
User 2’s average utility is 5/3

Network performance in summery

Situations Solution Utility
Selfish users p1=2/3,

p2=2/3
(0,0)

Cooperative
users

p1=1/3
p2=1/3

(5/3,5/3)

Delays

Delay

Four sources of packet delay

dproc: nodal processing

§ check bit errors
§ determine output link
§ typically < msec A B propagation transmission nodal processing queueing dqueue: queueing delay § time waiting at output link for transmission § depends on congestion level of router dnodal = dproc + dqueue + dtrans + dprop Delay Four sources of packet delay dtrans: transmission delay: § L: packet length (bits) § R: link bandwidth (bps) § dtrans = L/R dprop: propagation delay: § d: length of physical link § s: propagation speed in medium (~2x108 m/sec) § dprop = d/sdtrans and dprop very different propagation nodal processing queueing dnodal = dproc + dqueue + dtrans + dprop A B transmission Transmission Delay and Propagation Delay bit 1 trans t t bit 2 trans bit N trans …… sender receiver bit1 arrives bit2 arrives Bit N arrives Transmission delay Propagation delay Overall delay Store and Forward Store-and-forward › takes L/R seconds to transmit (push out) L-bit packet into link at R bps › store and forward: entire packet must arrive at router before it can be transmitted on next link › end-end delay: 2 L/R (assuming zero propagation delay) › one-hop numerical example: - L = 7.5 Mbits - R = 1.5 Mbps - delay = 5 sec source R bps destination 123 L bits per packet R bps Queueing delay › R: link bandwidth (bps) › L: packet length (bits) › a: average packet arrival rate traffic intensity = La/R v La/R ~ 0: avg. queueing delay small v La/R <~ 1: avg. queueing delay large v La/R > 1: more “work” arriving

than can be serviced, average delay infinite!

La/R ~ 0

La/R <~ 1 A Brief Discussion on Queueing Theory Server Queue Properties of a Queue › Job arrival › Job service time › Number of servers › Queue size › Service disciplines Properties of a Queue › Job arrival - Poisson process - Number of arrivals in [0, t): N(t) - Distribution of N(t) - Mean: E(N(t))= λt - Arrival rate λ Properties of a Queue › Job service time - Exponential distribution, with mean of 1/μ - PDF: probability density function μ e−μx - CDF: Cumulative distribution function 1 − e−μx - Mean: 1/μ - Can serve μ jobs per unit time. - Service rate: μ Properties of a Queue › Number of servers - 1 › Queue size - Infinity › Service disciplines - First in first served Properties of a Queue › Conclusions › Mean waiting time › 1/(μ- λ) › Derivation will be shown later.