• Title/Summary/Keyword: Address Assignment

Search Result 70, Processing Time 0.031 seconds

Traffic Grooming and Wavelength Routing for All Optical WDM-Ring Network (전광 WDM 링 통신망에서 수요집적 및 광파장 경로설정)

  • 윤문길
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.26 no.1
    • /
    • pp.33-44
    • /
    • 2001
  • In this paper, we address a problem of traffic grooming and wavelength routing in all optical WDM ring networks. Given a traffic demand for each node pair, we should aggregate the traffic onto lightpaths between pairs of nodes to transport the demand, and set up the routing path for each lightpath with minimum number of wavelengths to be assigned to lightpaths. In this paper, we formulate our problem as a mixed Integer Programming model. Owing to the problem complexity, it is hard to find an optimal solution for our problem. hence, we develop a heuristic algorithm to solve our problem efficiently. From the computational experiments, we can find the proposed heuristic is very satisfactory in both the computation time and the solution quality generated.

  • PDF

An Integrated Game Theoretical Approach for Primary and Secondary Users Spectrum Sharing in Cognitive Radio Networks

  • Kim, Jong-Gyu;Nguyen, Khanh-Huy;Lee, Jung-Tae;Hwang, Won-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.12
    • /
    • pp.1549-1558
    • /
    • 2011
  • In this paper, we address the problem of bandwidth sharing among multiple primary users and multiple secondary users in a cognitive radio network. In cognitive radio networks, effective spectrum assignment for primary and secondary users is a challenge due to the available broad range of radio frequency spectrum as well as the requisition of harmonious coexistence of both users. To handle this problem, firstly, Bertrand game model is used to analyze a spectrum pricing in which multiple primary users emulate with each other to acquire maximal profit. After that, we employ Cournot game to model the spectrum sharing of secondary users to obtain optimal profit for each user also. Simulation results show that our scheme obtains optimal solution at Nash equilibrium.

Experimental Performance Evaluation of BACnet MS/TP Protocol

  • Park, Tae-Jin;Song, Won-Seok;Hong, Seung-Ho
    • International Journal of Control, Automation, and Systems
    • /
    • v.5 no.5
    • /
    • pp.584-593
    • /
    • 2007
  • BACnet is a standard data communication protocol especially designed for building automation and control networks. BACnet uses the Master-Slave/Token-Passing (MS/TP) protocol as one of its field-level networks. In this study, the performance of the BACnet MS/TP protocol is evaluated using an experimental model. The network performance is investigated and evaluated in terms of token rotation time and round trip time. The experimental results show that the performance of the MS/TP network is heavily influenced by the network traffic load, the assignment of MS/TP node address and the network configuration parameter called $N_{max_info-frames}$. Based on the experimental results, simple practical designing guidelines for BACnet MS/TP network systems are also proposed.

The Path Recovery Technique for Hierarchical Routing over 6LoWPAN (6LoWPAN 기반의 계층적 라우팅을 위한 경로 복구 방법)

  • Nam, Choon-Sung;Jeong, Hee-Jin;Shin, Dong-Ryeol
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.705-706
    • /
    • 2008
  • The feature of 6LoWPAN is the capability of the dynamic assignment of 16bit short addresses. By using this dynamically assigned short address, a hierarchical routing is employed. In case of node failure, this hierarchical routing don't support a technique for path recovery. So, this paper proposes the path recovery technique for hierarchical routing over 6LoWPAN.

  • PDF

Performance of RA-T spread-spectrum transmission scheme for centralized DS/SSMA packet radio networks (집중형 DS/SSMA 무선 패킷통신망을 위한 RA-T 대역확산 전송방식의 성능)

  • 노준철;김동인
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.6
    • /
    • pp.11-22
    • /
    • 1996
  • We address an issue of channel sharing among users by using a random assignment-transmitter-based (RA-T) spread-spectrum transmission scheme which permits the contention mode only in the transmission of a header while avoiding collision during the data packet transmission. Once the header being successfully received, the data packet is ready for reception by switching to one of programmable matched-filters. But the receoption may be blocked due to limited number of matched-filters so that this effect is taken into account in our analysis. For realistic analysis, we integrate detection performance at the physical level with channel activity at the link level through a markov chain model. We also consider an acknowledgement scheme to notify whether the header is correctly detcted and the data packet can be processed continuously, which aims at reducing the interference caused unwanted data transmission. It is shown that receiver complexity can be greatly reduced by choosing a proper number of RA codes at the cost of only a little throughput degradation.

  • PDF

