50 Pages

COMP424 Lecture 11

Course: LECTURE 424, Fall 2009
School: CSU Northridge
Rating:
 
 
 
 
 

Word Count: 2064

Document Preview

424 Lecture COMP 11 Designing Trusted Operating Systems Trust An operating system is trusted if we have confidence that it consistently and effectively provides: Memory protection File protection General object access control User authentication Policy Every system can be described by its requirements. This set of requirements is the "policy" of the system. This information is...

Register Now

Unformatted Document Excerpt

Coursehero >> California >> CSU Northridge >> LECTURE 424

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
424 Lecture COMP 11 Designing Trusted Operating Systems Trust An operating system is trusted if we have confidence that it consistently and effectively provides: Memory protection File protection General object access control User authentication Policy Every system can be described by its requirements. This set of requirements is the "policy" of the system. This information is used as a basis for whether or not the system is performing as intended. E.g. Files must be accessible by only the owner Must support simultaneous usage. Must not allow passwords to be compromised remotely. Model Models are designed as a means to achieve the specifications of the policy. Different models can be compared and evaluated as to which satisfys the policy requirements best. Design Once a model has been selected, designs choose a method for implementing the model. A design includes both of the concepts of "what is it supposed to do" (policy) and "how will it achieve it." Trust The level of confidence that we as consumers have that a particular systems satisfys the policy that we believe it should. Dichotomy of the term "Secure" The term secure reflects a dichotomy: Either something IS secure, or It is NOT. There is no middle ground If it is secure then it should withstand all attacks... now, in the future, and forever. Typically an unachievable standard. Quality The overall evaluation of how good something is. Security is only a single facet of measurement of quality. Other factors can be of more importanc than security. It is common to have high quality products that are not as secure as we would like. Trust Since tradeoffs may need to be made in order to obtain quality and it is unreasonable to guarantee "Security" most of the time... My security professionals prefer to speak in terms of "trust" rather than secure. Trust Not a dichotomy. Provides for a spetrum of "gray" areas. A characteristic that often grows (or decreases) over time in accordance with evidence and experience. Trust is an evaluation of the recipient of the product and not that of the presenter. Viewed in context of use. Security Policy A statement of the security we expect a system to enforce. Military usage: Broken down in to levels of sensitivity Unclassified Restricted Confidential Secret Top Secret Need To Know basis Access to information is restricted to only those individuals that require the knowledge to perform their duties. The decision as to whether somebody needs knowledge is controlled by higher authorities in the military context. Compartments In addition to grouping by security level information is group according to compartments. "Codenames" Access is granted to only those members that are associated with the compartment. Classification The combination of a security level and a compartment is designated as a "classification" Denoted by: <rank; compartments> where rank is the security level rank. Clearance is an indication that an individual is authorized to access information upto a certain level within a set of compartments. Domination Both people and security can be given a classification. (People appear not different than information then.) s<=o iff ranks <= ranko and comparmentso is a superset of compartmentss Used to limit access to only those individuals that dominated the object being accessed. Dominance demystified Basically in order to have access to information the following is required: The clearance level of the subject is at least as high as the object The subject has a needtoknow about all compartments to which the information is classified. This is equivalent to saying the subject dominates the object. Commercial Security Policies Usually less rigid and less heirarchical than military policies. Still have valid worries. Arguably subject to more crackers as more obvious targets. Seurity Levels Public: information than any one may have access to. May also include information that must be available to the public such as stock performance, insider trading and membership information. Proprietary: information that competitors should not be aware or the public does not need. Internal: information that should never be known outside of the company. Lack of Dominance Function The decisions as to who has access to what in a commercial environment is typically more fluid. Such decisions are made on the spot and the duration of the decision can be highly fluid. Thus, there is no well defined dominance function for more commericial security models. (Though your boss will think about "dominance" in less appeals terms) Integrity and availability Classification and heirarchies can be used to control confidentiality. Integrity and availability are of equal importance. Security Policies do a better job of securing these types of access. ClarkWilson Policy Security is established through the authorizations of transactions of transformation procedures. Security is modeled through the use of access triples: <userid, TPi,{CDIj, CDIk, ...}> The only way to modify data is to request a transformation procedure to carry out the operation. Separation of Duty A person with authority to perform multiple activities may be able to abuse the intended security. If you can issue goods, receive goods and also write checks then you can probably steal stuff. Separation of Duty limits the authority to perform actions and distributes the duties required to carry out a complicated task to separate individuals. Having limited abilities prevents abuse but also creates dependencies. Dependencies ClarkWilson triples are stateless. Actions performed by current transformation procedure does not require any knowledge or activity by a prior transformation. Separation of Duty can accomplish this. Usually through the use of dual signatures. Generally though distinctness is easily implemented if it is stated as a policy requirement. Chinese Wall Security Policy Focuses on commercial needs for information security. Especially for areas that deal with "conflict of interest" items. Information objects are grouped Into Company Groups then into Conflict classes. Company groups represent those objects that belong to the same company or organization. Groups belonging to the same conflict classes as those groups were knowledge of information from one group would conflict with knowledge from another group in the same conflict class Subjects are only granted access to objects as long as they have never accessed information from a different company group in the same conflict Thus class. only piece of knowledge can be gained and then access to all other (conflicting) knowledge is prohibited. Interesting because of its dynamic nature. At time T0 you have certain rights and at T1 your rightshave been dynamically altered as a result of your previous activities. Models Useful for Testing a particular policy for completeness and consistency Document a policy Help conceptualize and design an implementation Check whether requirements have been met. Lattice model A mathematical model A collection of elements organized by a relation among them. Requires transitive and antisymetric properties Represents natural increasing degrees of sensitivity. (dominance function) Military Classification Policy is a lattice model. BellLa Padula Confidentiality Used to prevent simultaneous access to information of differing levels of sensitivity. A computer may need to process both topsecret information at the same time it is handling Classified data as well. There are two properties defined for this model: BellLa Padula Properties Simple security property: A subject s may have read access to an object o only if C(o) <= C(s). Where C() is the clearance of some object or subject. *property: A subject s who has read access to an object o may have write access to object p only if C(o)<=C(p). Deals with disclosure of information but doesn't explicitly handle integrity. Biba Integrity Model Supplements BellLa Padula with: Simple Integrity Property: Subject s can modify object o obly if I(s)>=I(o) Integrity *property: If subject s has read access to object o with integrity level I(o), s can have write access to object p only if I(o)>=I(p) Prevents degradation of integrity through untrustworthy sources or information. Theoretical Models Used to establish the feasability of an approach Similar to turning machines and the computer science question of computability. If we pose a question we want to be able to know if we will ever be able to decide the answer. GrahamDenning Model Model consists of Subjects S Object O Rights R Access control matric A Eight primitive protection rights Create objects Create subject delete object Delete subject Read Access right Grant access right Delete access right Transfer access right HarrisonRuzzoUllman (HRU) Model is defined by a list of commands and an access control matrix Operations are limited to: Create subject s Create object o Destroy subject s Destroy object o Enter right r into A[s,o] Delete right r from A[s,o] Results of HSU Any policy that can be modelled as HRU exhibits the following two properties: If commands can be restricted to a single operation each then it is possible to determine whether a given subject can ever obtain a particular right to an object. If commands are not restricted to one operation then it is not always decidable whether a given protection system can confer a given right. TakeGrant Systems Only four primitave operations Create Revoke Take Grant Can be illustrated through the use of graphs. Assumes that if a subject can grant rights on an object that they will grant such rights. TakeGrant results Can we decide whether a given subject can share an object with another subject? Yes. We can. Can we decide whether a given subject can steal access to an object from another subject? Yes. We can. Operating systems control the interactions between subject and objects Because security appears in every aspect of the operating system the design and implementation of security components cannot be left vague or untested until the rest of the system is working. It is encredibly difficult to succesfully retrofit security abilities. Security Principles Least Privileges: only allow the minimum Economy of mechanism: keep it simple Open Design: avoid security through obscurity Complete mediation: check every access Permission based: deny by default Separation of privilege: multiple checks Least common mechanism: avoid sharing Ease of use: prote...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Illinois State - CHE - 232
Organic Chemistry 232Chapter 19 ReviewCarboxylic AcidsQuestions from Vollhardt &amp; Schore: All the QuestionsChapter 19 Overview:A) Carboxylic Acids I) Order of Precedence for Functional Group Nomenclature II) Nomenclature III) Physical Properti
CSU Northridge - LECTURE - 424
COMP424Lecture02SecurityGoals(Requirements)Whatmakesasecuresystem? FinancialSecurityrequirements Homesecurity Homelandsecurity Physicalsecurity ComputersecurityAlltheseconceptsofsecurityhavedifferent requirements.Weare,ofcourse,inter
CSU Northridge - COMP - 282
COMP 282Lecture 04Selection Sort selectionSort(Comparable[] theArray, int n) { int last = n-1; while (last &gt;= 1) { / Find largest item int largest = indexOfLargest(theArray,last+1); / swap largest with current last unsorted position Comparable te
CSU Northridge - COMP - 429
COMP429 Computer Network SoftwareSample Presentation: RIP and OSPFJeff Wiegley, Ph.D. Computer Science jeffw@csun.edu Revised: May 9, 20061Topics Definitions and Introduction. Routing Information Protocol (RIP) Participation and Operation B
N. Georgia - ACWARN - 7734
Mr. Hernandez World History ClassMultimedia Research Project RubricStudent Name: _Topic: _Date: _ SelfScore Teacher ScoreResearch Process:Gathered information from journals, books, CDs, and the internet Resources are current and reliable Ex
CSU Northridge - LECTURE - 424
COMP424Lecture07 VirusandothermalicouscodeHowVirusesAttach Appendedtootherprograms Surroundotherprograms Integrationwithotherprograms ReplacementVirusesthatAppend Easytoprogram Insertedbeforethenonmaliciouscode Viruscodeexecutedfirst
N. Georgia - ACWARN - 7734
Web-Based Lesson PlanLesson Plan Title: Developed by: Subject Area: Grade Level: Purpose of the Activity: Learning Objectives (include at least one Georgia QCC): Lesson URL(s): Equipment Needed: How will you accommodate students with special needs?
CSU Northridge - LECTURE - 424
COMP 424Computer Security Lecture 09 &amp; 10ProtocolAn orderly sequence of steps agreed upon by two or more parties in order to accomplish a task Characteristics of a good protocol Established in advance All parties agree on it Easy to
CSU Northridge - LECTURE - 424
COMP424ComputerSecurity Lecture09&amp;10ProtocolAnorderlysequenceofstepsagreeduponbytwo ormorepartiesinordertoaccomplishatask Characteristicsofagoodprotocol Establishedinadvance Allpartiesagreeonit Easytounderstand Complete:coversallthatne
N. Georgia - ACWARN - 7734
Name: _The places you may goDraw a picture of yourself and one other person in a place that you would like to time travel to.Explain who you took with you and where you went. (4 sentences)
CSU Northridge - LECTURE - 424
COMP 424 Computer System SecurityLecture 01 Attacks, Goals and VulnerabilitiesAt one time Bank robbery was common. Now its very rare. What has changed or been implemented to provide this security? What do we mean by &quot;secure&quot;?Sophisticat
CSU Northridge - LECTURE - 424
COMP 424Lecture 04 Advanced Encryption Techniques (DES, AES, RSA)Secret Key SystemsA message M, encrypted with key K is K denoted as [M] . Decryption is done with the same key and K K denoted: [M] ] = M. The basic disadvantage to these syste
CSU Northridge - LECTURE - 424
Computer SecurityCOMP 424 Lecture week 6 Program SecurityProgram Security How do we keep programs free from flaws How do we protect resources against such flaws? Deals with the security aspects involved when writing programs. Chapter 5 will
CSU Northridge - LECTURE - 424
COMP424LectureWeek9 ProtectioninGeneralPurposeOperatingSystemsOperatingSystemsOperatingSystemsandDatabasespresent uniquechallengesinsecurity.DatabasesarecoveredinChapter7Modernoperatingsystems(andevensome oldersystems)aremultiuserand mu
N. Georgia - ACWARN - 7734
The 4 Seasons!By: Miss WarnerThe Fall Fall Starts September 21st School starts Leaves change colors Weather changes Halloween ThanksgivingWinter Winter starts December 21st It gets REALLY cold The trees are bare It could snow Christma
N. Georgia - ACWARN - 7734
Group Members_ _ _Group Project Lesson PlanLesson Plan Title: Developed by: Subject Area: Grade Level: Purpose of the Activity: Learning Objectives (include at least one Georgia QCC): Different Types of Weather Group members listed above Science 4
N. Georgia - ACWARN - 7734
Different types of weatherStudents Names: _ Group #: _ Date: _Component Worksheet was completed. All activities were completed at each station while following instructions Script was written for weather forecast by using research and teamwork. Wea
N. Georgia - ACWARN - 7734
WEATHER ACTIVITY SHEET &quot;Blizzards&quot;At this center you will go to the web site provided, and this one only, to find the answers to the following questions:Web Site: 1. http: / /eo.ucar.edu /webweather/blizzard2.html Questions: 1. What 3 things are ne
CSU Northridge - LECTURE - 429
COMP429 Computer Network SoftwareLecture 04: Address Resolution Protocol (ARP)Jeff Wiegley, Ph.D. Computer Science jeffw@csun.edu Revised: February 15, 20061IntroductionSo now we have the following: Ethernet network segments rely on a 48 bit
CSU Northridge - LECTURE - 424
COMP424Lecture04 AdvancedEncryptionTechniques (DES,AES,RSA)SecretKeySystemsAmessageM,encryptedwithkeyKisdenoted as[M]K. Decryptionisdonewiththesamekeyand denoted:[M]K]K=M. Thebasicdisadvantagetothesesystemsisa problemofcombinatorics.Publ
CSU Northridge - COMP - 282
COMP 282Lecture 03Algorithm Efficiency What is algorithm efficiency? Memory space costs How fast is the task completed* Cost to produce implementations Cost to maintain applications &quot;Method of solutions&quot; vs. programs Significant differenc
CSU Northridge - COMP - 282
COMP 282Lecture 05Merge Sort (pages 393-398) Void merge(Comparable[] theArray, int first, int mid, int last) { Comparable[] tempArray = new Comparable[last-first+1]; int f1 = first; int f2 = mid+1; int index = 0; while (f1&lt;=mid &amp; f2&lt;=last) if (th
CSU Northridge - COMP - 282
COMP282: Advanced Data StructuresLecture 02 COMP182 Review Basic Linear and Logarithmic Structures Arrays Linear Structures [O(n)]0 1 2 3 4 5 6 7 8 9 10 11 12Advantages:Easy to program / built-in to the language Space efficient* Support
CSU Northridge - COMP - 282
COMP 282Lecture 07 Binary Search TreesBinary Search Trees Properties:1. Nodes &quot;value&quot; is greater than all values in its left subtree. 2. Nodes &quot;value&quot; is less than ( ) all values in its right subtree 3. Both the left and right subtrees are also
CSU Northridge - COMP - 424
COMP424 Computer SecurityDesign PrinciplesaJeff Wiegley, Ph.D. Computer Science jeffw@csun.edu 08/29/2005a ByMatt Bishop, &quot;Computer Security&quot;1 The principle of least privilege states that a subject should be given only those privileges that
Virginia Tech - CS - 4234
peanut cashew acorn pecan chestnut macadamia brazilnut pistachio eureka lemon lime fig nectarine plum watermelon cantaloupe honeydew mango peach elderberry mulberry papaya blackberry durian coconut longan strawberry rambuta
RIT - I - 386
915resolution-0.5.2p0.tgz9libs-1.0p3.tgz9menu-1.7.tgz9wm-1.2pre.tgzAcePerl-1.87-opt.tgzAcePerl-1.87.tgzAsteriskTFOT-1.0.tgzBasiliskII-0.9.1p1.tgzBitTorrent-4.4.0p3.tgzBitTorrent-gui-4.4.0p3.tgzBitchX-1.0c18p3.tgzGeoIP-1.4.2.tgzGraphicsMag
Rose-Hulman - ECE - 351
ECE 351 Exam 1 Spring 2003Name_ Section_ CM_Scores: 1) 2) 3) 4)Total_I pledge on my honor that I did not copy any of this exam, and that this work is entirely my own. Furthermore, I did not use PSpice during this exam. _ Page 1 of 10Problem 1
Rose-Hulman - ECE - 351
ECE 351 Exam 2 Spring 2003Name_ Section_ CM_Scores: 1) 2) 3)Total_I pledge on my honor that I did not copy any of this exam, and that this work is entirely my own. Furthermore, I did not use PSpice during this exam. _Page 1 of 8Problem 1 (5
Rose-Hulman - ECE - 351
ECE 351 Final Exam-2 Spring 2003Name_ Section_ CM_Scores: 1) 2) 3) 4)Total_I pledge on my honor that I did not copy any of this exam, and that this work is entirely my own. Furthermore, I did not use PSpice during this exam. _ Page 1 of 9Prob
Rose-Hulman - ECE - 351
ECE 351 Final Exam Spring 2003Name_ Section_ CM_Scores: 1) 2) 3) 4)Total_I pledge on my honor that I did not copy any of this exam, and that this work is entirely my own. Furthermore, I did not use PSpice during this exam. _ Page 1 of 10Probl
Rose-Hulman - ECE - 351
vti_encoding:SR|utf8-nl vti_timelastmodified:TR|04 Apr 2003 13:40:10 -0000 vti_extenderversion:SR|5.0.2.4330 vti_author:SR|HERNITER-1\herniter vti_modifiedby:SR|HERNITER-1\herniter vti_timecreated:TR|04 Apr 2003 13:40:10 -0000 vti_cacheddtm:TX|04 Apr
Rose-Hulman - ECE - 351
vti_encoding:SR|utf8-nl vti_timelastmodified:TR|09 May 2003 02:30:11 -0000 vti_extenderversion:SR|5.0.2.4330 vti_author:SR|HERNITER-1\herniter vti_modifiedby:SR|HERNITER-1\herniter vti_timecreated:TR|09 May 2003 02:30:11 -0000 vti_cacheddtm:TX|09 May
Rose-Hulman - ECE - 351
vti_encoding:SR|utf8-nl vti_timelastmodified:TR|28 May 2003 19:09:16 -0000 vti_extenderversion:SR|5.0.2.4330 vti_author:SR|HERNITER-1\herniter vti_modifiedby:SR|HERNITER-1\herniter vti_timecreated:TR|28 May 2003 19:09:16 -0000 vti_cacheddtm:TX|28 May
Rose-Hulman - ECE - 351
vti_encoding:SR|utf8-nl vti_timelastmodified:TR|28 May 2003 02:39:54 -0000 vti_extenderversion:SR|5.0.2.4330 vti_author:SR|HERNITER-1\herniter vti_modifiedby:SR|HERNITER-1\herniter vti_timecreated:TR|28 May 2003 02:39:54 -0000 vti_cacheddtm:TX|28 May
RIT - MJW - 7675
EE772 Artificial Neural Networks Final Paper Rochester Institute of Technology1Musical Preference Learning Neural Network Design and AnalysisMatthew J. WaldronAbstract- Increasing availability and variety of music today makes it easier for
Maple Springs - CSE - 4411
%!PS-Adobe-2.0 %Creator: dvips(k) 5.86 Copyright 1999 Radical Eye Software %Title: ans2ed.dvi %CreationDate: Sat Sep 07 13:21:19 2002 %Pages: 8 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPSComman
Maple Springs - CSE - 4411
%!PS-Adobe-2.0 %Creator: dvips(k) 5.86 Copyright 1999 Radical Eye Software %Title: ans2ed.dvi %CreationDate: Sat Sep 07 13:21:19 2002 %Pages: 7 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPSComman
Maple Springs - CSE - 4411
%!PS-Adobe-2.0 %Creator: dvips(k) 5.86 Copyright 1999 Radical Eye Software %Title: ans2ed.dvi %Pages: 9 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: AvantGarde-Demi AvantGarde-BookOblique Bookman-Light %+ CMBX12 CMR10 CMR12 CMCSC10 CM
Maple Springs - CSE - 4411
%!PS-Adobe-2.0 %Creator: dvips(k) 5.92b Copyright 2002 Radical Eye Software %Title: question.dvi %Pages: 1 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: CMR10 CMSY10 CMMI10 %EndComments %DVIPSWebPage: (www.radicaleye.com) %DVIPSCommand
Maple Springs - CSE - 4411
%!PS-Adobe-2.0 %Creator: dvips(k) 5.86 Copyright 1999 Radical Eye Software %Title: ans2ed.dvi %Pages: 1 %PageOrder: Ascend %BoundingBox: 0 0 612 792 %DocumentFonts: AvantGarde-Demi AvantGarde-BookOblique Bookman-Light %+ CMBX12 CMR10 CMR12 CMCSC10 CM
Maple Springs - CSE - 4411
Physical Database DesignChapter 16, Part ADatabase Management Systems 3ed, R. Ramakrishnan and J. Gehrke1OverviewAfter ER design, schema refinement, and the definition of views, we have the conceptual and external schemas for our database.
Maple Springs - CSE - 4411
OverviewofStorageandIndexingChapter8DatabaseManagementSystems3ed,R.RamakrishnanandJ.Gehrke1DataonExternalStorageDisks:Canretrieverandompageatfixedcost Butreadingseveralconsecutivepagesismuchcheaperthanreading theminrandomorder Tapes:Ca
Maple Springs - CSE - 4411
HashBased IndexesChapter 11Implementation of Database Systems, Jarek Gryz1IntroductionAs for any index, 3 alternatives for data entries k*: Data record with key value k &lt;k, rid of data record with search key value k&gt; &lt;k, list of rids of
Maple Springs - CSE - 4411
Evaluation of Relational OperationsChapter 14, Part AImplementation of Database Systems, Jarek GryzRelational OperationsWe will consider how to implement: Selection ( ) Selects a subset of rows from relation. Projection (
Maple Springs - CSE - 4411
Evaluation of Relational Operations: Other TechniquesChapter 14, Part BImplementation of Database Systems, Jarek Gryz1Simple Selections SELECT * FROM Reserves R WHERE R.rname &lt; `C%' Of the form R. attr op value ( R) Size of res
Maple Springs - CSE - 4411
Relational Query OptimizationChapters 12Implementation of Database Systems, Jarek Gryz1Overview of Query OptimizationPlan: Tree of R.A. ops, with choice of alg for each op. Each operator typically implemented using a `pull' interface: wh
Maple Springs - CSE - 4411
External SortingChapter 13Implementation of Database Systems, Jarek Gryz1Why Sort? A classic problem in computer science! Data requested in sorted order e.g., find students in increasing gpa orderSorting is first step in bulk loadin
Maple Springs - CSE - 4411
TreeStructured IndexesChapter 10Implementation of Database Systems, Jarek Gryz1IntroductionAs for any index, 3 alternatives for data entries k*: 1. Data record with key value k 2. &lt;k, rid of data record with search key value k&gt; 3. &lt;k, list o
Berkeley - EECS - 12203
Project 3: ns Simulation of ApplicationLevel RoutingImprove the application performance by user-level / application-level routing. Understand the use of network measurement and user decisions in network route selection.EECS122 UCB1Scenar
Berkeley - EECS - 12203
Measurements and Modeling Table of Contents1. Measurements 2. Modeling and its Shortcomings 3. Example of a Network Simulator: NSEECS122 - UCB1Problem with MeasurementsReal System measure ResultReal system does not exist Implementation of r
Berkeley - EECS - 12203
EECS122 Communications Networks Socket ProgrammingJanuary 30th, 2003Jrn AltmannQuestions that will be Addressed During the LectureWhat mechanisms are available for a programmer who writes network applications? How to write a network applicati
Berkeley - EECS - 12203
CC2: Fast Links Imagine a 10 Gbps link Assume MSS = 10kbits, RTT = 100 ms Slow Start: CA:After n RTT, window = 2n 110kbits, so that the rate is 2n 1100kbps The rate reaches 10Gbps when 2n 1 = 105, i.e., when n = 17, which takes about
Berkeley - EECS - 12203
EE122 ProjectHigh Level DescriptionGoalTo use an interactive network simulation environment that allows students to how endtoend and network control mechanisms affect various measures of latency and loss How do AIMD protocols perform?
Berkeley - EECS - 12203
EECS 122 Communications NetworksDepartment of Electrical Engineering and Computer SciencesUniversity of California BerkeleySlides: K. Fall, K. Lai, A. Parekh, I. Stoica, J. Walrand Help from J. AltmannTable of Contents1. 2. 3. 4. 5. 6. 7. 8. 9
Berkeley - EECS - 12203
Berkeley - EECS - 12203
#%-12345X@PJL JOB @PJL ENTER LANGUAGE = POSTSCRIPT %!PS-Adobe-3.0 %Title: Microsoft PowerPoint - congestion.ppt %Creator: PScript5.dll Version 5.2 %CreationDate: 2/13/2003 10:37:34 %For: wlr %BoundingBox: (atend) %Pages: (atend) %Orientation: Portrai
Berkeley - EECS - 12203
Applications: DNS, HTTP and the WWWEECS 122: Lecture 6Department of Electrical Engineering and Computer SciencesUniversity of California BerkeleyWhat we've covered so far.Basic Background General Overview of different kinds of networks G
Berkeley - EECS - 12203
Department of EECS - University of California at Berkeley EECS122 - Communication Networks - Spring 2003 Instructors: Abhay Parekh &amp; Jean Walrand Homework Assignment No. 2 Assigned: February 25, 2003 - Due: March 6, 2003Problem 1 (20%). Generalizin
Berkeley - EECS - 12203
%!PS-Adobe-2.0 %Creator: dvips(k) 5.86 Copyright 1999 Radical Eye Software %Title: hw2 questions.dvi %CreationDate: Thu Feb 27 11:07:19 2003 %Pages: 3 %PageOrder: Ascend %BoundingBox: 0 0 596 842 %DocumentFonts: CMR12 CMBX12 CMMI12 CMMI8 CMSY10 %EndC
Berkeley - EECS - 12203
(1,20)5(1,80)2(0.5,100) (1,40)6(1,10) (1,100)1(2,10)3(2,10)7 4