• Title/Summary/Keyword: Offered load

Search Result 123, Processing Time 0.022 seconds

Circuit-Switched “Network Capacity” under QoS Constraints

  • Wieselthier, Jeffrey E.;Nguyen, Gam D.;Ephremides, Anthony
    • Journal of Communications and Networks
    • /
    • v.4 no.3
    • /
    • pp.230-245
    • /
    • 2002
  • Usually the network-throughput maximization problem for constant-bit-rate (CBR) circuit-switched traffic is posed for a fixed offered load profile. Then choices of routes and of admission control policies are sought to achieve maximum throughput (usually under QoS constraints). However, similarly to the notion of channel “capacity,” it is also of interest to determine the “network capacity;” i.e., for a given network we would like to know the maximum throughput it can deliver (again subject to specified QoS constraints) if the appropriate traffic load is supplied. Thus, in addition to determining routes and admission controls, we would like to specify the vector of offered loads between each source/destination pair that “achieves capacity.” Since the combined problem of choosing all three parameters (i.e., offered load, admission control, and routing) is too complex to address, we consider here only the optimal determination of offered load for given routing and admission control policies. We provide an off-line algorithm, which is based on Lagrangian techniques that perform robustly in this rigorously formulated nonlinear optimization problem with nonlinear constraints. We demonstrate that significant improvement is obtained, as compared with simple uniform loading schemes, and that fairness mechanisms can be incorporated with little loss in overall throughput.

A study on the performance improvements of spread ALOHA with CLSP (CLSP를 이용한 대역확산 ALOHA 네트워크의 성능 향상에 관한 연구)

  • 김태중;김호준;박병훈;황금찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.11
    • /
    • pp.2563-2571
    • /
    • 1997
  • This paper presents a new CLSP/CC (Channel Load Sensing Protocol/Channel Clearance) in order to obtain better performance in spread slotted ALOHA networks. This proposed protocol can decrease a wasteful using of channel by prohibiting continuous transmissionof packets destroyed in previous slot, with little added system complexities. The performances of the proposed CLSP/CC, which include network throughput, average processing tiem and the number of mobile stations in retranmission state, are obtained and compared with those of existing CLSP by simulations in this paepr. As the resutls of simulations, the proposed CLSP/CC gets higher throughput and less average processing time, especially in the highly offered load. And CLSP/CC can obtain maximum network throughput at larger offered load than existing CLSP, so it enable to accommodate more mobile station or highly offered loads in slotted spread ALOHA networks.

  • PDF

Link Layer Traffic Control Algorithm to Improve the Performance of WLANs (무선 랜 성능 향상을 위한 링크 계층 트래픽 제어 알고리즘)

  • Choi, Sun-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.4
    • /
    • pp.758-765
    • /
    • 2008
  • Wide-spread deployment of infrastructure WLANs has made Wi-Fi an integral part of today's Internet access technology. WLANs suffer from degraded system throughput and each node's throughput fluctuates significantly in the saturation regime. In this paper, we propose a link layer traffic control mechanism which controls the offered load of DCF system. It is shown that the link layer traffic controller can improve DCF system throughput and reduce nodes' throughput fluctuation with properly controlled offered load. We propose a dynamic traffic control algorithm which can find an optimal offered load and show its performance improvement with ns-2 simulation.

Overload Detection and Control for Switching Systems using Fuzzy Rules

  • Rhee, Chung-Hoon;Rhee, Byung-Ho;Cho, Sung-Ho
    • The Journal of the Acoustical Society of Korea
    • /
    • v.17 no.4E
    • /
    • pp.28-34
    • /
    • 1998
  • In most switching system, the processing unit is designed to work efficiently even at relatively high loads, but when the offered traffic exceeds a particular level, the rate of completed calls can fall drastically. A single call handled by the switching system consists of a sequence of events or messages that has to be processed by the control unit. The control unit is not only incapable of handling all of the offered calls, but also its call handling capability can drop as the offered load increases. The real time available for call processing is a critical resource that requires careful management. Therefore, the overloading of this resource must be detected by a subscriber in the from of a dial tone delay or an uncompleted call which is either blocked or mishandled. The subscriber may respond by either dialing prematurely or by re-attempting a call. This action can further escalate the processors load, which is spent for uncompleted calls. Unless a proper control is used, the switching system can finally break down. In this paper, we paper, we propose a fuzzy overload detection and control method for switching systems, which can by generating fuzzy rules via fuzzy aggregation networks. Simulation results involving a switching system is given.

  • PDF

A Study on the Performance Analysis of the DOCSIS 1.1 Protocol for Digital CATV Broadcasting (디지털 유선방송을 위한 DOCSIS 1.1 프로토콜의 성능분석에 관한 연구)

  • Kim Soo-Hee;Sohn Won;Kim Young-Soo;Hong Een-Kee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11A
    • /
    • pp.1253-1262
    • /
    • 2004
  • The Data Over Cable System Interface Specification (DOCSIS) protocol enables the delivery of Internet Protocol(IP) traffic over Cable TV networks with significantly higher data rates. In this paper, we assessed the performance of the DOCSIS protocol using the OPNET. The simulation can be used to predict the upstream system throughput, mean access delay and channel utilization on varying packet size and transmission stream and wid/without concatenation, and it has shown that maximum system throughput is 4.6 Mbps for channel capacity of 5.12 Mbps and packet size of 1500 bytes. The mean access delay varies depending on the offered load, and it is assumed that the offered load does not exceed the capacity of the channel. Excess offered load causes service starvation according to the assigned priority.

