IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-642-20009-0_99.html
   My bibliography  Save this book chapter

Non-Linear Offline Time Synchronization

In: Operations Research Proceedings 2010

Author

Listed:
  • Li Luo

    (Heinrich-Heine-Universität)

  • Björn Scheuermann

    (Heinrich-Heine-Universität)

Abstract

In the design process of communication protocols it is necessary to perform repeated network communication experiments. Each run results in large event logs. The analysis of these logs is crucial to find and to understand unexpected behaviors and design flaws. Intrinsic to network communication these logs suffer from random delays, drop outs, and deviating clocks, which complicate the analysis. Online synchronization protocols may interfere an experiment gravely and are unable to handle delays and drop outs. Offline synchronization approaches based on affine linear clocks using maximum likelihood estimation and least squares estimation are introduced by [3] and [2], respectively. We show that their approaches can be extended to non-linear clocks. The problem leads to a sparse linear program with a well-known structure, which can be readily solved by the interior point method. Under weak assumptions a consistency result is available for the least squares estimation.

Suggested Citation

  • Li Luo & Björn Scheuermann, 2011. "Non-Linear Offline Time Synchronization," Operations Research Proceedings, in: Bo Hu & Karl Morasch & Stefan Pickl & Markus Siegle (ed.), Operations Research Proceedings 2010, pages 629-634, Springer.
  • Handle: RePEc:spr:oprchp:978-3-642-20009-0_99
    DOI: 10.1007/978-3-642-20009-0_99
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:oprchp:978-3-642-20009-0_99. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.