• Title/Summary/Keyword: Queueing networks

Search Result 166, Processing Time 0.019 seconds

Resource Management System for Multimedia Service in Wireless Mobile Networks (무선 이동 통신망에서의 멀티미디어 서비스를 위한 자원 제어 시스템)

  • Lee, Won-Yeoul
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.9
    • /
    • pp.1153-1164
    • /
    • 2007
  • One of the most challenging technical issues in mobile communication for multimedia is Quality of Service (QoS) management of handover calls. This paper proposes a 2-level handover control system to copy with this problem. A 2-level handover control system consists of resource reservation and call admission control modules. The resource reservation module divides the network resource into Hard and Soft reserved resource. The Hard reserved resource is only for the handover calls while the Soft reserved resource is for both the handovers and the new calls. And also, the resource reservation module classifies handovers into primary and secondary handovers based on often they occur. The call admission control module deals with the primary and secondary handover calls in different ways. The new calls can use Soft reserved resource only if there is sufficient amount available in the Hard reserved resource. Proposed system is evaluated using an M/M/c/c queueing model. It is shown that proposed system allows more efficient utilization of network resource without degrading QoS comparing with the legacy handover control systems.

  • PDF

A Dynamic Queue Manager for Optimizing the Resource and Performance of Mass-call based IN Services in Joint Wired and Wireless Networks (유무선 통합 망에서 대량호 지능망 서비스의 성능 및 자원 최적화를 위한 동적 큐 관리자)

  • 최한옥;안순신
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.5B
    • /
    • pp.942-955
    • /
    • 2000
  • This paper proposes enhanced designs of global service logic and information flow for the mass-call based IN service, which increase call completion rates and optimize the resource in joint wired and wireless networks. In order to hanve this logic implemented, we design a Dynamic Queue Manager(DQM) applied to the call queuing service feature in the Service Control Point(SCP). In order to apply this logic to wireless service subscribers as well as wired service subscribers, the service registration flags between the Home Location Register(HLR) and the SCP are managed to notify the DQM of the corresponding service subscribers’ mobility. Hence, we present a dynamic queue management mechanism, which dynamically manages the service group and the queue size based on M/M/c/K queueing model as the wireless subscribers roam the service groups due to their mobility characteristics. In order to determine the queue size allocated by the DQM, we simulator and analyze the relationship between the number of the subscriber’s terminals and the drop rate by considering the service increment rate. The appropriate waiting time in the queue as required is simulated according to the above relationship. Moreover, we design and implement the DQM that includes internal service logic interacting with SIBs(Service Independent building Blocks) and its data structure.

  • PDF

An Integrated Processing Method for Image and Sensing Data Based on Location in Mobile Sensor Networks (이동 센서 네트워크에서 위치 기반의 동영상 및 센싱 데이터 통합 처리 방안)

  • Ko, Minjung;Jung, Juyoung;Boo, Junpil;Kim, Dohyun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.5
    • /
    • pp.65-71
    • /
    • 2008
  • Recently, the research is progressing on the SWE(Sensor Web Enablement) platform of OGC(Open Geospatial Consortium) to provide the sensing data and moving pictures collected in a sensor network through the Internet Web. However, existed research does not deal with moving objects like cars, trains, ships, and person. Therefore, we present a method to deal with integrated sensing data collected by GPS device, sensor network, and image devices. Also, this paper proposes an integrated processing method for image and sensing data based on location in mobile sensor networks. Additionally, according to proposed methods, we design and implement the combine adapter. This combine adapter receives a contexts data, and provides the common interface included parsing, queueing, creating unified message function. We verity the proposed method which deal with the integrated sensing data based on combine adapter efficiently. Therefore, the research is expected to help the development of a various context information service based on location in future.

  • PDF

Network Capacity Design in the local Communication and Computer Network for Consumer Portal System (전력수용가포털을 위한 구내 통신 및 컴퓨터 네트워크 용량 설계)

  • Hong, Jun-Hee;Choi, Jung-In;Kim, Jin-Ho;Kim, Chang-Sub;Son, Sung-Young;Son, Kwang-Myung;Jang, Gil-Soo;Lee, Jea-Bok
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.21 no.10
    • /
    • pp.89-100
    • /
    • 2007
  • Consumer Portal is defined as "a combination of hardware and software that enables two-way communication between energy service provider(ESP, like KEPCO) and equipment within the consumer's premises". The portal provides both a physical link(between wires, radio waves, and other media) and a logical link(translating among language-like codes and etiquette-like protocols) between in-building and wide-area access networks. Thus, the consumer portal is an important, open public shared infrastructure in the future vision of energy services. In this paper, we describe a new methodology for local communication and computer network capacity design of consumer portal, and also presents capacity calculation method using a network system limitation factors. By the approach, we can check into the limitations of existing methods, and propose an improved data processing algorithm that can expand the maximum number of the networked end-use devices up to $30{\sim}40$ times. For validation, we applies the proposed methode to our real system design. Our contribution will help electrical power information network design.

