Coverart for item
The Resource Oblivious network routing : algorithms and applications, S.S. Iyengar and Kianoosh G. Boroojeni

Oblivious network routing : algorithms and applications, S.S. Iyengar and Kianoosh G. Boroojeni

Label
Oblivious network routing : algorithms and applications
Title
Oblivious network routing
Title remainder
algorithms and applications
Statement of responsibility
S.S. Iyengar and Kianoosh G. Boroojeni
Creator
Contributor
Author
Subject
Language
eng
Cataloging source
DLC
http://library.link/vocab/creatorName
Iyengar, S. S.
Illustrations
  • illustrations
  • maps
Index
index present
Literary form
non fiction
Nature of contents
bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1989-
http://library.link/vocab/relatedWorkOrContributorName
Boroojeni, Kianoosh G.
http://library.link/vocab/subjectName
Adaptive routing (Computer network management)
Label
Oblivious network routing : algorithms and applications, S.S. Iyengar and Kianoosh G. Boroojeni
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier.
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent.
Contents
  • ch. 1 Introduction to Network Design -- 1.1.Single-Source Network Routing Problem -- 1.1.1.Preliminary Definitions -- Ground Transportation Example -- 1.1.2.Edge Routing Cost -- 1.1.3.Network Routing Cost -- 1.2.General Network Routing Problem -- Routing Cost Optimization -- 1.3.Oblivious Routing Cost Environment -- Dynamic Approach -- Versatile Approach -- 1.4.Fractional versus Integral Routing -- Routing Cost of the Fractional Solution -- Obliviousness of the Routing Cost Environment -- 1.5.Summary and Outlook -- Exercises -- Suggested Reading -- pt. I Mathematical Foundation -- ch. 2 Hierarchical Routing Tools and Data Structures -- 2.1.Preliminary Definitions -- 2.2.Hierarchical Decomposition Tree -- 2.2.1.Hierarchical Decomposition Sequence -- 2.2.2.Tree Definition -- 2.3.Hierarchical Independence Tree Type-1 -- 2.3.1.Independent Set of Vertices -- 2.3.2.HIT Definition and Properties -- 2.3.3.Induced Partitions of HIT --
  • Note continued: 2.4.Hierarchical Independence Tree Type-2 -- 2.5.Hierarchical Independence Tree Type-0 -- 2.6.Summary and Outlook -- Exercises -- Suggested Reading -- ch. 3 Routing Schemes in Oblivious Network Design -- 3.1.A Top-Down Versatile Routing Scheme -- 3.1.1.Routing Problem Specification -- 3.1.2.Padded Hierarchical Decomposition Sequence -- Fakcharoenphol's Algorithm -- 3.1.3.The Routing Scheme Construction -- Fractional Scheme -- Integral Scheme -- 3.1.4.Routing Cost Analysis -- Competitive Ratio of the Integral Scheme -- 3.2.A Bottom-Up Versatile Routing Scheme -- 3.2.1.Problem Specification -- 3.2.2.Scheme Construction -- Solution Cost Analysis -- 3.3.Summary and Outlook -- Exercises -- Suggested Reading -- pt. II Applications -- ch. 4 A Secure Versatile Model of Content-Centric Networks -- 4.1.Security Preliminaries -- Confidentiality -- Integrity -- Availability -- Privacy -- Host-Oblivious Security Schemes -- 4.2.The Hybrid Model Description --
  • Note continued: Phase 0 Key Distribution -- Phase 1 Requesting Content -- Responding to the Request -- Phase 3 Choosing the Supplying Device -- Phase 4 Data Transmission -- 4.3.Message Forwarding in the Routing Nodes -- Forwarding REQ and NOTIF -- Forwarding REG and ACK -- Forwarding DATA -- 4.4.Oblivious Routing Problem Specification -- 4.4.1.Definitions -- 4.4.2.Graph Representation of the Hybrid Model -- 4.4.3.Oblivious Routing Cost Environment -- 4.5.A Versatile Routing Scheme -- Busch's Randomized Algorithm -- 4.6.Node Congestion Prevention -- 4.6.1.Preliminary Definitions -- 4.6.2.The Expected Competitive Ratio -- 4.7.Routing Cost Analysis -- 4.8.Summary and Outlook -- Exercises -- Suggested Reading -- ch. 5 Versatile Distribution of Green Power Resources -- 5.1.Introduction -- A Residential Electricity System -- 5.2.Electricity System Reliability -- 5.2.1.Stochastic Processes -- 5.2.2.Modeling with Stochastic Processes -- 5.2.3.Reliability Analysis --
  • Note continued: Impact of Auxiliary Power Plants on System Reliability -- 5.3.Analysis of the Energy Distribution Cost -- 5.3.1.Global Controller -- Step 1 -- Step 2 -- Step 3 -- 5.3.2.Energy Flow Cost Function -- Edge Cost Function -- 5.4.Cost Optimization of Energy Distribution -- 5.4.1.Computation of Energy Flow Values Using Rosen's Method -- 5.4.2.Competitive Ratio of Cost Distribution -- 5.5.Summary and Outlook -- Exercises -- Suggested Reading
