• Title/Summary/Keyword: Dynamic allocation

Search Result 687, Processing Time 0.024 seconds

An Efficient Dynamic Bandwidth Allocation Algorithm for VoDSL Services (VoDSL 서비스를 위한 효율적인 동적 대역폭 할당 알고리즘)

  • Kim, Hoon;Park, Jong-Dae;Nam, Sang-Sig;Park, Kwang-Chae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.1C
    • /
    • pp.48-58
    • /
    • 2002
  • As internet traffic increases, the problem that it should be efficiently accepted in to the existing voice network in the pending problem importantly to the existing communication corporations. The feature of next generation exchange network is made up of the form of integration network that connect data traffic(internet service. Etc) with the existing voice network and it can be showed with very diverse aspects according to the constitution time of network or the characteristics of business. The progress strategy that develop the existing circuit based communication network into packet-based communication network can be divided into two in a large scale according to the application position These are VoDSL application method(Technology that packetize access network) and softswitch technology application method(after packetizing relay network, packetizing that into the access network). In this paper, we will deduce the desirable technology that can construct packet-based next generation exchange networks in the structure of the existing communication network environment. We will perform the research on a device to offer the necessary core technique VoSDL service with realistic resolutions primarily.

An Implementation of Network Intrusion Detection Engines on Network Processors (네트워크 프로세서 기반 고성능 네트워크 침입 탐지 엔진에 관한 연구)

  • Cho, Hye-Young;Kim, Dae-Young
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.2
    • /
    • pp.113-130
    • /
    • 2006
  • Recently with the explosive growth of Internet applications, the attacks of hackers on network are increasing rapidly and becoming more seriously. Thus information security is emerging as a critical factor in designing a network system and much attention is paid to Network Intrusion Detection System (NIDS), which detects hackers' attacks on network and handles them properly However, the performance of current intrusion detection system cannot catch the increasing rate of the Internet speed because most of the NIDSs are implemented by software. In this paper, we propose a new high performance network intrusion using Network Processor. To achieve fast packet processing and dynamic adaptation of intrusion patterns that are continuously added, a new high performance network intrusion detection system using Intel's network processor, IXP1200, is proposed. Unlike traditional intrusion detection engines, which have been implemented by either software or hardware so far, we design an optimized architecture and algorithms, exploiting the features of network processor. In addition, for more efficient detection engine scheduling, we proposed task allocation methods on multi-processing processors. Through implementation and performance evaluation, we show the proprieties of the proposed approach.

Design and Implementation of Dynamic Peer Selection Scheme for Allocating Proxy-Server on Pure P2P Network Environments (순수 P2P 네트워크 환경에서 프락시-서버 할당을 위한 동적 피어 선정 기법 설계 및 구현)

  • Kim, Young-Jin;Kim, Moon-Jeong;Kim, Ung-Mo;Eom, Young-Ik
    • The KIPS Transactions:PartD
    • /
    • v.10D no.1
    • /
    • pp.153-160
    • /
    • 2003
  • Recently, deployments of firewalls and NATs ire increasing to provide network security features or to solve the problem of public IP shortage. But, in these environments, peers in different firewall or NAT environments may get limited services because they cannot open direct communicate channels. This can be a significant problem in pure P2P environments where the peers should get or provide services by opening direct channels among themselves. In this paper, we propose a scheme for dynamically selecting a peer that fan be used as a proxy server. The proxy server supports the communication between the peers in different firewall or NAT environments. The proposed scheme is operating system independent and supports bidirectional communication among the peers in P2P environments. Additionally, the proposed scheme can distribute network traffic by dynamically allocating proxy servers to the peers that is not located in the firewall or NAT environments.

A Study on the Knowledge-Based T.P.N. System (1) (지식 구조화 경정맥 완전 영양공급 시스템의 개발에 관한 연구 (I))

  • Jeon, Gye-Rok;Choe, Sam-Gil;Byeon, Geon-Sik
    • Journal of Biomedical Engineering Research
    • /
    • v.11 no.2
    • /
    • pp.305-314
    • /
    • 1990
  • In this paper we have implemented and tested TPN which is system to supply sufficent nutrition to nutritionally deficient patient by means of ES (expert system) a kind of A.1 (artificial intelligence) . This system affords to evaluation of nutritional state of patient which is essential to physi- cian. who performs TPN, decision of performing TPN and management of patient-data & calculation of information needing to making TPN fluid. The features were as follolv 1. we input data, take ideal weight of patient and 24hr's creatlnln In urine according to chart in system compare TSF (triceps skin fold), MAC (mid-arm circumference), AMC (arm muscle circumference) to 5th, 15th, 50th percentile and evaluate the nutritional state of patient. 2. Calculation of protein & nonprotein calorie needing to treament of patient can be made exactly by stress factor, activity factor and body temperature. 3. patient's personal recording needing to management of patient date name of chief doc- tor, name of department of admission, chart number, history can by taken very easily. 4. The way of system operating is pull-down Menu one, It can be processing very efficiently. 5. Date processing in system, we can manage memory volume of computer verlr efficiently using of dynamic allocation variables. 6. We can make it very easy to edit & revise the input data, processed data is saved to diskette in 2 files (TDF, THF) , these are semipermanent preservation.

  • PDF

