• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.199-211
• /
• 2009

Recent advancements in wireless networks have enabled support for mobile applications to transfer data over heterogeneous wireless paths in parallel using data striping technique [2]. Traditionally, high performance data transfer requires tuning of multiple TCP sockets, at sender's end, based on bandwidth delay product (BDP). Moreover, traditional techniques like Automatic TCP Buffer Tuning (ATBT), which balance memory and fulfill network demand, is designed for wired infrastructure assuming single flow on a single socket. Hence, in this paper we propose a buffer tuning technique at senders end designed to ensure high performance data transfer by striping data at transport layer across heterogeneous wireless paths. Our mechanism has the capability to become a resource management system for transport layer connections running on multi-homed mobile host supporting features for wireless link i.e. mobility, bandwidth fluctuations, link level losses. We show that our proposed mechanism performs better than ATBT, in efficiently utilizing memory and achieving aggregate throughput.

• Journal of Korea Multimedia Society
• /
• v.5 no.1
• /
• pp.68-76
• /
• 2002

Multicast in mobile host has the problem of hast mobility, multicast decision, triangle routing, tunnel convergence, implosion of retransmission, and bandwidth waste. In particular, the bandwidth waste in radio is a definite factor that decreases transmission rate. To solve the problems, this paper proposes a new multicast transmission protocol called FIM(Forward Error Correction Integrated Multicast), which supports reliable packet recovery mechanism by integrating If Mobility Support for the host mobility, IGMP(Interned Group Management Protocol) for the group management, and DVMRP(Distance Vector Multicast Routing Protocol) for the multicast routing, and it also uses FEC and the local recovery method based on receiver. The performance measurement is performed by dividing the losses into the homogeneous independent loss, the heterogeneous independent loss, and the shared source link loss model.. The result shows that the performances improves in proportion to the size of local areal group when the size of transmission group exceeds designated size. This indicates FIM is effective in the environment where there are much of data and many receivers in the mobile host.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.468-471
• /
• 2010

MOST150, which has a higher bandwidth than of MOST25, appears to satisfy the demand for the automotive infotainment system and to increase the multimedia processing capacity, and the various technology applications are required for the accomplishment of MOST150 development. The MOST25 network technology is being restrictively equipped with some of the car models but the problems with bandwidth and compatibility has arisen. In order to solve this, the MOST150 technology has been developed and further research is being carried out to apply the technology to the automobile industry. Thus, for the effective process of the Ethernet traffic in the realization of MOST150/Ethernet Gateway for automobile, we, in the research, shall analyse the Management Mapping method, including the MOST150's Isochronous channel, the MOST Ethernet Packet channel, and etc. and study the efficient algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.2964-2985
• /
• 2019

Global data center IP traffic is expected to reach 20.6 zettabytes (ZB) by the end of 2021. Intra-data center networks (Intra-DCN) will account for 71.5% of the data center traffic flow and will be the largest portion of the traffic. The understanding of traffic distribution in IntraDCN is still sketchy. It causes significant amount of bandwidth to go unutilized, and creates avoidable choke points. Conventional transport protocols such as Optical Packet Switching (OPS) and Optical Burst Switching (OBS) allow a one-sided view of the traffic flow in the network. This therefore causes disjointed and uncoordinated decision-making at each node. For effective resource planning, there is the need to consider joining the distributed with centralized management which anticipates the system's needs and regulates the entire network. Methods derived from Kalman filters have proved effective in planning road networks. Considering the network available bandwidth as data transport highways, we propose an intelligent enhanced SDN concept applied to OBS architecture. A management plane (MP) is added to conventional control (CP) and data planes (DP). The MP assembles the traffic spatio-temporal parameters from ingress nodes, uses Kalman filtering prediction-based algorithm to estimate traffic demand. Prior to packets arrival at edges nodes, it regularly forwards updates of resources allocation to CPs. Simulations were done on a hybrid scheme (1+1) and on the centralized OBS. The results demonstrated that the proposition decreases the packet loss ratio. It also improves network latency and throughput-up to 84 and 51%, respectively, versus the traditional scheme.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.3
• /
• pp.91-98
• /
• 2013

