• Communications for Statistical Applications and Methods
• /
• v.16 no.6
• /
• pp.937-943
• /
• 2009

A network with variable link capacities is considered to be in a functioning state if it can transmit a maximum flow which is greater than or equal to a specified amount of flow. The links are independent and either function or fail with known probability. No flow can be transmitted through a failed link. In this paper, we consider the measures of importance of a link in such networks. We define the structural importance and reliability importance, with respect to capacity, of a link when the required amount of flow is given. We also present the performance importance with respect to capacity. Numerical examples are presented as well for illustrative purpose.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.260-264
• /
• 2003

본 논문에서는 인터넷에서의 트래픽 엔지니어링 체제를 구축하기 위하여 트래픽 엔지니어링을 수행하기 위한 기능 모델을 제시하였다. 제시한 기능 모델은 트래픽 관리, 용량 관리, 그리고 네트워크 계획으로 구성된다. 트래픽 관리는 다양한 조건하에서 네트워크 성능을 최대화하는 것을 목적으로 하며, 용량 관리는 최소의 비용으로 네트워크 요구에 대한 성능 목표치를 만족시키기 위하여 네트워크가 설계되고 제공됨을 목적으로 한다. 또한 네트워크 계획은 예측된 트래픽 증가에 앞서 노드와 전송 용량이 계획되고 배치됨을 보장한다.

• Journal of Internet Computing and Services
• /
• v.12 no.5
• /
• pp.1-9
• /
• 2011

Wireless mobile networks that exploit generalized PF scheduling can dynamically allocate network resources by using scheduling parameters. There are limitations to predict throughputs by the conventional stochastic approach in general. Moreover the limitations make it difficult to find appropriate scheduling parameters for achieving the demanded throughputs. This paper derives a prediction algorithm that predicts throughputs of the networks by using deterministic approach. A throughput adjust algorithm and a throughput switching algorithm are derived from the prediction algorithm. The performance of the throughput prediction/switching algorithms is evaluated by a simulator based on IEEE 802.16m system.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.11-17
• /
• 2012

Capacity is a traditional issue in wireless network and is closely related to the service quality of network providers, therefore it is a main interest of them. Especially, when a big match of sport game or a special event are held in a place and a large crowd temporarily gathers, a need of big transmission capacity greater than usual usage in the area is required, where network providers need a scheme to temporarily expand network capacity in any specified area. This paper focuses on temporary expansion of wireless network capacity for such situations. In this paper, we first investigate maximum transmission capacity of wireless ad-hoc networks. In the investigation, we consider a network topology with regularly located nodes. For the topology, we investigate the maximum transmission capacity with RTS/CTS medium access protocol, and then we study the maximum transmission capacity without the protocol. Next, we propose a scheme to expand network capacity and analyze the performance of the proposed scheme. From the results of analysis, we see that our proposed scheme is effective for temporary expansion of wireless network capacity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1B
• /
• pp.24-33
• /
• 2009

This paper considers network competition where the subscribers experience network congestion when they use the network and the network providers determine the network price and capacity. This paper discusses the impact of the network competition on social welfare. Network provider determines the price and capacity considering this characteristics of this sensitivity to network congestion where the subscriber has different preference about the congestion. This paper shows that network provider who wants to serve the intolerable customers (who is very sensitive to the congestion) offers higher price and capacity. However, this provider prepares lower capacity than socially optimal capacity. This is because the network provider seeks to earn more profits from additional subscriber while it is desirable to invest the capacity to give the entire subscribers a non-congestion network in the view of social welfare.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10B
• /
• pp.928-938
• /
• 2008

Though services requiring Quality-of-Service (QoS) guarantees such as Voice over Internet Protocol (VoIP) have been widely deployed on the internet, most of internet backbone networks, unfortunately, do not distinguish them from the best-effort services. Thus estimating the effective capacity meaning the traffic volume that the backbone networks maximally accommodate with keeping QoS guarantees for the services is very important for Internet Service Providers. This paper proposes a test-bed based on ns-2 to evaluate the effective capacity of backbone networks and then estimates the effective capacity of an experimental backbone network using the test-bed in terms of the service standard of the VoIP service. The result showed that the effective capacity of the network is estimated as between 12% and 55% of its physical capacity, which is depending on the maximum delay guarantee probability, and strongly affected by not only the type of offered workload but also the quality standard. Especially, it demonstrated that in order to improve the effective capacity the maximum end-to-end delay requirement of the VoIP service needs to be loosened in terms of the probability to guarantee.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.504-506
• /
• 2011

네트워크 관리자는 트래픽 증가에 따른 네트워크 성능저하 문제를 해결하기 위해 개별 링크에 필요한 용량을 산정해야할 때가 있다. 대규모 네트워크의 경우 이산 사건 시뮬레이션만을 수행하여 용량을 산정하는 것보다 분석적 시뮬레이션을 함께 사용하여 용량을 산정한다면 시뮬레이션에 필요한 시간을 줄일 수 있다. 본 논문에서는 링크 용량계획을 위한 분석적 시뮬레이션의 활용방안을 논하고 그 기법을 기술하였다. 제안한 분석적 시뮬레이션 기법은 정상상태의 네트워크 분석이기 때문에 이산 사건 시뮬레이션에 비해 시뮬레이션에 소요되는 시간은 작지만 정확도는 낮다. 하지만 대규모 네트워크의 상태를 빠르게 파악하고 문제를 해결해야 한다면 좀 더 정밀한 시뮬레이션이나 분석을 위한 사전자료를 만들기에 충분할 것이다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.57-62
• /
• 2014

The benefits of infrastructure support are shown by analyzing a throughput scaling law of an erasure network in which multiple relay stations (RSs) are regularly placed. Based on suitably modeling erasure probabilities under the assumed network, we show our achievable network throughput in the hybrid erasure network. More specifically, we use two types of physical models, a exponential decay model and a polynomial decay model. Then, we analyze our achievable throughput using two existing schemes including multi-hop transmissions with and without help of RSs. Our result indicates that for both physical models, the derived throughput scaling law depends on the number of nodes and the number of RSs.

• The Journal of the Korea Contents Association
• /
• v.5 no.1
• /
• pp.169-178
• /
• 2005

This paper presented high-level function model to achieve traffic engineering to construct traffic engineering infrastructure in Internet. Function model presented include traffic management, capacity management, and network planing. It is ensured that network performance is maximized under all conditions including load shifts and failures by traffic management. It is ensured that the network is designed and provisioned to meet performance objectives for network demands at minimum cost by capacity management. Also it is ensured that node and transport capacity is planned and deployed in advance of forecasted traffic growth by network planning.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.2
• /
• pp.303-310
• /
• 2014

We show improved throughput scaling laws for an ultra-wide band (UWB) ad hoc network, in which n wireless nodes are randomly located. First, we consider the case where a modified hierarchical cooperation (HC) strategy is used. Then, in a dense network of unit area, our result indicates that the derived throughput scaling depends on the path-loss exponent ${\alpha}$ for certain operating regimes due to the power-limited characteristics. It also turns out that the HC protocol is dominant for 2 < ${\alpha}$ < 3 while using the nearest multihop (MH) routing leads to a higher throughput for ${\alpha}{\geq}3$. Second, the impact and benefits of infrastructure support are analyzed, where m base stations (BSs) are regularly placed in UWB networks. In this case, the derived throughput scaling depends on ${\alpha}$ due to the power-limited characteristics for all operating regimes. Furthermore, it is shown that the total throughput scales linearly with parameter m as m is larger than a certain level. Hence, the use of either HC or infrastructure is helpful in improving the throughput of UWB networks in some conditions.