A Preventive Intra-Path Load Balancing Based on the Probabilistic Characteristics of the Quality-of-service (서비스 품질의 확률적 특성에 기초한 예방적 경로 부하 밸런싱)

  • Kim, Tae-Joon;Suh, Bong-Sue
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.2
    • /
    • pp.279-286
    • /
    • 2010
  • Unbalanced traffic load offered to the nodes making up a path in the network guaranteeing quality-of-service has been known as a main cause deteriorating the capability of the path in admitting traffic flows. Several path load balancing methods have been developed to resolve this problem which used a feedback control scheme that adjusts the delay budget of a flow allocated to each node according to the conditions of available resource in the path. Because of no consideration about the probabilistic characteristics of the service quality, it is impossible for them to prevent in advance a bottleneck on the path which leads to a native restriction in the improvement of the capability being deteriorated. This paper proposes a preventive intra-path load balancing method applicable to the RSVP system which is based on the probabilistic characteristics of the quality-of-service of the offered load. The results of the simulation of the proposed method on a simple evaluation network showed that it provides the gain of 4~22% compared to the legacy one in terms of the number of admitted flows.

LOSS PROBABILITY IN THE PH/M/1/K QUEUE

  • Kim, Jeong-Sim
    • Journal of applied mathematics & informatics
    • /
    • v.24 no.1_2
    • /
    • pp.529-534
    • /
    • 2007
  • We obtain an explicit expression of the loss probability for the PR/M/1/K queue when the offered load is strictly less than one.

A Study on MAC Protocol for Packet Data Service in Slotted CDMA Environment (Slotted CDMA 환경에서 패킷 데이터 서비스를 위한 MAC 프로토콜 연구)

  • 임인택
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.2
    • /
    • pp.204-210
    • /
    • 2004
  • This paper proposes a transmission probability control scheme and MAC protocol for packet data services in slotted CDMA system. In slotted CDMA system, multiple access interference is the major factor of unsuccessful packet transmissions. Therefore, in order to obtain the optimal system throughput, the number of simultaneously transmitted packets should be kept at a proper level. In the proposed protocol, the base station calculates the packet transmission probability of mobile stations according to the offered load and then broadcasts it. Mobile stations, which have a packet, attempt to transmit packet with the received probability. Numerical analysis and simulation results show that the proposed scheme can offer better system throughput than the conventional one, and guarantee a good fairness among all mobile stations regardless of the offered load.

  • PDF

Dynamic Packet Transmission Probability Control Scheme in CDMA S_ALOHA Systems (CDMA S_ALOHA 시스템에서 동적 패킷 전송 확률 제어 기법)

  • 임인택
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7A
    • /
    • pp.485-492
    • /
    • 2003
  • This paper proposes a transmission probability control scheme for guaranteeing fair packet transmissions in CDMA slotted ALOHA system. In CDMA slotted ALOHA system, the packets transmitted in the same slot act as multiple access interference, so that unsuccessful packet transmissions are caused entirely by multiple access interference. Therefore, in order to maximize the system throughput, the number of simultaneously transmitted packets should be kept at a proper level. In the proposed scheme, the base station calculates the packet transmission probability of mobile stations in the next slot according to the offered load and then broadcasts this probability to all the mobile stations. Mobile stations, which have a packet to transmit, attempt to transmit packet with the received probability. Simulation results show that the proposed scheme can offer better system throughput and average delay than the conventional scheme, and guarantee a good fairness among all mobile stations regardless of the offered load.

A Study on Improving The Coefficient of Utilization of Material in Deep Drawing Process (딥드로잉공정에서의 재료 수율 향상에 관한 연구)

  • Ha, Jong-Ho;Kang, Hyung-Sun;Baik, Ho-Hyun
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.33 no.4
    • /
    • pp.509-516
    • /
    • 2009
  • This paper is the study on improving the coefficient of utilization of material in deep drawing process. Cylindrical cup drawing process is widely used in sheet metal forming process. The blank shape is one of the important things in sheet metal forming process. It is produced for the bridge of blank in a blanking process. The coefficient of utilization of material is much effected by this bridge of blank. This study offered a new process method to reduce the loss of material. The new blank shape offered and manufactured by new process method is investigated by a finite element method and the experiment. Then the wrinkling, the punch load, the thickness distribution is observed. This result is different from the result of circular blank process. And it is got that the Max strain, the wrinkle and the height of the wrinkle are effected by the holding force and the punch load. As a result, if the processing optimum condition is found, the loss of material will be reduced. It is necessary to research systematically about determining the optimum value of process variables.