A Real-Time In-Memory Discovery Service : Leveraging Hierarchical Packaging Information in a Unique Identifier Network to Retrieve Track and Trace Information

Online-Ressource (XXIV, 168 p. 86 illus, digital)

Includes bibliographical references

Dedication; Contents; Figures; Tables; Listings; Symbols; About the Book; 1 Introduction and Motivation; 1.1 Definition of Key Terms; 1.1.1 Basic Terms; 1.1.2 Discovery Service; 1.1.3 Unique Identifier Network; 1.2 Use Case: Securing the European Pharmaceutical Supply Chain; 1.3 Contributions; 1.4 Design Science Research Approach; 1.4.1 Environment; 1.4.2 Knowledge Base; 1.5 Assumptions for This Thesis; 1.6 Outline; 2 Underlying Technologies and Related Work; 2.1 Underlying Technologies; 2.1.1 Automatic Identification and Data Capture Technologies

2.1.2 Unique Identifier Network Technology and Standards2.2 Approaches to Retrieve Track and Trace Information Without Discovery Services; 2.2.1 A Central Data Store for Each Item; 2.2.2 Daisy Chain Approach; 2.2.3 E-Pedigree; 2.2.4 Entry-Exit Testing; 2.2.5 A Federated Read Event Repository Database System; 2.2.6 Summary; 2.3 Related Work on Discovery Services; 2.3.1 Literature Review; 2.3.2 Requirements Elicitation; 2.3.3 Existing Discovery Service Approaches; 2.3.4 Qualitative Evaluation; 3 An In-Memory Hierarchical-Packaging-Aware Discovery Service: Overview and Communication Protocol

3.1 Overview of the Hierarchical-Packaging-Aware Discovery Service3.2 A Novel Discovery Service Communication Protocol; 3.2.1 Processing Lifecycle Queries; 3.2.2 Processing Last-Seen Queries; 4 A Recursive Search Algorithm to Find all Potentially Relevant Read Events; 4.1 Data Structure for the Discovery Service; 4.2 Description of the Search Algorithm; 4.3 Mode of Operation Exemplified with a Simple Supply Chain; 4.4 Handling Returnable Transport Items; 4.5 Handling Situations with an Incomplete Read Event Sequence; 4.5.1 Missing Packing Read Events; 4.5.2 Missing Unpacking Read Events

4.5.3 A Missing Pair of Corresponding Read Events4.5.4 Various Missing Corresponding Read Events; 4.6 Critical Discussion of the Search Algorithm; 4.6.1 No Notification Messages at All; 4.6.2 No Packaging Read Events; 4.6.3 No Hierarchical-Packaging Relationship; 4.6.4 Hierarchical-Packaging Relationships; 4.7 Limitations; 5 A Filter Algorithm to Extract the Relevant Read Events; 5.1 Data Structure for the Algorithm; 5.2 Description of the Filter Algorithm; 5.3 Mode of Operation Exemplified with a Simple Supply Chain; 5.4 Handling Interim Re-use of a Box

5.5 Handling Situations with an Incomplete Read Event Sequence5.5.1 Missing Packing Read Events; 5.5.2 Missing Unpacking Read Events; 5.5.3 A Missing Pair of Corresponding Read Events; 5.5.4 Various Missing Corresponding Read Events; 5.6 Critical Discussion of the Filter Algorithm; 5.6.1 Leveraging a Stack to Represent the Packaging Hierarchy; 5.6.2 Discussion of Filter Decisions; 5.6.3 The Stack for the Reverse Filter Algorithm; 5.6.4 Discussion of Filter Decisions for the Reverse Filter Algorithm; 5.7 Summary; 6 System Design and Implementation Considerations; 6.1 High-Level Design

6.2 Bulk Loading Read Events into the Discovery Service

10.1007/978-3-642-37128-8 [DOI]

ECONIS - Online Catalogue of the ZBW