IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v184y2011i1p273-29410.1007-s10479-010-0684-3.html
   My bibliography  Save this article

Optimal deployment of eventually-serializable data services

Author

Listed:
  • L. Michel
  • A. Shvartsman
  • E. Sonderegger
  • P. Hentenryck

Abstract

Providing consistent and fault-tolerant distributed object services is among the fundamental problems in distributed computing. To achieve fault-tolerance and to increase throughput, objects are replicated at different networked nodes. However, replication induces significant communication costs to maintain replica consistency. Eventually-Serializable Data Service (ESDS) has been proposed to reduce these costs and enable fast operations on data, while still providing guarantees that the replicated data will eventually be consistent. This paper reconsiders the deployment phase of ESDS, in which a particular implementation of communicating software components must be mapped onto a physical architecture. This deployment aims at minimizing the overall communication costs, while satisfying the constraints imposed by the protocol. Both MIP (Mixed Integer Programming) and CP (Constraint Programming) models are presented and applied to realistic ESDS instances. The experimental results indicate that both models can find optimal solutions and prove optimality. The CP model, however, provides orders of magnitude improvements in efficiency. The limitations of the MIP model and the critical aspects of the CP model are discussed. Symmetry breaking and parallel computing are also shown to bring significant benefits. Copyright Springer Science+Business Media, LLC 2011

Suggested Citation

  • L. Michel & A. Shvartsman & E. Sonderegger & P. Hentenryck, 2011. "Optimal deployment of eventually-serializable data services," Annals of Operations Research, Springer, vol. 184(1), pages 273-294, April.
    • Handle: RePEc:spr:annopr:v:184:y:2011:i:1:p:273-294:10.1007/s10479-010-0684-3
    DOI: 10.1007/s10479-010-0684-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-010-0684-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-010-0684-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Y Li & A Lim & B Rodrigues, 2004. "Crossdocking—JIT scheduling with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1342-1351, December.
    2. Miao, Zhaowei & Lim, Andrew & Ma, Hong, 2009. "Truck dock assignment problem with operational time constraint within crossdocks," European Journal of Operational Research, Elsevier, vol. 192(1), pages 105-115, January.
    3. Yu, Wooyeon & Egbelu, Pius J., 2008. "Scheduling of inbound and outbound trucks in cross docking systems with temporary storage," European Journal of Operational Research, Elsevier, vol. 184(1), pages 377-396, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Maxim A. Dulebenets, 2018. "A Diploid Evolutionary Algorithm for Sustainable Truck Scheduling at a Cross-Docking Facility," Sustainability, MDPI, vol. 10(5), pages 1-23, April.
    2. Dulebenets, Maxim A., 2019. "A Delayed Start Parallel Evolutionary Algorithm for just-in-time truck scheduling at a cross-docking facility," International Journal of Production Economics, Elsevier, vol. 212(C), pages 236-258.
    3. Saeid Rezaei & Amirsaman Kheirkhah, 2018. "A comprehensive approach in designing a sustainable closed-loop supply chain network using cross-docking operations," Computational and Mathematical Organization Theory, Springer, vol. 24(1), pages 51-98, March.
    4. Peter Bodnar & René de Koster & Kaveh Azadeh, 2017. "Scheduling Trucks in a Cross-Dock with Mixed Service Mode Dock Doors," Transportation Science, INFORMS, vol. 51(1), pages 112-131, February.
    5. Zhaowei Miao & Feng Yang & Ke Fu & Dongsheng Xu, 2012. "Transshipment service through crossdocks with both soft and hard time windows," Annals of Operations Research, Springer, vol. 192(1), pages 21-47, January.
    6. Berghman, Lotte & Leus, Roel, 2015. "Practical solutions for a dock assignment problem with trailer transportation," European Journal of Operational Research, Elsevier, vol. 246(3), pages 787-799.
    7. Fatma Essghaier & Hamid Allaoui & Gilles Goncalves, 2021. "Truck to door assignment in a shared cross-dock under uncertainty," Post-Print hal-04066589, HAL.
    8. Afonso Vaz de Oliveira & Carina M. Oliveira Pimentel & Radu Godina & João Carlos de Oliveira Matias & Susana M. Palavra Garrido, 2022. "Improvement of the Logistics Flows in the Receiving Process of a Warehouse," Logistics, MDPI, vol. 6(1), pages 1-23, March.
    9. Ladier, Anne-Laure & Alpan, Gülgün, 2016. "Cross-docking operations: Current research versus industry practice," Omega, Elsevier, vol. 62(C), pages 145-162.
    10. Boysen, Nils & Emde, Simon & Hoeck, Michael & Kauderer, Markus, 2015. "Part logistics in the automotive industry: Decision problems, literature review and research agenda," European Journal of Operational Research, Elsevier, vol. 242(1), pages 107-120.
    11. Nils Boysen & Stefan Fedtke & Felix Weidinger, 2017. "Truck Scheduling in the Postal Service Industry," Transportation Science, INFORMS, vol. 51(2), pages 723-736, May.
    12. Rijal, Arpan & Bijvank, Marco & de Koster, René, 2019. "Integrated scheduling and assignment of trucks at unit-load cross-dock terminals with mixed service mode dock doors," European Journal of Operational Research, Elsevier, vol. 278(3), pages 752-771.
    13. Van Belle, Jan & Valckenaers, Paul & Cattrysse, Dirk, 2012. "Cross-docking: State of the art," Omega, Elsevier, vol. 40(6), pages 827-846.
    14. Gelareh, Shahin & Monemi, Rahimeh Neamatian & Semet, Frédéric & Goncalves, Gilles, 2016. "A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1144-1152.
    15. Konur, Dinçer & Golias, Mihalis M., 2013. "Cost-stable truck scheduling at a cross-dock facility with unknown truck arrivals: A meta-heuristic approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 49(1), pages 71-91.
    16. Claudia R. Rosales & Michael J. Fry & Rajesh Radhakrishnan, 2009. "Transfreight Reduces Costs and Balances Workload at Georgetown Crossdock," Interfaces, INFORMS, vol. 39(4), pages 316-328, August.
    17. Vincent F. Yu & Parida Jewpanya & Voratas Kachitvichyanukul, 2016. "Particle swarm optimization for the multi-period cross-docking distribution problem with time windows," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 509-525, January.
    18. Serrano, Christian & Delorme, Xavier & Dolgui, Alexandre, 2017. "Scheduling of truck arrivals, truck departures and shop-floor operation in a cross-dock platform, based on trucks loading plans," International Journal of Production Economics, Elsevier, vol. 194(C), pages 102-112.
    19. Bruno, Giuseppe & Genovese, Andrea & Piccolo, Carmela, 2014. "The capacitated Lot Sizing model: A powerful tool for logistics decision making," International Journal of Production Economics, Elsevier, vol. 155(C), pages 380-390.
    20. Anne-Laure Ladier & Gülgün Alpan, 2018. "Crossdock truck scheduling with time windows: earliness, tardiness and storage policies," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 569-583, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:184:y:2011:i:1:p:273-294:10.1007/s10479-010-0684-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.