The Design and Implementation of Subscriber Information Management System (가입자시설 종합관리시스템(SIMS) 설계 및 구현)

  • Kim, Jang-Su
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.1 no.2 s.2
    • /
    • pp.131-141
    • /
    • 1993
  • This paper describes the development of SIMS. SIMS provides not only the basic functions, such as input and output of outside plant maps and facility status statistics report, which are the major function of TOMS, but also can manage outside plant facilities and subscriber information integrately to maximize the efficiency of large outside plant facility database and to increase the qualify of subscriber service. SIMS provides following functions: Work order generation for telephone installation; Automatic cable pair assignment; Cable tracing and unused pair management; Subscriber record management and statistics report generation; Subscriber address information management.

  • PDF

A dual based heuristic for the hub location and network design problem with single assignment constraint (단일연결 제약하의 설비입지를 고려한 망설계 문제의 쌍대기반 해법)

  • 윤문길
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.25 no.1
    • /
    • pp.67-84
    • /
    • 2000
  • In this paper, we address a network design problem including the decision of hub facility locatiions which is typically found in a communicatio and a transportation network design studies. Due to the administrative and the geographical restrictions, it is common to assume that each user should be assigned to only one hub facility. To construct such a network, three types of network costs should be considered: the fixed costs of establishing the hubs and the arcs in the network, and the variable costs associated with transversing the network. The complex problem is formulated as a mixed IP embedding a multicommodity flow problem. Exploiting its special structure, a dual-based heuristic is then developed, which yields near-optimal design plans. The test results indicate that the heuristic is an effective way to solve this computationally complex problem.

  • PDF

Hybrid Distributed Stochastic Addressing Scheme for ZigBee/IEEE 802.15.4 Wireless Sensor Networks

  • Kim, Hyung-Seok;Yoon, Ji-Won
    • ETRI Journal
    • /
    • v.33 no.5
    • /
    • pp.704-711
    • /
    • 2011
  • This paper proposes hybrid distributed stochastic addressing (HDSA), which combines the advantages of distributed addressing and stochastic addressing, to solve the problems encountered when constructing a network in a ZigBee-based wireless sensor network. HDSA can assign all the addresses for ZigBee beyond the limit of addresses assigned by the existing distributed address assignment mechanism. Thus, it can make the network scalable and can also utilize the advantages of tree routing. The simulation results reveal that HDSA has better addressing performance than distributed addressing and better routing performance than other on-demand routing methods.

Service Provision for Future Access Networks Using PPP Extensions

  • Lee, Jungjoon;Park, Jun-Kyun
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.695-698
    • /
    • 2000
  • The services such as real-time audio and video applications have become increasingly popular, especially over the Internet. Furthermore, as being commercialized those contents on the Internet require quality of service (QoS) support to ensure their performance. PPP is the best solution to of for those kinds of services. The reason why we want to employ PPP is this satisfies most of the requirements associated with remote connectivity to an NSP, such as IP address assignment, security, and AAA (authentication, authorization and accounting). In addition, since ISPs and corporations are familiar with PPP based connectivity, easy migration from existing ISP infrastructure is expected, if QoS is guaranteed. But so for PPP has had no field to ensure the quality of service. This article presents the solution by using some tunneling protocols and the draft [1] that proposed additional LCP option fields to negotiate QoS. To communicate each other, after negotiating those option fields, over various protocols such as ATM, Ethernet, and etc. tunneling protocol is used. Following sections will mention those briefly. And the service provision to offer the end-to-end communication with negotiated QoS will also be proposed.

  • PDF

Development of an efficient logic function manipulation system for solving large-scale combiation problems and its application to logic design of sequential circuits (대규모 조합문제를 해결하기 위한 효율적인 논리함수 처리 시스템의 개발과 순서회로 설계에의 응용)

  • 권용진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.8
    • /
    • pp.1613-1621
    • /
    • 1997
  • Many studies on internal data expression to process logic functions efficiently on computer have been doing actively. In this paper, we propose an efficient logic function manipulation system made on the Objected-Oriented manner, where Binary Decision Diagrams(BDD's) are adopted for internal data espressionof logic functions. Thus it is easy to make BDD's presenting combinational problems. Also, we propose a method of applying filtering function for reducing the size of BDD's instead of attributed bits, and add it to the mainpultion system. As a resutls, the space of address is expanded so that the number of node that can be used in the mainpulation system is increased up to 2/sup 27/. Finally, we apply the implemented system to One-Shot state assignment problems of asynchronous sequential circuits and show that it is efficient for the filtering method to reduce the size of BDD's.

  • PDF