• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.923-928
• /
• 2003

This paper proposes a bottleneck link bandwidth measurement algorithm for reducing packet transmission delay within the grid network. There are two methods for measuring bottleneck link bandwidth：Packet Pair algorithm and Paced Probes algorithm. They measure bottleneck link bandwidth using the difference in arrival times of two paced probe packets of the same size traveling from the same source to destination. In addition, they reduce the influences of cross traffic by pacer packet. But there are some problems on these algorithms：it's not possible to know where bottleneck link occurred because they only focus on measuring the smallest link bandwidth along the path without considering bandwidth of every link on the path. So hop-by-hop based bottleneck link bandwidth measurement algorithm can be used for reducing packet transmission delay on grid network. Timestamp option was used on the paced probe packet for the link level measurement of bottleneck bandwidth. And the reducing of packet transmission delay was simulated by the solving a bottleneck link. The algorithm suggested in this paper can contribute to data transmission ensuring FTP and realtime QoS by detecting bandwidth and the location where bottleneck link occurred.

• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.464-472
• /
• 2009

In this paper, we propose a packet scheduling algorithm for cellular relay networks by considering relay selection, variation of channel quality, and packet delay. In the networks, mobile users are equipped with not only cellular but also user relaying radio interfaces, where base station exploits adaptive high speed downlink channel. Our proposed algorithm selects a user with good cellular channel condition as a relay station for other users with bad cellular channel condition but can get access to relay link with good quality. This can achieve flexible packet scheduling by adjusting transmission rates of cellular link. Packets are scheduled for transmission depending on scheduling indexes which are calculated based on user's achieved transmission rate, packet utility, and proportional fairness of their throughput. The performance results obtained by using computer simulation show that the proposed scheduling algorithm is able to achieve high network capacity, low packet loss, and good fairness in terms of received throughput of mobile users.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.11
• /
• pp.1099-1105
• /
• 2007

In this paper, modified two-port time-domain passivity approach is proposed for stable bilateral control of teleoperators under time-varying communication delay. We separate input and output energy at each port of a bilateral controller, and propose a sufficient condition for satisfying the passivity of the bilateral controller including time-delay. Output energy at the master port should be less than the transmitted input energy from the slave port with time-delay, and output energy at the slave port should be less than the transmitted input energy from the master port with time-delay. For satisfying above two conditions, two passivity controllers are attached at each port of the bilateral controller. A packet reflector with wireless internet connection is used to introduce serious time-varying communication delay of teleoperators. Average amount of time-delay was about 190(msec) for round trip, and varying between 175(msec) and 275(msec). Moreover some data packet was lost during the communication due to UDP data communication. Even under the serious time-varying delay and packet loss communication condition, the proposed approach can achieve stable teleoperation in free motion and hard contact as well.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.10
• /
• pp.1462-1470
• /
• 1989

This paper aims at investigating the Demand Assigned Multiple Access(DAMA) system for the packet-switched Satellite Communication. An onboard processor of the multisport beam satellite incorporates the ground controller to macimize the packet transmissions for each slot. 'Request Following' trnasmission mode is introduced as a transmission strategy of ground station under the control of its zone controller. The combined scheme of reservation channel access and contention channel access was proposed by Lee & Mark[3] for improving the Delay-Throughput performance. Our scheme provides less communication delay of approximately max. 200msec for achieving the corresponding throughput than the Lee & Mark's work does. Delay versus Throughput curves as well as Delay versus Traffic parameter curves are obtained. Numerical results obtained through the analysis and by the computer simulation show that the proposed scheme provides the low average packer delay even under the condition that the number of transponders (M)is below the half of the number of zones(N).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.1
• /
• pp.205-214
• /
• 2008

