• Title/Summary/Keyword: link allocation.

Search Result 205, Processing Time 0.021 seconds

Semantic Dependency Link Topic Model for Biomedical Acronym Disambiguation (의미적 의존 링크 토픽 모델을 이용한 생물학 약어 중의성 해소)

  • Kim, Seonho;Yoon, Juntae;Seo, Jungyun
    • Journal of KIISE
    • /
    • v.41 no.9
    • /
    • pp.652-665
    • /
    • 2014
  • Many important terminologies in biomedical text are expressed as abbreviations or acronyms. We newly suggest a semantic link topic model based on the concepts of topic and dependency link to disambiguate biomedical abbreviations and cluster long form variants of abbreviations which refer to the same senses. This model is a generative model inspired by the latent Dirichlet allocation (LDA) topic model, in which each document is viewed as a mixture of topics, with each topic characterized by a distribution over words. Thus, words of a document are generated from a hidden topic structure of a document and the topic structure is inferred from observable word sequences of document collections. In this study, we allow two distinct word generation to incorporate semantic dependencies between words, particularly between expansions (long forms) of abbreviations and their sentential co-occurring words. Besides topic information, the semantic dependency between words is defined as a link and a new random parameter for the link presence is assigned to each word. As a result, the most probable expansions with respect to abbreviations of a given abstract are decided by word-topic distribution, document-topic distribution, and word-link distribution estimated from document collection though the semantic dependency link topic model. The abstracts retrieved from the MEDLINE Entrez interface by the query relating 22 abbreviations and their 186 expansions were used as a data set. The link topic model correctly predicted expansions of abbreviations with the accuracy of 98.30%.

Resource allocation in downlink SWIPT-based cooperative NOMA systems

  • Wang, Longqi;Xu, Ding
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.1
    • /
    • pp.20-39
    • /
    • 2020
  • This paper considers a downlink multi-carrier cooperative non-orthogonal multiple access (NOMA) transmission, where no direct link exists between the far user and the base station (BS), and the communication between them only relies on the assist of the near user. Firstly, the BS sends a superimposed signal of the far and the near user to the near user, and then the near user adopts simultaneous wireless information and power transfer (SWIPT) to split the received superimposed signal into two portions for energy harvesting and information decoding respectively. Afterwards, the near user forwards the signal of the far user by utilizing the harvested energy. A minimum data is required to ensure the quality of service (QoS) of the far user. We jointly optimize power allocation, subcarrier allocation, time allocation, the power allocation (PA) coefficient and the power splitting (PS) ratio to maximize the number of data bits received at the near user under the energy causality constraint, the minimum data constraint and the transmission power constraint. The block-coordinate descent method and the Lagrange duality method are used to obtain a suboptimal solution of this optimization problem. In the final simulation results, the superiority of the proposed NOMA scheme is confirmed compared with the benchmark NOMA schemes and the orthogonal multiple access (OMA) scheme.

Network function virtualization (NFV) resource allocation (RA) scheme and research trend (네트워크기능 가상화 (NFV) 자원할당 (RA) 방식과 연구동향)

  • Kim, Hyuncheol;Yoon, Seunghyun;Jeon, Hongseok;Lee, Wonhyuk
    • Convergence Security Journal
    • /
    • v.16 no.7
    • /
    • pp.159-165
    • /
    • 2016
  • Through the NFV (Network Function Virtualization), companies such as network service providers and carriers have sought to dramatically reduce CAPEX / OPEX by improving the speed of new service provisioning and flexibility of network construction through the S/W-based devices provided by NFV. One of the most important considerations for establishing an NFV network to provide dynamic services is to determine how to dynamically allocate resources (VNFs), the basic building blocks of network services, in the right place. In this paper, we analyzed the latest research trends on VNF node, link allocation, and scheduling in nodes that are required to provide arbitrary NS in NFV framework. In this paper, we also propose VNF scheduling problems that should be studied further in RA (Resource Allocation).

A Novel Frequency Planning and Power Control Scheme for Device-to-Device Communication in OFDMA-TDD Based Cellular Networks Using Soft Frequency Reuse (OFDMA-TDD 기반 셀룰러 시스템에서 디바이스간 직접통신을 위한 SFR 자원할당 및 전송 전력조절 방법)

  • Kim, Tae-Sub;Lee, Sang-Joon;Lim, Chi-Hun;Ryu, Seungwan;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.10
    • /
    • pp.885-894
    • /
    • 2012
  • Currently, Demand of data traffic has rapidly increased by popular of smart device. It is very difficult to accommodate demand of data traffic by limited resource of base station (BS). To solve this problem, method has proposed that the Device-to-Device (D2D) reduce frequency overload of the BS and all of the user equipment (UE) inside the BS and neighbor BS don't allow communicating directly to BS. However, in LTE-Advance system cellular link and sharing radio resources of D2D link, the strong interference of the cellular network is still high. So we need to eliminate or mitigate the interference. In this paper, we use the transmission power control method and Soft Frequency Reuse (SFR) resource allocation method to mitigate the interference of the cellular link and D2D link. Simulation results show that the proposed scheme has high performance in terms of Signal to Noise Ratio (SINR) and system average throughput.

