• ETRI Journal
• /
• v.27 no.1
• /
• pp.13-21
• /
• 2005

Many multicast applications, such as video-on-demand and video conferencing, desire quality of service (QoS) support from an underlying network. The differentiated services (DiffServ) approach will bring benefits for theses applications. However, difficulties arise while integrating native IP multicasting with DiffServ, such as multicast group states in the core routers and a heterogeneous QoS requirement within the same multicast group. In addition, a missing per-flow reservation in DiffServ and a dynamic join/leave in the group introduce heavier and uncontrollable traffic in a network. In this paper, we propose a distributed and stateless admission control in the edge routers. We also use a mobile agents-based approach for dynamic resource availability checking. In this approach, mobile agents act in a parallel and distributed fashion and cooperate with each other in order to construct the multicast tree satisfying the QoS requirements.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1489-1492
• /
• 2003

이동 컴퓨팅 환경에서 사용자의 이동 특성은 실시간 멀티미디어 서비스를 제공하기 위해서 요구되는 QoS(Quality of Service)에 심각한 영향을 미친다. RSVP(Resource reservation Protocol)는 유선을 기반으로 실시간 서비스를 제공하기 위해서 제안된 프로토콜로써 이동 환경에 적용하기에는 부적합하다. MRSVP(Mobile RSVP)는 RSVP를 기반으로 사용자의 이동이 QoS에 미치는 영향을 최소화하기 위해서 사용자가 이동할 것으로 예상되는 영역에 대한 자원을 미리 예약하는 프로토콜이다. 본 논문은 기존의 MRSVP를 확장하여 Mobile IP 지역등록(Regional Registration) 프로토콜과 이웃 라우터 발견 메커니즘(Neignbor Router Discovery Mechanism)을 결합하여 동적 앵커 에이전트(DAA: Dynamic Anchor Agent)를 계층적으로 구성하는 QoS지원 방안을 제안한다. 이는 기존의 MRSVP에서 미리 예약되는 자원예약 범위를 네트워치 위상을 고려하여 지역적으로 제한함으로써 자원예약을 최소화하는 반면에 기존의 MRSVP와 유사한 수준의 QoS 보장을 목적으로 한다.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.121-124
• /
• 2003

Passive optical networks (PONs) will be the pervasive choice in the design of next-generation access networks. One possible solution to implementing Passive optical access network is to rely on wavelength-division multiplexing (WDM). In this paper, we solve the problem of providing real-time service to both hard and soft real-time messages in conjunction with a conventional vest-effort service in WDM. we propose an adaptive scheduling algorithm to schedule and manage the message transmissions in the optical access network. Proposed algorithm is MLF-MQF. Also, we suggest dynamic bandwidth algorithm(DBA) in Loop-back WDM-PON (LPB-PON).our mechanism based on bandwidth reservation protocol.

• The Journal of Engineering Research
• /
• v.5 no.1
• /
• pp.17-35
• /
• 2004

Svg(Scalable Vector Graphics) is xml graphic standard recommended by E3C as a language based on xml to express two-dimension graphic. Svg can accommodate all Xml's patency and advantage of interoperability, and can used as various web applications being combined with other xml language. In addition, Svg can be applied to the fields of electronic commerce, geographical information, computer education and advertisement because it can produce high quality of dynamic from real-time data. SVG's application can be enhanced by linking with database. In this paper, we discuss how Svg can be utilized in theater reservation system, not just explaining svg's meaning or ability. Svg added graphic advantage in addition to xml's advantage. This means that svg retains not only graphic element but also xml's softness. It becomes easier to designate seats and add them. Current reservation system provided in general only information on time and price for a ticket, but the system using SVG in this paper provides additional information on position, price, cancellation and purchase availability of seat.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.543-550
• /
• 2002

This paper proposes the dynamic slot allocation method for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed method is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed method guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.2
• /
• pp.139-147
• /
• 2004

