• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.64-72
• /
• 2004

Multiprotocol Label Switching (MPLS) has been developed as a key technology to enhance the reliability, manageability and overall quality of service of core If networks with connection-oriented tunnel LSP and traffic engineering such as constraint-based routing, explicit routing, and restoration. In this paper, we propose a control bandwidth borrowing scheme that maximizes the utilization of tunnel LSPs or physical links by an extension to the RSVP-TE label distribution protocol. MPLS-based core switching network and VPN services rely on the establishment of connection-oriented tunneled LSPs that are configured or predefined by network management systems. The mechanism of network management system varies from (i) a relatively static LSP establishment accounting, to (ii) a dynamic QoS routing mechanisms. With the use of hierarchical LSPs, the extra bandwidth that is unused by the trunk (outer) LSPs should be fully allocated to their constituent end-to-end user traffic (inner) LSPs in order to maximize their utilization. In order to find out the unused extra bandwidth in tunnel LSP or physical link and redistribute these resources to constituent LSPs, we expend the functionality of RSVP-TE and the found unused extra bandwidth is redistributed with a weight-based recursive redistribution scheme. By the extended RSVP-TE and proposed recursive redistributed scheme, we could achieve the instantaneous maximized utilization of tunnel LSP or physical link suffering from the potential under-utilization problem and guarantee the end-to-end QoS requirements. With the proposed scheme, network manager can manage more effectively the extra available bandwidth of hierarchical LSPs and maximize the instantaneous utilization of the tunneled LSP resources.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.6
• /
• pp.311-318
• /
• 2013

In this paper, we consider a new packet scheduling algorithm for real-time traffic in the HSDPA system that has been introduced for the WCDMA system, in order to provide high transmission rates. The objective of the design is to meet the maximum tolerable delay and consider channel assignment based on the received SIR for real-time traffic users. The proposed scheduling algorithm shows that the users are ranked by the ratios of the bits in the buffer to the residual time for transmission as priority order; then the ranked users are assigned certain number of channels based on the SIR value table. The simulation results show that the proposed algorithm can provide a lower packet drop rate, and satisfy real time quality of service (QoS) requirements.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.127-130
• /
• 1998

Wireless multimedia networks require channel allocation strategies for various multimedia traffic since the mobility of users needs to be considered in addition to diversity of QoS requirements of multimedia traffic. In this paper, we propose an Efficient Channel Allocation strategy, based on prioritization of handoff calls used in Guard channel method. Gurad channels can be shared between non real time calls and real time handoff calls. To decrease the probability of handoff failure, when resources become scarce, the Call Admission Control can take some resources away from the active calls. It is shown through extensive simulations that the proposed strategy provides higher channel utilization and lower probability of handoff failure than existing strategies.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.319-322
• /
• 2002

In this paper, we consider a generalized rule of retransmission request, identified as (Μ, $\sigma$) rule for multicopy transmission ARQ. Following a revised rule to conform with a strict criterion for requesting a retransmission, we can reduce the probability that a packet accepted by the receiving node is still being infected with errors. In turn, such amendment invokes a degradation of delay and throughput performance. For a quantitative evaluation of (Μ, $\sigma$) rule, we develop an analytical method to calculate probability of error remains, maximum throughput, average and peak delays, and delay variation. From the numerical examples made by use of the analytical method, we observe a performance trade-off between probability of error remains and delay/throughput. We also confirm the adaptability of (Μ, $\sigma$) rule to meet various QoS requirements.

• International Journal of Computer Science & Network Security
• /
• v.22 no.3
• /
• pp.95-100
• /
• 2022

Cloud computing platform is a shared pool of resources and services with various kind of models delivered to the customers through the Internet. The methods include an on-demand dynamically-scalable form charged using a pay-per-use model. The main problem with this model is the allocation of resource in dynamic. In this paper, we have proposed a mechanism to optimize the resource provisioning task by reducing the job completion time while, minimizing the associated cost. We present the Cooperative Agents Dynamic Resource Allocation and Monitoring in Cloud Computing CADRAM system, which includes more than one agent in order to manage and observe resource provided by the service provider while considering the Clients' quality of service (QoS) requirements as defined in the service-level agreement (SLA). Moreover, CADRAM contains a new Virtual Machine (VM) selection algorithm called the Node Failure Discovery (NFD) algorithm. The performance of the CADRAM system is evaluated using the CloudSim tool. The results illustrated that CADRAM system increases resource utilization and decreases power consumption while avoiding SLA violations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7A
• /
• pp.560-568
• /
• 2012

