• Title/Summary/Keyword: Subscriber Networks

Search Result 127, Processing Time 0.027 seconds

Provision of a Novel Unlicensed Access Relay Station in IEEE 802.16-based Broadband Wireless Access Networks (IEEE 802.16 기반의 무선 액세스 망에서 Unlicensed 대역 액세스 릴레이에 대한 설계)

  • Choi, W.;Shon, T.S.;Choi, H.H.;Lee, Y.
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.169-177
    • /
    • 2007
  • Existing wireless access (mobile) routers are based commonly on the network address and port translation (NAPT) technique which permits simultaneously sharing a subscriber's connection to the network with multiple users. However, the NAPT architecturally makes the users invisible on the network side, thus becoming a user-oriented connection technique. In this paper, we propose a novel service provider-oriented unlicensed nomadic access relay station (WiNNERS) for helping wireless broadband network service providers to make their business more lucrative by accommdating unlicensed band users as subscribers into their network. The WiNNERS offers service providers the capability to directly manage each of the unlicensed band users at the network side. This direct management allows the service providers to flexibly and simply handle QoS, access control, and billing for each user. In order to distinguish each of the unlicensed band users the WiNNERS constructs a virtual tunnel from each user's terminal to the network access router using connection identifiers which is defined for service flow management within the WiBro system, Consequently, our proposed service provider-oriented relay station can be included into the WiBro network system with minimum modifications.

R-Tree Construction for The Content Based Publish/Subscribe Service in Peer-to-peer Networks (피어투피어 네트워크에서의 컨텐츠 기반 publish/subscribe 서비스를 위한 R-tree구성)

  • Kim, Yong-Hyuck;Kim, Young-Han;Kang, Nam-Hi
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.11
    • /
    • pp.1-11
    • /
    • 2009
  • A content based pub/sub (Publish/subscribe) services at the peer-to-peer network has the requirements about how to distribute contents information of subscriber and to delivery the events efficiently. For satisfying the requirements, a DHT(Distributed Hash Table) based pub/sub overlay networking and tree type topology based network construction using filter technique have been proposed. The DHT based technique is suitable for topic based pub/sub service but it's not good contents based service that has the variable requirements. And also filter based tree topology networking is not efficient at the environment where the user requirements are distributed. In this paper we propose the R-Tree algorithm based pub/sub overlay network construction method. The proposed scheme provides cost effective event delivery method by mapping user requirement to multi-dimension and hierarchical grouping of the requirements. It is verified by simulation at the variable environment of user requirements and events.

Effective Index and Backup Techniques for HLR System in Mobile Networks (이동통신 HLR 시스템에서의 효과적인 색인 및 백업 기법)

  • 김장환;이충세
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.9 no.1
    • /
    • pp.33-46
    • /
    • 2003
  • A Home Location Register(HLR) database system manages each subscriber's location information, which continuously changes in a cellular network. For this purpose, the HLR database system provides table management, index management, and backup management facilities. In this thesis, we propose using a two-level index method for the mobile directory number(MDN) as a suitable method and a chained bucket hashing method for the electronic serial number(ESN). Both the MDN and the ESN are used as keys in the HLR database system. We also propose an efficient backup method that takes into account the characteristics of HLR database transactions. The retrieval speed and the memory usage of the two-level index method are better than those of the R-tree index method. The insertion and deletion overhead of the chained bucket hashing method is less than that of the modified linear hashing method. In the proposed backup method, we use two kinds of dirty flags in order to solve the performance degradation problem caused by frequent registration-location operations. For a million subscribers, proposed techniques support reduction of memory size(more than 62%), directory operations (2500,000 times), and backup operations(more than 80%) compared with current techniques.