A Simplified QoS Model for MPLS Networks (MPLS 네트워크를 위한 간략화된 QoS 모델)

  • Seo Seung-Joon;Kang Chul-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4B
    • /
    • pp.235-245
    • /
    • 2005
  • In this paper, a simplified QoS model of MPLS-based backbone network. Conventional scheme proposed by IETF(IETF schem) is to embed a DiffServ model in MPLS network. However, this approach results in overall upgrade of MPLS system and so it is difficult to deploy this approach. Our proposed model, however, uses a Vidual Link which is a set of Label Switched Path(LSP) connected from an Ingress Label Edge Router(LER) to an Egress LER. In this model, Per-Hop-Behavior(PHB) is implemented only at each LSP in ingress LER and Core Label Switch Routers(LSRs) just guarantee each LSP's bandwidth, not service. This bandwidth guarantee service is fully provided by legacy MPLS model. Also we propose flow allocation mechanism and the flow distribution among LSPs of the virtual link by the flow according to the network status. To evaluate the simplified approach, the characteristics of the approach are compared logically with these of IETF's one through simulations.

A Study on the ABR Traffic Control Mechanism using Dynamic Bandwidth Allocation (동적 대역폭 할당을 이용한 ABR 트래픽 제어 방식에 관한 연구)

  • 류호용;박권철;박광채
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12B
    • /
    • pp.2275-2282
    • /
    • 1999
  • In ATM networks, bandwidth allocation using available bandwidth is important to control ABR traffic efficiently. However, it is difficult to dynamically assign bandwidth on bursty traffic, because the tracking of the existing available bandwidth information uses statistical value. In this paper, we propose a output-bufferd ATM switch using Per-VC queueing scheme with timer and Controller. The controller determines whether each VC is in congestion state or not, and the timer can assign dynamically as determining the available bandwidth for the Present period by Backlogged time and total link capacity, and then transmitting the determined bandwidth to source. Instead of using statistical parameters, the proposed scheme can improve link efficiency as allocating the bandwidth of the next period, by use of measured bandwidth during the current period.

  • PDF

A buffer readout scheduling for ABR traffic control (ABR 트랙픽 제어를 위한 버퍼 readout 스케쥴링)

  • 구창회;이재호
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.11
    • /
    • pp.25-33
    • /
    • 1997
  • The end-to-end rate-based control mechanism is used for the flow control of the ABR service to allow much more flexibility in ATM switching system. To accommodate the ABR service effciently many algorithms such as EFCI, EPRCA, ERICA, and CAPC2 have been proposed for the switch algorithm. ABR cells and related RM cells are received at the ATM switch fabric transparently without any processing. And then cells received from the traffic source are queued in the ABR buffer of switching system. The ABR buffer usually has some thresholds for easy congestion control signal transmission. Whatever we use, therefore, these can be many ABR traffic control algorithms to implement the ABR transfer capability. The genertion of congestion indicate signal for ABR control algorithms is determined by ABR buffer satus. And ABR buffer status is determined by ABR cells transfer ratio in ATM switch fabrics. In this paper, we presented the functional structures for control of the ABR traffic capability, proposed the readout scheduling, cell slot allocation of output link and the buffer allocation model for effective ABR traffic guranteeing with considering CBR/VBR traffics in ATM switch. Since the proposed readout scheduling scheme can provide more avaliable space to ABR buffer than existing readout scheduling scheme, generation rate of a SEND signal, that is, BCN signal in destination node can be increased for ABR call connection. Therefore, the proposed scheme, in this paper, can be appropriate as algorithm for effective ABR traffic service on output link of ATM switching node.

  • PDF

A Performance Analysis for Bandwidth Allocation Algorithm Using Available Bandwidth Information in ATM Networks (ATM 네트워크에서 가용 대역폭 정보를 이용한 대역폭 할당 알고리즘에 대한 성능분석)

  • 한상옥;박광채
    • The Journal of the Acoustical Society of Korea
    • /
    • v.19 no.1
    • /
    • pp.89-96
    • /
    • 2000
  • ABR service is defined by ATM Forum and ITU for the efficient use of link bandwidth, and 2-pass service policing is proposed for this service. 2-pass service policing is effective by the real-time measurement of the used bandwidth, and this scheme obtains multiplexing gam and control efficiently ABR traffic as dynamically allocating rate by residual bandwidth information. In this study, we propose the real-time bandwidth prediction scheme for ABR traffic control, as using dynamic rate allocation by available bandwidth information. This study can obtain the simple hardware structure by means of as predicting available bandwidth by the total link bandwidth and the sum of transmission rate on the backlogged state connections.

  • PDF

A Two Window-Based marking algorithm for enhancing throughput fairness of assured services in a differentiated service network (차별서비스 네트워크에서 보장형 서비스의 전송률 공평성 향상을 위한 이중 윈도우 기반 마킹 알고리즘)

  • 조병규;황구연;이성근;장문석
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.05a
    • /
    • pp.147-151
    • /
    • 2002
  • One of the main issues in Diffserv AS architecture is guaranteeing fairness among the flows which have their own QoS requirements. Because the methodology of resource allocation and traffic conditioning would affect the end-to-end QoS and backbone link utilization. In this paper, we propose a variant of TSW algorithm for enhancing fair bandwidth allocation and link utilization and presents performance evaluation between TSW & TS2W3C through NS-2 Simulations.

  • PDF