1 The Internet: Co-Evolution of Technology and Society CPSC 156b, Spring 2007 Time: Tu & Th, 2:30-3:45 pm Room: ML 221 Distribution Group: IV Not QR or.

Slides:



Advertisements
Similar presentations
Chapter 1 Introduction. Protocol Protocol (New Oxford American Dictionary): The official procedure or system of rules governing affairs of state or diplomatic.
Advertisements

1 Computational Complexity CPSC 468/568, Fall 2008 Time: Tu & Th, 1:00-2:15 pm Room: AKW 500 Satisfies the QR requirement.
1 Internet History, Architecture, and Routing ECON 425/563 & CPSC 455/555 9/25/2008 ECON 425/563 & CPSC 455/555 9/25/2008.
E-Commerce: Doing Business on the Internet CPSC 155b, Spring 2003 T, Th: 1-2:15 pm (The Co-Evolution of Technology.
CS155b: E-Commerce Lecture 3: Jan 16, 2001 How Does the Internet Work? Acknowledgements: S. Bradner and R. Wang.
ST-CS19995: Introduction to Web Interface Design Prof. Angela Guercio Spring 2008.
CS155b: E-Commerce Lecture 2: Jan. 16, 2003 How Does the Internet Work? Acknowledgements: S. Bradner and R. Wang.
E-Commerce: Doing Business on the Internet CPSC 155a, Fall 2001 T, Th: 1-2:15 pm, Room DL 220 (The Co-Evolution of.
CIS 3200 Networking Fundamentals Abdou Illia, Ph.D School of Business Eastern Illinois University (Week 1, Tuesday 1/09/2007)
Introduction to the Internet How did the Internet start? Why was the Internet developed? How does Internet handle the traffic? Why WWW changed the Internet.
EE 4272Spring, 2003 EE4272: Computer Networks Instructor: Tricia Chigan Dept.: Elec. & Comp. Eng. Spring, 2003.
11 Economics and Computation Econ 425/563 and CPSC 455/555, Fall 2008 Time: Tu & Th, 2:30-3:45 pm Room: BCT 102
CS – 600 Introduction to Computer Science Prof. Angela Guercio Spring 2008.
CPSC156a: The Internet Co-Evolution of Technology and Society Lecture 2: September 9, 2003 Internet Basics Acknowledgments: S. Bradner and R. Wang.
1 Computational Complexity CPSC 468/568, Fall 2007 Time: Tu & Th, 1:00-2:15 pm Room: AKW 200 Dist. Group: IV (not Natural Sci.) Satisfies “QR”
1 Computational Complexity CPSC 468b, Spring 2007 Time: Tu & Th, 1:00-2:15 pm Room: AKW 500 Dist. Group: IV (not Natural Sci.) Satisfies “QR”
Review on Networking Technologies Linda Wu (CMPT )
1 Computational Complexity CPSC 468/568, Fall 2009 Time: Tu & Th, 2:30-3:45 pm Room: AKW 307 Satisfies the QR requirement.
Spring 2010, ICE Stephen Kim, Ph.D.. March 3 rd – June 11 th, 2010 Wednesday and Friday 1:30-2:45 pm Room
EE 104: Introduction to Communications Professor Andrea Goldsmith.
E-Commerce: Doing Business on the Internet CPSC 155b, Spring 2001 T, Th: 1-2:15 pm, Room DL220
CPSC 100 – Personal Computers & Their Uses Fall 2010 Dongsheng Che Department of Computer Science East Stroudsburg University.
Lecture 1, 1Spring 2003, COM1337/3501Computer Communication Networks Rajmohan Rajaraman COM1337/3501 Textbook: Computer Networks: A Systems Approach, L.
15-1 More Chapter 15 Goals Compare and contrast various technologies for home Internet connections Explain packet switching Describe the basic roles of.
CSE 1111 Week 1 CSE 1111 Introduction to Computer Science and Engineering.
Welcome to the Course CPSC 5155 Computer Architecture Edward Bosworth, Ph.D. Associate Professor Computer Science.
CHEMISTRY 10123/10125 Spring 2007 Instructor: Professor Tracy Hanna Phone: Office: SWR 418
1 Internet Protocol: Forwarding IP Datagrams Chapter 7.
CS448 Computer Networking Chapter 1 Introduction to Computer Networks Instructor: Li Ma Office: NBC 126 Phone: (713)
ST-CS Introduction to Web Interface Design Fall 2010 Dr. Angela Guercio ( Course Web.
1 COMS 161 Introduction to Computing Title: Course Introduction Date: August 25, 2004 Lecture Number: 1.
Syllabus and Class Policies MATH 130: Summer 2014.
Course info1 1 st Semester 2007 MI305 Computer Networks  Instructor: Jen-Liang Cheng   Office: H501-1( 福田樓 )  Lectures:
James Tam CPSC 203: Introduction To Computers (Independent Study) James Tam.
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
Lecturer:Prof. Elizabeth A. Ritchie, ATMO TAs:Mr. Adrian Barnard Ms. Anita Annamalai NATS 101 Introduction to Weather and Climate Section 14: T/R 2:00.
Fall 2004FSU CIS 5930 Internet Protocols1 Welcome to CIS 5930 Internet Protocols Time: 5:15PM-6:30PM, TTh Location: Love 301 Fall 2004, 3 credits.
MIS 300: Introduction to Management Information Systems Yong Choi School of Business Administration CSU, Bakersfield.
Welcome to CS 101! Introduction to Computers Spring 2015 This slide is based on Dr. Keen slides for CS101 day sections, with some modifications.
Network Architecture: Design Philosophies IS250 Spring 2010 John Chuang
CPSC 411 Tutorial TA: Fang Wang. Fang Wang 9:00am-5:00pm, Mon-Fri.
Principles of Financial Accounting I Fall Semester 2007 Orientation Welcome – We are glad you are here! Let’s look at the syllabus for this course.
ECE 1100: Introduction to Electrical and Computer Engineering Wanda Wosik Associate Professor, ECE Dept. Notes 1 Spring 2011 Slides adapted from lectures.
CSE 1340 Introduction to Computing Concepts Class 1 ~ Intro.
Programming In Perl CSCI-2230 Thursday, 2pm-3:50pm Paul Lalli - Instructor.
1 Lecture # 21 Evolution of Internet. 2 Circuit switching network This allows the communication circuits to be shared among users. E.g. Telephone exchange.
Advanced Microsoft Office Applications Online Course – Lessons Learned.
Communication Networks - Overview CSE 3213 – Fall November 2015.
IST 210: Organization of Data
Syllabus. Instructor Dr. Hanan Lutfiyya Middlesex College 418 Ext Office Hours: Wednesday 5-6; Thursdays 4-6 or by appointment.
1 Introduction to Data Communication Networks ISQS 3349, Spring 2001 Instructor: Zhangxi Lin Office: BA 708 Phone: Homepage:
CS Introduction to Computer Science Spring 2011 Dr. Angela Guercio (
1 CDA 4527 Computer Communication Networking (not “analysis”) Prof. Cliff Zou School of Electrical Engineering and Computer Science University of Central.
Welcome to CS 101! Introduction to Computers Fall 2015.
1 Introduction to Data Communication Networks ISQS 3349, Spring 2000 Instructor: Zhangxi Lin Office: BA 708 Phone: Homepage:
Computer Science, FSU1 CNT5505 DATA/COMUTER COMMUNICATIONS Fall 2010.
The Internet: Co-Evolution of Technology and Society CPSC 156a, Fall 2003 Time: Tues & Thurs, 1-2:15 pm Room: DL 220
1 CNT 4704 Analysis of Computer Communication Networks Cliff Zou Department of Electrical Engineering and Computer Science University of Central Florida.
1 Transport Layer: Basics Outline Intro to transport UDP Congestion control basics.
CSE 1340 Introduction to Computing Concepts Class 1 ~ Intro.
MAT 279 Data Communication and the Internet Prof. Shamik Sengupta Office 4210 N Fall 2010.
IST 210: ORGANIZATION OF DATA Introduction IST210 1.
CS Computer Architecture Fall 2010 Dr. Angela Guercio ( Course Web Page
CSE 486/586, Spring 2013 CSE 486/586 Distributed Systems The Internet in 2 Hours: The First Hour Steve Ko Computer Sciences and Engineering University.
The Design Philosophy of the DARPA Internet Protocols [Clark 1988] Nick McKeown CS244 Lecture 2.
Course Overview 1 MAT 279 Data Communication and the Internet Prof. Shamik Sengupta Office 4210 N
ECE 6610: Wireless Networks
Database Design and Implementation
Practical Issues for Commercial Networks
COMS 161 Introduction to Computing
Presentation transcript:

1 The Internet: Co-Evolution of Technology and Society CPSC 156b, Spring 2007 Time: Tu & Th, 2:30-3:45 pm Room: ML 221 Distribution Group: IV Not QR or Natural Science

2 Partial Topic Outline Internet architecture and design philosophy Internet-based business Internet security –User privacy –Online identity –Viruses, spam, DoS attacks, etc. Digital copyright

3 Schedule Feb. 1: First HW Assignment Due Feb. 13: Second HW Assignment Due Feb. 22: Third HW Assignment Due Mar. 1: First In-Class Exam Mar. 6: Grades on HW1, HW2, HW3, and Ex1 will be returned to students today or earlier. Mar. 9: Drop Date Apr. 10: Fourth HW Assignment Due Apr. 19: Fifth HW Assignment Due Apr. 26: Second In-Class Exam

4 Requirements Modest reading assignments 5 Written HW Assignments, 4 of which will each be worth 15% of the course grade and one of which will be worth 10% of the course grade 2 In-Class Exams, each worth 15% of the course grade No final exam during exam week

5 Rules and Guidelines Deadlines are firm. Dean’s excuses are needed for all make-up exams or late homeworks. Hand them in promptly. You are responsible for all content of lectures and the class webpage. No “collaboration” on homeworks unless you are told otherwise. Pick up your graded homeworks and exams promptly, and tell the TA immediately if one is missing. Students who have previously taken CPSC155 may not take CPSC156 for credit but may audit it.

6 Instructor: Joan Feigenbaum Office: AKW 512 Office Hours: Tuesday 4-5 pm Thursday 9-10 am Phone: Assistant: Judi Paige , AKW 507a, 9am-2pm M-F) Note: Do not send to Professor Feigenbaum, who suffers from RSI. Contact her through Ms. Paige or the TA.

7 TA: Richard Alimi Office: AKW 303 Office Hours: Wednesday 11 am – 1 pm or by appointment Phone:

8 Sample Notes and Reading If you are undecided, see: “Rethinking the design of the Internet: The end-to-end arguments vs. the brave new world,” by Clark and Blumenthal “Commons-based Peer Production and Virtue,” by Benkler and Nissenbaum Pointers to these three items are in the “Schedule and Assignments” section of the CPSC156b class website.

9 Questions?

10 Internet History Late 1960s and early 1970s: ARPANET –US Department of Defense –Connects small ARPA-sponsored data networks –Ground breaking testbed for network ideas and designs Early 1980s: Other wide-area data networks are established (e.g., BITNET and Usenet). Late 1980s and early 1990s: –“ARPANET” fades out. –US Gov’t sponsors NSFNET, which connects large regional networks. –Commercial data networks become popular (e.g., Prodigy, Compuserve, and AOL). Mid-1990s: Unified “Internet”

11 Internet Protocols Design Philosophy Ordered set of goals: 1. multiplexed utilization of existing networks 2. survivability in the face of failure 3. support multiple types of communications service 4. accommodate a variety of network types 5. permit distributed management of resources 6. cost effective 7. low effort to attach a host 8. account for resources Not all goals have been met

12 Packets! Basic decision: use packets not circuits (Kleinrock) Packet (a.k.a. datagram) –self contained –handled independently of preceding or following packets –contains destination and source internetwork address –may contain processing hints (e.g., QoS tag) –no delivery guarantees –net may drop, duplicate, or deliver out of order –reliability (where needed) done at higher levels Dest Addr Src Addr payload

13 Telephone Network Connection-based Admission control Intelligence is “in the network” Traffic carried by relatively few, “well-known” communications companies Internet Packet-based Best effort Intelligence is “at the endpoints” Traffic carried by many routers, operated by a changing set of “unknown” parties

14 Technology Advances <0.1<=110sUsers/Machine 46416Address Bits 4,000,00040Gb/s9600b/sNetwork B/W 75,000750GB10MBDisk Capacity 30,0004GB128KBDRAM Capacity 5,000,000$0.02$100K$/MIPS 50, MIPS Factor Expensive machines, cheap humans Cheap machines, expensive humans (Almost) free machines, really expensive humans, and communities

15 The Network is the Computer Relentless decentralization –“Smaller, cheaper, more numerous” mainframe  mini  PC  palms  ubiquitous/embedded –More computers  more data communication (Shifting) reasons computers talk to each other –Efficient sharing of machine resources –Sharing of data –Parallel computing –Human communication

16 The Network is the computer (continued) Networks are everywhere and they are converging. –SAN, LAN, MAN, WAN –All converging towards a similar technology –Sensor nets New chapter of every aspect of computer science –Re-examine virtually all the issues in the context of distributed systems or parallel systems This is only the beginning.

17 Discussion Point Ubiquitous computers and networks More data communication begets more human communication. “(Almost) free machines, really expensive humans” Are humans on a collision course with networks?