A Study on Interconnectioned LAN of Token Ring Network (토큰링 네트워크가 상호 연결된 근거리 통신망에 관한 연구)

  • 이상훈;김경식;강준길
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.11
    • /
    • pp.1206-1218
    • /
    • 1992
  • Token ring systems which control to switch the data stream of networks by passing the token have been widely used to medium access controls in many ring or bus topology LANs. The system could be modeled for analysis as single-server-multi-queue system of the cyclic service method. These concepts could be expanded to multi-token ring systems interconnected with single ring consisting of bridges implemented simply to be stored and transmitted. In the proposal for the performance analysis of the interconnected token ring system, in has been assumed M/G/1 queueing model that frame arrivals are the Poisson process at each station queue and frame sizes are independently and identically distributed. And the average time delays were analyzed mathematically for arbitrary frame transferred from source station to destination area. The time delay of the frame transmission could be explained as the sum of the average time which the token passed from arbitrary position to source station, such as the waiting time in the source station transferring the previous arrival frames, and the propagation time from source station to interdestinated point. These delays were given as the sum of the duration from inner and outer bridge queues, the time delays from inner and outer bridge queues, and the time from outer bridge queue to destination station. These results were investigated by varing parameters effected to total time delays. In the results, those factors to be effected to dominant the total time delays were increased were in the cases of the high arrival rates and the high ration of destination of the other outerring. The system were shown the time delays increased exponentially in spite of the priority service policy. In order to decreasing the number of outerrings and increasing the number of nodes in backbone relatively, so the systems could be decreased the total delay in the interconnected token ring system.

  • PDF

A study on improving fairness and congestion control of DQDB using buffer threshold value (버퍼의 문턱치값을 이용한 DQDB망의 공평성 개선 및 혼잡 제어에 관한 연구)

  • 고성현;조진교
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.4
    • /
    • pp.618-636
    • /
    • 1997
  • DQDB(Distributed Queue Dual Bus) protocol, the IEEE 802.6 standard protocol for metropolitan area networks, does not fully take advantage of the capabilities of dual bus architecture. Although fairness in bandwidth distribution among nodes is improved when using so called the bandwidth balancing mechanism, the protocol requires a considerable amount of time to adjust to changes in the network load. Additionally, the bandwidth balancing mechanism leaves a portion of the available bandwidth unused. In a high-speed backbone network, each node may act as a bridge/ router which connects several LANs as well as hosts. However, Because the existence of high speed LANs becomes commonplace, the congestionmay occur on a node because of the limitation on access rate to the backbone network and on available buffer spaces. to release the congestion, it is desirable to install some congestion control algorithm in the node. In this paper, we propose an efficient congestion control mechanism and fair and waster-free MAC protocol for dual bus network. In this protocol, all the buffers in the network can be shared in such a way that the transmission rate of each node can be set proportional to its load. In other words, a heavily loaded node obtains a larger bandwidth to send the sements so tht the congestion can be avoided while the uncongested nodes slow down their transmission rate and store the incoming segments into thier buffers. this implies that the buffers on the network can be shared dynamically. Simulation results show that the proposed probotol significantly reduces the segment queueing delay of a heavily loaded node and segment loss rate when compared with original DQDB. And it enables an attractive high throughput in the backbone network. Because in the proposed protocol, each node does not send a requet by the segment but send a request one time in the meaning of having segments, the frequency of sending requests is very low in the proposed protocol. so the proposed protocol signigificantly reduces the segment queuing dely. and In the proposed protocol, each node uses bandwidth in proportion to its load. so In case of limitation of available buffer spaces, the proposed protocol reduces segment loss rate of a heavily loaded node. Bandwidth balancing DQDB requires the wastage of bandwidth to be fair bandwidth allocation. But the proposed DQDB MAC protocol enables fair bandwidth without wasting bandwidth by using bandwidth one after another among active nodes.

  • PDF