• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2B
• /
• pp.111-119
• /
• 2011

As Green-IT has attracted a lot of attention in recent years, many researches have been interested in reducing the energy consumption of network equipments. In this paper, we analyze the energy saving ratio and delay performance according to various traffic patterns and burst assemble algorithms in OBS network with sleeping mode. To do this, we design the traffic generators, which are based on exponential distribution and Pareto distribution, and the router model, which has the time based and length based burst assemble algorithms by using OPNET modeler. Through OPNET simulator, we evaluate the energy saving performance in terms of the sleeping time, the number of transitions and packet delay.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.10
• /
• pp.34-42
• /
• 2012

This paper analyses the energy saving basic power models in core IP networks, and proposes the adaptive buffer and burst scheme which is a possible energy saving method, and its implementation algorithm in core IP networks. Especially this paper describes the adaptive buffer and burst scheme dynamically varying the buffering interval B according to the input traffic volume of ingress router, and explains the operation principle of proposed scheme. This method is to adjust the buffering interval B according to input traffic volume of ingress router, that is increasing the interval B when input traffic volume is low, and decreasing the interval B when input traffic volume is high between some given interval regions. This method can gets the high energy saving effect as decreasing the transition number of idle/active in networks when input traffic volume is low, and decreasing the transition number of idle/active by the continuous of burst packets in transit router when input traffic volume is high. This paper shows the increasing of asleep rate for the energy saving of core IP networks and confirms the energy saving of core IP networks by the computer simulation. We confirmed that proposed method can be save the energy of IP networks by properly trade off network performances.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.7
• /
• pp.980-988
• /
• 1993

In this paper, performance of 8-ISDN traffic for the buffer size which is requested of important parameters in switch/multiplexer of B-ISDN with multimedia traffic is analyzed. Multimedia traffic is modeled as a traffic, which is composed of poisson distribution traffic and burst traffic with exponential/geometric ON time duration(Burst duration) Performance of traffic which is modeled as a multimedia traffic is analysed and buffer size, can provide the high quality service, is presented for the cell loss probability. It is simulated using event scheduling approach method which is provided by simulation package, PC SIMSCRIPT II.5. Simulation program is composed of PREAMBLE, MAIN, INITIAL, ARRIVAL, DEPARTURE and STOP·SIM modules. Specially, in case of mixed traffic simulation, ARRIVAL module is composed of ARRIVAL I and ARRIVAL II, and cells are generated independently by each module.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.177-180
• /
• 2000

Optical burst switching(OBS) is a new switching paradigm to supporting bursty traffic on the Internet efficiently. OBS separates burst level and control level. To handle data burst efficiently, the scheduling schemes in optical burst switching systems must keep track of future resource availability when assigning arriving data bursts to wavelength channels. In this paper, we evaluate the performance of three scheduling schemes which are called Horizon, Single-gap and Multiple-gap, as a basic study for the future research of Optical Internet. Thus, firstly, we analyze the trade-off between the performance and the processing overhead of each scheme. In addition, the performance of OBS system which uses Multiple-gap scheduling is evaluated in detail under various network size. We use simulation for performance evaluation in terms of burst loss rate(BLR), wavelength channel utilization and the number of management data.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.136-144
• /
• 2003

In this paper, we propose a scheme that can control the loss probability of low priority class bursts by dynamically adjusting the assembly threshold of low priority class. The key ideas is that the loss Probability of the longer burst increases as the load increases, thus reduced low priority class burst length decreases the loss priority at high traffic load. To achieve this aim, we first derive the relation among the loss probability, the assembly threshold, and the traffic load. In this paper we derive the relation by curve fitting on the simulation results. The ingress edge routers periodically or by event-driven receives the proper corresponding assembly threshold information from the core routers. This assembly threshold is calculated from the derived relation so that the required loss probability of the low priority class bursts in the network is satisfied. The simulation results show that the proposed scheme performs well to meet the loss probability target as expected.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.2
• /
• pp.101-114
• /
• 2002

