• Title/Summary/Keyword: network time-delay

Search Result 1,471, Processing Time 0.028 seconds

Fire Allocation and Combat Networking

  • Hong, Yoon-Gee
    • Journal of the military operations research society of Korea
    • /
    • v.24 no.1
    • /
    • pp.110-131
    • /
    • 1998
  • A stochastic modeling of combat that takes more realistic situations into account has been studied with deep concern. Either the firing strategies or network formations are very important elements in the analysis of combat. The first objective of this study is to evaluate how the different strategies affect the outcomes of combat. An analytical approach has been used in an attempt to understand a small-sized battle. The results are validated and compared with existing simulation models. Extending to the moderate size of battle may be achieved with ease. Secondly, an attempt has been made to study and investigate a way to solve combat in a different fashion. We divided a two-on-two battle into two separate one-on-one battles and connected them into a network. New elements considered such as delay time of starting a firefight on a particular node or search time for the next target when a kill occurs are defined and used as the input parameters. The discussions are made to validate the hypothesized model and ask if the results are meaningful and useful in the analysis of combat operations or not.

  • PDF

Bandwidth Allocation and Scheduling Algorithms for Ethernet Passive Optical Networks

  • Joo, Un-Gi
    • Management Science and Financial Engineering
    • /
    • v.16 no.1
    • /
    • pp.59-79
    • /
    • 2010
  • This paper considers bandwidth allocation and scheduling problems on Ethernet Passive Optical Networks (EPON). EPON is one of the good candidates for the optical access network. This paper formulates the bandwidth allocation problem as a nonlinear mathematical one and characterizes the optimal bandwidth allocation which maximizes weighted sum of throughput and fairness. Based upon the characterization, two heuristic algorithms are suggested with various numerical tests. The test results show that our algorithms can be used for efficient bandwidth allocation on the EPON. This paper also shows that the WSPT (Weighted Shortest Processing Time) rule is optimal for minimization the total delay time in transmitting the traffic of the given allocated bandwidth.

A Study on the Congestion Control with Multiple Time Scale under Self-Similar Traffic (자기유사성 트래픽 조건에서 다중 시간 간격을 이용한 혼잡제어에 관한 연구)

  • Cho, Hyeon-Seob;Kim, Young-Cho;Kim, Hui-Suk
    • Proceedings of the KAIS Fall Conference
    • /
    • 2006.05a
    • /
    • pp.294-297
    • /
    • 2006
  • Measurement of network traffic have shown that the self-similarity is a ubiquitous phenomenon spanning across diverse network environments. In previous work, we have explored the feasibility of exploiting the long-range correlation structure in a self-similar traffic for the congestion control. we show that a multiple time scale TCP endows the underlying feedback control with proactivity by bridging the uncertainty gap associated with reactive controls which is exacerbated by the high delay-bandwidth product in broadband wide area networks. Third, we investigate the influence of the three traffic control dimensions-tracking ability, connection duration, and fairness-on performance.

  • PDF

Adaptive Cross-Layer Packet Scheduling Method for Multimedia Services in Wireless Personal Area Networks

  • Kim Sung-Won;Kim Byung-Seo
    • Journal of Communications and Networks
    • /
    • v.8 no.3
    • /
    • pp.297-305
    • /
    • 2006
  • High-rate wireless personal area network (HR-WPAN) has been standardized by the IEEE 802.15.3 task group (TG). To support multimedia services, the IEEE 802.15.3 TG adopts a time-slotted medium access control (MAC) protocol controlled by a central device. In the time division multiple access (TDMA)-based wireless packet networks, the packet scheduling algorithm plays a key role in quality of service (QoS) provisioning for multimedia services. In this paper, we propose an adaptive cross-layer packet scheduling method for the TDMA-based HR-WPAN. Physical channel conditions, MAC protocol, link layer status, random traffic arrival, and QoS requirement are taken into consideration by the proposed packet scheduling method. Performance evaluations are carried out through extensive simulations and significant performance enhancements are observed. Furthermore, the performance of the proposed scheme remains stable regardless of the variable system parameters such as the number of devices (DEVs) and delay bound.

Performance Improvement of Fuzzy C-Means Clustering Algorithm by Optimized Early Stopping for Inhomogeneous Datasets

  • Chae-Rim Han;Sun-Jin Lee;Il-Gu Lee
    • Journal of information and communication convergence engineering
    • /
    • v.21 no.3
    • /
    • pp.198-207
    • /
    • 2023
  • Responding to changes in artificial intelligence models and the data environment is crucial for increasing data-learning accuracy and inference stability of industrial applications. A learning model that is overfitted to specific training data leads to poor learning performance and a deterioration in flexibility. Therefore, an early stopping technique is used to stop learning at an appropriate time. However, this technique does not consider the homogeneity and independence of the data collected by heterogeneous nodes in a differential network environment, thus resulting in low learning accuracy and degradation of system performance. In this study, the generalization performance of neural networks is maximized, whereas the effect of the homogeneity of datasets is minimized by achieving an accuracy of 99.7%. This corresponds to a decrease in delay time by a factor of 2.33 and improvement in performance by a factor of 2.5 compared with the conventional method.

