• Title/Summary/Keyword: 트래픽 부하

Search Result 598, Processing Time 0.023 seconds

A Design and Implementation of Dynamic Hybrid P2P System with Hierarchical Group Management and Maintenance of Reliability (계층적 그룹관리와 신뢰성을 위한 동적인 변형 P2P 시스템 설계 및 구현)

  • Lee, Seok-Hee;Cho, Sang;Kim, Sung-Yeol
    • The KIPS Transactions:PartD
    • /
    • v.11D no.4
    • /
    • pp.975-982
    • /
    • 2004
  • In current P2P concept, pure P2P and Hybrid P2P structures are used commonly. Gnutella and Ktella are forms of pure P2P. and forms of Hybrid P2P are innumerable. File searching models exist in these models. These models provide group management for file sharing, searching and indexing. The general file sharing model is good at maintaining connectivity. However, it is defective in group management. Therefore, this study approaches hierarchical structure in file sharing models through routing technique and backup system. This system was designed so that the user was able to maintain group efficiency and connection reliability in large-scale network.

Proportional Fair Subcarrier Allocation Scheme in the Multiuser OFDM Wireless Mobile Communication Systems (다중 사용자 OFDM 무선 이동통신 환경에서의 비례공정 부반송파 할당기법)

  • Park Hyo soon;Kim Jun soek;Lee Jai yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.12A
    • /
    • pp.1291-1297
    • /
    • 2004
  • In this paper, the new scheduling algorithm that supports the maximization of system throughput and the proportional fairness among non-real time traffic users is proposed in OFDMA wireless mobile communication systems. The concept of the proposed algorithm is based on the proportional fairness algorithm, which is deployed in 3GPP2, and sorting method. The proportional fairness algorithm is adapted to allocate the number of subcarrier per user. A sorting method is contributed to the maximization of system throughput in the practical allocation of subcarrier per user. Simulation results show that new algorithm had better performance than the max rate rule in case of fairness, higher throughput than the scheduling algorithm without sorting method. Even though the system throughput of the proposed algorithm is almost same with the iteration scheme using subcarrier swapping method between users, the computational time of the former is reduced up to 3 times than the latter.

An Efficient Dynamic Paging Scheme in Mobile IPv6 (Mobile IPv6에서 효율적인 동적 페이징 방식)

  • Joe In-Whee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.6B
    • /
    • pp.544-550
    • /
    • 2006
  • Next-generation wireless/mobile networks are envisioned to have an IP-based infrastructure. One of the research challenges for next-generation all IP-based networks is the design of intelligent mobility management technologies that have a seamless mobility and minimal signaling overhead. Recently, HMIPv6 was proposed by the IETF for efficient mobility management. HMIPv6 reduces the amount of signaling and improves the performance of MIPv6 in terms of handover latency. However the MAP can be a single point of performance bottleneck when there are a lot of local movements. HMIPv6 can cause signaling overhead due to the unnecessary location update of idle mobile nodes. Therefore, in this paper, we propose the dynamic paging Mobile IPv6 that reduces the signaling cost of the unnecessary location updates using IP paging and organizes dynamically optimal MAP area according to user's mobility and traffic. We show performance results that are obtained from the average total location update cost and packet delivery cost.

A New Distributed Conference Architecture using Resource Lists (리소스 리스트를 사용한 새로운 분산형 컨퍼런스 구조)

  • Jang, Choon-Seo;Lee, Ky-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.9
    • /
    • pp.123-129
    • /
    • 2011
  • In this paper, We have proposed a new distributed conference architecture which can reduce largely SIP(Session Initiation Protocol) messages exchanged between servers and participants in distributed conference environment by using resource lists which consist of conference participants URIs. This architecture can also reduce processing time and loads of conference servers. In our proposed method, the number of SIP messages required for participating in the conference can be largely reduced, and the number of SIP messages required for subscription of conference event package and maintaining sessions can also be largely reduced by using resource lists. Therefore expandibility of the conference system increases and network traffic can be reduced by using our conference architecture. And We also have proposed in this paper a new conference information data format with some added elements that are necessary for processing resource lists. Furthermore the procedure for dynamically adding conference servers to the conference environment has been suggested, and the exchanging process of SIP messages and conference information data between conference servers and conference participants has been also suggested. The performance of our proposed system has been evaluated by experiments.

Architecture and Server Selection for DHT-based Distributed CDN (해시 테이블 기반 분산형 CDN 구조 및 서버 선택 방안)

  • Jung, Jong-Hae;Oh, Gun-Young;Lee, Nam-Kyung;Yoon, Chang-Woo;Lee, Hyun-Woo;Ryu, Won;Lee, Sung-Chang
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.5
    • /
    • pp.217-228
    • /
    • 2011
  • In centralize CDN systems, the content server selection is performed by service node for every user request, and the selected node is notified to the user. In this paper, we present distributed CDN architecture and algorithm in which the request from a user is delivered to the content source by a P2P algorithm utilizing DHT(distributed hash table) through the overlay network and the user selects one of the source nodes based on real-time user-centric criteria. For this purpose, we propose a modified Pastry algorithm for contents registration, search and selection, in addition to the distributed architecture. The proposed architecture has the advantages of load balancing, traffic balancing, scalability, fault-tolerance due to the self-configuration, self-healing attributes of distributed architecture. Various simulation shows the feasibility of the proposed architecture and algorithm, and the performance is compared and discussed for the variations of the proposed scheme.