Spectrum sensing and spectrum decision are the main functions that cognitive radios (CRs) have to perform in order to get the best available spectrum band for the establishment of a wireless communication. These problems are worsened in the presence of users with different demands and spectrum channels with different properties in a heterogeneous network. The primary objective in this work is to design and simulate a new spectrum decision algorithm for heterogeneous cognitive radio system. To this end, first, we consider all cognitive users are separated into different traffic classes according to their Quality of Service (QoS). The cognitive users within one traffic class perform spectrum sensing in centralized group-based cooperative spectrum sensing system and the users of different traffic classes share the sensing results. Second, we propose a novel use of the Analytic Hierarchy Process (AHP) to optimally select available bands according to user requirements and detected spectrum channel characteristics (SCC). In this paper, utility function is used as spectrum decision algorithm. Simulation results demonstrate that the proposed method shows can effectively select the best available spectrum channels with a low complexity.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.105-110
• /
• 2005

With the proliferation of multimedia group applications, the construction of multicast trees satisfying QoS requirements is becoming a problem of prime importance. In this paper, we study the delay- and delay variation-bounded multicast tree (DVBMT) problem which is NP-complete. The problem is to construct a spanning tree for destination node, which has the minimized multicast delay variation, and the delay on the path from the source to each destination is bounded. A solution to this problem is required to provide decent real-time communication services such as on-line games, shopping, and teleconferencing. Performance comparison shows that the proposed scheme outperforms DDVCA which is known to be effective so far in any network topology. The enhancement is up to about $3.6{\%}{\~}11.1{\%}$ in terms of normalized surcharge for DUVCA. The time complexity of our algorithm is $O(mn^2)$.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2003.05a
• /
• pp.8-13
• /
• 2003

Historically, IP-based internets have been able to provide a simple best-effort delivery service to all applications they carry. Best effort treats all packets equally, with no service level, packet loss, and delay. But the needs of users have changed. The want to use the new real-time, multimedia, and multicasting applications. Thus, there is a strong need to be able to support a variety of traffic with a variety of quality-of-service requirements. The DiffServ architecture, proposed by the Internet Engineering Task Force(IETF), has become the most viable solution for provising QoS over IP networks. The DiffServ architecture does not specify any handling method between AF out-profile packets and BE packets. This paper propose a mechanism for supporting inter class fairness in the DiffServ architecture. Ⅰ proposed a modified Weighted Round Robin method to protect the BE traffic from AF out-profile packets in the core routers. The proposed technique is evaluated through simulation. Simulation results indicate that the proposed method provides better protection not only for BE packets from AF out-profile packets, but also for the AF in-profile packets in congested networks.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1770-1780
• /
• 1997

Our problem is improvement of image quality because it is inevitable cell loss of image data when traffic congestion occurs. If cells are discarded indiscriminately in transmission of MPEG video data, it occurs severe degradation in quality of service(QOS). In this paper, to solve this problem, we propose two method. The first, we analyze the traffic characteristics of an MPEG encoder and generate high priority and low priority data stream. During network congestion, only the least low priority cells are dropped, and this ensures that the high priority cells are successfully transmitted, which, in turn, guarantees satisfactory QoS. In this case, the prioritization scheme for the encoder assigns components of the data stream to each priority level based on the value of a parameter ${\beta}$. The second, Number of high priority cells are increased when value of ${\beta}$ is large. It occurs the loss of high priority cell in the congestion. To prevent it, this paper is regulated to data stream rate as buffer occupancy with UPC controller. Therefore, encoder's bandwidth can be calculated renegotiation of the encoder and networks. In this paper, the encoder's bandwidth requirements are characterized by a usage parameter control (UPC) set consisting of peak rate, burstness, and sustained rate. An adaptive encoder rate control algorithm at the Networks Interface Card(NIC) computes the necessary UPC parameter to maintain the user specified quality of service. Simulation results are given for a rate-controlled VBR video encoder operating through an ATM network interface which supports dynamic UPC. These results show that dynamic bandwidth renegotiation of prioritized data stream could provided bandwidth saving and significant quality gains which guarantee high priority data stream.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.495-507
• /
• 2006

In wireless local area networks (WLANs), the successful design of scheduling algorithm is a key factor in guaranteeing the various quality of service (QoS) requirements for the stringent real-time constraints of multimedia services. In this paper we propose a multipolling-based dynamic scheduling algorithm for providing delay guarantees to multimedia traffics such as MPEG streams. The dynamic algorithm exploits the characteristics of MPEG stream, and uses mini frames for feedback control in order to deliver dynamic parameters for channel requests from stations to the point coordinator (PC) operating at the access point (AP). In this scheme, the duration of channel time allocated to a station during a superframe is changed dynamically depending on the MPEG frame type, traffic load and delay bound of the frame, etc. Performance of the proposed scheme is investigated by simulation. Our results show that compared to conventional scheme, the proposed scheme is very effective and has high performance while guaranteeing the delay bound.