• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2379-2397
• /
• 2017

Content distribution technology, which routes content to the cache servers, is considered as an effective method to reduce the response time of the user requests. However, due to the exponential increases of content traffic, traditional content routing methods suffer from high delay and consequent inefficient delivery. In this paper, a content selection policy is proposed, which combines the histories of cache hit and cache hit rate to collaboratively determine the content popularity. Specifically, the CGM policy promotes the probability of possible superior paths considering the storage cost and transmission cost of content network. Then, the content routing table is updated with the proportion of the distribution on the paths. Extensive simulation results show that our proposed scheme improves the content routing and outperforms existing routing schemes in terms of Internet traffic and access latency.

• ETRI Journal
• /
• v.21 no.4
• /
• pp.23-28
• /
• 1999

In this paper, we analyze the performance benefits of broadband ATM networks when the call control and management flows are separated from user data flows. The virtual path tunneling concept for control and management flows are applied to the same physical ATM networks. The behaviors of channel throughput and transfer delay are analyzed. It results that the proposed virtual short-cut paths can maintain the network being stable with acceptable bandwidth. They are very useful to provide the stable control and management capabilities for Internet and mobile applications in the broadband ATM networks. In our numerical results, the effective throughputs of the proposed virtual shout-ut channel are about three times than those of end-to-end user data channels with hop distances of 10, and about two times than those with hop distance of 5 when the link blocking probability increases to 0.1. It concludes that the effective channel bandwidth are greatly reduced down while physical links are not stable and user traffic flows are occasionally overflowed.

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.630-632
• /
• 1998

The basic user location strategies proposed in current PCS(Personal Communication Services) Network are two-level Database strategies. These Databases which exist in the Signalling network always maintain user's current location information, and it is used in call setup process to a mobile user. As the number of PCS users are increasing, this strategies yield some problem such as concentrating signalling traffic on the Database, increasing Call setup Delay, and so on. In this paper, we proposed RCP(Reverse Connection setup Protocol) model, which apply RVC(Reverse Virtual Call setup) algorithm to PCS reference model, and CRCP(Cache algorithm in RCP) model, which adopt Caching strategies in the RCP model. When Cache-miss occur, we found that CRCP model require less miss-penalty than PCS model. Also we show that proposed models are always likely to yield better performance in terms of reduced Location Tracking Delay time.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.10
• /
• pp.47-54
• /
• 2013

In this paper, the structural design of optical Internet is analyzed and by using UNI (User Network Interface) signaling protocol an optical transmission experiment was performed. The hierarchical structure of the basic optical Internet consists of the backbone network, the service network and the access network. The necessary functions for each layer were described as follows: Control structure of the optical transport layer, network operation and management structure, internetworking technology of sub networks, routing and signaling technology. By using UNI signaling protocol from OIF (Optical Internetworking Forum), the optical transmission in the proposed structure of the optical Internet network was experimented. By the traffic generation of LSP (Label Switched Path) data packets along the route-configuration was delivered to UNI. Finally, by showing the value of TCP (Transmission Control Protocol) packets the optical transmission was completely and successfully demonstrated.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.215-217
• /
• 2005

There are two types of packet loss probabilities used in both the network layer and the physical layer within the wireless transmitter such as a queueing discard probability and transmission loss probability. We analyze these loss performances in order to guarantee Quality of Service (QoS) which is the basic of the future network. The queuing loss probability is caused by a maximum allowable delay time and the transmission loss probability is caused by a wireless channel error. These two types of packet loss probabilities are not easily analyzed due to recursive feedback which, originates as a result at a queueing delay and a number of retransmission attempts. We consider a wireless transmitter to a M/D/1 queueing model. We configurate the model to have a finite-size FIFO buffer in order to analyze the real-time traffic streams. Then we present the approaches used for evaluating the loss probabilities of this M/D/1/K queueing model. To analyze the two types of probabilities which have mutual feedbacks with each other, we drive the solutions recursively. The validity and accuracy of the analysis are confirmed by the computer simulation. From the following solutions, we suggest a minimum of 'a Maximum Allowable Delay Time' for real-time traffic in order to initially guarantee the QoS. Finally, we analyze the required service rate for each type utilizing real-time traffic and we apply our valuable analysis to a N-user's wireless network in order to get the fundamental information (types of supportable real-type traffics, types of supportable QoS, supportable maximum number of users) for network design.

