2,872 Hits in 4.2 sec

Characterizing the transport behaviour of the short message service

Earl Oliver
2010 Proceedings of the 8th international conference on Mobile systems, applications, and services - MobiSys '10  
We build an efficient and reliable data transport protocol on top of the Short Message Service (SMS).  ...  This study examines how variables such as the transmission order, delay between transmissions, the network interface used, and the time-of-day affect the service.  ...  We build an efficient and reliable data transport protocol on top of SMS.  ... 
doi:10.1145/1814433.1814457 dblp:conf/mobisys/Oliver10 fatcat:fe7zr75k55di5eb7ycrfblqfza

Exploiting the short message service as a control channel in challenged network environments

Earl A. Oliver
2008 Proceedings of the third ACM workshop on Challenged networks - CHANTS '08  
Through this characterization we show that bidirectional traffic and the choice of hardware have a significant effect on transmission rate, delay, and message reordering.  ...  Through integration with an existing mobile system, we show that the SMS-NIC has little operational overhead and provides efficient, reliable transport for large messages sent over the cellular network  ...  We have designed this SMS-NIC to run efficiently and reliably on a variety of resource constrained mobile devices.  ... 
doi:10.1145/1409985.1409997 dblp:conf/mobicom/Oliver08 fatcat:b7ol3jtulrfelmktdd5btuhpte

Verification and Improvement of the Sliding Window Protocol [chapter]

Dmitri Chkliaev, Jozef Hooman, Erik de Vink
2003 Lecture Notes in Computer Science  
The well-known Sliding Window protocol caters for the reliable and efficient transmission of data over unreliable channels that can lose, reorder and duplicate messages.  ...  messages. 1 Such protocols can also be designed for untimed systems which limit the reordering of messages [Knu81], but such systems seem to be only of theoretical interest.  ...  As [AAF + 94] shows, for a fully asynchronous system and channels that can both lose and reorder messages, it is impossible to design an efficient transmission protocol that uses bounded sequence numbers  ... 
doi:10.1007/3-540-36577-x_9 fatcat:vom3fg3np5dg7ctjpuegzkvy2e

Reliable communication over unreliable channels

Yehuda Afek, Hagit Attiya, Alan Fekete, Michael Fischer, Nancy Lynch, Yishay Mansour, Dai-Wei Wang, Lenore Zuck
1994 Journal of the ACM  
A reliable data link layer is usually implemented on top of a physical transmission medium that permits message loss and message corruption faults.  ...  A reliable transport layer is often implemented using a connectionless network that permits message reordering and message loss.  ...  The retractability of bounded protocols for on-hne sequence transmission over non-FIFO channels. J. ACM, 39, 4 (Oct.), 783-799.  ... 
doi:10.1145/195613.195651 fatcat:grc3lshonvgirnorvioxe6vsq4

Breaking the Scalability Barrier of Causal Broadcast for Large and Dynamic Systems

Brice Nedelec, Pascal Molli, Achour Mostefaoui
2018 2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS)  
The proposed protocol outperforms state-of-the-art in size of messages, execution time complexity, and local space complexity.  ...  Most importantly, messages piggyback control information the size of which is constant. We prove that for both static and dynamic systems.  ...  PC-broadcast is efficient, for the upper bound on the complexity of delivery execution time does not depend on any factor.  ... 
doi:10.1109/srds.2018.00016 dblp:conf/srds/NedelecMM18 fatcat:peqbs6d6svem7becgg73btag3e

Breaking the Scalability Barrier of Causal Broadcast for Large and Dynamic Systems [article]

Brice Nédelec, Pascal Molli, Achour Mostéfaoui
2018 arXiv   pre-print
The proposed protocol outperforms state-of-the-art in size of messages, execution time complexity, and local space complexity.  ...  Most importantly, messages piggyback control information the size of which is constant. We prove that for both static and dynamic systems.  ...  We allow only 2 elements in each buffer.Algorithm 3:Bounding the size of buffers and handling network failures.  ... 
arXiv:1805.05201v1 fatcat:s2yu5djtbjc4rgpxlj2jqtnz4a

Self-Stabilizing Automatic Repeat Request Algorithms for (Bounded Capacity, Omitting, Duplicating and non-FIFO) Computer Networks [article]

Shlomi Dolev, Ariel Hanemann, Elad Micahel Schiller, Shantanu Sharma
2020 arXiv   pre-print
We present a self-stabilizing ARQ algorithm that can be applied to networks of bounded capacity that are prone to packet loss, duplication, and reordering.  ...  Reliable end-to-end communications are based on Automatic Repeat reQuest (ARQ) algorithms for dealing with packet failures, such as packet drops.  ...  A Sender must deliver to a Receiver one message at a time, where no omissions, duplications and reordering are allowed.  ... 
arXiv:2006.05901v1 fatcat:atdvt5alkra6lhjoo6vpubjica

How Stop and Wait Protocols Can Fail over the Internet [chapter]

Jonathan Billington, Guy Edward Gallasch
2003 Lecture Notes in Computer Science  
The paper presents an investigation of these protocols operating over a medium, such as that provided by the Internet Protocol, that does allow reordering of data.  ...  We firstly prove the counter intuitive property for a Stop-and-Wait protocol that the number of packets that are stored in the network can grow without bound.  ...  Sliding Window protocols [31] improve the efficiency of SWPs allowing many messages (rather than one) to be sent before requiring an acknowledgement.  ... 
doi:10.1007/978-3-540-39979-7_14 fatcat:4pi7cvjd7rdcvgslqjtae4psle