Performance Evaluation of PDP System Using Realtime Network Monitoring (실시간 네트워크 모니터링을 적용한 PDP 시스템의 성능 평가)

  • Song, Eun-Ha;Jeong, Jae-Hong;Jeong, Young-Sik
    • The KIPS Transactions:PartA
    • /
    • v.11A no.3
    • /
    • pp.181-188
    • /
    • 2004
  • PDF(Parallel/Distributed Processing) is an internet-based parallel/distributed processing system that utilizes resources from hosts on the internet in idle state to perform large scale application through parallel processing, thus decreasing the total execution time. In this paper. do propose an adaptive method to be changed network environment at any time using realtime monitoring of host. It is found from experiments that parallel/distributed processing has better performance than its without monitoring as an adaptive strategy, which copy with task delay factor by overload and fault of network, be applicable to the cockpits of task allocation algorithm in PDP.

Packet Data Performance Evaluation in TETRA Wireless Back-bone Network (TETRA 무선 기간망에서 Packet Data 성능 평가)

  • Song, Byeong-Kwon;Kim, Sai-Byuck;Jeong, Tae-Eui;Kim, Gun-Woong;Kim, Jin-Chul;Kim, Young-Eok
    • Proceedings of the KIEE Conference
    • /
    • 2008.11a
    • /
    • pp.379-381
    • /
    • 2008
  • TETRA(Terrestrial Trunked Radio) is a digital trunked radio standard developed by the ETSI(European Telecommunications Standards Institute). Currently, TETRA was set Digital TRS in electric power If wireless backbone network. In this time, we use many company's TETRA modem. So, TETRA modem performance evaluation is very important. TETRA modem use two type of Data transfer mode. One is Packet Data using UDP/IP. and the other is SDS(Short Data Service). In this paper, We generate Packet Data using Traffic Generator module. Packet Data transfer 1000 times each 10 bytes to 400 bytes. We analyze transmission delay time, success rate and standard deviation.

  • PDF

A Real Time Network Game System Based on Retransmission Mechanism of Game Command History on Wire/Wireless Environments (유.무선 환경에서의 게임명령 히스토리 재전송 기법 기반 실시간 네트워크 게임 시스템)

  • Kim, Seong-Hoo;Kweon, Young-Do;Park, Kyoo-Seok
    • Journal of Internet Computing and Services
    • /
    • v.7 no.6
    • /
    • pp.143-155
    • /
    • 2006
  • In this paper, we suggest a network game system that can support video game based on multi-platform for multi-user video game, Latency occurring from the load fluctuation in realtime network game is overcomed by using an initial delay buffering scheme on client, when a real-fire game is played, and shows that stable play for a game is achieved as the result of the scheme. Also, We suggest a retransmission algorithm based on the history of game commands, and this Algorithm supplement shortcomings for packet loss and pocket error on UDP communication.

  • PDF

Intelligent Massive Traffic Handling Scheme in 5G Bottleneck Backhaul Networks

  • Tam, Prohim;Math, Sa;Kim, Seokhoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.3
    • /
    • pp.874-890
    • /
    • 2021
  • With the widespread deployment of the fifth-generation (5G) communication networks, various real-time applications are rapidly increasing and generating massive traffic on backhaul network environments. In this scenario, network congestion will occur when the communication and computation resources exceed the maximum available capacity, which severely degrades the network performance. To alleviate this problem, this paper proposed an intelligent resource allocation (IRA) to integrate with the extant resource adjustment (ERA) approach mainly based on the convergence of support vector machine (SVM) algorithm, software-defined networking (SDN), and mobile edge computing (MEC) paradigms. The proposed scheme acquires predictable schedules to adapt the downlink (DL) transmission towards off-peak hour intervals as a predominant priority. Accordingly, the peak hour bandwidth resources for serving real-time uplink (UL) transmission enlarge its capacity for a variety of mission-critical applications. Furthermore, to advance and boost gateway computation resources, MEC servers are implemented and integrated with the proposed scheme in this study. In the conclusive simulation results, the performance evaluation analyzes and compares the proposed scheme with the conventional approach over a variety of QoS metrics including network delay, jitter, packet drop ratio, packet delivery ratio, and throughput.

The Design of Distributed Control Algorithm for Mobile Communication Network in the Battle Field (전투지역에서의 이동통신을 위한 분산제어 알고리즘 설계)

  • 이경현;송주석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.16 no.11
    • /
    • pp.1167-1178
    • /
    • 1991
  • In this paper, we review the characteristics of battle field, consider required properties of mobile radio network, and design network control architecture proper to battle field network. Also we design distributed algorithm which constructs network control architecture and transmission schedule. For the information of network connectivity and the immediate reconfiguration caused by failure, loss, or movement of nodes, configuration and transmission schedule, algorithms are to be executed periodically and for entire network reliability, algorithms must to be executed fully distributedly. At the time of loss or failure of primary local control node, we suggest the method which diminishes transmission delay. We explain the operation of network with examples. Finally designed algorithms are verified and analized by computer simulation.

  • PDF