Cooperative Task Scheduling for Personal Identity Verification in Networked Systems

摘要

Several working groups are coping with an ecosystem in which a user manages his/her own digital identity (ID) information among different organizations or companies in a decentralized manner. Accordingly, we developed a platform for trusted ID exchange called IDentitY eXchange. In the platform, the personal identity verification process will be realized by verifying credentials about users’ information issued by other organizations. Through this kind of ID cooperation, users can prove their ID online using the credentials and will no longer need to take procedure for every organization when updating their ID information registered there. To update their ID information among multiple organizations, users have to plan a schedule that represents an order of ID cooperation requests from each organization to other organizations. However, the organizations’ policies to identify a user and relationships among the organizations make the scheduling problem a complicated one. In this study, we formulate a scheduling problem in the cooperative network as an integer linear program and propose a heuristic method based on the graph structure. Numerical experiments show that the heuristic approach has feasible scalability for practical use. Finally, we discuss other use cases of the proposed formulation, especially regarding logistics management, such as vehicle scheduling for transporting products from suppliers to consumers.