Security ECS 289M
Popular in Course
Popular in Engineering Computer Science
This 27 page Class Notes was uploaded by Ashleigh Dare on Tuesday September 8, 2015. The Class Notes belongs to ECS 289M at University of California - Davis taught by Staff in Fall. Since its upload, it has received 34 views. For similar materials see /class/187797/ecs-289m-university-of-california-davis in Engineering Computer Science at University of California - Davis.
Reviews for Security
Report this Material
What is Karma?
Karma is the currency of StudySoup.
You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!
Date Created: 09/08/15
ECS 289M Foundations of Computer and Information Security Spring Quarter 2006 Outline for April 28 2006 Reading text 81782 H Greetings and felicitations Problem with instantiation of BelliLaPadula Model a Covert charmel example what is writing b Composition of lattices c Principles of autonomy and security d Give example N W Deterministic noninterference Model of system Exam 1e Relationship of output to states Projections and purge functions Exam 1e Noninterference Wop057 L Alternative definition of security policy Outputiconsistent Security policy Alternate projection function Noninterferenceisecure with respect to the policy r Fquot 9057 Unwinding Theorem a Locally respects b Transitioniconsistent Version of April 28 2006 at 1220 PM Page 1 de Placement timization and velopment in a Wireless sh Networks Eiman Alotaibi Prantik Bhattacharyya Huan Song Department of Computer Science University of California Davis Outline I Introduction I Network Development I Equipment Addition I Traffic Balancing amp Placement Strategy I Performance Study I Conclusion June 9 2008 Introduction I Equipment Placement vital to Network Deployment l 39 Ease of Placement I Ubiquitous Connection I Maintenance Issue I How to better this network June 9 2008 I UC Davis CS Wireless June 9 2008 Network Development Parameters Improved Connectivity Increased Capacity Increased Throughput Reduce Delay Uniform Load Balancing June 9 2008 Network Development How to I Equipment Addition i Uniform Placement to network i Strategic Placement to ease overloaded areas I Budget Constraint on Equipment Availability I Keep Operational and Maintenance Cost Minimal June 9 2008 J Equipment Addition Feasibility Tow 9t W V mLogn I 39h i7 3 11674 n Vquot m Log In In Artisan 5 X EVEd Gupta and Kumar The Capacity of Wireless Networks June 9 2008 Nodes Required for given Network Nodes Gain in Nodes Gain in Added Throughput Added Throughput 0 1 0 1 50 184 200 1 56 100 232 400 1 92 150 269 800 247 200 301 1000 269 250 328 2200 370 400 396 2600 397 450 416 2800 409 500 434 3000 421 600 468 3400 444 650 484 3800 466 700 499 4400 496 750 514 4500 501 Number of Initial Nodes n 10 Number of Initial Nodes n 100 Merely Adding Nodes does not seem to be a good idea June 9 2008 8 Add Nodes Possible Strategy I Put Nodes where link is weakest I Put Nodes where connectivity is lowest I Put Nodes where capacity is low June 9 2008 39 1 Add Nodes Possible Strategy I Put Nodes where link is weakest v I Put Nodes where connectivity is lowest I Put Nodes where capacity is low June 9 2008 10 Traffic Balancing i and j endpoints of a physical wireless link s and d source and destination A Average load between node pairs s and d Hid Weight or cost of wireless link i j Pig Traffic routes Pfgfi39 1 if connection s d is routed through iInk i j otherwise c it bandwidth of link i j June 9 2008 1 1 39illlllllll 1 Equations I Target function U U 2 A Unisj lwi i 139 171 139 LT ij SJL i I Constraints 1 ifks 232772334 0 ifky s d i J 71 if1d 5d 5d 2quot PU 5 BU sad June 9 2008 New Equipment Placement Strategy I Fixed Routing I Heuristic Algorithm I Random Placement for New Nodes l Add nodes in condense area I May increase the total contention l Add nodes in scattered area I May increase aggregate WLAN performance June 9 2008 1 3 Performance Study I Using UCD CS wireless network I 20 Equipment Increment Permissible i We add 2 more nodes I OPNET version 110 I Traffic generated by layer3 IPIayer flows June 9 2008 14 Simulation Setup Table 1 Silll LELti ll general setup Fe ket rEwreprtinan power threeheld JEIIE 18111 RTEECTE eff Thtal number If channels 1 Link data mm 12 11113133 22111 0 1 13135 Pm size 1 E111 I 1nggtpee Trmlemieeie 11 Denver 1 111Wr Briginal WEEIAN 11 edes Number Df new Hades 2 Number 3f tmi I ows 1 June 9 2008 15 39 1 Lquot Initial Placement of Nodes quotquotquot June 9 2008 Li Best case Placement June 9 2008 17 June 9 2mm 39 U Other Near Optimal Placements JJJJJJJJ 08 Results Aggr agate D 3133 5 ac June 9 2008 1 391 ncndes 13 nodes EDD time 5 BE 20 Results Inter Cluster Flow F1 ow throughput at node 4 packetsfsecj 1 WWHWVW W I IV H39l39 11 nodes 13 nodes 1 DD ZDEI SUD June 9 2008 21 Results Inter Cluster Flow 400 F1 ow throughput at node J packetsr sec 3cm 1 1 nodes 13 nodes 20D 10 I D l I I I D IUD 20D SDI time 53 June 9 2008 Results Intra Cluster Flow kFl OW throughput at node 5 packetsfsec M i 39 m w m June 9 2008 23 Results Intra Cluster Flow SUD F1 ow throughput at node 8 packetsfsec 40E 1 1 nodes 30 Ag Heeles EDD IUD D l I I I El 1U EDD EIUEI til39i39IE sec June 9 2008 24 Simulation Results T131313 39 RRquotL Drlgl n Tl irvzjugh39put lip115 In I 52 EELSE rst Casa IL erent mums CHEE IEEI39IEEH I utEE 4239 f CREE June 9 2008 Delay 111 SEC 18 25 Results Node Requirement June 9 2008 Number of Required Gain in Nodes Added Throughput Uniform 18 139 Distribution Our Algorithm 2 139 26
Are you sure you want to buy this material for
You're already Subscribed!
Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'