• Title/Summary/Keyword: busy node

Search Result 18, Processing Time 0.021 seconds

A congestion control scheme estimating global channel busy ratio in VANETs

  • Kim, Tae-won;Jung, Jae-il;Lee, Joo-young
    • Journal of IKEEE
    • /
    • v.21 no.2
    • /
    • pp.115-122
    • /
    • 2017
  • In vehicular safety service, every vehicle broadcasts Basic Safety Message (BSM) periodically to inform neighbor vehicles of host vehicle information. However, this can cause network congestion in a region that is crowded with vehicles resulting in a reduction in the message delivery ratio and an increase in the end-to-end delay. Therefore, it could destabilize the vehicular safety service system. In this paper, in order to improve the congestion control and to consider the hidden node problem, we propose a congestion control scheme using entire network congestion level estimation combined with transmission power control, data rate control and time slot based transmission control algorithm. The performance of this scheme is evaluated using a Qualnet network simulator. The simulation result shows that our scheme mitigates network congestion in heavy traffic cases and enhances network capacity in light traffic cases, so that packet error rate is perfectly within 10% and entire network load level is maintained within 60~70%. Thus, it can be concluded that the proposed congestion control scheme has quite good performance.

Routing Algorithm for Task Migration in Circuit-switched Hypercube (회선교환방식 하이퍼큐브에서 작업이동을 위한 라우팅 알고리즘)

  • 김대영;최상방
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.7
    • /
    • pp.952-965
    • /
    • 1995
  • In the hypercube multiprocessor system. repeated allocations and deallocations of subcubes generate a fragmented hypercube from which. even if sufficient free processors are available, a subcube that is large enough to accomodate a new task cannot be formed. To eliminate the fragmentation, we need a processor relocation to move a task-occupied subcube to a free subcube, and gather dispersed small subcubes. In this paper, we propose a routing algorithm for task migration in circuit- switched hypercube to relocate processors. In the circuit-switched hypercube, we have to find a set of dedicated link-disjoint routing paths for each node to move a task from a busy subcube to a free subcube in fragmentation. The proposed algorithm is based on the PGC(packed Gray code) which detects all kinds of subcubes.

  • PDF

The Design and Performance analysis of a Process Migration Facility in a Distributed System (분산 시스템에서 프로세스 이주 기능의 설계와 성능 평가)

  • 엄태범;송주석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.7
    • /
    • pp.656-665
    • /
    • 1992
  • In this paper, the performance of the various multiple access techniques for the mobile computer network has been studiedi in the consideration of the charactersitics of the mobile cimmunication channel. In the case of the hidden node occurring. It could be seen that the performance of the code division multiple access (CDMA) technique with simultaneous access function is better than that of the other packet access methods such as carrier sendsed multiple access (CDMA), busy tone multiple access (BTMA) and idle signal multiple access (ISMA) in the view of the throughput and mean delay time. Also, it has been shown that the performance of the CDMA method is superior to that of other packet access techniques such as multiple access (CSMA), etc. when the fading effect or impulsive noise exists in the mobile channel, Especially, in the case of the distributed mobile network it has been shown that the receivertransmitter based CDMA method using the characteristics of CDMA effectively has better throughput and less mean delay time than the commontransmitter based CDMA technique.

  • PDF

A Heuristic to reduce busy waiting in Periodic Boost (주기적 추진(Periodic Boost)의 바쁜 대기를 줄이기 위한 휴리스틱)

  • 정다운;유정록;맹승렬;이준원
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.457-459
    • /
    • 2003
  • 클러스터 시스템은 상대적으로 가격이 싼 컴퓨터를 고성능의 네트워크(Network)로 묶어서 슈퍼컴퓨터와 같은 고성능을 가지도록 만들어진 시스템이다. 이런 클러스터 컴퓨팅 환경에서 효율적인 스케줄링은 그 성능에 직접적인 영향을 주는 요소이다. 이런 시스템에서 완전한 동시 스케줄링(Coscheduling)은 서로 교환해야하는 정보가 많아지기 때문에 그 구현이 어렵다. 이 상황에서 메시지를 기다리는 정보와 메시지의 도착 정보를 이용해서 즉 단지 그 노드(Node) 자체의 정보만을 이용해 동시 스케줄링의 효과를 구현할 수 있다. 그리고 이것을 이용한 알고리즘 중에 주기적 추진(Periodic Boost(PB))이 있다. 이 논문에서는 주기적 추진에 휴리스틱을 이용하du 더 효과적인 스케줄링을 할 수 있는 알고리즘을 소개한다. 그리고 이 휴리스틱의 효과를 검증하기 위해서 클러스터 노드 2개를 이용해서 실험을 했다. 실험은 계산대 통신 비율(Communication-to-Computation ratio)을 변화시켜가면서 총 수행시간을 측정하고, 서로 통신하는 양이 다른 프로세스를 섞어서 그 성능을 실험한 결과 휴리스틱이 주기적 추진(PB)에서 불필요하게 낭비되는 자원을 효율적으로 사용할 수 있음을 알 수 있었다.

  • PDF

