close menu
Bookswagon-24x7 online bookstore
close menu
My Account
Network Reliability: Experiments with a Symbolic Algebra Environment(Discrete Mathematics and Its Applications)

Network Reliability: Experiments with a Symbolic Algebra Environment(Discrete Mathematics and Its Applications)

          
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

Network Reliability: Experiments with a Symbolic Algebra Environment examines two intertwined topics: computational methods for computing bounds on three measures of network reliability, and a symbolic algebra system to support these computations. It describes, in algorithmic outlines, efficient techniques for reliability bounds and discusses the implementation of the techniques. It explores all-terminal reliability, two-terminal reliability, and reliability of interconnection networks. Consistent with real-world experience, the computational environment and results are strongly supported by sound theoretical development.

Table of Contents:

BLOCKING PROPERTIES OF CHANNEL GRAPHS
Introduction for Channel Graphs
Motivation
Summary and Overview
Background for Channel Graphs
Channel Graphs
Optimal Channel Graphs
Reliability Polynomial and Kruskal-Katona Bounds
Consecutive Minimal Cutsets
The Esary-Proschan Upper Bound
Reachability
Monte Carlo Methods
Transformations on Channel Graphs
The Swap Transformation
An Application to Takagi's and Chung and Hwang's Result
Insplit and Outsplit Transformation
Renormalization
Threshold Channel Graphs
Shifting for Threshold Channel Graphs
Least Reliable Threshold Channel Graph
Most Reliable Threshold Channel Graph
Shifting in Many Stages and a Lower Bound
Different Operational Probabilities
The Averaging Transformation
Subgraph Counting Bounds
Improving the Kruskal-Katona Bounds
Lower Bounds on the Coefficients
Upper Bounds on the Coefficients
Test Results
An Empirical Evaluation
Interconnection Networks
Conclusions for Channel Graphs
Summary of Contributions
Directions for Future Work
A SYSTEM FOR TWO-TERMINAL RELIABILITY
Introduction for Two-Terminal Reliability
Overview of the Part
Two-Terminal Reliability
Network Model Graph Theoretic Definitions
Existing Connectivity Algorithms
Performability
New or Improved Methods
The Renormalization Method
Coefficient-Wise Bounds
Consecutive Cuts Orderings
Hybrid Methods for Performability
The System Developed
Requirements
Development Decisions
Pre-Existing System
New Development
Development Experience
Using the Package as a Research Tool
Test Results
Test Network Topologies
Performance of Upper Bounding Methods
Performance of the Lower Bounding Methods
Conclusions for Two-Terminal Reliability
Summary
Current (Ongoing) Research and System Development
Future of the System
APPENDICES
Interactive Session Using the System
Using the Networks Package


Best Seller

| | See All

Product Details
  • ISBN-13: 9780849339806
  • Publisher: Taylor & Francis Inc
  • Publisher Imprint: CRC Press Inc
  • Height: 254 mm
  • No of Pages: 240
  • Series Title: Discrete Mathematics and Its Applications
  • Sub Title: Experiments with a Symbolic Algebra Environment
  • Width: 178 mm
  • ISBN-10: 0849339804
  • Publisher Date: 16 Jun 1995
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Spine Width: 18 mm
  • Weight: 657 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Be The First to Review
Network Reliability: Experiments with a Symbolic Algebra Environment(Discrete Mathematics and Its Applications)
Taylor & Francis Inc -
Network Reliability: Experiments with a Symbolic Algebra Environment(Discrete Mathematics and Its Applications)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Network Reliability: Experiments with a Symbolic Algebra Environment(Discrete Mathematics and Its Applications)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    | | See All


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA