• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.75-78
• /
• 1998

In this paper, we propose a new cell discarding and scheduling scheme which reduce cell loss rate by measuring, in real time, the number of discarded cells in the queuing system with a different loss priority for each class of service such that each class of service meets its cell loss rate requirements and reduce average delay rate for the traffic that is sensitive in cell delay in output buffer of the ATM switch. Throughout the computer simulation, the existing scheduling scheme and proposed scheme are compared with respect to cell loss rate and average delay time.

• 한국통신학회논문지
• /
• 제30권10A호
• /
• pp.877-885
• /
• 2005

Home Phoneline Networking Alliance (HomePNA) 2.0 기술은 기존의 댁내 전화 선로를 이용하여 홈 네트워크를 구축하는 기술로서, 4-32 Mbps의 고속 데이터 전송 속도를 제공한다. 이러한 HomePNA 2.0의 Medium Access Control(MAC) 프로토콜은 IEEE 802.3 Carrier Sense Multiple Access with Collision Detection (CSMA/CD) 방식을 사용하면서, Quality of Service(QoS) 알고리즘을 제공하구 충돌 해결 알고리즘은 Distributed Fair Priority Queuing(DFPQ) 알고리즘을 사용한다. 본 논문은 HomePNA 2.0 MAC 프로토콜 성능의 중요 요소인 포화 처리율(Saturation Throughput), 패킷 지연(Packet Delay) 및 패킷 지터(Packet Jitter)에 대한 수학적인 모델을 제안하고, 이에 대한 모의 실험(Simulation) 결과를 제공하며, 각각의 모의 실험 결과를 분석함으로써, HomePNA 2.0 MAC 프로토콜의 성능을 종합적으로 분석한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권6호
• /
• pp.2450-2469
• /
• 2018

In this paper, we develop a spatiotemporal model to analysis of cellular user in underlay D2D communication by using stochastic geometry and queuing theory. Firstly, by exploring stochastic geometry to model the user locations, we derive the probability that the SINR of cellular user in a predefined interval, which constrains the corresponding transmission rate of cellular user. Secondly, in contrast to the previous studies with full traffic models, we employ queueing theory to evaluate the performance parameters of dynamic traffic model and formulate the cellular user transmission mechanism as a M/G/1 queuing model. In the derivation, Embedded Markov chain is introduced to depict the stationary distribution of cellular user queue status. Thirdly, the expressions of performance metrics in terms of mean queue length, mean throughput, mean delay and mean dropping probability are obtained, respectively. Simulation results show the validity and rationality of the theoretical analysis under different channel conditions.

• Journal of applied mathematics & informatics
• /
• 제41권4호
• /
• pp.861-868
• /
• 2023

Nonlinear network creates complex homotopy structural communication in wireless network medium because of complex distribution approach. Due to this multicast topological connection structure, the queuing probability was non regular principles to create routing structures. To resolve this problem, we propose a Co-cluster homotopy queuing model (Co-CHQT) for Nonlinear Algebraic Topological Structure (NLTS-) for improving poison distribution network communication. Initially this collects the routing propagation based on Nonlinear Distance Theory (NLDT) to estimate the nearest neighbor network nodes undernon linear at x_(a,b)→ax²+bx² = c. Then Quillen Network Decomposition Theorem (QNDT) was applied to sustain the non-regular routing propagation to create cluster path. Each cluster be form with co variance structure based on Two unicast 2(n+1)-Z2(n+1)-Z network. Based on the poison distribution theory X_(a,b) ≠ µ(C), at number of distribution routing strategies weights are estimated based on node response rate. Deriving shorte;'l/st path from behavioral of the node response, Hilbert -Krylov subspace clustering estimates the Cluster Head (CH) to the routing head. This solves the approximation routing strategy from the nonlinear communication depending on Max- equivalence theory (Max-T). This proposed system improves communication to construction topological cluster based on optimized level to produce better performance in distance theory, throughput latency in non-variation delay tolerant.

• 한국정보통신학회논문지
• /
• 제7권5호
• /
• pp.916-924
• /
• 2003

공정큐잉은 자원이 노드들 간에 공유되는 유선 및 무선 멀티미디어망에서 주요한 주제중의 하나이다. 대부분의 공정큐잉 알고리즘은 GPS 알고리즘에 근거하고 있으며 공정성을 강조하는 반면 망에서 멀티미디어를 서비스를 지원하기 위해서는 필수적인 제한된 지연시간 보장 측면은 간과하고 있다. 이 논문에서는 새로운 공정큐잉 방안인 지연 보장 공정큐잉 (DGFQ, Delay Guaranteed Fair Queueing)을 제안한다. 이 방식은 무선 패킷망에서 멀티미디어 서비스를 제공하기 위하여 각 flow 별 지연시간 요구에 맞추어 제한된 지연시간을 보장한다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2002년도 봄 학술발표논문집 Vol.29 No.1 (A)
• /
• pp.169-171
• /
• 2002

Ethernet PON(Passive Optical Network)은 지금까지 연구되고 있는 가입자 망 가운데 인터넷 트래픽에 가장 적합한 모델이다. 본 논문에서는 Ethernet PON의 성능분석을 위해서 OPNET을 이용하여 Ethernet PON 시뮬레이션 모델을 설계 및 구현한다 또한, 이 모델에 대한 End to end Ethernet delay, Queuing delay, Throughput과 Utilization 분석을 통해서 하나의 OLT(Optical Line Termination)가 수용 할 수 있는 최적의 ONU(Optical Network Unit) 개수를 산정하고 Ethernet PON을 설치할 때 망의 효율을 극대화하는 방안을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4389-4410
• /
• 2014

