Abstract
We design a new language DR w F in which we extend the language DR w to handle node failure during communication. We have extended the reduction semantics of DR w . For handling the node failure we describe two tables at router: One is routing table contains name mapping for forward travel of messages and other is a database of all active nodes at any router. Further we discuss the new node creation and failed node activation during communication. We show how the entries of routing tables are updated using backward learning updates. We explain the usefulness and working of our reduction semantics by taking one example.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
