Search

This paper addresses the distributed fusion filtering problem for discrete-time random signals from measured outputs perturbed by random parameter matrices and correlated additive noises. These measurements are obtained by a sensor network with a given topology, where random packet dropouts occur during the data transmission through the different network communication channels. The distributed fusion estimation is accomplished in two phases. Firstly, by an innovation approach and using the last observation that successfully arrived if a packet is lost, a preliminary distributed least-squares estimator is designed at each sensor node using its own measurements and those from its neighbors. Secondly, every sensor collects the preliminary filters that are successfully received from its neighbors and fuses this information with its own one to generate the least-squares linear matrix-weighted distributed fusion estimator. The accuracy of the proposed estimators, which is measured by the estimation error covariances, is examined by a numerical simulation example. [ABSTRACT FROM AUTHOR]

Abstract: Optical Label Switching (OLS) has been considered to be a promising approach to realize optical packet switching (OPS) networks. In an OLS router, the header processing module retrieves the routing information carried in the optical header and then replaces the old header with a new one through optical label swapping. The cost-effectiveness and the speed of performing label swapping are two major concerns. Due to lack of optical random access memory, optical label swapping has become a big challenging issue in implementing OLS switches. To overcome these difficulties, in this paper, we propose two Linear Random Code (LRC)-based label encoding schemes to achieve label swapping free OPS networks. Using the proposed schemes, a small sized label is needed. Only simple modulo-2 multiplication and modulo-2 addition operations are required to decode an optical label and there is no optical label swapping during packets traverse along the entire routing path. In our system, each source–destination pair is assigned multiple paths so the network is with traffic engineering and fault tolerance capabilities. We have carried out extensive simulations to evaluate the performance of the proposed scheme. Compared with the well-known KIS encoding scheme, the proposed LRC-based scheme can reduce the label size significantly. An 8-byte LRC label is long enough to support all node pair with five paths in a 300-node network. [Copyright &y& Elsevier]

Abstract: Recently, the need of the high speed packet switch is increased. The basic 2DRR scheduling algorithm provides high throughput, fair access and simple working on a packet switch. However, few input and output node could not be permissioned in some timeslots. It occurs decreasing throughput and some transmission delay. This paper proposes a new packet switch scheduling algorithm. The proposed scheduling algorithm provides higher throughput and low delay. The effectiveness of the proposed algorithm is shown through simulation studies. [Copyright &y& Elsevier]

Abstract: In the problem of buffer management with bounded delay, packets with weights and deadlines arrive at a network switch over time, and the goal is to send those packets on the outgoing link while maximizing the total weight of the packets that are sent before their deadlines. We present a study of randomized algorithms that are competitive against an adaptive adversary. Previous studies considered only the oblivious adversary model that does not capture dependency of network traffic on the packet scheduling algorithm. We give a new analysis of a previously known algorithm, which shows that it remains -competitive even against an adaptive adversary. We complement this with a 4/3 lower bound on the competitive ratio on 2-bounded instances, in which each packet has a lifespan of one or two steps. We also study more restricted 2-uniform instances, in which every packet has a lifespan of exactly two steps. For such instances we give a 1.2 lower bound on the competitive ratio of arbitrary algorithms and 4/3 lower bound on the competitive ratio of memoryless scale-invariant algorithms. Finally, we devise a 4/3-competitive memoryless scale-invariant algorithm for 2-bounded instances, matching two of these lower bounds. [Copyright &y& Elsevier]

Abstract: TCP-over-OBS is a promising transport paradigm to support next-generation Internet. It is well known that load-balanced routing generally improves loss performance over OBS. We identify that implementing TCP over load-balanced OBS could lead to persistent out-of-order delivery of TCP segments, resulting in unnecessary timeouts and fast retransmissions. In this paper we evaluate the performance of Reordering-Robust TCP (RR-TCP) over OBS networks. We develop an analytical end-to-end transfer delay model for TCP SACK and RR-TCP over load-balanced OBS networks. We observe that standard TCP experiences significant throughput degradation due to persistent packet reordering. Through simulations and modeling we show that RR-TCP achieves significant improvement compared to TCP SACK. In our simulations we add High-Speed TCP functionality to RR-TCP (HS-RR-TCP). The simulations show up to a 300% performance improvement for HS-RR-TCP compared to HS-TCP-SACK under ideal conditions and a 20% improvement on NSFnet with background traffic. [ABSTRACT FROM AUTHOR]

Abstract: TCP (Transmission Control Protocol) is one of the protocols which are widely used in Internet environments. This paper presents an analytical model developed using the stochastic reward net (SRN) modeling technique for the TCP flow behavior in WLANs. The purpose of developing an analytical model is the evaluation of stationary TCP flow behavior. In this paper, we focus the attention on the TCP variant called TCP Reno which is implemented by most operating systems. The performance of TCP Reno is investigated through the SRN model. The model captures aspects such as congestion window (cwd) evolution, slow start and congestion avoidance phases, TCP packet transmissions, management of packet losses due to time-out, and due to generation of triple duplicate acknowledgements. The performance metrics such as throughput and delay of the TCP traffic are obtained using the SRN model. On the basis of these performance measures, the existing unfairness between the downstream and upstream flow at the AP in WLANs is also shown. The proposed analytical model is validated via simulation. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we investigate the low coverage problem of efficient broadcast protocols in wireless ad hoc networks with realistic physical layer models. To minimize energy consumption, efficient protocols aim to select small set of forward nodes and minimum transmission radii. In ideal physical layer model, nodes within forward nodes’ transmission ranges can definitely receive packets; therefore energy efficient protocols can guarantee full coverage for broadcasting. However, in networks with a realistic physical layer, nodes can only receive packets with probability. We present an analytical model to show that the transmission radii used for nodes can be used to establish a tradeoff between minimizing energy consumption and ensuring network coverage. We then propose a mechanism called redundant radius, which involves using two transmission radii, to form a buffer zone that guarantees the availability of logical links in the physical network, one for broadcast tree calculation and the other for actual data transmission. With this mechanism, we extend well-known centralized protocols, BIP and DBIP, and corresponding localized protocols, LBIP and LDBIP. The effectiveness of the proposed scheme in improving network coverage is validated analytically and by simulation. [Copyright &y& Elsevier]

