1-13hit |
Shintaro IKUMA Zhetao LI Tingrui PEI Young-June CHOI Hiroo SEKIYA
The IEEE 802.11p Enhanced Distributed Channel Access (EDCA) is a standardization for vehicle-to-vehicle and road-to-vehicle communications. The saturated throughputs of the IEEE 802.11p EDCA obtained from previous analytical expressions differ from those of simulations. The purpose of this paper is to explain the reason why the differences appear in the previous analytical model of the EDCA. It is clarified that there is a special state wherein the Backoff Timer (BT) is decremented in the first time slot of after a frame transmission, which cannot be expressed in the previous Markov model. In addition, this paper proposes modified Markov models, which allow the IEEE 802.11p EDCA to be correctly analyzed. The proposed models describe BT-decrement procedure in the first time slot accurately by adding new states to the previous model. As a result, the proposed models provide accurate transmission probabilities of network nodes. The validity of the proposed models is confirmed by the quantitative agreements between analytical predictions and simulation results.
Woongsoo NA Gunwoo LEE Hyungchul BAE Jungsuk YU Sungrae CHO
The IEEE has recently released IEEE 802.15.5 standard [3] to provide multi-hop mesh functions for low-rate wireless personal area networks (WPANs). In this paper, we extensively describe a link-layer reliable broadcast protocol referred to as timer-based reliable broadcast (TRB) [3] in the IEEE 802.15.5 standard. The TRB scheme exploits (1) bitmap based implicit ACK to effectively reduce the unnecessary error control messages and (2) randomized timer for ACK transmission to substantially reduce the possibility of contentions. Performance evaluation shows that the TRB scheme achieves 100% reliability compared with other schemes with expense of slightly increased energy consumption.
Masao TANABE Hirofumi AKAIKE Masaki AIDA Masayuki MURATA Makoto IMASE
As a result of the rapid development of the Internet in recent years, network security has become an urgent issue. Distributed denial of service (DDoS) attacks are one of the most serious security issues. In particular, 60 percent of the DDoS attacks found on the Internet are TCP attacks, including SYN flood attacks. In this paper, we propose adaptive timer-based countermeasures against SYN flood attacks. Our proposal utilizes the concept of soft-state protocols that are widely used for resource management on the Internet. In order to avoid deadlock, a server releases resources using a time-out mechanism without any explicit requests from its clients. If we change the value of the timer in accordance with the network conditions, we can add more flexibility to the soft-state protocols. The timer is used to manage the resources assigned to half-open connections in a TCP 3-way handshake mechanism, and its value is determined adaptively according to the network conditions. In addition, we report our simulation results to show the effectiveness of our approach.
Ryousei TAKANO Tomohiro KUDOH Yuetsu KODAMA Fumihiro OKAZAKI
Packet pacing is a well-known technique for reducing the short-time-scale burstiness of traffic, and software-based packet pacing has been categorized into two approaches: the timer interrupt-based approach and the gap packet-based approach. The former was originally hard to implement for Gigabit class networks because it requires the operating system to handle too frequent periodic timer interrupts, thus incurring a large overhead. On the other hand, a gap packet-based packet pacing mechanism achieves precise pacing without depending on the timer resolution. However, in order to guarantee the accuracy of rate control, the system must be able to transmit packets at the wire rate. In this paper, we propose a high-resolution timer-based packet pacing mechanism that determines the transmission timing of packets by using a sub-microsecond resolution timer. The high-resolution timer is a light-weight mechanism compared to the traditional low-resolution periodic timer. With recent progress in hardware protocol offload technologies and multicore-aware network protocol stacks, we believe high-resolution timer-based packet pacing has become practical. Our experimental results show that the proposed mechanism can work on a wider range of systems without degrading the accuracy of rate control. However, a higher CPU load is observed when the number of traffic classes increases, compared to a gap packet-based pacing mechanism.
This paper deals with a new ranging algorithm in an ultra-wideband system. The conventional ToA algorithm determines the distance between devices by estimating the propagation time. However, due to different timer offsets in each device, the accuracy of this estimation can be compromised. In this paper, a double reply ToA algorithm is proposed to increase the ranging accuracy without increasing hardware complexity.
JungYul CHOI JinSeek CHOI Minho KANG
Suitably aggregated data burst enhances link utilization and reduces data processing complexity of optical transport networks rather than just transmitting each bursty input traffic from access networks. This data burst generation method is called as a burst assembly process and has two assembly parameters, timer and threshold, for regulating burst release time and burst size. Since the traffic characteristics of data burst generated at the burst assembler may affect network performance, the decision of burst assembly parameters should be carefully designed. Thus, in this paper we study the dimensioning burst assembly process to find the burst assembly parameter values satisfying target performance. For this purpose, we first analyze timer-based and threshold-based burst assembly processes, respectively. As constraints on the dimensioning burst assembly process, we consider the following performance metrics: 1) processing delay of control packet, 2) burst loss at control plane, and 3) link utilization. Based on these constraints, a decision mechanism of the burst assembly parameters is proposed. From numerical analysis, we suggest a possible lower boundary value for the burst assembly parameters satisfying the target burst loss rate and delay time at the control plane.
Vicente CASARES-GINER Pablo GARCIA-ESCALLE
In mobile communication systems, mobility tracking operations are executed to maintain known the whereabouts of each mobile terminal (MT). In this article, we propose and analyse two new versions of the original time-based registration method, namely the Stop and Wait (S
Yun Won CHUNG Jae Kyun KWON Yeong Jin KIM Dan Keun SUNG
This letter proposes an improved timer-based location management scheme for packet-switched (PS) mobile communication systems. Compared to the conventional timer-based scheme with a single timer threshold, a new timer-based scheme with two timer thresholds is proposed to accommodate the bursty data traffic characteristics of PS service. The location update and paging costs of the proposed scheme are analyzed and compared with those of the conventional scheme. We show that the proposed scheme outperforms the conventional scheme in terms of total cost of both location update and paging with an appropriate selection of timer thresholds.
BGP might experience a lengthy path exploration process to reach the convergence after the routing changes. found that the BGP rate-limiting timer--MinRouteAdvertisementInterval (MRAI) has an optimal value Mo that achieves the best trade-off between the stability and the convergence speed. In this paper, with the aid of a timed BGP model, we investigate the effects of MRAI and its optimal value Mo for the BGP convergence process. We find that an adequately long MRAI timer can batch-remove candidate paths and ensure the routing stability in the convergence process. There exists a minimal MRAI Ms that achieves the effect, which is also the upper bound of Mo and provides an approximation of Mo. We calculate the approximations of Ms for different settings and estimate the optimal MRAI for the Internet. According to the results, the optimal MRAI for the Internet might be 5-10 times less than the current default value used in the Internet. The simulations taken with SSFNet and the experiments conducted over the Planet-Lab demonstrate the correctness of our analysis.
In order to exploit the benefits of soft handoff, finding good values of handoff control parameters is important. In cellular system specifications such as IS-95C and WCDMA, handoff decision algorithm includes signal strength averaging and drop timer in addition to hysteresis. This paper analyzes the effects of signal strength averaging and drop timer and their performance tradeoffs. Because averaging and drop timer are both based on time delay, one may expect that they have similar impact on soft handoff performance. The results show that the effects of averaging and drop timer are rather similar and closely connected in terms of reducing the signaling overhead. However, they have different impacts on resource usage and diversity gain of the system.
Katsumi SAKAKIBARA Takashi GONDA Jiro YAMAKITA
We analytically investigate combinatorial effects of timer control and backoff algorithms on performance of bulk data transfer over two-state Markovian packet error channels. Numerical results for throughput, energy efficiency, and the probabilities of packet loss and loss of bulk data indicate that linear backoff algorithms outperform binary exponential ones as a whole when they are employed at the logical link sublayer with timer control.
Masayuki MOTEGI Hidetoshi KAYAMA Narumi UMEDA
Adaptive Battery Conservation Management (ABCM), an effective form of power conservation for mobile terminals in an always-connected environment, was proposed and evaluated in a previous published work. The ABCM method employs three states: active, dormant, and the Battery Saving Mode (BSM). The BSM is defined as a battery-saving state; in the BSM, the mobile terminal saves power by intermittently receiving paging notifications via a paging channel between the packet bursts of a session. Two control parameters, the sleep-timer and paging interval, are set up according to packet class and are the keys to the performance of a system with this method. In real-time communications, a long sleep-timer and short paging interval are selected to minimize buffering delay. In non-real-time communications, on the other hand, a short sleep-timer and long paging interval are chosen to reduce power consumption by the mobile terminal. Our previous evaluation showed that the method is effective as a means for power conservation in non-real-time communications. In real-time communications, on the other hand, the ABCM method provides shorter buffering delays and the same battery-conservation performance as the conventional method. To further improve the ABCM method's performance, we now propose an enhanced ABCM method that employs multiple BSM sub-modes, each of which has a different paging interval. As dormant periods become longer, the mobile terminal makes transition to successive sub-modes, each of which has a longer interval than the previous one. In this paper, we evaluate the battery conservation effect of the ABCM method through theoretical analysis and computer simulation. Numerical evaluation indicates that the ABCM method will be suitable for the broadband multimedia packet-radio systems of the future.
Mika ISHIZUKA Arata KOIKE Masatoshi KAWARASAKI
This paper evaluates the performance of TCP over ATM by simulation studies to clarify its applicability to high-speed WANs. We compared the performance of TCP over ABR with that of TCP over UBR, and TCP over UBR with Early Packet Discard (EPD). As for TCP over UBR, TCP has all responsibilities for end-to-end performance. In this case, cell loss at the ATM layer degrades TCP performance. Optimum tuning of TCP parameters may mitigate this degradation problem, but cannot solve it. Using EPD with UBR can fairly reduce useless transmission of corrupted packets and improve TCP performance, but still have the problem on fairness. As a result, TCP over ABR was proved to be the most effective as long as it suppressed cell loss. It was also proved that, if we want to extract best performance by TCP over ABR, we need to choose TCP parameters such as window size or timer granularity, so that ABR rate control does not interact with TCP window control and retransmission control.