CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

DRwp F : A Fault Tolerant Distributed Routing Calculi

by Manish Gaur, Rama Kant
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 40 - Number 7
Year of Publication: 2012
Authors: Manish Gaur, Rama Kant
10.5120/4973-7239

Manish Gaur, Rama Kant . DRwp F : A Fault Tolerant Distributed Routing Calculi. International Journal of Computer Applications. 40, 7 ( February 2012), 1-7. DOI=10.5120/4973-7239

@article{ 10.5120/4973-7239,
author = { Manish Gaur, Rama Kant },
title = { DRwp F : A Fault Tolerant Distributed Routing Calculi },
journal = { International Journal of Computer Applications },
issue_date = { February 2012 },
volume = { 40 },
number = { 7 },
month = { February },
year = { 2012 },
issn = { 0975-8887 },
pages = { 1-7 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume40/number7/4973-7239/ },
doi = { 10.5120/4973-7239 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:27:25.037310+05:30
%A Manish Gaur
%A Rama Kant
%T DRwp F : A Fault Tolerant Distributed Routing Calculi
%J International Journal of Computer Applications
%@ 0975-8887
%V 40
%N 7
%P 1-7
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

We design a new language DRwp F in which we extend the language DRwp to handle node failure during communication. We have extended the reduction semantics of DRwp . 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.

References
  1. Andrew T. Campbell and S. Keshav. Quality of service in distributed systems. Computer Communications, pages 21(4):291–293, 1998.
  2. editor Douglas Comer. Internetworking with TCP/IP - Principles, Protocols, and Architectures,. Prentice-Hall, fourth edition, 2000.
  3. Adrian Francalanza and Matthew Hennessy. A theory of system behaviour in the presence of node and link failures. In CONCUR, pages 368– 382, 2005.
  4. Adrian Francalanza and Matthew Hennessy. A theory of system behaviour in the presence of node and link failure. Inf. Comput., pages 206(6):711–759, 2008.
  5. Manish Gaur. A routing calculus for distributed computing. In Elena Troubitsyna, editor, Proceedings of Doctoral Symposium held in conjunction with Formal Methods 2008,Turku Centre for Computer Science General Publication, 48:23– 32., May 2008.
  6. Manish Gaur. A Routing Calculus: Towards formalising the cost of computation in a distributed computer network. Phd, Informatics, University of Sussex, U.K., December 2008.
  7. Manish Gaur and Matthew Hennessy. . counting the cost in the picalculus (extended abstract). Electronic Notes in Theoretical Computer Science (ENTCS), pages 229:117–129, 2009.
  8. Matthew Hennessy. A distributed Pi-Calculus. Cambridge University Press, 2007.
  9. Matthew Hennessy and Julian Rathke. Typed behavioural equivalences for processes in thepresence of subtyping. Mathematical Structures in Computer Science, pages 14(5):651–684, 2004.
  10. James F. Kurose and Keith W. Ross. Computer Networking: A top down approach featuring the Internet. Addison Wesley, 2001.
  11. J. Riely. M. Hennessy. Resource access control in systems of mobile agents. Information and Computation ., pages 173 :82–120, 2002.
  12. Robin Milner. A calculus of communicating systems. volume 92 of Lecture Notes in Computer Science. Springer, 1980.
  13. Robin Milner. Communication and Concurrency. Prentice Hall, 1989.
  14. Robin Milner. Communicating and mobile systems: The p -Calculus. Cambridge University Press, 1999.
  15. Benjamin C. Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, pages 6(5):409–453, 1996.
  16. Daniele Gorla Rocco De Nicola and Rosario Pugliese. Basic observables for a calculus for global computing. Inf. Comput.,, pages 205(10):1491–1525, 2007.
  17. Davide Sangiorgi and DavidWalker. The p - Calculus: A theory of Mobile Processes. Cambridge University Press, 2001.
  18. W. Richard Stevens. TCP/IP Illustrated : The Protocols,, volume 1. Addison-Wesley, 1994.
  19. Andrew S. Tanenbaum. Computer Networks. Pearson Education, Inc.„ Upper Saddle River,New Jersey„ fourth edition, 2003.
Index Terms

Computer Science
Information Sciences

Keywords

Routing calculi node failure Fault Tolerance

Powered by PhDFocusTM