• Journal of information and communication convergence engineering
• /
• 제10권3호
• /
• pp.231-236
• /
• 2012

For real-time wireless sensor network applications, it is essential to provide different levels of quality of service (QoS) such as reliability, low latency, and fault-tolerant traffic control. To meet these requirements, an (m,k)-firm based real-time routing protocol has been proposed in our prior work, including a novel local transmission status indicator called local DBP (L_DBP). In this paper, a fault recovery scheme for (m,k)-firm real-time streams is proposed to improve the performance of our prior work, by contributing a delay-aware forwarding candidates selection algorithm for providing restricted redundancy of packets on multipath with bounded delay in case of transmission failure. Each node can utilize the evaluated stream DBP (G_DBP) and L_DBP values as well as the deadline information of packets to dynamically define the forwarding candidate set. Simulation results show that for real-time service, it is possible to achieve both reliability and timeliness in the fault recovery process, which consequently avoids dynamic failure and guarantees meeting the end-to-end QoS requirement.

• The Journal of the Korea institute of electronic communication sciences
• /
• 제14권5호
• /
• pp.837-844
• /
• 2019

In this paper, we propose the AMBM(: Adaptive Multi-channel Backoff Machisum) -Mac protocol to provide high throughput for non-safety applications in VANET(: Vehicular Ad Hoc Networks) environment. The proposed protocol guarantees the quality of service of non-safety packets by dynamically adjusting CW(: Channel Window) of WSA(: WAVE Service Advertisement) to maximize throughput between non-safety packets of different priority. It also shows that allocating a large amount of time for channel coordination and time slot reservation for SC and dynamically adjusting CW and CCI as nodes increase to reduces transmission delay than IEEE 1609.9, C-MAC(: Coordinated multi-channel MAC, and Q-VCI(: QoS Variable CCH Interval) protocols.

• Journal of Korea Multimedia Society
• /
• 제13권11호
• /
• pp.1594-1609
• /
• 2010

In the case that multiple services are in race condition for limited I/O resource, the services or processes with lower priority occasionally occupy most of limited I/O resource. And it decreases QoS and performance of important services and makes it difficult to efficiently use limited I/O resource. Although system administrator allocates I/O resource according to priority of process, he/she can't know or expect how much resource will be used by the specific process. Due to these reasons, it causes the problem that he/she can't guarantee the service QoS and performance stability. Therefore, in this paper, we propose service based disk I/O control supporting predictable I/O bandwidth to resolve upper problems. Proposed I/O control guarantees the service QoS and performance stability by supporting the service based predictable I/O bandwidth and it makes limited I/O resource to be efficiently used in respect of service.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국정보통신학회 2013년도 추계학술대회
• /
• pp.1033-1036
• /
• 2013

A study about collision resolution is needed because huge file, video and multimedia information are transmitted to wireless LAN. CSMA/CR protocol guarantees fairness, but doesn't consider QoS. To practicalize CSMA/CR protocol in saturation fully-connected single hop network environments, this paper proposes method of collision compensation. previous CSMA/CR protocol chooses CR Slot only considering fairness, but this paper chooses front CR Slot for compensation of collision to station experiencing collisions. The station transmits jam signal and has channel priority of transmission. So transmitting efficiency and successful transmission probability rise. This proposed simple method can offer benefit to station experiencing collisions without additional hardware cost.

• Journal of Advanced Navigation Technology
• /
• 제23권4호
• /
• pp.302-308
• /
• 2019

Aircraft data network (ADN) is a data networking for signal transmission among avionic systems in aircraft, and it mostly has been applied MIL-STD-1553B that guarantees high reliability considering its application environments. However, commercial Ethernet has been widely applied for ADN recently, and its range of applications have increased. Ethernet provides high speed of data transmission, however, it could not guarantee quality of service (QoS) so high as MIL-STD-1553B. In this paper, we propose dynamic routing and priority based data transmission schemes in order to improve the QoS of legacy Ethernet. Our propose schemes can be applied to Ethernet switch, and it is able to manage network traffic efficiently, and reduce the time for data transmission. We analyze the packet transmission time for both legacy and proposed schemes in Ethernet environments using simulation, and we show that our proposed scheme can reduce the time for data transmission compare to legacy spanning tree protocol.

• The KIPS Transactions:PartC
• /
• 제10C권3호
• /
• pp.305-310
• /
• 2003

The performance of various GFR implementations has been recently studied due to the interest to provide bandwidth guarantees with a simpler implementation than ABR in ATM networks. One of the important factors is buffer management for guaranteeing QoS in GFR service. An efficient buffer management algorithm is necessary to guarantee MCR for untagged cell in ATM switch. In this paper, we propose and evaluate a buffer management scheme to provide the GFR service guarantees. The proposed scheme can control the cell discarding for fairness in each VC, and compared with Double-EPD and DFBA. Our results show that the proposed buffer management with per-VC queuing achieves significant enhancement on goodputs and fairness index than those of existing methods.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• 제38권6호
• /
• pp.28-38
• /
• 2001

In this paper, we propose and analyze a more efficient and flexible dynamic data traffic system for a circuit switched satellite network. Our proposed system is more efficient than existing circuit switched satellite networks and allows for dynamic capacity in each connection without rebuilding or resetting the connection software or algorithms. We also discuss an algorithm for bandwidth allocation that provides deterministic quality of service guarantees. The traffic sources are regulated using standard dual leaky buckets; the system performance is analytically evaluated; and the algorithm is verified through simulation. Our analysis scheme and results should prove useful for the design and implementation of protocols in future circuit-switched satellite networks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국정보통신학회 2014년도 추계학술대회
• /
• pp.165-167
• /
• 2014

In this paper, an packet drop technique is proposed to outperform the previous RIO (RED In and Out) drop mechanism for DiffServ in ship area networks. the proposed packet drop technique does not manage the individual flows and divides them into several flow groups according to a criterion. And it guarantees the fairness between individual flows in the same QoS class through the group-based control. In simulation results of the proposed packet drop technique, the link utilization decreases than RIO. But it guarantees more data rates to DiffServ flows passing multiple bottleneck links.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제29권4C호
• /
• pp.461-471
• /
• 2004

Recently, subscribers have strong desire to get QoS based personalized services in high-speed Internet access. Service providers have been rapidly replacing ADSL, cable broadband access networks with Metro-Ethernet based VDSL. But, it is difficult for Motto-Ethernet based broadband access networks to provide QoS based personalized services, because already deployed network elements cannot distinguish subscribers by specific traffic characteristics. In this paper, when the access network has tree topology, we show that it is possible to provide QoS for each downstream flow with only per flow traffic shaping at the edge node without QoS functions in access networks. In order to show that our suggested scheduling algorithm at the edge node can support the assured service in tree topology access networks, we evaluated its performance by simulation. The suggested scheduling algorithm can shape per-flow traffic based on the maximum bandwidth, and guarantees minimum bandwidth per flow by modifying the DRR scheduler. Simulation results show that congestion and loss in the access network elements are greatly reduced, TCP performance is highly enhanced and loss for assured CBR service flows is reduced by only shaping per-flow traffic at the edge node using our proposed scheduling algorithm.

• Journal of KIISE:Information Networking
• /
• 제36권5호
• /
• pp.425-436
• /
• 2009

In recent years, the user demands have increased for multimedia service of high quality over the broadband convergence network. These rising demands for high quality multimedia service led the popularization of various user terminals and large scale display equipments, which needs a variety type of QoS (Quality of Service). In order to support demands for QoS, numerous research projects are in progress both from the perspective of network as well as end system; For example, at the network perspective, QoS guaranteeing by improving of internet performance such as Active Queue Management, while at the end system perspective, SVC (Scalable Video Coding) encoding scheme to guarantee media quality. However, existing AQM algorithms have problems which do not guarantee QoS, because they did not consider the essential characteristics of video encoding schemes. In this paper, it is proposed to solve this problem by deploying the TS- AQM (Temporal Scalability Active Queue Management) which employs the differentiated packet dropping for dependency of the temporal level among the frames, based on SVC encoding characteristics by exploiting the TID (Temporal ID) field of the SVC NAL unit header. The proposed TS-AQM guarantees multimedia service quality through video decoding reliability for SVC streaming service, by differentiated packet dropping when congestion exists.