{"product_id":"new-fault-tolerant-routing-algorithms-for-k-ary-n-cube-networks-von-jehad-alsadi","title":"New Fault-Tolerant Routing Algorithms for k-ary n-cube Networks","description":"\u003cp\u003eThis thesis proposes two new limited global- information-based fault-tolerant routing algorithms  for k-ary n-cubes, namely the unsafety vectors  algorithm and the probability vectors algorithm.  While the first algorithm uses a deterministic  approach, which has been widely employed by other  existing algorithms, the second algorithm is the  first that uses probability-based fault-tolerant  routing. These two algorithms have two important  advantages over those already existing in the  relevant literature. Both algorithms ensure fault- tolerance under relaxed assumptions, regarding the  number of faulty nodes and their locations in the  network. Furthermore, the new algorithms are more  general in that they can easily be adapted to  different topologies, including those that belong to  the family of k-ary n-cubes.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783838352633\"\u003e\u003ch3\u003eProbabilistic Approach\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9783838352633","offer_id":39499067555933,"sku":"9783838352633","price":59.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/af28d022-be9c-4d42-b0ea-e8da1c2f32fa.jpg?v=1758953022","url":"https:\/\/shop.autorenwelt.de\/products\/new-fault-tolerant-routing-algorithms-for-k-ary-n-cube-networks-von-jehad-alsadi","provider":"Autorenwelt Shop","version":"1.0","type":"link"}