Pump-slowly, fetch-quickly (PSFQ): a reliable transport protocol for sensor networks

C.-Y. Wan, A.T. Campbell, L. Krishnamurthy
2005 IEEE Journal on Selected Areas in Communications  
Index Terms-Energy-efficient reliable transport protocols, error control, rate control, sensor networks  ...  the communication cost for data reliability, and importantly, it is robust because it is responsive to a wide range of operational error conditions found in sensor network, allowing for the successful  ...  A sink-to-sensor reliability solution is presented in [16] that focus on communication reliability from the sink to the sensors in a static network.  ... 
doi:10.1109/jsac.2005.843554 fatcat:nu6gmux2wna7dhxzpeks7xw5ua

A mobile ad-hoc network multi-path routing protocol based on biological attractor selection for disaster recovery communication

Hyukjoon Lee, Donghoon Jeon
2015 ICT Express  
In this paper we extend the MMQR such that the alternative paths are reordered adaptively as the communication environment changes based on the heuristic model of attractor selection mechanism by which  ...  MMQR is designed to work on top of the OFDM-TDMA MAC which allows each node to send various management messages to join a network, configure topology, and schedule packet transmissions.  ...  ., path bandwidth, delay bound, accumulated delay and reliability.  ... 
doi:10.1016/j.icte.2015.10.001 fatcat:zuj6jw3ckrdenlcf3njzmwzlna

Efficient concurrent multipath transfer using network coding in wireless networks

Zhuofeng Li, Changqiao Xu, Jianfeng Guan, Hongke Zhang, Gabriel-Miro Muntean
2014 2014 IEEE Wireless Communications and Networking Conference (WCNC)  
CMT-NC is capable of avoiding reordering and compensating lost packets. Further, an innovative group-based transmission management mechanism enhances the robustness and reliability of data transfer.  ...  However, CMT performance degrades seriously in terms of data reordering due to path dissimilarity and frequent packet loss from wireless unreliability.  ...  Since SCTP CMT allows replying SACK messages on different paths from their corresponding DATA packets, the general Smoothed RTT (SRT T ) measurement may lead to incorrect delay estimation.  ... 
doi:10.1109/wcnc.2014.6952900 dblp:conf/wcnc/LiXGZM14 fatcat:w3vwwdaziva6jlijtqav5tudb4

Self-stabilizing End-to-End Communication in (Bounded Capacity, Omitting, Duplicating and non-FIFO) Dynamic Networks [chapter]

Shlomi Dolev, Ariel Hanemann, Elad Michael Schiller, Shantanu Sharma
2012 Lecture Notes in Computer Science  
We present a self-stabilizing end-to-end algorithm that can be applied to networks of bounded capacity that omit, duplicate and reorder packets.  ...  We study end-to-end algorithms that exchange packets to deliver (high level) messages in FIFO order without omissions or duplications.  ...  [9] presented a self-stabilizing data link algorithm for reliable FIFO message delivery over bounded non-FIFO and non-duplicating channel.  ... 
doi:10.1007/978-3-642-33536-5_14 fatcat:xvalu7lsvzdyfjmhibxpz5xrwq

A Review of Multihoming Issues Using the Stream Control Transmission Protocol

T. Daniel Wallace, Abdallah Shami
2012 IEEE Communications Surveys and Tutorials  
Unfortunately, our current means of guaranteeing reliability while maintaining quality control, specifically, the transmission control protocol (TCP), does not support multihoming.  ...  Whether it's improved reliability or sheer throughput potential, network devices will benefit from a multihomed framework.  ...  Partial reliability is achieved by putting an upper bound on the number or retransmissions without acknowledgement.  ... 
doi:10.1109/surv.2011.051111.00096 fatcat:4wckir3qybhzzikgfj52khmgv4

A window-based congestion control for reliable multicast based on TCP dynamics

Koichi Yano, Steven McCanne
2000 Proceedings of the eighth ACM international conference on Multimedia - MULTIMEDIA '00  
In this paper, we detail the congestion control of Rainbow and demonstrate its efficiency and scalability through simulation and analysis.  ...  Our proposed reliable multicast transport, URainbow", is built on top of this model.  ...  Thus, networks can enjoy efficient multicast transmission, and receivers can receive data at the end-to-end available bandwidth.  ... 
doi:10.1145/354384.354494 dblp:conf/mm/YanoM00 fatcat:se3rbvqelfe4hokazoyo2skb74

Building Covert Channels over the Packet Reordering Phenomenon

A. El-Atawy, E. Al-Shaer
2009 IEEE INFOCOM 2009 - The 28th Conference on Computer Communications  
A simple tool is implemented to communicate over the natural phenomenon of packet reordering.  ...  In this paper, we propose using the packet reordering phenomenon as the media to carry a hidden channel.  ...  Moreover, the bandwidth and coding efficiency are theoretically calculated and their bounds discussed.  ... 
doi:10.1109/infcom.2009.5062143 dblp:conf/infocom/El-AtawyA09 fatcat:4szmpr5szrdqlnieyg5tdptcya
« Previous Showing results 1 — 15 out of 2,872 results