MADF: Mobile-Assisted Data Forwarding for Wireless Data Networks

  • Xiaoxin;Gary, Shueng-Han;Biswanath;Bharat
    • Journal of Communications and Networks
    • /
    • v.6 no.3
    • /
    • pp.216-225
    • /
    • 2004
  • In a cellular network, if there are too many data users in a cell, data may suffer long delay, and system's quality-of-service (QoS) will degrade. Some traditional schemes such as dynamic channel-allocation scheme (DCA) will assign more channels to hot (or overloaded) cells through a central control system (CC) and the throughput increase will be upper bounded by the number of new channels assigned to the cell. In mobile-assisted data forwarding (MADF), we add an ad-hoc overlay to the fixed cellular infrastructure and special channels-called forwarding channels- are used to connect mobile units in a hot cell and its surrounding cold cells without going through the hot cell's base station. Thus, mobile units in a hot cell can forward data to other cold cells to achieve load balancing. Most of the forwarding-channel management work in MADF is done by mobile units themselves in order to relieve the load from the CC. The traffic increase in a certain cell will not be upper bounded by the number of forwarding channels. It can be more if the users in hot cell are significantly far away from one another and these users can use the same forwarding channels to forward data to different cold neighboring cells without interference. We find that, in a system using MADF, under a certain delay requirement, the throughput in a certain cell or for the whole net-work can be greatly improved.

Efficient DBA Algorithm for Supporting CBR Service on EPON with Traffic Burstiness (트래픽이 급증하는 EPON 환경에서 고정비트율 서비스를 효율적으로 지원하는 DBA 알고리즘)

  • Lee, Jin-Hee;Lee, Tae-Jin;Chung, Min-Young;Lee, You-Ho;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.9 no.4
    • /
    • pp.61-68
    • /
    • 2008
  • Ethernet passive optical network (EPON) is the next-generation technology mitigating the bottleneck between high-capacity local area networks (LANs) and a backbone network. The bottleneck is aggrevated depending on burstiness and long range dependence (LRD) of traffic characteristics as well as amount of outgoing traffic from the high-capacity LANs. The proposed scheme decreases average packet delay for data upstreaming by considering such traffic characteristics to dynamically allocate bandwidth to multiple optical network units (ONUs). In addition, it can appropriately support delay-sensitive traffic such as constant bit ratio (CBR) traffic by making maximum cycle time fix regardless of the number of ONUs. The comprehensive simulation results indicate that the proposed scheme acheives up to 77% and 82% lower than previous schemes in terms of average packet delay and average queue size while it limits the maximum cycle time to twice of the basic cycle time.

  • PDF

Cases Study of Accidents in High Risk Organizations by System Dynamics (시스템 다이내믹스 기법을 활용한 고위험 조직 사고 사례 분석)

  • Oh, Youngmin;Ryu, Jin
    • Korean System Dynamics Review
    • /
    • v.16 no.3
    • /
    • pp.5-29
    • /
    • 2015
  • The importance of the concept of safety culture has increased in the security of high-risk facility after Chernobyl accident in 1986. This paper elaborated the concept of safety culture and its main factors by Causal Loop Diagram. Due to the decline of safety culture, the occurrence of incidents and accidents require more and more corrective actions to the members of high-risk facilities and thereby increasing their workloads. Employees who must complete the task within the given time have to have time pressures and don't comply with the rules and procedures. Also, a schedule pressure is a big stress for employees, causing mistakes in precision work. In order to improve these problems, CLD of the safety culture in this paper suggests hiring more workers, re-allocation of given workloads and strengthen the learning, communication capabilities and safety leadership. In addition, the two real accident cases were analyzed to test the feasibility of the System Dynamic simulation model through the process of structuring the fault trees on the stationary black out accident in Kori unit 1 in South Korea and Kleen Energy power station explosion in US. The simulation results show that the various safety factors cause the serious accident combined with mechanical failure and safety culture will reduce the possibility of the accidents in these high-risk organizations. This simulation model can contribute to analyzing the impact of the organizational and human factors of safety culture and can provide the alternatives in high-risk facilities.

