• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.241-248
• /
• 2002

With the structure of tilde-area computing system which Is specified by a researching team in Vrije University, Netherlands, lots of researchers and developers have been progressing the studies of global location and interconnection services of distributed objects existing in global sites. Most of them halve focused on binding services of only non-duplicated computational objects existing wide-area computing sites without any consideration of duplication problems. But all of objects existing on the earth rave the duplicated characteristics according to how to categorize their own names or properties. These objects with the same property can define as duplicated computational objects. Up to now, the existing naming or trading mechanism has not supported the binding services of duplicated objects, because of deficiency of independent location service. For this reason, we suggest a new model that can not only manages locations of duplicated objects In wide-area computing environments, but also provide minimum binding time by considering both the optimal selection of one of duplicated objects and load balance among distributed systems. Our model is functionally divided into 2 parts, one part to obtain an unique object handle of duplicated objects with same property as a naming and trading service, and the other to search one or more contact addresses by a node manager using a liven object handle, as a location service For location transparency, these services are independently executing each other. Based on our model, we described structure of wide-area integrated tree and algorithms for searching and updating contact address of distributed object on this tree. finally, we showed a federation structure that can globally bind distributed objects located on different regions from an arbitrary client object.

• Journal of Broadcast Engineering
• /
• v.25 no.1
• /
• pp.94-104
• /
• 2020

Currently media consumption over fixed/mobile Internet is mostly conducted by adaptive media streaming technology such as DASH (Dynamic Adaptive Streaming over HTTP), which is an ISO/IEC MPEG (Moving Picture Experts Group) standard, or some other technologies similar to DASH. All these heavily depend on the HTTP caches that ISPs (Internet Service Providers) are obliged to provide sufficiently to make sure fast enough Web services. As a result, as the number of media streaming users increases, ISPs' burden for HTTP cache has been greatly increased rather than CDN (Content Delivery Network) providers' server burden. Hence ISPs charge traffic cost to CDN providers to compensate for the increased cost of HTTP caches. Recently in order to reduce the traffic cost of CDN providers, P2P (Peer-to-Peer)-assisted DASH system was proposed and a peer selection algorithm that maximally reduces CDN provides' traffic cost was investigated for this system. This algorithm, however, tends to concentrate the burden upon the selected peer. This paper proposes a new peer selection algorithm that distributes the burden among multiple peers while maintaining the proper reduction level of the CDN providers' cost. Through implementation of the new algorithm in a Web-based media streaming system using WebRTC (Web Real-Time Communication) standard APIs, it demonstrates its effectiveness with experimental results.

• Animal Bioscience
• /
• v.34 no.4
• /
• pp.525-532
• /
• 2021

Objective: Old World camels are a valuable genetic resource for many countries around the world due to their adaptation to the desert environment. At present, Old World camels have encountered the challenge of unprecedented loss of genetic resources. Through our research, we would reveal the population structure and genetic variation in Old World camel populations, which provides a theoretical basis for understanding the germplasm resources and origin and evolution of different Old World camel populations. Methods: In the present study, we assessed mtDNA control region sequences of 182 individuals from Old World camels to unravel genetic diversity, phylogeography, and demographic dynamics. Results: Thirty-two haplotypes confirmed by 54 polymorphic sites were identified in the 156 sequences, which included 129 domestic and 27 wild Bactrian camels. Meanwhile, 14 haplotypes were defined by 47 polymorphic sites from 26 sequences in the dromedaries. The wild Bactrian camel population showed the lowest haplotype and nucleotide diversity, while the dromedaries investigated had the highest. The phylogenetic analysis suggests that there are several shared haplotypes in different Bactrian camel populations, and that there has been genetic introgression between domestic Bactrian camels and dromedaries. In addition, positive values of Tajima's D and Fu's Fs test demonstrated a decrease in population size and/or balancing selection in the wild Bactrian camel population. In contrast, the negative values of Tajima's D and Fu's Fs test in East Asian Bactrian camel populations explained the demographic expansion and/or positive selection. Conclusion: In summary, we report novel information regarding the genetic diversity, population structure and demographic dynamics of Old World camels. The findings obtained from the present study reveal that abundant genetic diversity occurs in domestic Bactrian camel populations and dromedaries, while there are low levels of haplotype and nucleotide diversity in the wild Bactrian camel population.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.7
• /
• pp.283-292
• /
• 2013