Control code
FIEb1778881x
Dimensions
28 cm.
Extent
xi, 160 pages
Isbn
9780262029155
Media category
unmediated
Media MARC source
rdamedia.
Media type code
  • n
Other physical details
illustrations, map
System control number
(OCoLC)911047679
Label
Oblivious network routing : algorithms and applications, S.S. Iyengar and Kianoosh G. Boroojeni
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier.
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent.
Contents
  • ch. 1 Introduction to Network Design -- 1.1.Single-Source Network Routing Problem -- 1.1.1.Preliminary Definitions -- Ground Transportation Example -- 1.1.2.Edge Routing Cost -- 1.1.3.Network Routing Cost -- 1.2.General Network Routing Problem -- Routing Cost Optimization -- 1.3.Oblivious Routing Cost Environment -- Dynamic Approach -- Versatile Approach -- 1.4.Fractional versus Integral Routing -- Routing Cost of the Fractional Solution -- Obliviousness of the Routing Cost Environment -- 1.5.Summary and Outlook -- Exercises -- Suggested Reading -- pt. I Mathematical Foundation -- ch. 2 Hierarchical Routing Tools and Data Structures -- 2.1.Preliminary Definitions -- 2.2.Hierarchical Decomposition Tree -- 2.2.1.Hierarchical Decomposition Sequence -- 2.2.2.Tree Definition -- 2.3.Hierarchical Independence Tree Type-1 -- 2.3.1.Independent Set of Vertices -- 2.3.2.HIT Definition and Properties -- 2.3.3.Induced Partitions of HIT --
  • Note continued: 2.4.Hierarchical Independence Tree Type-2 -- 2.5.Hierarchical Independence Tree Type-0 -- 2.6.Summary and Outlook -- Exercises -- Suggested Reading -- ch. 3 Routing Schemes in Oblivious Network Design -- 3.1.A Top-Down Versatile Routing Scheme -- 3.1.1.Routing Problem Specification -- 3.1.2.Padded Hierarchical Decomposition Sequence -- Fakcharoenphol's Algorithm -- 3.1.3.The Routing Scheme Construction -- Fractional Scheme -- Integral Scheme -- 3.1.4.Routing Cost Analysis -- Competitive Ratio of the Integral Scheme -- 3.2.A Bottom-Up Versatile Routing Scheme -- 3.2.1.Problem Specification -- 3.2.2.Scheme Construction -- Solution Cost Analysis -- 3.3.Summary and Outlook -- Exercises -- Suggested Reading -- pt. II Applications -- ch. 4 A Secure Versatile Model of Content-Centric Networks -- 4.1.Security Preliminaries -- Confidentiality -- Integrity -- Availability -- Privacy -- Host-Oblivious Security Schemes -- 4.2.The Hybrid Model Description --
  • Note continued: Phase 0 Key Distribution -- Phase 1 Requesting Content -- Responding to the Request -- Phase 3 Choosing the Supplying Device -- Phase 4 Data Transmission -- 4.3.Message Forwarding in the Routing Nodes -- Forwarding REQ and NOTIF -- Forwarding REG and ACK -- Forwarding DATA -- 4.4.Oblivious Routing Problem Specification -- 4.4.1.Definitions -- 4.4.2.Graph Representation of the Hybrid Model -- 4.4.3.Oblivious Routing Cost Environment -- 4.5.A Versatile Routing Scheme -- Busch's Randomized Algorithm -- 4.6.Node Congestion Prevention -- 4.6.1.Preliminary Definitions -- 4.6.2.The Expected Competitive Ratio -- 4.7.Routing Cost Analysis -- 4.8.Summary and Outlook -- Exercises -- Suggested Reading -- ch. 5 Versatile Distribution of Green Power Resources -- 5.1.Introduction -- A Residential Electricity System -- 5.2.Electricity System Reliability -- 5.2.1.Stochastic Processes -- 5.2.2.Modeling with Stochastic Processes -- 5.2.3.Reliability Analysis --
  • Note continued: Impact of Auxiliary Power Plants on System Reliability -- 5.3.Analysis of the Energy Distribution Cost -- 5.3.1.Global Controller -- Step 1 -- Step 2 -- Step 3 -- 5.3.2.Energy Flow Cost Function -- Edge Cost Function -- 5.4.Cost Optimization of Energy Distribution -- 5.4.1.Computation of Energy Flow Values Using Rosen's Method -- 5.4.2.Competitive Ratio of Cost Distribution -- 5.5.Summary and Outlook -- Exercises -- Suggested Reading
Control code
FIEb1778881x
Dimensions
28 cm.
Extent
xi, 160 pages
Isbn
9780262029155
Media category
unmediated
Media MARC source
rdamedia.
Media type code
  • n
Other physical details
illustrations, map
System control number
(OCoLC)911047679

Library Locations

    • Badia FiesolanaBorrow it
      Via dei Roccettini 9, San Domenico di Fiesole, 50014, IT
      43.803074 11.283055
Processing Feedback ...