• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.723-731
• /
• 2005

Wide spread deployment of infrastructure WLANs has made Wi Fi an integral part of today's Internet access technology. Despite its crucial role in affecting end to end performance, past research has focused on MAC protocol enhancement, analysis and simulation based performance evaluation without sufficient consideration for modeling inaccuracies stemming from inter layer dependencies, including physical layer diversity, that significantly impact performance. We take a fresh look at IEEE 802.11 WLANs, and using experiment, simulation, and analysis demonstrate its surprisingly agile performance traits. Contention based MAC throughput degrades gracefully under congested conditions, enabled by physical layer channel diversity that reduces the effective level of MAC contention. In contrast, fairness and jitter significantly degrade at a critical offered load. This duality obviates the need for link layer flow control for throughput improvement but necessitates traffic control for fairness and QoS. We use experimentation and simulation in a complementary fashion, pointing out performance characteristics where they agree and differ.

• Journal of KIISE:Information Networking
• /
• v.36 no.4
• /
• pp.286-296
• /
• 2009

A major challenge in next generation optical Internet (NGOI) networks based on dense-wavelength division multiplexing (DWDM) is the provision of guaranteed quality-of-service (QoS) for a wide variety of multimedia applications. One of the critical issues in NGOI is the routing and wavelength assignment problem that is embossed as very important and plays a key role in improving the global efficiency for capacity utilization. But the previous researches had the delay problem, and the path routed by higher priority nodes may be congested and interfere with potential future multicast session requests. To overcome these problems, in this research we suggest a Priority-based Minimum Interference Path Multicast Routing (PMIPMR) algorithm, a new routing algorithm which finds alternative routes based on node priorities and Virtual Source (VS) nodes that has both splitting and wavelength conversion, and then chooses a path that does not interfere with potential future multicast session requests when congestions occur in the network. The PMIPMR algorithm reduces blocking rate significantly and increases the wavelength utilization by avoiding congestion in future multicast session requests.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.658-668
• /
• 2011

Over the past decade, the improvement of communications technologies and the rapid spread of www (World Wide Web) have brought on the exponential growth of users using Internet and real time multimedia multicast services like video conferencing, tele-immersive virtual reality, and Internet games. The dense-wavelength division multiplexing (DWDM) networks have been widely accepted as a promising approach to meet the ever-increasing bandwidth demands of Internet users, especially in next generation Internet backbone networks for nation-wide or global coverage. A major challenge in the next generation Internet backbone networks based on DWDM technologies is the resolution of the multicasting RWA (Routing and Wavelength Assignment) problem; given a set of wavelengths in the DWDM network, we set up light-paths by routing and assigning a wavelength for each connection so that the multicast connections are set-upped as many as possible. Finding such optimal multicast connections has been proven to be Non-deterministic Polynomial-time-complete. In this paper, we suggest a new heuristic multicast routing and wavelength assignment method for multicast sessions called DVS-PMIPMR (Differentiated Virtual Source-based Priority Minimum Interference Path Multicast Routing algorithm). We measured the performance of the proposed algorithm in terms of number of wavelength and wavelength channel. The simulation results demonstrate that DVS-PMIPMR algorithm is superior to previous multicast routing algorithms.

• Journal of Intelligence and Information Systems
• /
• v.7 no.1
• /
• pp.17-25
• /
• 2001

Tree model is the most popular classification algorithm in data mining due to easy interpretation of the result. In CART(Breiman et al., 1984) and C4.5(Quinlan, 1993) which are representative of tree algorithms, the split fur classification proceeds to attain the homogeneous terminal nodes with respect to the composition of levels in target variable. But, fur instance, in the chum prediction modeling fur CRM(Customer Relationship management), the rate of churn is generally very low although we are interested in mining the churners. Thus it is difficult to get accurate prediction modes using tree model based on the traditional split rule, such as mini or deviance. Buja and Lee(1999) introduced a new split rule, one-sided purity for classifying minor interesting group. In this paper, we compared one-sided purity with traditional split rule, deviance analyzing churning vs. non-churning data of ISP company. Also reviewing the result of tree model based on one-sided purity with some simulated data, we discussed problems and researchable topics.

• Journal of Korea Society of Industrial Information Systems
• /
• v.5 no.2
• /
• pp.22-31
• /
• 2000

The VB5.2 interface of B-lSDN, that is located between an access network and a service node, allows dynamic allocation and release of ATM resources. In this paper, we propose the B-ANCC protocol of the VB5.2 interface to minimize the overall connection setup delay by introducing the access network. The B-ANCC protocol enhances the B-BCC protocol and adopts a parallel interworking function with signaling protocols in the service node. To confirm the correctness of the proposed B-ANCC protocol, we validate it using the automated validation tool, SPIN. We analyze and simulate the sequential interworking model based on the B-BCC protocol and the parallel interworking model based on the B-ANCC protocol, in terms of a connection setup delay and a completion ratio. It is shown that our proposed parallel interworking model with B-ANCC reduces a setup delay and improves a completion ratio compared to the sequential interworking model with B-BCC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3A
• /
• pp.160-167
• /
• 2005

The gain-clamped EDFA has been developed to eliminate the output power change of WDM surviving channels to occur with added or dropped channels, which degrades the performance of WDM optical network. It maintains the constant gain of surviving channels when WDM channels are added or dropped in a network amplifying node. In this paper, the hi-directionally pumped gain-clamped EDFA is implemented to compensate the change of the input power by a lasing. The results show that the lasing of a short wavelength and backward propagation is the optimal condition to minimize the transient response of surviving channels in terms of the overshoot and gain saturation due to the inhomogeneous broadening effect.

• Journal of Korea Multimedia Society
• /
• v.14 no.1
• /
• pp.33-43
• /
• 2011

Routing technologies considering QoS-based hypermedia services have been seen as a crucial network property in next generation optical Internet (NGOI) networks based on IP/dense-wavelength division multiplexing (DWDM). The huge potential capacity of one single fiber. which is in Tb/s range, can be exploited by applying DWDM technology which transfers multiple data streams (classified and aggregated IP traffics) on multiple wavelengths (classified with QoS-based) simultaneously. So, DWDM-based optical networks have been a favorable approach for the next generation optical backbone networks. Finding a qualified path meeting the multiple constraints is a multi-constraint optimization problem, which has been proven to be NP-complete and cannot be solved by a simple algorithm. The majority of previous works in DWDM networks has viewed heuristic QoS routing algorithms (as an extension of the current Internet routing paradigm) which are very complex and cause the operational and implementation overheads. This aspect will be more pronounced when the network is unstable or when the size of network is large. In this paper, we propose a flooding-based unicast and multicast QoS routing methodologies(YS-QUR and YS-QMR) which incur much lower message overhead yet yields a good connection establishment success rate. The simulation results demonstrate that the YS-QUR and YS-QMR algorithms are superior to the previous routing algorithms.