To provide Internet QoS, the IETF Proposed two models of Integrated Services (IntServ) and Differentiated Services (DiffServ) Unlike IntServ where resource reservation and admission control is Per-flow based using RSVP. DiffServ supports aggregated traffic classes to provide various QoS to different classes of traffics. However a dynamic QoS management system is required to dynamically provide differentiated QoS for customers who require dynamic QoS change. This paper designed and implemented therefore a policy-based QoS management system to manage effectively and configure dynamically QoS of DiffServ networks. The validity of the system has been verified by the experimentation on the Linux-based DiffServ network.

• The Journal of Korean Association of Computer Education
• /
• v.12 no.2
• /
• pp.77-86
• /
• 2009

Large-scale applications, that needs large-capacity R&D resources and realtime data transmission, have demanded more stable and high-performance network environment than current Internet environments. Recently, global R&D networks have focuses on utilizing Lambda networking technologies and resource reservation systems to be satisfied with various applications' requirements. In this paper, we modify the existing DRS (Dynamic Right-Sizing) model to reflect various advantages in terms of the stability and high-capacity of Lambda network. In addition, we suggest the design methodology of high-performance Lambda network, which can integrate NRPS (Network Resource Provisioning System) into our modified DRS model.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.3
• /
• pp.62-73
• /
• 2012

IEEE 802.15.4 standard which has low-speed, low-power, low-cost can be efficiently used in wireless sensor network environment. Among various topologies used in IEEE 802.15.4 standard, a cluster-tree topology which has many nodes in it, transmit delay, energy consumption and data loss due to traffic concentration around the sink node. In this paper, we propose the MRS-DCA algorithm that minimizes conflicts between packets for efficient data transmission, and dynamically allocates the active period for efficient use of limited energy. The MRS-DCA algorithm allocates RP(Reservation Period) to the active period of IEEE 802.15.4 and guarantees reliable data transmission by allocating RP and CAP dynamically which is based on prediction using EWMA. The comparison result shows that the MRS-DCA algorithm reduces power consumption by reducing active period, and increasing transmission rate by avoiding collision.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2940-2947
• /
• 2000

In the wireless ATM networks, a Medium Access Control (MAC) protocol is required to support an integrated mix of multimedia traffic services. The MAC protocol should be designed in a way that the limited wireless bandwidth can be efficiently utilized maximizing the Quality of Service (QoS) guarantees for various traffic service classes. In this paper, a Dynamic Resource Allocation-based MAC protocol, which satisfies QoS of each traffic service class in the wireless ATM environment, is proposed. The proposed MAC protocol adopts the dynamic channel allocation schemes for a mix of different traffic service classes. The suggested MAC protocol is designed to provide the QoS guarantees for Constant Bit Rate (CBR) or real-time Variable Bit Rate (VBR) traffic through fixed or dynamic reservation. For Available Bit Rate (ABH) traffic, which has the lowest priority among the traffic classes, large improvement in delay by reserving the minimum bandwidth is shown. And for real-time VBR traffic, increase in throughput of transmission is demonstrated because of bandwidth, which is allocated through contention at the initial phase and without contention thereafter.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5723-5743
• /
• 2018

The evolving internet-based services demand high-speed data transmission in conjunction with scalability. The next generation optical network has to exploit artificial intelligence and cognitive techniques to cope with the emerging requirements. This work proposes a novel way to solve the dynamic provisioning problem in optical network. The provisioning in optical network involves the computation of routes and the reservation of wavelenghs (Routing and Wavelength assignment-RWA). This is an extensively studied multi-objective optimization problem and its complexity is known to be NP-Complete. As the exact algorithms incurs more running time, the heuristic based approaches have been widely preferred to solve this problem. Recently the software-defined networking has impacted the way the optical pipes are configured and monitored. This work proposes the dynamic selection of path computation algorithms in response to the changing service requirements and network scenarios. A software-defined controller mechanism with a novel packet matching feature was proposed to dynamically match the traffic demands with the appropriate algorithm. A software-defined controller with Path Computation Element-PCE was created in the ONOS tool. A simulation study was performed with the case study of dynamic path establishment in ONOS-Open Network Operating System based software defined controller environment. A java based NOX controller was configured with a parent path computation element. The child path computation elements were configured with different path computation algorithms under the control of the parent path computation element. The use case of dynamic bulk path creation was considered. The algorithm selection method is compared with the existing single algorithm based method and the results are analyzed.