• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11B
• /
• pp.999-1006
• /
• 2003

In the paper, we investigate the impact of handoff on the packet delivery in the Mobile IPv6 networks, where the smooth handoff is adopted. That is measured by an 'unstable time period (UTP)', a 'silence time period(STP)', and a 'handoff time period (HTP)' in the mobile node's perspective. Then, we propose a queuing model to get the exact value of the handoff transient time. The numerical results show that the queuing delay for the handoff packets and the involved link (or route) capacities affect the estimated UTP, STP, and HTP. On the other hand, the damage of application caused by handoff will increases when the handoff transient time becomes longer. We show that the priority scheduling method can achieve shorter STP and UP than the FIFO scheduling method that is generally used in best-effort IP network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.3
• /
• pp.523-541
• /
• 2011

In current IEEE 802.11 wireless LAN, every unicast transmission requires an ACK from the receiver for reliability, though it consumes energy and bandwidth. There have been studies to remove or reduce ACK overhead, especially for energy efficiency. However none of them are practically used now. This paper introduces a noble method of selective unacknowledged transmission, where skipping an ACK is dynamically decided frame by frame. Utilizing the fact that a multicast frame is transmitted without accompanying an ACK in 802.11, the basic unacknowledged transmission is achieved simply by transforming the destination address of a frame to a multicast address. Since removing ACK is inherently more efficient but less strict, its practical profit is dependent on traffic characteristics of a frame as well as network error conditions. To figure out the selective conditions, energy and performance implications of unacknowledged transmission have been explored. Extensive experiments show that energy consumption is almost always reduced, but performance may be dropped especially when TCP exchanges long data with a long distance node through a poor wireless link. An experiment with a well-known traffic model shows that selective unacknowledged transmission gives energy saving with comparable performance.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.4
• /
• pp.33-43
• /
• 2016

Public transportation card data, which is collected for purposes of the Integrated Public Transportation Fare System, provides neither transfer time nor transfer frequency occurring on the metropolitan city-rail (MCR). And because there are no transfer toll gates installed on the MCR, data on transfers between lines are estimated through means such as elicitations using survey questionnaire, or otherwise through macroscopic observations, which poses the risk of transfer time and frequencies being underestimated. For the accurate estimation thereof, an explanation of the transit path that arises between the Entry-and Exit-Gates must be provided. The purpose of this research is twofold : 1) to build a transit path model to reflect the current state of transfer movements on the basis of transportation card reader data, and 2) to deduce information on transfers occurring in the greater metropolis. To achieve these aims, the idea of Big Nodes is introduced in the model to align transportation card reader operation system characteristics with those of the MCR network. The link-label method is applied in the model as well to make certain that the MCR network runs in an effective manner. Administrative information obtained by the transportation card reader is used to derive transfer time and frequency both in the city's mid-zones, and in the Seoul-Gyeonggi-Incheon district's large-zones. Public transportation card data from a single specific day in year 2014 is employed in the building of the quantified transfer specific data. Extended usage thereof as providing comprehensive data of transfer resistance on the MCR is also examined.

• Journal of Korean Society of Transportation
• /
• v.26 no.4
• /
• pp.63-76
• /
• 2008

The goals of this study are to develop travel time functions based on intersection delay and to analyze the applicability of the functions to traffic assignment models. The study begins with the premise that the existing assignment models can not effectively account for intersection delay time. In pursuing the goals, this study gives particular attention to dividing the link travel time into link moving time and stopped time at node, making the models based on such variables as the travel speed, volume, geometry, and signal data of signalized intersections in Cheongju, and analyzing the applicability of these models to traffic assignment. There are several major findings. First, the study presents the revised percentage of lanes (considering type of intersection) instead of g/C for calculating intersection delay, which is analyzed to be significant in the paired t-test. Second, the assigned results of applying these models to the Cheongju network in EMME/2 are compared with the data observed from a test car survey in Cheongju. The analyses show that the BPR models do not consider the intersection delay, but the modified uniform delay model and modified Webster model are comparatively well fitted to the observed data. Finally, the assigned results of applying these models are statistically compared with the test car survey data in assigned volume, travel time, and average speed. The results show that the estimates from the divided travel time model are better fitted to observed data than those from the BPR model.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.202-213
• /
• 2007