The real multimedia application in wide area communication needs the guaranteed performance of communication service. Therefore, the resource is reserved at the moment of traffic burst and the region of connection admission possibility is widened at the basis of maximum cell rate. This of study shows that the end-to-end traffic delay to the traffic of burst state is guaranteed when the total of maximum transmission rate is higher than link speed by using the region of deterministic delay. The network load rate of connection admission can be improved by the inducement of delay bounds consideration each traffic characteristic to guarantee the end-to-end delay of network from single switch. This suggested buffering system using deterministic service do not give any influence to service quality and can guarantee the bounds of end-to-end delay. And it can also reduce the load of network even if the delay is increased according to the burst traffic characteristic. The above suggested system can be applied effectively to the various kinds of general network specification which admit both real time trafnc service and non-real time traffic service.

• Journal of Satellite, Information and Communications
• /
• v.5 no.2
• /
• pp.87-91
• /
• 2010

The IEEE 802.15.4 and IEEE 802.15.7 standard are the typical of low rate wireless and Visible Light Wireless personal area networks. Its Medium Access Control protocol can support the QoS traffic flows for real-time application through guaranteed time slots (GTS) in beacon mode. However, how to achieve a best allocation scheme is not solved clearly. The current analytical models of IEEE 802.15.4 MAC reported in the literature have been mainly developed under the assumption of saturated traffic or non-bursty unsaturated traffic conditions. These assumptions don't capture the characteristics of bursty multimedia traffic. In this paper, we propose a new analytical model for GTS allocation with burst Markov modulated ON-OFF arrival traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1158-1163
• /
• 2002

In this paper it is focused on the relation between CLR (Cell Loss Ratio) and blocking probability, GoS(Grade of Services) parameters in the wireless ATM (Asynchronous Transfer Mode) access network which consists of access node and wireless channel. Traffic model of wireless ATM access network is based on the cell scale, burst scale and call connection level. The CLR equation due to buffer overflow for wireless access node is derived for CBR (Constant Bit Rate) traffic. The CLR equation due to random bit errors and burst errors for wireless channel is derived. Using the CLR equation for both access node and wireless channel, the CLR equation of wireless ATM access network is derived. The relation between access network CLR and blocking probability is analyzed for CBR traffic.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2366-2377
• /
• 1997

An Adaptive Usage Parameter Control(UPC) mechanism using a Variable Token Pool(VTP) which is kind of preventive traffic control in the Asynchronous Transfer Mode(ATM) networks is described. The VTP mechanism can monitor violations of the average bit rate and burst duration as well as peak bit rate for the ON-OFF type traffic. The VTP can vary the token pool size by monitoring burst duration and silence duration for a long term. It also improves the sensitivity against the violation of burst duration and average bit rate and enables to response for the violating traffic situation quickly. The variable token pool size is varied in step size by every burst duration and silence duration. Two important parameters for controlling token pool size are Down_size and Up_size. We compare the performance of LB and JW mechanism with the proposed VTP mechanism by computer simulations. We have known that the proposed method is more effective than the previous mechanisms. It is shown that the cell loss rate of the VTP quite depends on the value of Down_size and Up_size. The two parameters should be decided as a propr value according to traffic situations.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.181-187
• /
• 2002

Connection admission control(CAC), which decides whether or not to accept a new call request, is one of the most Important preventive congestion control techniques in asynchronous transfer mode(ATM) networks. To develop a practical CAC scheme, first we propose a "Modified Cell Loss Probability MP${\nu}"$, which is based on "Virtual Cell Loss Probability P${\nu}"$, taking into account mean burst duration of input traffic source and buffer size in ATM networks. MP${\nu}"$ computes more accurate cell loss probability than P${\nu}"$ without increasing computational complexity, since P${\nu}"$ is formulated simply form the maximum and the average cell rate of input traffic. P${\nu}"$ is overestimated as compared to the real cell loss probability when the mean burst duration is relatively small to the buffer capacity. Then, we Propose a CAC scheme, based on "Modified Virtual Bandwidth(MVB)" method, which may individualize the cell loss probabilities in heterogeneous traffic environments. For the proposed approach, we define the interference intensity to identify interferences between heterogeneous traffic sources and use it as well as MP${\nu}"$ to compute MVB. Our approach is well suitable for ATM networks since it provides high bandwidth utilization and guarantees simple and real time CAC computation for heterogeneous traffic environments.heterogeneous traffic environments.