Router security strategies: securing IP network traffic planes
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Indianapolis, Ind.
Cisco Press
2008
|
| Schriftenreihe: | Cisco security
|
| Schlagworte: | |
| Beschreibung: | Includes bibliographical references and index Preface.Acknowledgments.Introduction.1. Matrix 2 person games.1.1 The Basics.Problems.1.2 The von Neumann Minimax Theorem.Problems.1.3 Mixed strategies.1.3.1 Dominated Strategies.1.4 Solving 2 x 2 games graphically.Problems.1.5 Graphical solution of 2 x m and n x 2 games.Problems.1.6 Best Response Strategies.Problems.2. Solution Methods for Matrix Games.2.1 Solution of some special games.2.1.1 2 x 2 games again.Problems.2.2 Invertible matrix games.Problems.2.3 Symmetric games.Problems.2.4 Matrix games and linear programming.2.4.1 A direct formulation without transforming.Problems.2.5 Linear Programming and the Simplex Method (Optional).2.5.1 The Simplex Method Step by Step.Problems.2.6 A Game Theory Model of Economic Growth (Optional).Problems.3. Two Person Nonzero Sum Games.3.1 The Basics.Problems.3.2 2 x 2 Bimatrix Games.Problems.3.3 Interior Mixed Nash Points by Calculus.Problems.3.3.1 Proof that there is a Nash Equilibrium for Bimatrix Games (Optional).3.4 Nonlinear Programming Method for Nonzero Sum 2 person Games.Problems.3.5 Choosing among several Nash Equilibria (Optional).Problems.4. N Person Nonzero Sum Games with a Continuum of Strategies.4.1 The Basics.4.2 Economics applications of Nash equilibria.Problems.4.2.1 Duels.Problems.4.3 Auctions (Optional).4.3.1 Complete Information 208.Problems.4.3.2 Incomplete Information.4.3.3 Symmetric Independent Private Value Auctions.Problems.4.3.4 Symmetric Individual private value auctions again.Problems.5. Cooperative games.5.1 Coalitions and Characteristic Functions.Problems.5.1.1 Finding the least core.Problems.5.2 The Nucleolus.Problems.5.3 The Shapley Value.Problems.5.4 Bargaining.5.4.1 The Nash model with security point.5.4.2 Threats.Problems.6. Evolutionary Stable Strategies and Population games.6.1 Evolution.Problems.6.2 Population games.Problems.Appendix A: The essentials of matrix analysis.Appendix B: The essentials of probability.B.0.1 Order Statistics.Appendix C: The Essentials of Maple.Appendix D: The Mathematica commands.Appendix E: Biographies.Appendix F: Solutions to selected Problems.Problem Solutions.References.Index |
| Beschreibung: | XXIII, 650 S. graph. Darst. 23 cm |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV036754882 | ||
| 003 | DE-604 | ||
| 005 | 20101202 | ||
| 007 | t | ||
| 008 | 101103s2008 d||| |||| 00||| eng d | ||
| 020 | |z 9781587053368 (pbk.) |9 978-1-58705-336-8 (pbk.) | ||
| 020 | |z 1587053365(pbk.) |9 1-58705-336-5(pbk.) | ||
| 035 | |a (OCoLC)174138969 | ||
| 035 | |a (DE-599)BVBBV036754882 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-522 | ||
| 082 | 0 | |a 005.8 |2 22 | |
| 100 | 1 | |a Schudel, Gregg |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Router security strategies |b securing IP network traffic planes |c Gregg Schudel ; David J. Smith |
| 264 | 1 | |a Indianapolis, Ind. |b Cisco Press |c 2008 | |
| 300 | |a XXIII, 650 S. |b graph. Darst. |c 23 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Cisco security | |
| 500 | |a Includes bibliographical references and index | ||
| 500 | |a Preface.Acknowledgments.Introduction.1. Matrix 2 person games.1.1 The Basics.Problems.1.2 The von Neumann Minimax Theorem.Problems.1.3 Mixed strategies.1.3.1 Dominated Strategies.1.4 Solving 2 x 2 games graphically.Problems.1.5 Graphical solution of 2 x m and n x 2 games.Problems.1.6 Best Response Strategies.Problems.2. Solution Methods for Matrix Games.2.1 Solution of some special games.2.1.1 2 x 2 games again.Problems.2.2 Invertible matrix games.Problems.2.3 Symmetric games.Problems.2.4 Matrix games and linear programming.2.4.1 A direct formulation without transforming.Problems.2.5 Linear Programming and the Simplex Method (Optional).2.5.1 The Simplex Method Step by Step.Problems.2.6 A Game Theory Model of Economic Growth (Optional).Problems.3. | ||
| 500 | |a Two Person Nonzero Sum Games.3.1 The Basics.Problems.3.2 2 x 2 Bimatrix Games.Problems.3.3 Interior Mixed Nash Points by Calculus.Problems.3.3.1 Proof that there is a Nash Equilibrium for Bimatrix Games (Optional).3.4 Nonlinear Programming Method for Nonzero Sum 2 person Games.Problems.3.5 Choosing among several Nash Equilibria (Optional).Problems.4. N Person Nonzero Sum Games with a Continuum of Strategies.4.1 The Basics.4.2 Economics applications of Nash equilibria.Problems.4.2.1 Duels.Problems.4.3 Auctions (Optional).4.3.1 Complete Information 208.Problems.4.3.2 Incomplete Information.4.3.3 Symmetric Independent Private Value Auctions.Problems.4.3.4 Symmetric Individual private value auctions again.Problems.5. Cooperative games.5.1 Coalitions and Characteristic Functions.Problems.5.1.1 Finding the least core.Problems.5.2 The Nucleolus.Problems.5.3 The Shapley Value.Problems.5.4 Bargaining.5.4.1 The Nash model with security point.5.4.2 Threats.Problems.6. | ||
| 500 | |a Evolutionary Stable Strategies and Population games.6.1 Evolution.Problems.6.2 Population games.Problems.Appendix A: The essentials of matrix analysis.Appendix B: The essentials of probability.B.0.1 Order Statistics.Appendix C: The Essentials of Maple.Appendix D: The Mathematica commands.Appendix E: Biographies.Appendix F: Solutions to selected Problems.Problem Solutions.References.Index | ||
| 650 | 4 | |a Routers (Computer networks) / Security measures | |
| 650 | 4 | |a Computer networks / Security measures | |
| 650 | 4 | |a TCP/IP (Computer network protocol) / Security measures | |
| 650 | 0 | 7 | |a Rechnernetz |0 (DE-588)4070085-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Computersicherheit |0 (DE-588)4274324-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a TCP/IP |0 (DE-588)4197538-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Routing |0 (DE-588)4269073-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Routing |0 (DE-588)4269073-0 |D s |
| 689 | 0 | 1 | |a Computersicherheit |0 (DE-588)4274324-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Rechnernetz |0 (DE-588)4070085-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a TCP/IP |0 (DE-588)4197538-8 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Smith, David J. |e Sonstige |4 oth | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-020672069 | ||
Datensatz im Suchindex
| _version_ | 1804143419460681728 |
|---|---|
| any_adam_object | |
| author | Schudel, Gregg |
| author_facet | Schudel, Gregg |
| author_role | aut |
| author_sort | Schudel, Gregg |
| author_variant | g s gs |
| building | Verbundindex |
| bvnumber | BV036754882 |
| ctrlnum | (OCoLC)174138969 (DE-599)BVBBV036754882 |
| dewey-full | 005.8 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.8 |
| dewey-search | 005.8 |
| dewey-sort | 15.8 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03878nam a2200517 c 4500</leader><controlfield tag="001">BV036754882</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20101202 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">101103s2008 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781587053368 (pbk.)</subfield><subfield code="9">978-1-58705-336-8 (pbk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1587053365(pbk.)</subfield><subfield code="9">1-58705-336-5(pbk.)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)174138969</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV036754882</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-522</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.8</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schudel, Gregg</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Router security strategies</subfield><subfield code="b">securing IP network traffic planes</subfield><subfield code="c">Gregg Schudel ; David J. Smith</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Indianapolis, Ind.</subfield><subfield code="b">Cisco Press</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXIII, 650 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">23 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Cisco security</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Preface.Acknowledgments.Introduction.1. Matrix 2 person games.1.1 The Basics.Problems.1.2 The von Neumann Minimax Theorem.Problems.1.3 Mixed strategies.1.3.1 Dominated Strategies.1.4 Solving 2 x 2 games graphically.Problems.1.5 Graphical solution of 2 x m and n x 2 games.Problems.1.6 Best Response Strategies.Problems.2. Solution Methods for Matrix Games.2.1 Solution of some special games.2.1.1 2 x 2 games again.Problems.2.2 Invertible matrix games.Problems.2.3 Symmetric games.Problems.2.4 Matrix games and linear programming.2.4.1 A direct formulation without transforming.Problems.2.5 Linear Programming and the Simplex Method (Optional).2.5.1 The Simplex Method Step by Step.Problems.2.6 A Game Theory Model of Economic Growth (Optional).Problems.3. </subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Two Person Nonzero Sum Games.3.1 The Basics.Problems.3.2 2 x 2 Bimatrix Games.Problems.3.3 Interior Mixed Nash Points by Calculus.Problems.3.3.1 Proof that there is a Nash Equilibrium for Bimatrix Games (Optional).3.4 Nonlinear Programming Method for Nonzero Sum 2 person Games.Problems.3.5 Choosing among several Nash Equilibria (Optional).Problems.4. N Person Nonzero Sum Games with a Continuum of Strategies.4.1 The Basics.4.2 Economics applications of Nash equilibria.Problems.4.2.1 Duels.Problems.4.3 Auctions (Optional).4.3.1 Complete Information 208.Problems.4.3.2 Incomplete Information.4.3.3 Symmetric Independent Private Value Auctions.Problems.4.3.4 Symmetric Individual private value auctions again.Problems.5. Cooperative games.5.1 Coalitions and Characteristic Functions.Problems.5.1.1 Finding the least core.Problems.5.2 The Nucleolus.Problems.5.3 The Shapley Value.Problems.5.4 Bargaining.5.4.1 The Nash model with security point.5.4.2 Threats.Problems.6. </subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Evolutionary Stable Strategies and Population games.6.1 Evolution.Problems.6.2 Population games.Problems.Appendix A: The essentials of matrix analysis.Appendix B: The essentials of probability.B.0.1 Order Statistics.Appendix C: The Essentials of Maple.Appendix D: The Mathematica commands.Appendix E: Biographies.Appendix F: Solutions to selected Problems.Problem Solutions.References.Index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Routers (Computer networks) / Security measures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks / Security measures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">TCP/IP (Computer network protocol) / Security measures</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computersicherheit</subfield><subfield code="0">(DE-588)4274324-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">TCP/IP</subfield><subfield code="0">(DE-588)4197538-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Routing</subfield><subfield code="0">(DE-588)4269073-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Routing</subfield><subfield code="0">(DE-588)4269073-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Computersicherheit</subfield><subfield code="0">(DE-588)4274324-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">TCP/IP</subfield><subfield code="0">(DE-588)4197538-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Smith, David J.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-020672069</subfield></datafield></record></collection> |
| id | DE-604.BV036754882 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:47:22Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020672069 |
| oclc_num | 174138969 |
| open_access_boolean | |
| owner | DE-522 |
| owner_facet | DE-522 |
| physical | XXIII, 650 S. graph. Darst. 23 cm |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Cisco Press |
| record_format | marc |
| series2 | Cisco security |
| spelling | Schudel, Gregg Verfasser aut Router security strategies securing IP network traffic planes Gregg Schudel ; David J. Smith Indianapolis, Ind. Cisco Press 2008 XXIII, 650 S. graph. Darst. 23 cm txt rdacontent n rdamedia nc rdacarrier Cisco security Includes bibliographical references and index Preface.Acknowledgments.Introduction.1. Matrix 2 person games.1.1 The Basics.Problems.1.2 The von Neumann Minimax Theorem.Problems.1.3 Mixed strategies.1.3.1 Dominated Strategies.1.4 Solving 2 x 2 games graphically.Problems.1.5 Graphical solution of 2 x m and n x 2 games.Problems.1.6 Best Response Strategies.Problems.2. Solution Methods for Matrix Games.2.1 Solution of some special games.2.1.1 2 x 2 games again.Problems.2.2 Invertible matrix games.Problems.2.3 Symmetric games.Problems.2.4 Matrix games and linear programming.2.4.1 A direct formulation without transforming.Problems.2.5 Linear Programming and the Simplex Method (Optional).2.5.1 The Simplex Method Step by Step.Problems.2.6 A Game Theory Model of Economic Growth (Optional).Problems.3. Two Person Nonzero Sum Games.3.1 The Basics.Problems.3.2 2 x 2 Bimatrix Games.Problems.3.3 Interior Mixed Nash Points by Calculus.Problems.3.3.1 Proof that there is a Nash Equilibrium for Bimatrix Games (Optional).3.4 Nonlinear Programming Method for Nonzero Sum 2 person Games.Problems.3.5 Choosing among several Nash Equilibria (Optional).Problems.4. N Person Nonzero Sum Games with a Continuum of Strategies.4.1 The Basics.4.2 Economics applications of Nash equilibria.Problems.4.2.1 Duels.Problems.4.3 Auctions (Optional).4.3.1 Complete Information 208.Problems.4.3.2 Incomplete Information.4.3.3 Symmetric Independent Private Value Auctions.Problems.4.3.4 Symmetric Individual private value auctions again.Problems.5. Cooperative games.5.1 Coalitions and Characteristic Functions.Problems.5.1.1 Finding the least core.Problems.5.2 The Nucleolus.Problems.5.3 The Shapley Value.Problems.5.4 Bargaining.5.4.1 The Nash model with security point.5.4.2 Threats.Problems.6. Evolutionary Stable Strategies and Population games.6.1 Evolution.Problems.6.2 Population games.Problems.Appendix A: The essentials of matrix analysis.Appendix B: The essentials of probability.B.0.1 Order Statistics.Appendix C: The Essentials of Maple.Appendix D: The Mathematica commands.Appendix E: Biographies.Appendix F: Solutions to selected Problems.Problem Solutions.References.Index Routers (Computer networks) / Security measures Computer networks / Security measures TCP/IP (Computer network protocol) / Security measures Rechnernetz (DE-588)4070085-9 gnd rswk-swf Computersicherheit (DE-588)4274324-2 gnd rswk-swf TCP/IP (DE-588)4197538-8 gnd rswk-swf Routing (DE-588)4269073-0 gnd rswk-swf Routing (DE-588)4269073-0 s Computersicherheit (DE-588)4274324-2 s DE-604 Rechnernetz (DE-588)4070085-9 s TCP/IP (DE-588)4197538-8 s Smith, David J. Sonstige oth |
| spellingShingle | Schudel, Gregg Router security strategies securing IP network traffic planes Routers (Computer networks) / Security measures Computer networks / Security measures TCP/IP (Computer network protocol) / Security measures Rechnernetz (DE-588)4070085-9 gnd Computersicherheit (DE-588)4274324-2 gnd TCP/IP (DE-588)4197538-8 gnd Routing (DE-588)4269073-0 gnd |
| subject_GND | (DE-588)4070085-9 (DE-588)4274324-2 (DE-588)4197538-8 (DE-588)4269073-0 |
| title | Router security strategies securing IP network traffic planes |
| title_auth | Router security strategies securing IP network traffic planes |
| title_exact_search | Router security strategies securing IP network traffic planes |
| title_full | Router security strategies securing IP network traffic planes Gregg Schudel ; David J. Smith |
| title_fullStr | Router security strategies securing IP network traffic planes Gregg Schudel ; David J. Smith |
| title_full_unstemmed | Router security strategies securing IP network traffic planes Gregg Schudel ; David J. Smith |
| title_short | Router security strategies |
| title_sort | router security strategies securing ip network traffic planes |
| title_sub | securing IP network traffic planes |
| topic | Routers (Computer networks) / Security measures Computer networks / Security measures TCP/IP (Computer network protocol) / Security measures Rechnernetz (DE-588)4070085-9 gnd Computersicherheit (DE-588)4274324-2 gnd TCP/IP (DE-588)4197538-8 gnd Routing (DE-588)4269073-0 gnd |
| topic_facet | Routers (Computer networks) / Security measures Computer networks / Security measures TCP/IP (Computer network protocol) / Security measures Rechnernetz Computersicherheit TCP/IP Routing |
| work_keys_str_mv | AT schudelgregg routersecuritystrategiessecuringipnetworktrafficplanes AT smithdavidj routersecuritystrategiessecuringipnetworktrafficplanes |