A Study on the Performance of the Various Multiple Access for the Mobile Computer Network (이동 컴퓨터 통신망용 다중 엑세스 방식의 성능 연구)

  • 백지현;조동호;이영웅
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.7
    • /
    • pp.641-655
    • /
    • 1992
  • In this paper, the performance of the various multiple accesstechniques for the mobile computer network has been studied in the consideration of the characteristics. Of the mobile communication channel. In the case of the hidden node occurring, it could be seen that the performance of the code division multiple access(CDMA) technique. With simultaneous access function is better than that of the other packet access methods such as carrier sensed multiple access(CAMA). Busy tone mulitiple access(BTMA)and idle signal muitiple access(ISMA) in the view of the throuhtput and mean delay time. Also it has been shown that the performance of the CDMA method is superior to that of other packet access techniques such as multiple access(CSMA).etc when the fading effect or impulsive noise exists in the mobile channel. Especially in the case of the distributed mobile network. It has been shown that the receiver-transmitter based CDMA method using the characteristics of CDMA effectively has better throughput and less mean delay time than the commontransmitter based CDMA technique.

  • PDF

Sentinel Node Biopsy Examination for Breast Cancer in a Routine Laboratory Practice: Results of a Pilot Study

  • Khoo, Joon-Joon;Ng, Chen-Siew;Sabaratnam, Subathra;Arulanantham, Sarojah
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.17 no.3
    • /
    • pp.1149-1155
    • /
    • 2016
  • Background: Examination of sentinel lymph node (SLN) biopsies provides accurate nodal staging for breast cancer and plays a key role in patient management. Procurement of SLNs and the methods used to process specimens are equally important. Increasing the level of detail in histopathological examination of SLNs increases detection of metastatic tumours but will also increase the burden of busy laboratories and thus may not be carried out routinely. Recommendation of a reasonable standard in SLN examination is required to ensure high sensitivity of results while maintaining a manageable practice workload. Materials and Methods: Twenty-four patients with clinically node-negative breast cancer were recruited. Combined radiotracer and blue dye methods were used for identification of SLNs. The nodes were thinly sliced and embedded. Serial sectioning and immunohistochemical (IHC) staining against AE1/AE3 were performed if initial H&E sections of the blocks were negative. Results: SLNs were successfully identified in all patients. Ten cases had nodal metastases with 7 detected in SLNs and 3 detected only in axillary nodes (false negative rate, FNR=30%). Some 5 out of 7 metastatic lesions in the SLNs (71.4%) were detected in initial sections of the thinly sliced tissue. Serial sectioning detected the remaining two cases with either micrometastases or isolated tumour cells (ITC). Conclusions: Thin slicing of tissue to 3-5mm thickness and serial sectioning improved the detection of micro and macro-metastases but the additional burden of serial sectioning gave low yield of micrometastases or ITC and may not be cost effective. IHC validation did not further increase sensitivity of detection. Therefore its use should only be limited to confirmation of suspicious lesions. False negative cases where SLNs were not involved could be due to skipped metastases to non-sentinel nodes or poor technique during procurement, resulting in missed detection of actual SLNs.

Balanced DQDB Applying the System with Cyclic Service for a Fair MAC Procotol (공정한 MAC 프로토콜을 위해 순환서비스시스템을 적용한 평형 DQDB)

  • 류희삼;강준길
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.12
    • /
    • pp.1919-1927
    • /
    • 1993
  • A new MAC protocol has been proposed and analysed to relieve the unfairness problems exhibited by the basic version of the DQDB standard. DQDB MAC protocol has the unfairness problems in throughputs. message delay and so or. And when the slots are reused or the file transmissions takes long, the unfairness problems in the system become worse. The new access protocol proposed here, which of called the Balanced DQDB, guarantees a fair bandwidth distribution by using one bit of the dual bus network protocol and keeps up all characteristics of DQDB. the DQDB analysis model introduced by Wen Jing, et al, was considered to analyse a sequential balance distribution of solts. And the probabilities of the empty in operation mode were represented to determine the probabilities for busy bits to generate on each node of the bus using the Markov chain. Through the simulations. the performances of the proposed Balanced DQDB and that of the standard DQDB of the BWB mechanism were compared at the state that the values of the RQ or CD counter on each node varied dynamically. As the results, it is shown that the Balanced DQDB has the decrement of throughputs in upstream, but the numbers of the used empty slots at each node of the Balanced DQDB had more than that of the others because the Balanced DQDB has over 0.9 throughputs in the 70~80% nodes of total node and it has constant throughputs at each node. And there results were analogous to that of the analytical model.

  • PDF

Efficient Radio Resource Measurement System in IEEE 802.11 Networks (IEEE 802.11 네트워크에서 효율적인 라디오 자원 측정 시스템 연구)

  • Yang, Seung-Chur;Lee, Sung-Ho;Kim, Jong-Deok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.11
    • /
    • pp.2437-2445
    • /
    • 2012
  • This paper presents the efficient measurement method of radio resource by analyzing various medium occupied elements. The medium occupied time consists of 802.11 frames, wireless interference, and protocol waiting time from a wireless node on a current channel. And it is used to performance metric. Existing research is only measured partial occupied elements, and is lack of validation of measurement unit and scalability on various IEEE 802.11 radio. This paper presents the measurement method of classified occupied elements. To achieve this, we modified 802.11n based OpenHAL device driver to collect the register information of wireless chipset, and to analyze receiving frames in an virtual monitor mode. We conclude accurate medium occupied time measurement system from various validation methods.