scispace - formally typeset
Search or ask a question

Showing papers on "Fast packet switching published in 2018"


Journal ArticleDOI
TL;DR: Some novel sufficient conditions are obtained for ensuring the exponential stability in mean square and the switching topology-dependent filters are derived such that an optimal disturbance rejection attenuation level can be guaranteed for the estimation disagreement of the filtering network.
Abstract: In this paper, the distributed ${H_{\infty }}$ state estimation problem is investigated for a class of filtering networks with time-varying switching topologies and packet losses. In the filter design, the time-varying switching topologies, partial information exchange between filters, the packet losses in transmission from the neighbor filters and the channel noises are simultaneously considered. The considered topology evolves not only over time, but also by event switches which are assumed to be subjects to a nonhomogeneous Markov chain, and its probability transition matrix is time-varying. Some novel sufficient conditions are obtained for ensuring the exponential stability in mean square and the switching topology-dependent filters are derived such that an optimal ${H_{\infty }}$ disturbance rejection attenuation level can be guaranteed for the estimation disagreement of the filtering network. Finally, simulation examples are provided to demonstrate the effectiveness of the theoretical results.

127 citations


Journal ArticleDOI
01 Feb 2018
TL;DR: A general Markov chain theoretical framework is developed to model the packet delivery process under the algorithm in 3D MANETs and closed-form expressions are derived for mean and relative standard deviation of packet delivery delay.
Abstract: This paper studies the packet delivery delay performance in three-dimensional mobile ad hoc networks (3D MANETs). Available work mainly focuses on the performance study in two-dimensional MANETs (2D MANETs), which cannot support delay-intensive applications in 3D MANETs. To explore the packet delivery delay performance in 3D MANETs, this paper adopts two-hop relay algorithm with packet replication for packet routing. With such an algorithm, source node can transmit a packet to at most f distinct relay nodes, which then help to forward the packet to its destination node. The algorithm is flexible such that the packet delivery process can be controlled through a proper setting of f . Specially, a general Markov chain theoretical framework is developed to model the packet delivery process under the algorithm in 3D MANETs. Based on the theoretical framework, the closed-form expressions are further derived for mean and relative standard deviation of packet delivery delay. Finally, extensive simulation and numerical results are provided to validate our theoretical models and illustrate the impact of network parameters on packet delivery delay performance in 3D MANETs.

10 citations


Journal ArticleDOI
TL;DR: A new packet loss estimation technique by making use of user_data field of video, which is less intrusive since it does not affect video playing and does not need to inject extra probing stream, and can provide the packet loss detailed information of I,P,B frames.
Abstract: Packet loss is of great importance as a metric that characterizes the network’s performance, and is crucial for video applications, congestion control and routing. Most of existing measurement tools can indicate the packet loss of network links instead of the actual packet loss of individual application. On the other hand, because occurrence of packet loss behavior is relatively rare and its duration is short, active measuring methods need to inject a large number of packets and run for a long time for reporting accurate estimates, which would introduce additional intrusiveness to the network and perturb user traffic. In this paper, we present a new packet loss estimation technique by making use of user_data field of video, which is less intrusive since it does not affect video playing and does not need to inject extra probing stream. It can also provide the packet loss detailed information of I,P,B frames. The accuracy of the algorithm has been evaluated with both simulations and experiments over real-world Internet paths. In addition, we analyze the video quality distortion caused by packet loss of different frame types, and a real-time video quality monitoring system is built.

8 citations


Book ChapterDOI
01 Jan 2018
TL;DR: Architectural and technological innovations are desired, in order to enable the scalable growth both in the number of connected endpoints and exchanged traffic volume.
Abstract: Driven by the cloud computing, Internet of things, and emerging big data applications, more stringent requirements in terms of high bandwidth, low latency, and large interconnectivity are imposed on the communications within the data centers (DC). Traditional intra-DC network based on electronic switches is organized in a hierarchical topology, which is affected by the communication bottleneck and poor power efficiency. Architectural and technological innovations are desired, in order to enable the scalable growth both in the number of connected endpoints and exchanged traffic volume.

7 citations


Book ChapterDOI
08 Oct 2018

1 citations


Journal ArticleDOI
TL;DR: The blocking probability and the mean delay of such delay constrained packets in an asynchronous single-wavelength optical buffer in optical packet switching networks, where the packet arrival process follows the Poisson process and the packet-length distribution is assumed to be general.
Abstract: Within the communication networks, a delayed constrained data packet is the one that will be dropped if not being served before a certain deadline time, which causes data packet loss affecting the quality of service (QoS). In this paper, we study the blocking probability and the mean delay of such delay constrained packets in an asynchronous single-wavelength optical buffer in optical packet switching networks, where the packet arrival process follows the Poisson process and the packet-length distribution is assumed to be general. We obtain the integral equations of the modeled system and the exact expressions of blocking probabilities and the mean delays. Numerical examples are provided to validate the results with interesting observations being highlighted.

1 citations