A network is an important model widely used in natural and social science as well as engineering. To analyze these networks easily it is necessary that we should layout the features of networks visually. These Graph-Layout researches have been performed recently according to the development of the computer technology. Among them, the Scale-free Network that stands out in these days is widely used in analyzing and understanding the complicated situations in various fields. The Scale-free Network is featured in two points. The first, the number of link(Degree) shows the Power-function distribution. The second, the network has the hub that has multiple links. Consequently, it is important for us to represent the hub visually in Scale-free Network but the existing Graph-layout algorithms only represent clusters for the present. Therefor in this thesis we suggest Graph-layout algorithm that effectively presents the Scale-free network. The Hubity(hub+ity) repulsive force between hubs in suggested algorithm in this thesis is in inverse proportion to the distance, and if the degree of hubs increases in a times the Hubity repulsive force between hubs is ${\alpha}^{\gamma}$ times (${\gamma}$??is a connection line index). Also, if the algorithm has the counter that controls the force in proportion to the total node number and the total link number, The Hubity repulsive force is independent of the scale of a network. The proposed algorithm is compared with Graph-layout algorithm through an experiment. The experimental process is as follows: First of all, make out the hub that exists in the network or not. Check out the connection line index to recognize the existence of hub, and then if the value of connection line index is between 2 and 3, then conclude the Scale-free network that has a hub. And then use the suggested algorithm. In result, We validated that the proposed Graph-layout algorithm showed the Scale-free network more effectively than the existing cluster-centered algorithms[Noack, etc.].

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.27-34
• /
• 2012

Today the energy consumption of ICT networks is about 10% of the worldwide power consumption and will be remarkably increased in the near future. For that reason, the energy saving topics of ICT networks are actually studying in various research institutes. This paper studies the possible energy saving methods assuring the QoS of networks on network level. This paper assumed the energy consumption models according to energy profiles of node and link in IP networks. Especially it formulates the energy problem of a minimum energy consumption with various energy profile models and suggests the methods of energy-aware QoS routing under energy saving and network QoS sustaining condition. It shows the large difference of energy saving according to energy profiles and the possibility of energy saving by using the appropriate energy profile model in the simulation experiment. This paper shows that min_used_path(MP) heuristic of energy-aware QoS routing is the excellent method compared with other heuristic methods as view of reduction ratio of nodes and links and energy saving effect under network QoS sustaining condition. As a result, this paper confirms that the min_used_path(MP) heuristic of energy-aware QoS routing can get energy saving and sustaining of network QoS in IP networks.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.421-426
• /
• 2010

Due to the ease of deployment and the extended coverage, wireless mesh networks (WMNs) are gaining popularity and research focus. For example, the routing protocols that enhance the throughput on the WMNs and the link quality measurement schemes are among the popular research topics. However, most of these works assume that the locations of the mesh routers are predetermined. Since the operators in an Indoor mesh network can determine the locations of the mesh routers by themselves, it is essential to the WMN performance for the mesh routers to be initially placed by considering the performance issues. In this paper, we propose a mesh router placement scheme based on genetic algorithms by considering the characteristics of WMNs such as interference and topology. There have been many related works that solve similar problems such as base station placement in cellular networks and gateway node selection in WMNs. However, none of them actually considers the interference to the mesh clients from non-associated mesh routers in determining the locations of the mesh routers. By simulations, we show that the proposed scheme improves the performance by 30-40% compared to the random selection scheme.

• Journal of Intelligence and Information Systems
• /
• v.20 no.1
• /
• pp.49-65
• /
• 2014

