Information Management in Federated Digital Archives

Part of the Studies in Computational Intelligence book series (SCI, volume 700)


The chapter describes the problem of resources dislocation among federated archives. In the archive lifetime, the resource can be a subject of format change, relocation, transfer onto another operating system or area, the data carrier can be a subject of magnetic renewal, etc. Some of the operations can be risky, namely the resource can be, in the effect of them, damaged. The federation of archives allows for dislocation of digital resources, i.e. the another method to ensure reliable ability to read it. As the federated archives are usually geographically dispersed, have different operating systems, or storage media, are managed in various ways, the dislocation prevents against the effects of natural disasters, acts of war, etc. The chapter describes acquisition and placement of information about the corresponding resources, archives identification, and communication among the archives. The developed coordination protocol, basing on the state of the art, is described and presented under the assumption, that the archives communicate as they have software agents to communicate with each other. It allows among others, that the archives do not need to be homogeneous. Finally, the implementation proposal of the module responsible for relocation is described.


Message Request Resource Reservation Resource Block Interaction Protocol Digital Resource 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Bellifemine, F., Poggi, A., Rimassa, G. Developing multi-agent systems with a FIPA-compliant agent framework Software-Practice and Experience 31(2):103–128, 2001.Google Scholar
  2. 2.
    Bauer, B., Müller, J.P., Odell, J. Agent UML: A formalism for specifying multiagent software systems International journal of software engineering and knowledge engineering, 11(03):207–230, World Scientific, 2001.Google Scholar
  3. 3.
    Jade Board. Jade web services integration gateway (WSIG) guide Telecom Italia, 2008.Google Scholar
  4. 4.
    Lamport, L. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, 1978.Google Scholar
  5. 5.
    Maekawa, M., Oldehoeft, A.E., Oldehoeft, R.R. Operating Systems: Advanced Concept. Benjamin/Cummings Publishing Company, Inc., 1987.Google Scholar
  6. 6.
    O’Brien, P.D., Nicol, R.C. FIPA – towards a standard for software agents BT Technology Journal, 16(3):51–59, 1998.Google Scholar
  7. 7.
    Open Services Gateway initiative
  8. 8.
    Raymond, K. A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems (TOCS), 7(1):61–77, 1989.Google Scholar
  9. 9.
    Ricart, G., Agrawala, A.K. An optimal algorithm for mutual exclusion in computer networks. Communications of the ACM, 24(1):9–17, 1981.Google Scholar
  10. 10.
    Suzuki, I., Kasami, T. A distributed mutual exclusion algorithm. ACM Transactions on Computer Systems (TOCS), 3(4):344–349, 1985.Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Institute of Control and Computation EngineeringWarsaw University of TechnologyWarsawPoland

Personalised recommendations