Improvement of Received Optical Power Sensitivity in Asymmetric 2.5Gbps/1.2Gbps Passive Optical Network with Inverse Return to Zero(RZ) coded Downstream and NRZ upstream re-modulation (역 RZ 부호로 코딩된 하향신호의 재변조를 이용한 비대칭 2.5Gbps/622Mbps 수동 광가입자 망에서의 수신 감도의 개선)

  • Park, Sang-Jo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.3
    • /
    • pp.65-72
    • /
    • 2010
  • We propose the asymmetric 2.5Gbps/622Mbps PON(Passive Optical Network) in order to reduce the bandwith of filter at receiver with inverse RZ(Return to Zero) code coded downstream and NRZ(Non Return to Zero) upstream re-modulation. I theoretically analyze BER(Bit Error Rate) performance and the power sensitivity with the optimal threshold level by performing simulation with MATLAB according to the types of downstream data. The results have shown that the optimal threshold level at the optical receiver could be saturated at 0.33 as the optical received power increase more than -26dBm to keep $10^{-12}$ of BER to a minimum. Also the power sensitivity is more improved by about 3dB by fixing the threshold level at 0.33 than the conventional receiver. The proposed system can be a useful technology for optical access networks with asymmetric upstream and downstream data rates because the optical receiver can be used without controlling threshold levels and that does not require a light source in optical network unit (ONU) and its control circuits in the optical line termination (OLT).

A Study on Strategic Groups of Program Providers(PP) and the Performance in Korea (국내 방송채널사용사업자(PP)의 전략집단과 성과에 관한 연구)

  • Ryo, Hyon-Chol;Kim, Jai-Beom;Lee, Sahang-Shik
    • Korean journal of communication and information
    • /
    • v.46
    • /
    • pp.387-419
    • /
    • 2009
  • The concept of strategic group is defined as an aggregate of corporations utilizing similar strategies with similar resources. It becomes a kinds of contact point in the middle of corporation and industry between the industrial organization theory and the strategic management theory. This study tried to apply the strategic group model, which has been a main theory in the management studies, to program providing industry in Korea. This study shed lights upon research problems such as number of strategic groups, differences of strategic variables among the groups, finally differential performances according to strategic groups. 40 commercial broadcasting companies were analyzed to find answers. 9 strategic groups were drawn as a result of cluster analysis. Major variables which contribute to making groups were operating efficiency(4.05), pricing(3.83), size(number of system operator, 3.56), reliance on license revenue(2.58), horizontal integration(number of sister networks, 2.16) in order. An analysis of variance between performance variables has shown statistical significance regarding total net revenue per subscriber, however, insignificances statistically in regards to ratio of operating profit to net sales, cash Abstracts 687 flow ratio. Some studies in the past insisted that history variable played an important role to classifying strategic groups. However, this study found that the history didn't exert significant influence on either the group classification itself or performance.

  • PDF

Mutual Authentication Method between Wireless Mesh Enabled MSAPs in the Next-generation TICN (차세대 전술정보통신체계에서의 무선 메쉬 MSAP 노드 간 상호 인증 기법)

  • Son, Yu-Jin;Bae, Byoung-Gu;Shon, Tae-Shik;Ko, Young-Bae;Lim, Kwang-Jae;Yun, Mi-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.5B
    • /
    • pp.385-394
    • /
    • 2012
  • The tactical mobile communication network, which comprises a part of the next-generation Tactical Information and Communication Network (TICN), provides means of communication and control for Tactical Multi-Functional Terminals (TMFT) belonging to a Mobile Subscriber Access Point (MSAP). The next-generation of MSAP is capable of constructing a backbone network via LCTR and HCTR directional antennas. At the same time, WMN modules are used to create and manage a wireless mesh backbone. When directional antennas are used in mobile environments, seamless services cannot be efficiently supported as the movement of the node prevents the angle of the antenna to constantly match. Therefore, data communication through the wireless mesh networks is required to provide direct communication between mobile MSAPs. Accordingly, mutual authentication and data encryption mechanisms are required to provide reliable data transmission in this environment. To provide efficient mutual authentication between MSAP devices, the process of verifying a certificate of the other MSAP device through its own authentication server is required. This paper proposes mutual authentication mechanisms where the MSAP requiring authentication and the MSAP that permits it initiates low-cost and efficient authentication in a distributed way. More specifically, we propose a method of applying EAP-ELS (Extensible Authentication Protocol-Transport Layer Security) in the next-generation TICN.