• Journal of Korea Multimedia Society
• /
• v.8 no.2
• /
• pp.192-200
• /
• 2005

In this paper, an improved User Parameter Control (UPC) algorithm is proposed for controlling traffic in ATM networks. The present algorithm consists of Cell Buffer, Red Token Pool, Green Token Pool, and Spacer. A token is generated at a certain time period, and the tokens are consumed one each time a cell arrives. At this time, if the delay element, named Spacer, is empty, the cell comes into the network. On the other hand, if Spacer is not empty, the cell cannot come into the network. In addition, in the case that tokens do not exist in Token Pool, the corresponding cell is thrown away The arbitrary function of the token used in this paper is removed. Instead, the token is used only to control network traffic. This research proposes new UPC Algorithm to improve the current cell delay rate and cell loss rate by dynamically adopting the delay element, named Spacer, with respect to the traffic condition, which is different from controlling that the cell comes into the network after a certain delay time period.

• The KIPS Transactions:PartC
• /
• v.15C no.2
• /
• pp.93-102
• /
• 2008

The network weather map and bandwidth time-series graph are popularly used to understand the current and past traffic condition of NSP, ISP, and enterprise networks. These systems collect traffic performance data from a SNMP agent running on the network devices such as routers and switches, store the gathered information into a DB, and display the network performance status in the form of a time-series graph or a network weather map using Web user interface. Most of current enterprise networks are constructed in the form of a hierarchical tree-like structure with multi-Gbps Ethernet links, which is quietly different from the national or world-wide backbone network structure. This paper focuses on the network weather map for current enterprise network. We start with the considering points in developing a network weather map system suitable for enterprise network. Based on these considerings, this paper proposes the best way of using SNMP in constructing a network weather map system. To prove our idea, we designed and developed a network weather map system for our campus network, which is also described in detail.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1B
• /
• pp.49-55
• /
• 2002

IMT-2000 mobile system will provide many application services such as mobile internet, wireless electronics commerce applications using air interface with high data rate. These applications require high data integrity, data confidentiality, user authentication, user identity confidentiality and non-repudiation. In this study, we analyze new security threats and air interface traffic performance for IMT-2000 mobile systems. Signal traffic for network access security services requires 0.2kbps~4.5kbps with the conditions of 246~768bits/massage, 0.2~1.0 basic services/sec and the security services of the rate 0.2~1.0 times compared with basic services.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3635-3654
• /
• 2015

With the rapid development of smart devices and mobile Internet, the video application plays an increasingly important role on mobile devices. Understanding user behavior patterns is critical for optimized operation of mobile live streaming systems. On the other hand, volume based billing models on cloud services make it easier for video service providers to scale their services as well as to reduce the waste from oversized service capacities. In this paper, the watching behaviors of a commercial mobile live streaming system are studied in a content-centric manner. Our analysis captures the intrinsic correlation existing between popularity and watching intensity of programs due to the synchronized watching behaviors with program schedule. The watching pattern is further used to estimate traffic volume generated by the program, which is useful on data volume capacity reservation and billing strategy selection in cloud services. The traffic range of programs is estimated based on a naive popularity prediction. In cross validation, the traffic ranges of around 94% of programs are successfully estimated. In high popularity programs (>20000 viewers), the overestimated traffic is less than 15% of real happened traffic when using upper bound to estimate program traffic.

• Journal of Korean Society of Transportation
• /
• v.24 no.2 s.88
• /
• pp.169-178
• /
• 2006

Traffic assignment has been used both for predicting travel demands and for evaluating the tools for alleviating congestion on road network in advance. Some assignment models have been proposed such as equivalent mathematical minimization method, variational inequality problem, nonlinear complementary problem and fixed point method, in following the principle of Wardrop (1952) that no driver can not Improve his travel cost by unilaterally changing his route. Recently Jin(2005a) presented a traffic assignment model based on dynamic process. This paper proposes a solution algorithm for the model of Jin and assesses the performances. Compared to the Frank-Wolfe method, which has been wildly used for solving the existing assignment models, the proposed algorithm is expected to be more efficient because it does not need to evaluate the objective function. Two numerical examples are used for assessing the algorithm, and they show that the algorithm converges to user equilibrium of Wardrop.