38023286
Distributed mobile tracking: a novel location management scheme for routing improvement in cellular IP networks
In this paper, a novel location management scheme, distributed mobile tracking (DMT), is proposed for routing improvement in Cellular IP networks. A mobile-tracking tree (MT-Tree) for each active mobile host is established by tracking the movement of the host in DMT. Two mechanisms, pruning process and growing process, are also proposed to improve DMT. Packet transmissions can follow the route on the MT-Tree instead of using the gateway route. Simulation results have shown that DMT has the advantages of shorter routing paths as well as load balance for wired links over the original gateway-based location management scheme. Moreover, three multicast protocols for Cellular IP are proposed: GBMP, GBMP-RO, and MTMP. In GBMP, the gateway is responsible for group management as well as multicast transmission. Multicast packets received by the base station are first forwarded to the gateway. The gateway then forwards the packets to each member of the group by multiple unicasting. GBMP-RO, a modified version of GBMP, adopts the idea of source routing for multicast transmissions. MTMP is mainly based on the MT-Tree routing scheme. However, if not all group members can be covered by MT-Tree routing, MTMP will instead adopt GBMP-RO for multicast transmission. Simulation results demonstrate that MTMP has the advantages over GBMP and GBMP-RO in terms of load balance in the Cellular IP network.
6374629
A Multimedia Synchronization Model and Its Implementation in Transport Protocols
An implementation of a synchronization mechanism in transport protocol to support multimedia applications over a packet or cell switched network is proposed. In designing such a mechanism for practical use, ease of implementation and capability of handling random delay of packets are two key issues for success. Since the random delay of packet or cell switched networks makes synchronization among media more complicated after the transmission across the network, a model which considers the random transmission delay is hence required to specify the temporal relationship among media. Therefore, a real-time synchronization model is presented to satisfy this requirement in the paper. Based on the proposed synchronization model, a transport protocol, namely the multimedia synchronization transport protocol (MSTP), is designed and implemented. We have implemented a prototype system using the MSTP protocol and built a simulation system for the wide area network (WAN) environment in order to evaluate the performance of the MSTP protocol.
36972963
A real-time synchronization model and transport protocol for multimedia applications
In considering a transport layer protocol for multimedia applications in packet networks, real-time and synchronization characteristics of multimedia applications have to be considered. Synchronization means that the intermedium temporal relationship for an application has to be satisfied, after the transmission across the network. Since the random delay of packet networks makes synchronization among media more complicated, a model is required to specify the temporal relationship among media across the network which can be easily implemented in a transport protocol. In the paper, a real-time synchronization model (RTSM), is presented for synchronization, and a new protocol, namely MSTP (multimedia synchronization transport protocol), is proposed based on RTSM.<<ETX>>
6411174
SMILAuthor: An Authoring System for SMIL-Based Multimedia Presentations
In this paper, an authoring tool named SMILAuthor for SMIL-based multimedia presentations is proposed. SMILAuthor adopts standard SMIL language as the format of the presentation to generate reusable and easily accessible presentations. Moreover, powerful editing functions such as cut, copy, and paste are supported by the system in a timeline-based manner. In order to support timeline-based editing functions, the playback duration of each object in the input SMIL script is first calculated by the parsing process of the system. The parsing process extracts and converts the temporal relationship of the input script to Real-Time Synchronization Model (RTSM), and the playback duration of each object in the script is then computed by traversing the RTSM. Editing results are converted to the SMIL format and saved in the output file. Language structure of SMIL is hidden by the system and the temporal information is visualized in the timeline manner to provide users an easy way to understand and control the timing of each object. Implementation of the system provides a friendly WYSIWYG environment and multiple views/windows are provided by the system to help authors compose multimedia presentations efficiently.
13803760
A bandwidth-based polling scheme for QoS support in Bluetooth
A flexible bandwidth management scheme namely Bandwidth-based Polling (BBP) for Bluetooth is proposed. A framing structure of time is defined in BBP, and the master allocates proper number of slots for each active slave in a frame. BBP allows the master to poll a slave more than once to achieve high flexibility for bandwidth allocation. The calculation of the polling time as well as the payload type for a slave is according to the bandwidth requirement of the slave and the limit of the frame size controlled by the master. Extension of BBP for supporting slaves with the SCO link and slaves without bandwidth requirement (best-effort slaves) is also proposed. Simulation results have shown the efficiency and fairness of BBP in bandwidth management. The flexibility of bandwidth allocation depends on the maximum polling time preset by BBP. A larger maximum polling time makes the higher flexibility of bandwidth allocation at the expense of a longer latency before reaching the equilibrium state. Analysis of the impact of the maximum polling time on bandwidth allocation is also presented in the paper.
6557904
A Novel Congestion Control Mechanism for Multicast Real-Time Connections
Time framing strategies such as Stop-and-Go (SG Golestani S.J., A framing strategy for congestion management, IEEE JSAC, 9(7), 1991, pp.1064-1077; Golestani S.J., Congestion-free communication in high-speed packet networks, IEEE Trans. on Communications, 39(12), 1991, pp.1802-1812; Golestani S.J., A stop-and-go queueing framework for congestion management, ACM SIGCOMM, 1992, pp.8-18] and Continuous Framing (CF) [Jau-Hsiung Huang, Biau-Jwo Tsaur, Continuous framing mechanism for congestion control in broadband networks, Computer Communications, 18(10), 1995, pp.718-724] are designed to support the end-to-end delay bound and jitter bound for unicast connections. Considering the features of real-time multicast connections, a new time framing mechanism named Multicast Continuous Framing (MCF) is proposed in this article. S&G and CF allow only one time frame length per connection, but MCF allows changing of the time frame length of a connection at intermediate nodes so that the statistical multiplexing gain within a connection is increased, i.e., the bandwidth requirement can be reduced. We also present the multicast connection setup scheme for MCF in the article. Simulation results show that MCF has a much better performance than that of CF, and the tighter jitter bound a connection requests, the more performance improvement MCF can obtain.
14257802
Terrorism and Crime Related Weblog Social Network: Link, Content Analysis and Information Visualization
A Weblog is a Web site where entries are made in diary style, maintained by its sole author - a blogger, and displayed in a reverse chronological order. Due to the freedom and convenience of publishing in Weblogs, this form of media provides an ideal environment as a propaganda platform for terrorist groups to promote their ideologies and as an operation platform for organizing crimes. In this work, we present a framework to analyze and visualize Weblog social network embedded beneath relevant Weblogs gathered through topic-specific exploration. Link analysis uses the relationships between bloggers to construct the Weblog social network. Content analysis associates similar blog messages to unveil implicit relationships found in the semantics to further improve the Weblog social network analysis. Users can use different interactive information visualization techniques to explore various aspects of the underlying social network at different levels of abstraction. With the capability of analyzing and visualizing Weblog social networks in terrorist and crime related matters, intelligence agencies and law enforcement will be able to have an additional tools and means to ensure the national security.
8419272
An Enhanced Parallel Loop Self-Scheduling Scheme for Cluster Environments
Approaches for dealing with scheduling and load-balancing in PC-based cluster systems are famous and well known. In such environments, Self-Scheduling Schemes are suitable for parallel loops with independent iterations. However, while schemes such as FSS, GSS, and TSS fit most computer systems, they cannot provide good load-balancing. Chao-Tung Yang and Shun-Chi Chang proposed a parallel loop scheduling scheme for heterogeneous PC cluster systems in Yang and Chang [13]. Though the proposed scheme allows users to choose parameters before execution initialization, weaknesses in it motivated us to develop further improvements. For instance, using fixed and monotonous parameters can easily lead to invalid scheduling due to use of previously input information. Thus, in this paper we propose a new scheme that fits most widely available computer systems and allows the scheduling parameter to be adjusted dynamically in order to provide higher overall performance.
6108459
Fast multiple object tracking via a hierarchical particle filter
A very efficient and robust visual object tracking algorithm based on the particle filter is presented. The method characterizes the tracked objects using color and edge orientation histogram features. While the use of more features and samples can improve the robustness, the computational load required by the particle filter increases. To accelerate the algorithm while retaining robustness we adopt several enhancements in the algorithm. The first is the use of integral images for efficiently computing the color features and edge orientation histograms, which allows a large amount of particles and a better description of the targets. Next, the observation likelihood based on multiple features is computed in a coarse-to-fine manner, which allows the computation to quickly focus on the more promising regions. Quasi-random sampling of the particles allows the filter to achieve a higher convergence rate. The resulting tracking algorithm maintains multiple hypotheses and offers robustness against clutter or short period occlusions. Experimental results demonstrate the efficiency and effectiveness of the algorithm for single and multiple object tracking.
16872458
Decision tree construction for data mining on grid computing environments
In this paper, the authors presented the grid-based decision tree architecture, with the intention of applying it to both parallel and sequential algorithms. Also, it is shown that, based on the scope and model of data mining applied in the grid environment as well as user equivalent perspective, grid roles can be categorized into three types. It was aimed, through these definitions, to help software developers define clear system processes and differentiate the application scope for software applications. To fulfill the architecture, an existing parallel decision tree algorithm was first applied (the SPRINT algorithm) to the grid environment. The performance and differences in many other areas are compared using datasets of different sizes. The experimental results will be used for future reference and further development.
16530408
Searching behavior in peer-to-peer communities
The focus of this paper is the searching behavior in peer-to-peer (P2P) communities and in that context, will discuss potential for enhancement of the P2P protocol using searching behavior. Due to excessive network traffic, network scalability is a major P2P problem. The purpose of this paper is to study searching behavior by using log files and subsequently, will propose solutions to reduce the amount of redundant searching activities. In the current research, log data containing over 5 million query messages was collected over seven consecutive days using a Gnutella-based P2P program. The results of this study will be instrumental in providing ways to reduce existing problems with P2P network traffic.