Algorithme pour minimiser le nombre de sauts et de longueurs d'onde dans un réseau WDM
Home > General > Algorithme pour minimiser le nombre de sauts et de longueurs d'onde dans un réseau WDM
Algorithme pour minimiser le nombre de sauts et de longueurs d'onde dans un réseau WDM

Algorithme pour minimiser le nombre de sauts et de longueurs d'onde dans un réseau WDM


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
About the Book

Ce texte propose un algorithme complet pour minimiser le nombre de sauts et de longueurs d'onde dans un réseau WDM. Pour résoudre le problème RWA du réseau routé VWP, un algorithme heuristique est utilisé. Dans cet algorithme, la première route est assignée à la demande de trafic à tout moment. Après le routage, l'encombrement du réseau sur chaque lien est calculé. Avec l'aide de l'encombrement du réseau, les longueurs d'onde sont assignées à chaque route de manière à ce qu'une même liaison reçoive une longueur d'onde différente, si elle est utilisée dans plus d'une route pour le trafic demandé. L'encombrement du réseau permet également de mesurer les besoins en convertisseurs de réseau. L'affectation des longueurs d'onde est indépendante de l'affectation du routage, mais il est nécessaire d'affecter les longueurs d'onde de manière à minimiser le nombre de convertisseurs de longueurs d'onde, car ils ont tendance à augmenter le coût du réseau. Lorsque les algorithmes de routage et de longueur d'onde sont utilisés en combinaison sur le réseau, le coût du réseau est minimisé et l'utilisation des ressources est maximisée. Dans la deuxième phase, un algorithme de reroutage est mis en oeuvre, dont l'objectif est de minimiser les besoins en longueur d'onde du réseau et le nombre de sauts requis pour un itinéraire lors du voyage vers les noeuds de destination, ainsi que de minimiser la consommation du réseau.


Best Sellers



Product Details
  • ISBN-13: 9786206285038
  • Publisher: KS Omniscriptum Publishing
  • Binding: Paperback
  • Language: French
  • Returnable: N
  • Weight: 199 gr
  • ISBN-10: 6206285030
  • Publisher Date: 28 Jul 2023
  • Height: 229 mm
  • No of Pages: 96
  • Spine Width: 6 mm
  • Width: 152 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Algorithme pour minimiser le nombre de sauts et de longueurs d'onde dans un réseau WDM
KS Omniscriptum Publishing -
Algorithme pour minimiser le nombre de sauts et de longueurs d'onde dans un réseau WDM
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.

Algorithme pour minimiser le nombre de sauts et de longueurs d'onde dans un réseau WDM

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



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!