Node which plays the role of cache server does not exist in the wireless ad-hoc network consisting of only mobile nodes. Even if it exists, it is difficult to provide cache services due to the movement of nodes. Therefore, the cooperative cache technique is necessary in order to improve the efficiency of information access by reducing data access time and use of bandwidth in the wireless ad-hoc network. In this paper, the whole network is divided into zones which don't overlap and master node of each zone is elected. General node of each zone has ZICT and manages cache data to cooperative cache and gateway node use NZCT to manage cache information of neighbor zone. We proposed security structure which can accomplish send and receive in the only node issued id key in the elected master node in order to prepare for cache consistent attack which is vulnerability of distributed caching techniques. The performance of the proposed method in this paper could confirm the excellent performance through comparative experiments of GCC and GC techniques.

• ETRI Journal
• /
• v.24 no.4
• /
• pp.299-310
• /
• 2002

This paper describes an integrated network management framework for providing point-to-multipoint reservation service (PMRS) in an ATM network. There are two major issues confronting the network service provider in relation to this service: one is to rapidly confirm the acceptability of the subscriber's reservation at subscription time, and the other is to punctually activate the reserved point-to-multipoint service. To meet these requirements, we developed a service provision model (SPM) and a network resource model of a bandwidth allocation timetable (BATT). We propose a point-to-multipoint routing algorithm composed of ordering and backtracking procedures, which can find the best branch point under the complex network topology and can add more destinations to the existing point-to-multipoint route. We demonstrate the feasibility of the SPM, the BATT, and the point-to-multipoint routing algorithm by implementing our schemes and analyzing their performance under the operational ATM network of KT(Korea Telecom).

• Journal of Korean Society for Quality Management
• /
• v.18 no.2
• /
• pp.127-133
• /
• 1990

In this article, several problems inherent in histogram estimate of unknown probability density function are discussed. Those include so called sharp comers and bin edge effect. A resolution for these problems occurred with histogram is discussed. The resulting estimate is called kernel density estimate which is most widely used by data analysts. One of the most recent and reliable data-based choices of scale factor (bandwidth) of the estimate, which has been known to be most crucial, is also discussed.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.135-138
• /
• 2004

This paper considers a ring loading problem on RPR(Resilient Packet Ring), where RPR is recommended by IEEE802.17 Resilient Packet Ring working group for data optimized networks without the requirements of provisioning circuits. RPR is well suitable for metropolitan area network with two counter-rotating rings that multiple stations share the bandwidth, where the data and its corresponding control traffic is transmitted to the two opposite directional ring, respectively. One of the major concerns on RPR is to provide fairness among traffic requirements. The paper discusses several fairness measures and analysis ring loading problems for the fairness.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.2
• /
• pp.81-94
• /
• 1999

ATM network design procedure is different from the current circuit or packet networks design procedure because of the variety of the offered services and the variability of requested bandwidth for each connection of ATM network. A number of optimization models for the link dimensioning of ATM network design have been proposed in the literature. However, most of the literature did not consider the modularity of resources allocated to a transmission path and the non-bifurcation of a VP link over the more than one TP, which are standardized in recent ITU-T Recommendations. In thIs paper, we propose a mathematical model for link dimensioning of ATM networks, based on the network synthesis method and a generalized bin-packing problem. The suggested model satisfies the constraints mentioned in the ITU-T Recommendations. We also propose efficient and practical algorithms for the suggested model. Computational experiment shows that the suggested algorithm gives efficient solutions even for moderate and large-sized networks within reasonable time.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.325-329
• /
• 2007

The mobile and multimedia service on wireless network have been leaded from the improvement of telecommunication techniques. A typical multimedia service, a video transmission usually requires larger bandwidth than voice transmission. Many channel allocation algorithms for Orthogonal Frequency Division Multiple Access (OFBMA) to use resources more efficiently, Previous channel allocation algorithms have developed with an assumption that the data traffic is constant bit rate (CBR). However, existing algorithms are not suitable to video traffic because it usually generates a variable bit rate (VBR) traffic. In this paper, we proposed a new channel allocation algorithm called a queue-based channel allocation. it is more suitable to transmit the video traffics. Also, a problem are notified in case of realtime generated video traffic and a corresponding heuristic solution was proposed.