In order to ensure high performance, all the servers in an existing server cluster are always On regardless of number of real-time requests. They ensure QoS, but waste server power if some of them are idle. To save energy consumed by servers, the server power mode control was developed by shutdowning a server when a server is not needed. There are two types of server power mode control depending on when a server is actually turned off if the server is selected to be off: static or dynamic. In a static mode, the server power is actually turned off after a fixed time delay from the time of the server selection. In a dynamic mode, server power is actually turned off if all the services served in the server are done. This corresponds to a turn off after a variable time delay. The static mdoe has disadvantages. It takes much time to find an optimal shutdown time manually through repeated experiments. In this paper, we propose a dynamic shutdown method to overcome the disadvantages of static shutdown. The proposed method allows to guarantee user QoS with good power-saving because it automatically approaches an optimal shutdown time. We performed experiments using 30 PCs cluster. Experimental results show that the proposed dynamic shutdown method is almost same as the best static shutdown in terms of power saving, but better than the best static shutdown in terms of QoS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.15-30
• /
• 2000

The important considerations in the design of fiber-optic networks are reliability and survivability preparing against a failure. The SDH(Synchronous Digital Hierarchy), the international standard of optical transmission, offers several network reconfiguration methods that enable network to be automatically restored from failure. One of the methods is the SHR(Self Healing Ring), which is a ring topology system. Most network providers have constructed their backbone networks with SHR architecture since it can provide survivability economically. The network architecture has eventually evolved into a multi-ring network comprised of interconnected rings. This paper addresses multi-ring network design problems is to minimize ring-construction cost. This problem can be formulated with MIP(mixed integer programming) model. However, it is difficult to solve the model within reasonable computing time on a large scale network because the model is NP-complete. Furthermore, in practice we should consider the problem of routing demands on rings to minimize total cost. This routing problem involves multiplex bundling at the intermediate nodes. A family of heuristic algorithms is presented for this problem. These algorithms include gateway selection and routing of inter-ring demands as well as load balancing on single rings. The developed heuristic algorithms are applied to some network provider's regional and long-distance transmission networks. We show an example of ring design and compare it with another ring topology design. Finally, we analysis the effect bundling.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.41-47
• /
• 2009

Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless sensor networks. However, the backbone nodes will need extra functionality and therefore consume more energy compared to the other nodes. The power consumption imbalance among sensor nodes may cause a network partition and failures where the transmission from some sensors to the sink node could be blocked. Hence optimal construction of the backbone is one of the pivotal problems in sensor network applications and can drastically affect the network's communication energy dissipation. In this paper a distributed algorithm is proposed to generate backbone trees through robust multi-hop clusters in wireless sensor networks. The main objective is to form a properly designed backbone through multi-hop clusters by considering energy level and degree of each node. Our improved cluster head selection method ensures that energy is consumed evenly among the nodes in the network, thereby increasing the network lifetime. Comprehensive computer simulations have indicated that the newly proposed scheme gives approximately 10.36% and 24.05% improvements in the performances related to the residual energy level and the degree of the cluster heads respectively and also prolongs the network lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.4
• /
• pp.768-779
• /
• 2017

Recently, the great number of mobile devices causes excessive data/control traffic problems in the centralized LTE/EPC network and such dramatically increased traffic is emerging as a critical issue. In the Centralized Mobility Management (CMM) based LTE/EPC network, the Packet Data Network Gateway (P-GW) plays the centralized mobility anchor role and it accommodates most of data traffic. To solve this problem, the IETF has proposed the Distributed Mobility Management (DMM) scheme, but it has only focused on the data traffic load balancing and could not solve the control traffic overload problem. In this paper, therefore, we propose a new SDN based hybrid CMM/DMM Mobility Management (C-DMM) architecture based on Packet Network Edge Gateway (P-EGW), and introduce a selection scheme between CMM and DMM according to a device's mobility and the number of PDN connections. In order to prove the efficiency of the proposed architecture and scheme, we compare the data traffic processing load and the control traffic processing load over each scheme by emulating them in the ONOS controller and the Mininet environment.