Word of Mouth (WOM) is a behavior used by consumers to transfer or communicate their product or service experience to other consumers. Due to the popularity of social media such as Facebook, Twitter, blogs, and online communities, electronic WOM (e-WOM) has become important to the success of products or services. As a result, most enterprises pay close attention to e-WOM for their products or services. This is especially important for movies, as these are experiential products. This paper aims to identify the network factors of an online movie community that impact box office revenue using social network analysis. In addition to traditional WOM factors (volume and valence of WOM), network centrality measures of the online community are included as influential factors in box office revenue. Based on previous research results, we develop five hypotheses on the relationships between potential influential factors (WOM volume, WOM valence, degree centrality, betweenness centrality, closeness centrality) and box office revenue. The first hypothesis is that the accumulated volume of WOM in online product communities is positively related to the total revenue of movies. The second hypothesis is that the accumulated valence of WOM in online product communities is positively related to the total revenue of movies. The third hypothesis is that the average of degree centralities of reviewers in online product communities is positively related to the total revenue of movies. The fourth hypothesis is that the average of betweenness centralities of reviewers in online product communities is positively related to the total revenue of movies. The fifth hypothesis is that the average of betweenness centralities of reviewers in online product communities is positively related to the total revenue of movies. To verify our research model, we collect movie review data from the Internet Movie Database (IMDb), which is a representative online movie community, and movie revenue data from the Box-Office-Mojo website. The movies in this analysis include weekly top-10 movies from September 1, 2012, to September 1, 2013, with in total. We collect movie metadata such as screening periods and user ratings; and community data in IMDb including reviewer identification, review content, review times, responder identification, reply content, reply times, and reply relationships. For the same period, the revenue data from Box-Office-Mojo is collected on a weekly basis. Movie community networks are constructed based on reply relationships between reviewers. Using a social network analysis tool, NodeXL, we calculate the averages of three centralities including degree, betweenness, and closeness centrality for each movie. Correlation analysis of focal variables and the dependent variable (final revenue) shows that three centrality measures are highly correlated, prompting us to perform multiple regressions separately with each centrality measure. Consistent with previous research results, our regression analysis results show that the volume and valence of WOM are positively related to the final box office revenue of movies. Moreover, the averages of betweenness centralities from initial community networks impact the final movie revenues. However, both of the averages of degree centralities and closeness centralities do not influence final movie performance. Based on the regression results, three hypotheses, 1, 2, and 4, are accepted, and two hypotheses, 3 and 5, are rejected. This study tries to link the network structure of e-WOM on online product communities with the product's performance. Based on the analysis of a real online movie community, the results show that online community network structures can work as a predictor of movie performance. The results show that the betweenness centralities of the reviewer community are critical for the prediction of movie performance. However, degree centralities and closeness centralities do not influence movie performance. As future research topics, similar analyses are required for other product categories such as electronic goods and online content to generalize the study results.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.5
• /
• pp.100-111
• /
• 2019

The existing selected station analysis (SSA) method analyzes the link transfer mode data between origin and destination of individuals passing through stations from a microscopic standpoint. As such, existing SSA is insufficient as it uses integrated analysis using macroscopic data such as subway lines. This research builds a line chain OD based on path search of individual passenger's movement through the subway, and explores means to utilize the findings. First, a method is proposed that searches the traversed subway path from the linked passage modes that the passenger uses and applies the results to SSA line analysis. Compared to the existing SSA, this method provides for analysis of commonly conflicting features such as the line on which the station is passed, and the stations included on the line thanks to the presence of complete information of the individual passenger's traversed path. It also allows for integrated observation of the line chain OD that approaches a certain station. For enhanced understanding, Seoul Metro Line 9 is used as a case study to demonstrate the integrated formulation concept of line chain OD centered around a certain station as well as the macroscopic features of the traversed path that approaches stations included on the line.