When BBR beats FEC coded CUBIC flows over SATCOM

Meta-Lamarckian learning in multi-objective optimization for mobile social network search

The vehicular ad hoc network (VANET) is a wireless technology adopted by the research community to implement smart transportation applications. Due to the variation in the vehicular speed, topology in the VANET continuously changes that make a routing complex task. It is better to use the position-based routing protocol that is adaptive and mostly suitable for dynamically changing road environments. The objective of the paper is to analyze an impact of real mobility traces on position-based routing protocols using simulation. It is difficult to perform a simulation in the VANET due to the restricted movement of vehicles. Vehicular mobility plays a major role in the VANET. Realistic mobility traces such as intelligent driver model-intersection management (IDM-IM), IDM–lane changing (LC) and ManhattanGrid are generated using VANETMobiSim and Bonnmotion tool. These traces are applied to the intersection-based routing (IBR), greedy perimeter stateless routing (GPSR) and ant colony optimization-intersection-based routing (ACO-IBR). The impact of the mobility traces has been evaluated with parameters such as delay, throughput and successful delivery ratio (SDR). The result shows that the selection of proper mobility pattern is a key to achieve the realistic performance of the simulation. ACO-IBR minimizes delay and produces better successful delivery ratio and throughput for all real mobility patterns.

In Hybrid wired-wireless networks, power control algorithms and FEC techniques have to be adopted and optimized to hide the unreliability of wireless links to TCP. To achieve the expected performance gain, a joint cross-layer optimization that takes into account also TCP congestion control is required. Recently, in literature, a theoretic framework has been proposed to address this issue when New Reno TCP is used. This work extends such a recent findings to cope also with Westwood+ TCP, a recent TCP congestion control algorithm proposed for networks with high bandwidth delay products and random losses. Numerical results have shown that, for the same propagation conditions, Westwood+ TCP requires less power and FEC codes to achieve the same goodput of New Reno TCP

Article history: Received October 23,2013 Received in revised format November 25, 2013 Accepted November 27, 2013 Available online November 27 2013 An innovative price plan monitoring and advisory system simulates subscriber usage consumption for offering suitable price plan. The aim of this paper is to develop the decision support system by using Statistical Process Control (SPC) to identify subscriber usage behavior and provide critical visibility into subscriber consumption to detect their inappropriate usage especially in exceeding usage. To explore subscriber usage behavior, a forecasting model and a regression is employed to identify related factors and predictive usage model. The innovative price plan monitoring and advisory system has been verified and validated with one of the largest telecommunication company in Thailand. Using decision support system with effective control chart and real subscriber behavior pattern help mobile network operator grow their revenues and profits by offering an appropriate price plan as well as improve subscriber experience with more flexible choice to meet their individual usage consumption needs. © 2014 Growing Science Ltd. All rights reserved.

To provide a bounded-delay service with an end-to-end delay guarantee and utilize network efficiently, the admission control functions in a network require an adequate per-switch delay allocation policy to allocate end-to-end delay requirement to a set of local switches. In this paper, we derive an optimal QOS allocation policy and decide the maximum utilization bound in a deterministic traffic model and a rate-controlled FCFS scheduler. We found that with the delay bound as the QOS metric, there is a significant difference in the performance of allocation policies. We also develop an evaluation strategy to analyze allocation policies. The numerical results compare the equal allocation policy with the optimal allocation policy and show the correctness and efficiency of QOS allocation policy.

Mobile broadband networks are becoming increasingly popular, and they support many different IP based services. The Transmission Control Protocol (TCP) is a widely used protocol in the Internet. In this paper, we analyze the performance of the existing loss-based and delay-based congestion control algorithms for TCP on real mobile networks. The impact the loss-based algorithm has in terms of network latency is extremely heavy and degrades the communication quality of all flows which share the same bottleneck link. On the other hand, although delay-based TCP is able to maintain latency at a low level, its goodput is very small because the RTT increases independently of network congestion. We propose a new delay-based congestion control algorithm. To enable this algorithm to work well on mobile networks, we use a variable threshold which includes the delay caused by the data link layer. Experiments on emulated network and real network show that the algorithm can maintain the queue size and transmission delay at low levels without degrading goodput.