• Journal of Korea Multimedia Society
• /
• v.4 no.5
• /
• pp.371-376
• /
• 2001

Since continuous media such as video and audio data are displayed within a certain time constraint, their computation and manipulation should be handled under limited condition. Traditional real-time scheduling algorithms cold be directly applicable, because they are not suitable for multimedia scheduling applications which support many clients at the same time. Rate Regulating Proportional Share Scheduling Algorithm based on the stride scheduler is a scheduling algorithm considered the time constraint of the continuous media. The stride schedulers, which are designed to general tasks, guarantee the fairness of resource allocation and predictability. The key concept of RRPSSA is a rate regulator which prevents tasks from receiving more resource than its share in a given period. But this algorithm loses fairness which is a strong point of the stride schedulers, and does not show graceful degradation of performance under overloaded situation. This paper proposes a new modified algorithm, namely Modified Proportional Share Scheduling Algorithm considering the characteristics of multimedia data such as its continuity and time dependency. Proposed scheduling algorithm shows graceful degradation of performance in overloaded situation and it reduces the scheduling violations up to 70% by maintaining the fair resource allocation. The number of context switching is 8% less than RRPSSA and the overall performance is increased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3B
• /
• pp.161-167
• /
• 2007

In this paper, we evaluate the capacity of voice over internet protocol (VoIP) services over high-speed downlink packet access (HSDPA), in which frame-bundling (FB) is incorporated to reduce the effect of relatively large headers in the IP/UDP/RTP layers. Also, a modified proportional pair (PF) packet scheduler design supporting for VoIP service is provided. The main focus of this work is the effect of FB on system outage based on delay budget in radio access networks. Simulation results show that VoIP system performance with FB scheme is highly sensitive to delay budget. We also conclude that HSDPA is attractive for transmission of VoIP if compared to the circuit switched (CS) voice that is used in WCDMA (Release'99).

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.1
• /
• pp.3-8
• /
• 2016

Wireless networks have evolved to the appearance of heterogeneous wireless networks(HetNet), where various networks provide data services with various data rates and coverage. One of technical issues for HetNet is efficient utilization of radio resources for system performance enhancement. For the next generation wireless networks, energy saving has become one of key performance indices, so energy-efficient resource management schemes for HetNet need to be developed. This paper addresses an energy-efficient scheduling for HetNet in order to improve the energy efficiency while maintaining similar system throughput as existing scheme, for which an energy-efficient scheduling that energy efficiency factor is included. Simulation results show that the proposed scheme achieves the reduction of energy consumption while admitting limited ragne of throughput degradation in comparison with the conventional proportional fair scheduling.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.618-636
• /
• 1997

DQDB(Distributed Queue Dual Bus) protocol, the IEEE 802.6 standard protocol for metropolitan area networks, does not fully take advantage of the capabilities of dual bus architecture. Although fairness in bandwidth distribution among nodes is improved when using so called the bandwidth balancing mechanism, the protocol requires a considerable amount of time to adjust to changes in the network load. Additionally, the bandwidth balancing mechanism leaves a portion of the available bandwidth unused. In a high-speed backbone network, each node may act as a bridge/ router which connects several LANs as well as hosts. However, Because the existence of high speed LANs becomes commonplace, the congestionmay occur on a node because of the limitation on access rate to the backbone network and on available buffer spaces. to release the congestion, it is desirable to install some congestion control algorithm in the node. In this paper, we propose an efficient congestion control mechanism and fair and waster-free MAC protocol for dual bus network. In this protocol, all the buffers in the network can be shared in such a way that the transmission rate of each node can be set proportional to its load. In other words, a heavily loaded node obtains a larger bandwidth to send the sements so tht the congestion can be avoided while the uncongested nodes slow down their transmission rate and store the incoming segments into thier buffers. this implies that the buffers on the network can be shared dynamically. Simulation results show that the proposed probotol significantly reduces the segment queueing delay of a heavily loaded node and segment loss rate when compared with original DQDB. And it enables an attractive high throughput in the backbone network. Because in the proposed protocol, each node does not send a requet by the segment but send a request one time in the meaning of having segments, the frequency of sending requests is very low in the proposed protocol. so the proposed protocol signigificantly reduces the segment queuing dely. and In the proposed protocol, each node uses bandwidth in proportion to its load. so In case of limitation of available buffer spaces, the proposed protocol reduces segment loss rate of a heavily loaded node. Bandwidth balancing DQDB requires the wastage of bandwidth to be fair bandwidth allocation. But the proposed DQDB MAC protocol enables fair bandwidth without wasting bandwidth by using bandwidth one after another among active nodes.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.499-509
• /
• 2010

A plethora of transmission control protocol (TCP) congestion control algorithms have been devoted to achieving the ultimate goal of high link utilization and fair bandwidth sharing in high bandwidth-delay product (HBDP) networks. We present a new insight into the TCP congestion control problem; in particular an end-to-end delay-based approach for an HBDP network. Our main focus is to design an end-to-end mechanism that can achieve the goal without the assistance of any network feedback. Without a router's aid in notifying the network load factor of a bottleneck link, we utilize goodput and throughput values in order to estimate the load factor. The obtained load factor affects the congestion window adjustment. The new protocol, which is called TCP-goodput and throughput (GT), adopts the carefully designed inversely-proportional increase multiplicative decrease window control policy. Our protocol is stable and efficient regardless of the link capacity, the number of flows, and the round-trip delay. Simulation results show that TCP-GT achieves high utilization, good fairness, small standing queue size, and no packet loss in an HBDP environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.1
• /
• pp.37-44
• /
• 2016

It is important that using of efficient radio resource because of deficiency spectrum problem, so that related to this problem many researches are have proceeded. To solve this problem, Cognitive Radio(CR) was suggested. The channels are allocated to the secondary users when the primary users don't use the channels, and unfairness of secondary users can be serious problem and channel quality of multichannel can be different due to the different traffic pattern of primary users. In this paper, we propose MAC prtocol both of the user's fairness and channel quality in CR networks. Simulation results show the comparison with CR MAC protocols.

• Composites Research
• /
• v.24 no.5
• /
• pp.29-33
• /
• 2011

The application of high performance materials for the deck can represent a fair alternative to reduce the weight of the deck and improve the econimic efficiency of the bridge even if high performance materials are costly. In UHPC(Ultra High Performance Concrete) bridges, it is necessary to verify that exiting headed stud can be used to transfer longitudinal shear forces across the steel-concrete interface. In this paper, the push-out tests are performed to analisys the composite behavior between UHPC bridge deck and steel girder. The ultimate strength of test specimens is proportional to the diameter of headed studs in push-out test for static loading. Test results show that the shear strength of headed stud is improved for the case of normal concrete bridge decks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.8
• /
• pp.1469-1476
• /
• 2015

We propose a beam selection algorithm that improves inter sector SIR using a code-book of a circular array antenna in multi-sector wireless mesh network environments. The proposed method improves SIR using a combination of fed back code-book and guarantees QoS of all nodes. Computer simulation exhibits the proposed scheme demonstrates 4.42dB higher SIR than that of the conventional code-book method, QoS with proportional fair is improved by 1.70dB and fact that all nodes are satisfied Qos is also shown.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.777-787
• /
• 2005

In this paper, we propose an urgency- and efficiency-based wireless packet scheduling (UEPS) algorithm that is able to schedule real-time (RT) and non-real-time (NRT) traffics at the same time while supporting multiple users simultaneously at any given scheduling time instant. The UEPS algorithm is designed to support wireless downlink packet scheduling in an orthogonal frequency division multiple access (OFDMA) system, which is a strong candidate as a wireless access method for the next generation of wireless communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average channel status as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics while satisfying quality-of-service (QoS) requirements of RT traffics. The simulation study shows that the UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF), while satisfying the QoS requirements of RT traffics such as average delay and packet loss rate under various traffic loads.

• KIEE International Transactions on Power Engineering
• /
• v.5A no.1
• /
• pp.79-84
• /
• 2005

In many countries, the electric power industry is undergoing significant changes known as deregulation and restructuring. These alterations introduce competition in generation and retail and require open access to the transmission network. The competition of the electric power industry causes many issues to surface. Among them, unbundling of the transmission service is probably the most complicated as it is a single and integrated sector and the transmission revenue requirement must be allocated to market participants in a fair way. In these situations, it is valuable to research the methodologies to allocate transmission usage. The power tracing method offers useful information such as which generators supply a particular load or how much each generator (load) uses a particular transmission line. With this information, we can allocate required transmission revenue to market participants. Recently, several algorithms were proposed for tracing power flow but there is no dominant power tracing method. This paper proposes a power tracing method based on graph theory and complex-current distribution. For practicability, the proposed method for transmission usage allocation is applied to IEEE 30 buses and compared with the method proposed by Felix F.Wu.