Clustering Method based on Genre Interest for Cold-Start Problem in Movie Recommendation (영화 추천 시스템의 초기 사용자 문제를 위한 장르 선호 기반의 클러스터링 기법)

  • You, Tithrottanak;Rosli, Ahmad Nurzid;Ha, Inay;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.1
    • /
    • pp.57-77
    • /
    • 2013
  • Social media has become one of the most popular media in web and mobile application. In 2011, social networks and blogs are still the top destination of online users, according to a study from Nielsen Company. In their studies, nearly 4 in 5active users visit social network and blog. Social Networks and Blogs sites rule Americans' Internet time, accounting to 23 percent of time spent online. Facebook is the main social network that the U.S internet users spend time more than the other social network services such as Yahoo, Google, AOL Media Network, Twitter, Linked In and so on. In recent trend, most of the companies promote their products in the Facebook by creating the "Facebook Page" that refers to specific product. The "Like" option allows user to subscribed and received updates their interested on from the page. The film makers which produce a lot of films around the world also take part to market and promote their films by exploiting the advantages of using the "Facebook Page". In addition, a great number of streaming service providers allows users to subscribe their service to watch and enjoy movies and TV program. They can instantly watch movies and TV program over the internet to PCs, Macs and TVs. Netflix alone as the world's leading subscription service have more than 30 million streaming members in the United States, Latin America, the United Kingdom and the Nordics. As the matter of facts, a million of movies and TV program with different of genres are offered to the subscriber. In contrast, users need spend a lot time to find the right movies which are related to their interest genre. Recent years there are many researchers who have been propose a method to improve prediction the rating or preference that would give the most related items such as books, music or movies to the garget user or the group of users that have the same interest in the particular items. One of the most popular methods to build recommendation system is traditional Collaborative Filtering (CF). The method compute the similarity of the target user and other users, which then are cluster in the same interest on items according which items that users have been rated. The method then predicts other items from the same group of users to recommend to a group of users. Moreover, There are many items that need to study for suggesting to users such as books, music, movies, news, videos and so on. However, in this paper we only focus on movie as item to recommend to users. In addition, there are many challenges for CF task. Firstly, the "sparsity problem"; it occurs when user information preference is not enough. The recommendation accuracies result is lower compared to the neighbor who composed with a large amount of ratings. The second problem is "cold-start problem"; it occurs whenever new users or items are added into the system, which each has norating or a few rating. For instance, no personalized predictions can be made for a new user without any ratings on the record. In this research we propose a clustering method according to the users' genre interest extracted from social network service (SNS) and user's movies rating information system to solve the "cold-start problem." Our proposed method will clusters the target user together with the other users by combining the user genre interest and the rating information. It is important to realize a huge amount of interesting and useful user's information from Facebook Graph, we can extract information from the "Facebook Page" which "Like" by them. Moreover, we use the Internet Movie Database(IMDb) as the main dataset. The IMDbis online databases that consist of a large amount of information related to movies, TV programs and including actors. This dataset not only used to provide movie information in our Movie Rating Systems, but also as resources to provide movie genre information which extracted from the "Facebook Page". Formerly, the user must login with their Facebook account to login to the Movie Rating System, at the same time our system will collect the genre interest from the "Facebook Page". We conduct many experiments with other methods to see how our method performs and we also compare to the other methods. First, we compared our proposed method in the case of the normal recommendation to see how our system improves the recommendation result. Then we experiment method in case of cold-start problem. Our experiment show that our method is outperform than the other methods. In these two cases of our experimentation, we see that our proposed method produces better result in case both cases.