To transfer large amount of packets fast in sensor network, it is necessary that the delay between successive packet transmissions should be minimized as possible. In Sensor network, since the Operating Systems are worked on the event driven, the Timer Event is used to transfer packets successively. However, since the transferring time of packet completely is varies very much, it is very hard to set appropriate interval. If interval is too long, delay also becomes too long but if interval is too short, the fail of transfer request would increase. In this paper, we propose ESTEO which reduces the delay between successive packet transmissions by using SendDone Event which informs that a packet transmission has been completed. In ESTEO, the delay between successive packet transmissions is shortened very much since the transmission of next Packet starts at the time when the transmission of previous packet has completed, irrespective of the transmission time. Therefore ESTEO could provide high packet transmission rate given large amount of packets.

• ETRI Journal
• /
• v.34 no.6
• /
• pp.807-815
• /
• 2012

In this paper, we propose a scheme for partially dynamic lane control for energy saving in multilane-based high-speed Ethernet. In this scheme, among the given transmission lanes, at least one lane is always operating, and the remaining lanes are dynamically activated to alleviate the network performance in terms of queuing delay and packet loss in the range of acceptance. The number of active lanes is determined by the decision algorithm based on the information regarding traffic and queue status. The reconciliation sublayer adjusts the transmission lane with the updated number of lanes received from the algorithm, which guarantees no processing delay in the media access control layer, no overhead, and minimal delay of the exchanging control frames. The proposed scheme is simulated in terms of queuing delay, packet loss rate, lane changes, and energy saving using an OPNET simulator. Our results indicate that energy savings of around 55% (or, when the offered load is less than 0.25, a significant additional savings of up to 75%) can be obtained with a queuing delay of less than 1 ms, a packet loss of less than $10^{-4}$, and a control packet exchange time of less than $0.5{\mu}s$ in random traffic.

• Journal of Communications and Networks
• /
• v.11 no.3
• /
• pp.297-305
• /
• 2009

Multiprotocol label switching (MPLS) networks require dynamic flow admission control to guarantee end-to-end quality of service (QoS) for each Internet protocol (IP) traffic flow. In this paper, we propose to tackle the joint routing and admission control problem for the IP traffic flows in MPLS networks without rerouting already admitted flows. We propose two mathematical programming models for this problem. The first model includes end-to-end delay constraints and the second one, end-to-end packet loss constraints. These end-to-end QoS constraints are imposed not only for the new traffic flow, but also for all already admitted flows in the network. The objective function of both models is to minimize the end-to-end delay for the new flow. Numerical results show that considering end-to-end delay (or packet loss) constraints for all flows has a small impact on the flow blocking rate. Moreover, we reduces significantly the mean end-to-end delay (or the mean packet loss rate) and the proposed approach is able to make its decision within 250 msec.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.93-96
• /
• 2001

In this paper, we propose a delay-constrained retransmission method to control packet error or loss in common internet. The Delay Regulator(or Jitter Buffer) which is used to control errors caused by unreliable UDP connection, stores received data packets fDr a small amount of time to prevent network jitter from affecting display quality, which causes constant delay. In this paper, we propose a retransmission method to increase efficiency of ARQ(Automatic Repeat reQuest) by using characteristic of delay regulator.

• Proceedings of the KAIS Fall Conference
• /
• 2009.12a
• /
• pp.989-993
• /
• 2009

Wireless LAN(WLAN) is a rather mature communication technology connecting mobile terminals. IEEE 802.11 is a representative protocol among WLAN technologies. With the rising popularity of delay-sensitive real-time multimedia applications(video, voice and data) in IEEE 802.11 wireless LAN, it is important to study the MAC layer delay performance of WLANs. In this paper, performance for packet delay that recently have been proposed schemes is analysed in wireless LAN and proved performance results via simulation.

• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.551-555
• /
• 2011

Optical packet switching is a promising technology, which can integrate both data and optical network. In this paper, we present a comparative study of various traffic arrival approaches in WDM packet switches. The comparison is made based on packet loss rate and average delay under uniform and self-similar Pareto traffic. Computer simulations are performed in order to obtain the switch performance metrics. Study shows that burstiness of data traffic has a strong negative impact in the performance of WDM packet switches.