Abstract: The burstiness of video traffic in future wired and wireless networks makes dynamic management of network resources more critical. This helps to meet stringent delay and loss requirements of video traffic and improves its Quality of Service (QoS). Since buffer management in queueing system plays an important role towards effective control of QoS for various types of applications, we have focused on its dynamic management. In this paper, we have proposed ADPBS scheme for priority queueing system. The performance of this scheme is analyzed with MPEG-4 encoded video sequence as input to the ADPBS queue. The simulation is carried out in MATLAB for various combinations of threshold control parameters, different traffic load and input traffic mix variations. The results of simulations indicate that dynamically controlled threshold in ADPBS contributes to significant reduction of packet loss of different priority classes as compared with static partial buffer sharing queue and first in first out queue based on threshold control parameters and the traffic type. [Copyright &y& Elsevier]

Abstract: non-preemptive priority queue with bulk arrivals has already been analysed in many papers. Two problems are known in this area: first, when the number of priorities is greater than 2, the analysis for priority processes is obviously very difficult to handle. Therefore, the earlier work on the subject was restricted mostly to two priority classes; and second, although analytically explicit results are available, they require sophisticated closed-form expressions of the mean queue length. One particular bulk size distribution – the GE distribution – is motivated by an ME (Maximum Entropy) formulation for the behavior of a G/G/1 queue. The choice of a GE distribution is motivated by the fact that measurements of actual inter-arrival traffic or service times may be generally limited and so only few parameters, such as mean and variance, can be computed reliably. Thus this paper we can obtain very simple and analytic closed-form expression for the mean queue length of a GE/G/1 priority queue and a significant increase in performance evaluation has been achieved. We present the four-class priority queues, performance analysis and simulation of the LER (Label Edge Router) system in the ATM-based MPLS (Multiprotocol Label Switching) network. We wish to obtain the boundary conditions of the mean queue lengths and the mean queueing delays for each priority class, since this metric is one of the most important in performance evaluation parameters for improving QoS and system performance of the LER system in ATM-based MPLS network. A significant numerical example is presented and discussed as well. In order to obtain optimizing the performance analysis for EF flow, AF 1 flow, AF 2 flow and BE flow, the optimum ratios of COV (Coefficient of Variation) can be found via many numerical experiments carried out by the authors for queueing network model with HOL (Head of Line) priority rules. However, the ratios of COV value constraints exist. Furthermore, we find that each service class gradually begins to deteriorate when SQVs (Squared Coefficient of Variations), , and traffic intensity is greater than 0.95. We also find the values of maximum allowed burst size for EF flow and AF 1 flow and perform necessary policing actions on EF flow and AF 1 flow at the boundary node of the network. Finally, the four-class GE/G/1 priority queues and performance analysis of the LER system are shown accurate and robust after the comparison between theoretical evaluates and computer simulation results. [Copyright &y& Elsevier]

Abstract: When using wireless sensor networks for real-time event alarming, it is critical to ensure event notification in a timely manner. Additionally, it is extremely important to ensure the alarms generated by the sensors propagate securely through the network to the sink. Another important factor to consider is energy, as it is a limited resource in wireless sensor networks. Accordingly, maximizing network lifetime is always an optimization goal. To address the aforementioned concerns, in this paper we present the Authentic Delay Bounded Event Detection System (ADBEDS). ADBEDS works in rounds, and in each round an event detection tree is responsible for simultaneously detecting events, routing packets to a gateway node, and detecting injection of false packets. The ADBEDS can support k-watching composite events to allow event detection in a redundant manner. Additionally, the corresponding event alarm can be delivered within a user-specified bounded delay. The use of energy-based keying allows smaller, more efficient keys as input to security mechanisms, allowing further reduction in energy consumption of the ADBEDS. We evaluate the energy efficiency and reliability of ADBEDS using theoretical analysis and simulation. [Copyright &y& Elsevier]

Abstract: This paper introduces a game theoretic method, called forwarding dilemma game (FDG), which controls routing overhead in dense multi-hop wireless ad hoc networks. The players of the game are the wireless nodes with set of strategies {Forward, Not forward}. The game is played whenever an arbitrary node in the network receives a flooding packet. In FDG, every player needs to know the number of players of the game. That is why a neighbor discovery protocol (NDP) is introduced. In order for NDP to function, a field is attached to the flooding packets (routing overhead packets). The mixed strategy Nash equilibrium is used as a solution for the FDG. This provides the probability that the flooding packet would be forwarded by the receiver node. FDG with NDP is implemented in AODV protocol in Network Simulator NS-2 to verify its performance with simulations. FDG with NDP improves performance of the AODV compared to the same network with only AODV protocol in moderate and high node densities. FDG can be applied to any routing protocol that uses flooding in the route discovery phase. [Copyright &y& Elsevier]

Abstract: An all-optical differential group delay (DGD) monitor for packet-switched networks is proposed. The monitoring approach consists of an integrated active Mach–Zehnder interferometer acting as a logic XOR gate. According to the estimated DGD value, a latching switch is employed to route the input packets “on-the-fly”. The simulation results show a successful operation which has been confirmed with the experimental validation of the XOR-based monitoring subsystem. [Copyright &y& Elsevier]