A Rule for Reducing Error Remains in Multicopy Transmission ARQ

  • Shin, Woo-Cheol;Park, Jin-Kyung;Ha, Jun;Choi, Cheon-Won
    • Journal of IKEEE
    • /
    • v.7 no.1 s.12
    • /
    • pp.97-106
    • /
    • 2003
  • In ARQ based error control, imperfect error detection leaves error remains on a packet. Aiming for a reduction of error remains in multicopy transmission ARQ system, we propose a rule of requesting a retransmission and deciding a correct copy, (identified as (m,σ)rule). While the probability of error remains is reduced by the employment of the (m,σ) rule at multicopy transmission ARQ, delay and throughput performance may be degraded in comparison with those of conventional single copy transmission ARQ. Thus, we develop an analytical method to evaluate the performance trade-off in multicopy transmission ARQ following the (m,σ) rule. From the numerical results obtained by the analytical method, we investigate the effect of channel characteristics on the performance of error remains, packet loss, throughput, and packet delay, and confirm that the adaptability of the (m,σ) rule to conform to various QoS requirements with ease.

  • PDF

Performance Analysis of Adaptive RS Coverage Extension Scheme for the MMR systems (MMR 시스템을 위한 적응적인 RS 커버리지 확장 기법의 성능 분석)

  • Kim, Seung-Yeon;Kim, Se-Jin;Lee, Hyong-Woo;Ryu, Seung-Wan;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.4B
    • /
    • pp.584-591
    • /
    • 2010
  • In this paper, we propose an adaptive Relay Station (RS) coverage extension scheme for the Mobile Multi-hop Relay (MMR) systems. The MMR system with a non-transparent mode RS can be used to extend BS coverage using the remaining capacity of the Base Station(BS). Thus, the call blocking may occur in RSs when calls arrive very often in Multi-hop Relay Base Station (MR-BS). In the proposed scheme, RSs can be connected to the neighbor MMR system as the 2ndtier RSs if the neighbor MMR system services low traffic load when calls are frequently arrived in MR-BS or RSs. By doing so, the MMR system can accept a new call without call blocking. Through numerical results, we demonstrate that the proposed scheme outperforms the conventional MMR system in terms of the throughput and call blocking probability of MMR systems.

A Study of a Hierarchical Grade-based Contents Forwarding Scheme for CCN Real-time Streaming Service (CCN 실시간 스트리밍 서비스를 위한 계층별 차등기반의 데이터 전송 기법 연구)

  • Kim, Taehwan;Kwon, Taewook
    • Journal of KIISE
    • /
    • v.44 no.11
    • /
    • pp.1219-1230
    • /
    • 2017
  • Real-time streaming services over the Internet have increased with the explosive growth of the various mobile platforms, with a focus on smart phones, and the demand for them is growing. In addition, the bandwidth occupied by the streaming services over the Internet had already surpassed 50% in 2010. Because of the shortage of network bandwidth for multimedia services traffic, restrictions on quality and capacity will become more and more serious. CCN is a future Internet architecture that improves how existing host-based Internet architecture handles content-oriented structure, but it is designed for the transmission of general contents and is not suitable for transmitting real-time streaming contents. In this paper, we focus on the inefficient aspects of CCN and propose a hierarchical grade-based scheme for real-time service for a more efficient environment in real-time streaming services. Experiments have shown better performance in terms of bandwidth, network load, and reliability.

Energy-aware Routing Protocol using Multi-route Information in Wireless Ad-hoc Networks with Low Mobility (저이동성을 갖는 무선 애드혹 망에서 다중 경로 정보를 이용한 에너지 인지 라우팅 프로토콜)

  • Hong, Youn-Sik
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.4
    • /
    • pp.55-65
    • /
    • 2010
  • We present a method for increasing network lifetime without link failure due to lack of battery capacity of nodes in wireless ad-hoc networks with low mobility. In general, a node with larger remaining battery capacity represents the one with lesser traffic load. Thus, a modified AODV routing protocol is proposed to determine a possible route by considering a remaining battery capacity of a node. Besides, the total energy consumption of all nodes increase rapidly due to the huge amount of control packets which should be flooded into the network. To reduce such control packets efficiently, a source node can store information about alternative routes to the destination node into its routing table. When a link failure happens, the source node should retrieve the route first with the largest amount of the total remaining battery capacity from its table entries before initiating the route rediscovery process. To do so, the possibility of generating unnecessary AODV control packets should be reduced. The method proposed in this paper increases the network lifetime by 40% at most compared with the legacy AODV and MMBCR.

Dynamic Bandwidth Allocation Scheme with Considering Downstream Traffic in EPON (EPON에서 하향 데이터 전송을 고려한 동적 대역폭 할당 방안)

  • Kim Eun-Chul;Lee Kang-Won;Choi Young-Soo;Cho You-Ze
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.12
    • /
    • pp.37-44
    • /
    • 2005
  • This paper proposes a hybrid scheme for dynamic bandwidth allocation(DBA) in Ethernet passive optical network(EPON), which combines advantages of adaptive cycle and constant cycle-based schemes. The proposed scheme is based on IPACT scheme, but it operates as adaptive cycle or constant cycle mode according to the queue status of optical line terminal(OLT) for downstream transmission. Simulation results showed that the proposed scheme could achieve a similar throughput in downstream transmission to a constant cycle-based DBA scheme, while producing a similar delay performance to the IPACT scheme in upstream transmission.