Network coding is a promising technology that increases system throughput by reducing the number of packet transmissions from the source node to the destination node in a saturated traffic scenario. Nevertheless, some packets can suffer from end-to-end delay, because of a queuing delay in an intermediate node waiting for other packets to be encoded with exclusive or (XOR). In this paper, we analyze the delay according to packet arrival rate and propose two network coding schemes, iXOR (Intelligent XOR) and oXOR (Optimal XOR) with Markov Decision Process (MDP). They reduce the average delay, even under an unsaturated traffic load, through the Holding-${\chi}$ strategy. In particular, we are interested in the unsaturated network scenario. The unsaturated network is more practical because, in a real wireless network, nodes do not always have packets waiting to be sent. Through analysis and extensive simulations, we show that iXOR and oXOR are better than the Distributed Coordination Function (DCF) without XOR (the general forwarding scheme) and XOR with DCF with respect to average delay as well as delivery ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권7호
• /
• pp.2257-2285
• /
• 2022

Cyber-physical systems (CPS) have been growing exponentially due to improved cloud-datacenter infrastructure-as-a-service (CDIaaS). Incremental expandability (scalability), Quality of Service (QoS) performance, and reliability are currently the automation focus on healthy Tier 4 CDIaaS. However, stable QoS is yet to be fully addressed in Cyber-physical data centers (CP-DCS). Also, balanced agility and flexibility for the application workloads need urgent attention. There is a need for a resilient and fault-tolerance scheme in terms of CPS routing service including Pod cluster reliability analytics that meets QoS requirements. Motivated by these concerns, our contributions are fourfold. First, a Distributed Non-Recursive Cloud Model (DNRCM) is proposed to support cyber-physical workloads for remote lab activities. Second, an efficient QoS stability model with Routh-Hurwitz criteria is established. Third, an evaluation of the CDIaaS DCN topology is validated for handling large-scale, traffic workloads. Network Function Virtualization (NFV) with Floodlight SDN controllers was adopted for the implementation of DNRCM with embedded rule-base in Open vSwitch engines. Fourth, QoS evaluation is carried out experimentally. Considering the non-recursive queuing delays with SDN isolation (logical), a lower queuing delay (19.65%) is observed. Without logical isolation, the average queuing delay is 80.34%. Without logical resource isolation, the fault tolerance yields 33.55%, while with logical isolation, it yields 66.44%. In terms of throughput, DNRCM, recursive BCube, and DCell offered 38.30%, 36.37%, and 25.53% respectively. Similarly, the DNRCM had an improved incremental scalability profile of 40.00%, while BCube and Recursive DCell had 33.33%, and 26.67% respectively. In terms of service availability, the DNRCM offered 52.10% compared with recursive BCube and DCell which yielded 34.72% and 13.18% respectively. The average delays obtained for DNRCM, recursive BCube, and DCell are 32.81%, 33.44%, and 33.75% respectively. Finally, workload utilization for DNRCM, recursive BCube, and DCell yielded 50.28%, 27.93%, and 21.79% respectively.

• 정보처리학회논문지A
• /
• 제12A권2호
• /
• pp.117-126
• /
• 2005

대규모 멀티컴퓨터 시스템에서 단편화를 줄일 수 있는 적응성 있는 프로세서 할당 기법을 제안한다. 큰 크기의 서브메쉬 할당을 요구하는 작업들의 개수가 적을 경우에도 나머지 작업들의 대기 큐의 지연시간이 증가할 수 있다. 이런 상황에서 할당이 불가능한 기존의 기법들과 달리, L-모양 서브메쉬를 할당할 수 있으며, 할당 가능한 L-모양 서브메쉬를 효율적으로 탐색하는 알고리즘을 개발하였다. 그러므로 FCFS로 스케쥴링되어도, 대기 큐의 지연시간을 줄임으로써 평균응답시간을 줄일 수 있다. 시뮬레이션 결과를 통해서 제안하는 기법이 외부 단편화, 작업응답시간, 그리고 시스템의 활용도 면에서 다른 기법들보다 우수함을 보인다.

• 대한전자공학회논문지TC
• /
• 제40권7호
• /
• pp.261-272
• /
• 2003

Ethernet PON(Passive Optical Network)은 최근 활발하게 연구되고 있는 경제적이고 효율적인 가입자망이다. 차세대 가입자망인 Ethernet PON의 MAC(Media Access Control) 프로토콜은 TDMA(Time Division Multiple Access)방식을 기본으로 하며, QoS(Qualify of Service)를 보장해야 하는 전용회선(Leased Line) 가입자에 적합한 고정 할당 방식과 LAN/MAN의 최선형(Best Effort) 방식에 적합한 동적 할당 방식으로 나눌 수 있다. 본 논문에서는 이들 프로토콜의 성능을 분석하기 위하여 OPNET 시뮬레이션 도구를 이용해 Ethernet PON 모델을 설계한다. 설계된 모델에 대한 단대단 Ethernet 지연(end-to-end Ethernet delay), 큐잉 지연(queuing delay), 처리(throughput)과 사용률(utilization) 분석을 통해서 MAC 프로토콜을 검증하고, 하나의 OLT(Optical Line Terminal)가 수용할 수 있는 최적의 ONU(Optical Network Unit) 개수를 산정한다. 또한, 적정한 ONU의 버퍼 크기를 제안하여 Ethernet PON의 망 효율을 극대화하는 방안을 제시한다.