Radio Resource Management of CoMP System in HetNet under Power and Backhaul Constraints

  • Yu, Jia;Wu, Shaohua;Lin, Xiaodong;Zhang, Qinyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.3876-3895
    • /
    • 2014
  • Recently, Heterogeneous Network (HetNet) with Coordinated Multi-Point (CoMP) scheme is introduced into Long Term Evolution-Advanced (LTE-A) systems to improve digital services for User Equipments (UEs), especially for cell-edge UEs. However, Radio Resource Management (RRM), including Resource Block (RB) scheduling and Power Allocation (PA), in this scenario becomes challenging, due to the intercell cooperation. In this paper, we investigate the RRM problem for downlink transmission of HetNet system with Joint Processing (JP) CoMP (both joint transmission and dynamic cell selection schemes), aiming at maximizing weighted sum data rate under the constraints of both transmission power and backhaul capacity. First, joint RB scheduling and PA problem is formulated as a constrained Mixed Integer Programming (MIP) which is NP-hard. To simplify the formulation problem, we decompose it into two problems of RB scheduling and PA. For RB scheduling, we propose an algorithm with less computational complexity to achieve a suboptimal solution. Then, according to the obtained scheduling results, we present an iterative Karush-Kuhn-Tucker (KKT) method to solve the PA problem. Extensive simulations are conducted to verify the effectiveness and efficiency of the proposed algorithms. Two kinds of JP CoMP schemes are compared with a non-CoMP greedy scheme (max capacity scheme). Simulation results prove that the CoMP schemes with the proposed RRM algorithms dramatically enhance data rate of cell-edge UEs, thereby improving UEs' fairness of data rate. Also, it is shown that the proposed PA algorithms can decrease power consumption of transmission antennas without loss of transmission performance.

Research on Per-cell Codebook based Channel Quantization for CoMP Transmission

  • Hu, Zhirui;Feng, Chunyan;Zhang, Tiankui;Gao, Qiubin;Sun, Shaohui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.6
    • /
    • pp.1828-1847
    • /
    • 2014
  • Coordinated multi-point (CoMP) transmission has been regarded as a potential technology for LTE-Advanced. In frequency division duplexing systems, channel quantization is applied for reporting channel state information (CSI). Considering the dynamic number of cooperation base stations (BSs), asymmetry feature of CoMP channels and high searching complexity, simply increasing the size of the codebook used in traditional multiple antenna systems to quantize the global CSI of CoMP systems directly is infeasible. Per-cell codebook based channel quantization to quantize local CSI for each BS separately is an effective method. In this paper, the theoretical upper bounds of system throughput are derived for two codeword selection schemes, independent codeword selection (ICS) and joint codeword selection (JCS), respectively. The feedback overhead and selection complexity of these two schemes are analyzed. In the simulation, the system throughput of ICS and JCS is compared. Both analysis and simulation results show that JCS has a better tradeoff between system throughput and feedback overhead. The ICS has obvious advantage in complexity, but it needs additional phase information (PI) feedback for obtaining the approximate system throughput with JCS. Under the same number of feedback bits constraint, allocating the number of bits for channel direction information (CDI) and PI quantization can increase the system throughput, but ICS is still inferior to JCS. Based on theoretical analysis and simulation results, some recommendations are given with regard to the application of each scheme respectively.

Performance Evaluation of a Differentiated Service Mechanism by Traffic Models and Weight Factor (트래픽 모델과 Weight Factor에 의한 차등 서비스 메커니즘의 성능평가)

  • 전용희;박수영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.11C
    • /
    • pp.10-23
    • /
    • 2001
  • It is difficult to satisfy the QoS(Quality of Service) guarantee which is required by real-time application services only with the Best-Effort(BE) service adopted in the current Internet. Therefore, worldwide research is being made on the method of QoS provisioning. Among them, the QoS guarantee mechanism using the Diffserv(Differentiated Service) was discussed in this paper. First we analyzed how the DiffServ performance was affected by traffic models. For this, we performed the research for the random, bursts, and self-similar traffic modeling method. We then designed and implemented an OPNET simulator, and performed the simulation 7d performance evaluation for diverse input parameters. Based on the results of performance evaluation, it was confirmed that QoS guarantee is possible for the EF(Expedited Forwarding) class with the DiffServ function under every environments considered and the service separation between EF and BE(Best Effort) classes is also possible. We also analyzed the performance variation and dynamic behavior of DiffServ mechanism based on the resource allocation between E? and BE classes in WFQ(Weighted Fair Queueing).

  • PDF