ieee sw1

pFusion: A P2P Architecture for Internet-Scale ContentBased Search and Retrieval Demetrios Zeinalipour-Yazti, Member, IEEE, Vana Kalogeraki, Member, IEEE, and Dimitrios Gunopulos, Member, IEEE Abstract The emerging Peer-to-Peer (P2P) model has become a very powerful and attractive paradigm for developing Internet-scale systems for sharing resources, including files and documents. The distributed nature of these systems, where nodes are typically located across different networks and domains, inherently hinders the efficient retrieval of information. In this paper, we consider the effects of topologically aware overlay construction techniques on efficient P2P keyword search algorithms. We present the Peer Fusion (pFusion) architecture that aims to efficiently integrate heterogeneous information that is geographically scattered on peers of different networks. Our approach builds on work in unstructured P2P systems and uses only local knowledge. Our empirical results, using the pFusion middleware architectu re and data sets from Akamai’s Internet mapping infrastructure (AKAMAI), the Active Measurement Project (NLANR), and the Text REtrieval Conference (TREC) show that the architecture we propose is both efficient and practical. Index Terms—Information retrieval, peer-to-peer, overlay construction algorithms. A/I Net: a network that integrates ATM and IP Chin-Tau Lea Chi-Ying Tsui Bo Li Kwan, C.-Y. Chan, S.K.-M. Chan, A.H.-W. Hong Kong Univ. of Sci. & Technol.; This paper appears in: Network, IEEE Volume: 13, Issue: 1 On page(s): 48-55 ISSN: 0890-8044 References Cited: 30 CODEN: IENEET INSPEC Accession Number: 6213014 Digital Object Identifier: 10.1109/65.750449 Posted online: 2002-08-06 22:26:00.0 Abstract Future networks need both connectionless and connection-oriented services. IP and ATM are major examples of the two types. Connectionless IP is more efficient for browsing, e-mail, and other non-real-time services; but for services demanding quality and real-time delivery, connectionoriented ATM is a much better candidate. Given the popularity of the Internet and the established status of ATM as the broadband transport standard, it is unlikely that one can replace the other. Therefore, the challenge we face lies in finding an efficient wa y to integrate the two. This article describes a research project reflecting this trend. The project aims at efficient integration of the two to eliminate the deficiencies of a standalone ATM or IP network Distributed Cache Updating for the Dynamic Source Routing Protocol Xin Yu Department of Computer Science New York University xinyu@cs.nyu.edu Abstract On-demand routing protocols use route caches to make routing decisions. Due to mobility, cached routes easily become stale. To address the cache stale ness issue, prior work in DSR used heuristics with ad hoc parameters to predict the lifetime of a link or a route. However, heuristics cannot accurately estimate timeouts because topology changes are unpredictable. In this paper, we propose proactively disseminating the broken link information to the nodes that have that link in their caches. We define a new cache structure called a cache table and present a distributed cache update algorithm. Each node maintains in its cache table the information necessa ry for cache updates. When a link failure is detected, the algorithm notifies all reachable nodes that have cached the link in a distributed manner. The algorithm does not use any ad hoc parameters, thus making route caches fully adaptive to topology changes. We show that the algorithm outperforms DSR with path caches and with Link MaxLife, an adaptive timeout mechanism for link caches. We conclude that proactive cache updating is key to the adaptation of on-demand routing protocols to mobility. Distributed Data Mining in Credit Card Fraud Detection CREDIT CARD TRANSACTIONS Continue to grow in number, taking an ever -larger share of the US payment system and leading to a higher rate of stolen account numbers and subsequent losses by banks. Improved fraud detection thus has become essential to maintain the viability of the US payment system. Banks have used early fraud warning systems for some years. Large-scale data-mining techniques can improve on the state of the art in commercial practice. Scalable techniques to analyze massive amounts of transaction data that efficiently compute fraud detectors in a timely manner is an important problem, especially for e commerce. Besides scalability and efficiency, the fraud-detection task exhibits technical problems that include skewed distributions of training data and nonuniform cost per error, both of which have not been widely studied in the knowledge-discovery and datamining community. In this article, we survey and evaluate a number of techniques that address these three main issues concurrently. Our proposed methods of combining multiple learned fraud detectors under a ―cost model‖ are general and demonstrably useful; our empirical results demonstrate that we can significantly reduce loss due to fraud through distr ibuted data mining of fraud models. Our approach In today’s increasingly electronic society and with the rapid advances of electronic commerce on the Internet, the use of credit cards for purchases has become convenient and necessary. Credit card transactions have become the de facto standard for Internet and Web based e-commerce. The US government estimates that credit cards accounted for approximately US $13 billion in Internet sales during 1998. This figure is expected to grow rapidly each year. However, the growing number of credit card transactions provides more opportunity for thieves to steal credit card numbers and subsequently commit fraud. When banks lose money because of credit card fraud, cardholders pay for all of that loss through higher interest rates, higher fees, and reduced benefits. Cardholders interest to reduce illegitimate use of credit cards by early fraud detection. For many years, the credit card industry has studied computing models for automated detection systems; recently, these models have been the subject of academic research, especially with respect to e-commerce. The credit card fraud-detection domain presents a number of challenging issues for data mining: • There are millions of credit card transactions processed each day. Mi ning such massive amounts of data requires highly efficient techniques that scale. • The data are highly skewed—many more transactions are legitimate than fraudulent. • Typical accuracy-based mining techniques can generate highly accurate fraud THIS SCALABLE BLACK-BOX APPROACH FOR BUILDING EFFICIENT FRAUD DETECTORS CAN SIGNIFICANTLY REDUCE LOSS DUE TO ILLEGITIMATE BEHAVIOR. IN MANY CASES, THE AUTHORS’ METHODS OUTPERFORM A WELLKNOWN, STATE OF THE ART COMMERCIAL FRAUD-DETECTION SYSTEM. A Distributed Database Architecture for Global Roaming in Next-Generation Mobile Networks Zuji Mao, Member, IEEE, and Christos Douligeris, Senior Member, IEEE Abstract The next-generation mobile network will support terminal mobility, personal mobility, and service provider portability, making global roaming seamless. A location-independent personal telecommunication number (PTN) scheme is conducive to implementing such a global mobile system. However, the nongeographic PTNs coupled with the anticipated large number of mobile u sers in future mobile networks may introduce very large centralized databases. This necessitates research into the design and performance of high -throughput database technologies used in mobile systems to ensure that future systems will be able to carry efficiently the anticipated loads. This paper proposes a scalable, robust, efficient location database architecture based on the location- independent PTNs. The proposed multitree database architecture consists of a number of database subsystems, each of which is a three-level tree structure and is connected to the others only through its root. By exploiting the localized nature of calling and mobility patterns, the proposed architecture effectively reduces the database loads as well as the signaling traff ic incurred by the location registration and call delivery procedures. In addition, two memory-resident database indices, memory-resident direct file and T-tree, are proposed for the location databases to further improve their throughput. Analysis model and numerical results are presented to evaluate the efficiency of the proposed database architecture. Results have revealed that the proposed database architecture for location management can effectively support the anticipated high user density in the futu re mobile networks. Index Terms—Database architecture, location management, location tracking, mobile networks A Software Defect Report and Tracking System in an Intranet Abstract This paper describes a case study where SofTrack - a Software Defect Report and Tracking System – was implemented using internet technology in a geographically distributed organization. Four medium to large size information systems with different levels of maturity are being analyzed within the scope of this project. They belong to the Portuguese Navy’s Information Systems Infrastructure and were developed using typical legacy systems technology: COBOL with embedded SQL for queries in a Relational Database environment. This pilot project of Empirical Software Engineering has allowed the development of techniques to help software managers to better understand, control and ultimately improve the software process. Among them are the introduction of automatic system documentation, module’s complexity assessment and effort estimation for maintenance activities in the organization. Secure Electronic Data Interchange over the Internet The Electronic Data Interchange over the Internet (EDI-INT) standards provide a secure means of transporting EDI and XML business documents over the Internet. EDI-INT includes different implementation protocols that work over the Internet’s three major transports — SMTP,HTTP, and FTP. Each uses Secure Multipurpose Internet Mail Extensions (S/MIME), digital signatures, encryption, and message receipt validation to ensure the necessary security for business-to business communications. Numerous retailers, manufacturers, and other companies within business supply chains are leveraging Applicability Statement #2 (AS2) and other standards developed by the IETF’s Electronic Data Interchange over the Internet (EDI-INT) working group (www. imc.org/ietf-ediint/). Founded in 1996 to develop a secure transport service for EDI business documents, the EDI-INT WG later expanded its focus to include XML and virtually any other electronic business-documentation format. It began by providing the digital security and message-receipt validation for Internet communication for MIME (Multipurpose Internet Mail Extensions) packaging of EDI.1 EDI-INT has since become the leading means of business-to-business (B2B) transport for retail and other industries. Although invisible to the consumer, standards for secure electronic communication of purchase orders, invoices, and other business transactions are helping enterprises drive down costs and offer flexibility in B2B relationships. EDI-INT provides digital security of email, Web, and FTP payloads through authentication, content-integrity, confidentiality, and receipt validation. Building Intelligent Shopping Assistants Using Individual Consumer Models Chad Cumby, Andrew Fano, Rayid Ghani, Marko Krema Accenture Technology Labs 161 N. Clark St Chicago, IL, USA chad.m.cumby,andrew.e.fano,rayid.ghani,marko.krema@accenture.com ABSTRACT This paper describes an Intelligent Shopping Assistant designed for a shopping cart mounted tablet PC that enables individual interactions with customers. We use machine learning algorithms to predict a shopping list for the customer's current trip and present this list on the device. As they navigate through the store, personalized promotions are presented using consumer models derived from loyalty card data for each inidvidual. In order for shopping assistant devices to be e ective, we believe that they have to be powered by algorithms that are tuned for individual customers and can make accurate predictions about an individual's actions. We formally frame the shopping list prediction as a classication problem, describe the algorithms and methodology behind our system, and show that shopping list prediction can be done with high levels of accuracy, precision, and recall. Beyond the prediction of shopping lists we brie y introduce other aspects of the shopping assistant project, such as the use of consumer models to select appropriate promotional tactics, and the development of promotion planning simulation tools to enable retailers to plan personalized pro motions delivered through such a shopping assistant. Categories and Subject Descriptors: H.2.8 Database ManagementDatabase Applications[Data Mining] General Terms: Algorithms, Economics, Experimentation. Keywords: Retail applications, Machine learning, Classification ObjectRank: Authority-Based Keyword Search in Databases∗ Andrey Balmin IBM Almaden Research Center San Jose, CA 95120 abalmin@us.ibm.com Vagelis Hristidis School of Computer Science Florida International University Miami, FL 33199 vagelis@cs.fiu.edu Yannis Papakonstantinou Computer Science UC, San Diego La Jolla, CA 92093 yannis@cs.ucsd.edu Abstract The ObjectRank system applies authority-based ranking to keyword search in databases modeled as labeled graphs. Conceptually, authority originates at the nodes (objects) containing the keywords and flows to objects according to their semantic connections. Each node is ranked according to its authority with respect to the particular keywords. One can adjust the weight of global importance, the weight of each keyword of the query, the importance of a result actually containing the keywords versus being referenced by nodes containing them, and the volume of authority flow via each type of semantic connection. Novel performance challenges and opportunities are addressed. First, schemas impose constraints on the graph, which are exploited for performance purposes. Second, in order to address the issue of authority ranking with respect to the given keywords (as opposed to Google’s global PageRank) we precompute single keyword ObjectRanks and combine them during run time. We conducted user surveys and a set of performance experiments on multiple real and synthetic datasets, to assess the semantic meaningfulness and performance of ObjectRank. An Acknowledgment-based Approach for the Detection of Routing Misbehavior in MANETs Kejun Liu, Jing Deng, Pramod K. Varshney, and Kashyap Balakrishnan Abstract We study routing misbehavior in MANETs (Mobile Ad Hoc Networks) in this paper. In general, routing protocols for MANETs are designed based on the assumption that all participating nodes are fully cooperative. However, due to the open structure and scarcely available battery-based energy, node misbehaviors may exist. One such routing misbehavior is that some sel sh nodes will participate in the route discovery and maintenance processes but refuse to forward data packets. In this paper, we propose the 2ACK scheme that serves as an add-on technique for routing schemes to detect routing misbehavior and to mitigate their adverse effect. The main idea of the 2ACK scheme is to send two-hop acknowledgment packets in the opposite direction of the routing path. In order to reduce additional routing overhead, only a fraction of the received data packets are acknowledged in the 2ACK scheme. Analytical and simulation results are presented to evaluate the performance of the proposed scheme. Index Terms Mobile Ad hoc Networks (MANETs); Routing Misbehavior; Node Misbehavior; Network Security; Dynamic Source Routing (DSR) A Self-Repairing Tree Topology Enabling Content-Based Routing in Mobile Ad Hoc Networks Luca Mottola, Gianpaolo Cugola, and Gian Pietro Picco Abstract—Content-based routing (CBR) provides a powerful and flexible foundation for distributed applications. Its communication model, based on implicit addressing, fosters decoupling among the communicating components, therefore meeting the needs of many dynamic scenarios, including mobile ad hoc networks (MANETs). Unfortunately, the characteristics of the CBR model are only rarely met by available systems, which typically assume that application-level routers are organized in a tree-shaped network with a fixed topology. In this paper we present COMAN, a protocol to organize the nodes of a MANET in a tree-shaped network able to i) selfrepair to tolerate the frequent topological reconfigurations typical of MANETs; ii) achieve this goal through repair strategies that minimize the changes that may impact the CBR layer exploiting the tree. COMAN is implemented and publicly available. Here we report about its performance in simulated scenarios as well as in real-world experiments. The results confirm that its characteristics enable reliable and efficient CBR on MANETs. Index Terms—Content-based routing, publish-subscribe, query-advertise, mobile ad hoc network Continuous k-Means Monitoring over Moving Objects Zhenjie Zhang, Yin Yang, Anthony K.H. Tung, and Dimitris Papadias Abstract— Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. Since this problem is NP-hard, several approximate algorithms have been proposed and used in practice. In this paper, we study continuous k-means computation at a server that monitors a set of moving objects. Re-evaluating k-means every time there is an object update imposes a heavy burden on the server (for computing the centers from scratch) and the clients (for continuously sending location updates). We overcome these problems with a novel approach that significantly reduces the computation and communication costs, while guaranteeing that the quality of the solution, with respect to the re -evaluation approach, is bounded by a user-defined tolerance. The proposed method assigns each moving object a threshold (i.e., range) such that the object sends a location update only when it crosses the range boundary. First, we develop an efficient technique for maintaining the k-means. Then, we present mathematical formulae and algorithms for deriving the individual thresholds. Finally, we justify our performance claims with extensive experiments Bandwidth Estimation for IEEE 802.11-Based Ad Hoc Networks Cheikh Sarr, Claude Chaudet, Guillaume Chelius, and Isabelle Gue´ rin Lassous Abstract—Since 2005, IEEE 802.11-based networks have been able to provide a certain level of quality of service (QoS) by the means of service differentiation, due to the IEEE 802.11e amendment. However, no mechanism or method has been standardized to accurately evaluate the amount of resources remaining on a given channel. Such an evaluation would, however, be a good asset for bandwidth-constrained applications. In multihop ad hoc networks, such evaluation becomes even more difficult. Consequently, despite the various contributions around this research topic, the estimation of the available bandwidth still represents one of the main issues in this field. In this paper, we propose an improved mechanism to estimate the available bandwidth in IEEE 802.11-based ad hoc networks. Through simulations, we compare the accuracy of the estimation we propose to the estimation performed by other state-of-the-art QoS protocols, BRuIT, AAC, and QoS-AODV. Dual-Link Failure Resiliency Through Backup Link Mutual Exclusion Srinivasan Ramasubramanian, Member, IEEE, and Amit Chandak Abstract—Networks employ link protection to achieve fast recovery from link failures. While the first link failure can be protected using link protection, there are several alternatives for protecting against the second failure. This paper formally classifies the approaches to dual-link failure resiliency. One of the strategies to recover from dual-link failures is to employ link protection for the two failed links independently, which requires that two links may not use each other in their backup paths if they may fail simultaneously. Such a requirement is referred to as Backup Link Mutual Exclusion (BLME) constraint and the problem of identifying a backup path for every link that satisfies the above requirement is referred to as the BLME problem. This paper develops the necessary theory to establish the sufficient conditions for existence of a solution to the BLME problem. Solution methodologies for the BLME problem is developed using two approaches by: (1) formulating the backup path selection as an integer linear program; and (2) developing a polynomial time heuristic based on minimum cost path routing. The ILP formulation and heuristic are applied to six networks and their performance is compared to approaches that assume precise knowledge of dual-link failure. It is observed that a solution exists for all the six networks considered. The heuristic approach is shown to obtain feasible solutions that are resilient to most dual-link failures, although the backup path lengths may be significantly higher than optimal. In addition, the paper illustrates the significance of the knowledge of failure location by illustrating that network with higher connectivity may require lesser capacity than one with a lower connectivity to recover from dual-link failures A Geometric Approach to Improving Active Packet Loss Measurement Joel Sommers, Paul Barford, Nick Duffield, and Amos Ron Abstract—Measurement and estimation of packet loss characteristics are challenging due to the relatively rare occurrence and typically short duration of packet loss episodes. While active probe tools are commonly used to measure packet loss on end-toend paths, there has been little analysis of the accuracy of these tools or their impact on the network. The objective of our study is to understand how to measure packet loss episodes accurately with end-to-end probes. We begin by testing the capability of standard Poisson-modulated end-to-end measurements of loss in a controlled laboratory environment using IP routers and commodity end hosts. Our tests show that loss characteristics reported from such Poisson-modulated probe tools can be quite inaccurate over a range of traffic conditions. Motivated by these observations, we introduce a new algorithm for packet loss measurement that is designed to overcome the deficiencies in standard Poisson-based tools. Specifically, our method entails probe experiments that follow a geometric distribution to (1) enable an explicit trade-off between accuracy and impact on the network, and (2) enable more accurate measurements than standard Poisson probing at the same rate. We evaluate the capabilities of our methodology experimentally by developing and implementing a prototype tool, called BADABING. The experiments demonstrate the trade-offs between impact on the network and measurement accuracy. We show that BADABING reports loss characteristics far more accurately than traditional loss measurement tools Security Requirements Engineering: A Framework for Representation and Analysis Charles B. Haley, Robin Laney, Jonathan D. Moffett, Member, IEEE, and Bashar Nuseibeh, Member, IEEE Computer Society Abstract—This paper presents a framework for security requirements elicitation and analysis. The framework is based on constructing a context for the system, representing security requirements as constraints, and developing satisfaction arguments for the security requirements. The system context is described using a problem-oriented notation, then is validated against the security requirements through construction of a satisfaction argument. The satisfaction argument consists of two parts: a formal argument that the system can meet its security requirements and a structured informal argument supporting the assumptions expressed in the formal argument. The construction of the satisfaction argument may fail, revealing either that the security requirement cannot be satisfied in the context or that the context does not contain sufficient information to develop the argument. In this case, designers and architects are asked to provide additional design information to resolve the problems. We evaluate the framework by applying it to a security requirements analysis within an air traffic control technology evaluation project. Index Terms—Requirements engineering, security engineering, security requirements, argumentation Logarithmic Store-Carry-Forward Routing in Mobile Ad Hoc Networks Jie Wu and Shuhui Yang Department of Computer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 Fei Dai Department of Electrical and Computer Engineering North Dakota State University Fargo, ND 58105 Abstract Two schools of thought exist in terms of handling mobility in mobile ad hoc networks (MANETs). One is the traditional connection-based model, which views node mobility as undesirable and tries to either remove (through recovery schemes) or mask (through tolerant schemes) the effect of mobility. The other is the mobility-assisted model, which considers mobility as a desirable feature, where routing is based on the store-carry-forward paradigm with random or controlled movement of mobile nodes (called ferries). It is well known that mobility increases the capacity of MANETs by reducing the number of relays in routing. Surprisingly, only two models, diameter-hop-count in the connection-based model and constant-hop-count in the mobility-assisted model, which correspond to two extremes of the spectrum, have been systematically studied. In this paper, we propose a new routing model that deals with message routing as well as trajectory planning of the ferries that carry the message. A logarithmic number of relays is enforced to achieve a good balance among several contradictory goals, including increasing network capacity, increasing ferry sharing, and reducing moving distance. The model considers the dynamic control of ferries in terms of the number of ferries, trajectory planning of ferries, and node communication and synchronization. The effectiveness of the proposed model is evaluated analytically as well as through simulation. Keywords: MANETs, mobile nodes, network capacity, store-carry-forward, trajectory planning.. A New TCP for Persistent Packet Reordering Stephan Bohacek, João P. Hespanha, Junsoo Lee, Chansook Lim, and Katia Obraczka Abstract—Most standard implementations of TCP perform poorly when packets are reordered. In this paper, we propose a new version of TCP that maintains high throughput when reordering occurs and yet, when packet reordering does not occur, is friendly to other versions of TCP. The proposed TCP variant, or TCP-PR, does not rely on duplicate acknowledgments to detect a packet loss. Instead, timers are maintained to keep track of how long ago a packet was transmitted. In case the corresponding acknowledgment has not yet arrived and the elapsed time since the packet was sent is larger than a given threshold, the packet is assumed lost. Because TCP-PR does not rely on duplicate acknowledgments, packet reordering (including out-or-order acknowledgments) has no effect on TCPPR’s performance. Through extensive simulations, we show that TCP-PR performs consistently better than existing mechanisms that try to make TCP more robust to packet reordering. In the case that packets are not reordered, we verify that TCP-PR maintains the same throughput as typical implementations of TCP (specifically, TCP-SACK) and shares network resources fairly. Furthermore, TCP-PR only requires changes to the TCP sender side making it easier to deploy. Location-based Spatial Queries with Data Sharing in Wireless Broadcast Environments Abstract Location-based spatial queries (LBSQs) refer to spatial queries whose answers rely on the location of the inquirer. Efficient processing of LBSQs is of critical importance with the ever-increasing deployment and use of mobile technologies. We show that LBSQs have certain unique characteristics that traditional spatial query processing in centralized databases does not address. For example, a significant challenge is presented by wireless broadcasting environments, which often exhibit high-latency database access. In this paper, we present a novel query processing technique that, while maintaining high scalability and accuracy, manages to reduce the latency considerably in answering location-based spatial queries. Our approach is based on peer-to-peer sharing, which enables us to process queries without delay at a mobile host by using query results cached in its neighboring mobile peers. We illustrate the appeal of our technique through extensive simulation results. Distributed Suffix Tree for Peer-to-Peer Search Hai Zhuge and Liang Feng China Knowledge Grid Research Group, Key Lab of Intelligent Information Processing Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China Abstract Establishing an appropriate semantic overlay on Peer-to-Peer networks to obtain both semantic ability and scalability is a challenge. Current DHT-based P2P networks are limited in their ability to support semantic search. This paper proposes the DST Distributed Suffix Tree) overlay as the intermediate layer between the DHT overlay and the semantic overlay. The DST overlay supports search of keyword sequences. Its time cost is sub -linear with the length of the keyword sequences. Using a common interface, the DST overlay is independent of the variation of the underlying DHT overlays. Analysis and experiments show that DST-based search is fast, load-balanced, and useful in realizing accurate content search on large networks. Key words: DHT, Peer-to-Peer, Search, Semantics, Suffix Tree, Load Balance. Dual-link failure resiliency through backup link mutual exclusion Source IEEE/ACM Transactions on Networking (TON) archive Volume 16 , Issue 1 (February 2008) table of contents Year of Publication: 2008 ISSN:1063-6692 ABSTRACT Networks employ link protection to achieve fast recovery from link failures. While the first link failure can be protected using link protection, there are several alternatives for protecting against the second failure. This paper formally classifies the approaches to dual-link failure resiliency. One of the strategies to recover from dual-link failures is to employ link protection for the two failed links independently, which requires that two links may not use each other in their backup paths if they may fail simultaneously. Such a requirement is referred to as backup link mutual exclusion (BLME) constraint and the problem of identifying a backup path for every link that satisfies the above requirement is referred to as the BLME problem. This paper develops the necessary theory to establish the sufficient conditions for existence of a solution to the BLME problem. Solution methodologies for the BLME problem is developed using two approaches by: 1) formulating the backup path selection as an integer linear program; 2) developing a polynomial time heuristic based on minimum cost path routing. The ILP formulation and heuristic are applied to six networks and their performance is compared with approaches that assume precise knowledge of dual-link failure. It is observed that a solution exists for all of the six networks considered. The heuristic approach is shown to obtain feasible solutions that are resilient to most dual-link failures, although the backup path lengths may be significantly higher than optimal. In addition, the paper illustrates the significance of the knowledge of failure location by illustrating that network with higher connectivity may require lesser capacity than one with a lower connectivity to recover from dual-link failures. Problem Oriented Software Engineering: solving the Package Router Control problem Jon G. Hall Lucia Rapanotti Michael A. Jackson Centre for Research in Computing The Open University fJ.G.Hall,L.Rapanottig@open.ac.uk, jacksonma@acm.org Abstract—Problem Orientation is gaining interest as a way of approaching the development of software intensive systems and yet a significant example that explores its use is missing from the literature. In this paper, we present the basic elements of Problem Oriented Software Engineering (POSE) which aims to bring both non-formal and formal aspects of software development together in a single framework. We provide an example of a detailed and systematic POSE development of a software problem, that of designing the controller for a package router. The problem is drawn from the literature, but the analysis presented here is new. The aim of the example is twofold: to illustrate the main aspects of POSE and how it supports software engineering design, and to demonstrate how a non-trivial problem can be dealt with by the approach. Protection of Database Security Via Collaborative Inference Detection ∗ Yu Chen and Wesley W. Chu Computer Science Department, University of California, USA {chenyu, wwc}@cs.ucla.edu Abstract. Malicious users can exploit the correlation among data to infer sensitive information from a series of seemingly innocuous data accesses. Thus, we develop an inference violation detection system to protect sensitive data content. Based on data dependency, database schema and semantic knowledge, we constructed a semantic inference model (SIM) that represents the possible inference channels from any attribute to the pre-assigned sensitive attributes. The SIM is then instantiated to a semantic inference graph (SIG) for query-time inference violation detection. For a single user case, when a user poses a query, the detection system will examine his/her past query log and calculate the probability of inferring sensitive information. The query request will be denied if the inference probability exceeds the pre-specified threshold. For multi-user cases, the users may share their query answers to increase the inference probability. Therefore, we develop a model to evaluate collaborative inference based on the query sequences of collaborators and their task-sensitive collaboration levels. Experimental studies reveal that informa tion authoritativeness and communication fidelity are two key factors that affect the level of achievable collaboration. An example is given to illustrate the use of the proposed technique to prevent multiple collaborative users from deriving sensitive information via inference. On the Performance Benefits of Multihoming Route Control Aditya Akella, Member, IEEE, Bruce Maggs, Srinivasan Seshan, Member, IEEE, Anees Shaikh, Member, IEEE, and Ramesh Sitaraman, Member, IEEE Abstract—Multihoming is increasingly being employed by large enterprises and data centers to extract good performance and reliability from their ISP connections. Multihomed end networks today can employ a variety of route control products to optimize their Internet access performance and reliability. However, little is known about the tangible benefits that such products can offer, the mechanisms they employ and their trade-offs. This paper makes two important contributions. First, we present a study of the potential improvements in Internet round-trip times (RTTs) and transfer speeds from employing multihoming route control. Our analysis shows that multihoming to 3 or more ISPs and cleverly scheduling traffic across the ISPs can improve Internet RTTs and throughputs by up to 25% and 20%, respectively. However, a careful selection of ISPs is important to realize the performance improvements. Second, focusing on large enterprises, we propose and evaluate a widerange of route control mechanisms and evaluate their design trade-offs. We implement the proposed schemes on a Linuxbased Web proxy and perform a trace-based evaluation of their performance.We show that both passive and active measurementbased techniques are equally effective and could improve the Web response times of enterprise networks by up to 25% on average, compared to using a single ISP. We also outline several ―best common practices‖ for the design of route control products. Index Terms—Multihoming, performance, reliability. HBA: Distributed Metadata Management for Large Cluster-based Storage Systems Yifeng Zhu, Member, IEEE, Hong Jiang, Member, IEEE Jun Wang, Member, IEEE, Feng Xian, Student Member, IEEE, Abstract—An efficient and distributed scheme for file mapping or file lookup is critical in decentralizing metadata management within a group of metadata servers. This paper presents a novel technique called HBA (Hierarchical Bloom filter Arrays) to map filenames to the metadata servers holding their metadata. Two levels of probabilistic arrays, namely, Bloom filter arrays, with different level of accuracies, are used on each metadata server. One array, with lower accuracy and representing the distribution of the entire metadata, trades accuracy for significantly reduced memory overhead, while the other array, with higher accuracy, caches partial distribution information and exploits the temporal locality of file access patterns. Both arrays are replicated to all metadata servers to support fast local lookups. We evaluate HBA through extensive trace-driven simulations and implementation in Linux. Simulation results show our HBA design to be highly effective and efficient in improving performance and scalability of file systems in clusters with 1,000 to 10,000 nodes (or superclusters) and with the amount of data in the Petabyte scale or higher. Our implementation indicates that HBA can reduce metadata operation time of a single-metadata-server architecture by a factor of up to 43.9 when the system is configured with 16 metadata servers. Energy-Efficient Resource Allocation in Wireless Networks: An overview of game-theoretic approaches Farhad Meshkati, H. Vincent Poor, and Stuart C. Schwartz Abstract An overview of game-theoretic approaches to energy-efficient resource allocation in wireless networks is presented. Focusing on multiple-access networks, it is demonstrated that game theory can be used as an effective tool to study resource allocation in wireless networks with quality-of-service (QoS) constraints. A family of non-cooperative (distributed) games is presented in which each user seeks to choose a strategy that maximizes its own utility while satisfying its QoS requirements. The utility function considered here measures the number of reliable bits that are transmitted per joule of energy consumed and, hence, is particulary suitable fo r energy-constrained networks. The actions available to each user in trying to maximize its own utility are at least the choice of the transmit power and, depending on the situation, the user may also be able to choose its transmission rate, modulation, packet size, multiuser receiver, multi-antenna processing algorithm, or carrier allocation strategy. The best-response strategy and Nash equilibrium for each game is presented. Using this game-theoretic framework, the effects of power control, rate control, modulation, temporal and spatial signal processing, carrier allocation strategy and delay QoS constraints on energy efficiency and network capacity are quantified. Building a Distributed E-Healthcare System Using SOA March/April 2008 (vol. 10 no. 2) pp. 24-30 This article describes a distributed e-healthcare system that uses the serviceoriented architecture as a means of designing, implementing, and managing healthcare services. Index Terms: Atom, RSS, e-healthcare, electronic health record, e-prescription, healthcare standards, interoperability, medical devices, service-oriented architecture, SOA, speech software, Web services Citation: Firat Kart, Louise E. Moser, P. Michael Melliar-Smith, "Building a Distributed EHealthcare System Using SOA," IT Professional, vol. 10, no. 2, pp. 24-30, Mar/Apr, 2008 Impact of user participation on Web-based information system: The Hong Kong experience Quaddus, M. Lau, A. Grad. Sch. of Bus., Curtin Univ. of Technol., Perth, WA; This paper appears in: Computer and information technology, 2008. iccit 2007. 10th international conference on Publication Date: 27-29 Dec. 2007 Location: Dhaka, ISBN: 978-1-4244-1550-2 INSPEC Accession Number: 10114576 Digital Object Identifier: 10.1109/ICCITECHN.2007.4579419 Current Version Published: 2008-07-25 Abstract The rapid growth of highly sophisticated computers and Web-based information systems (WIS) as integral components of business operations have led to an increased interest in the role of user participation during WIS implementation and its influence on end-user satisfaction and, ultimately, organisational success. The primary purpose of this research is, therefore, to investigate the significance of user-characteristics during WIS implementation. The research is conducted by collecting data via survey among organizations in Hong Kong. The important findings of this study demonstrate that user participation is positively related to user satisfaction and organisational effectiveness. In addition, user satisfaction can be largely applied to mediate the relationship between user participation (through user training, career stage, and empowerment) and organisational effectiveness. A deeper understanding of these concepts will provide organisations in Hong Kong with a richer view of the role of user participation during Web based information system implementation, which in turn has the potential to contribute towards improved business performance. E cient Key Agreement for Large and Dynamic Multicast Groups Abstract Secure multicast represents the core component of many web and multimedia applications such as pay-TV, teleconferencing, real-time distribution of stock market price and etc. The main challenges for secure multicast is scalability, e ciency and authenticity. In this paper, we propose a scalable, e E cient Key Agreement for Large and Dynamic Multicast Groups Abstract Secure multicast represents the core component of many web and multimedia applications such as pay-TV, teleconferencing, real-time distribution of stock market price and etc. The main challenges for secure multicast is scalability, e ciency and authenticity. In this paper, we propose a scalable, e Efficient, authenticated group key agreement scheme for large and dynamic multicast systems. The proposed key agreement scheme is identity-based which uses the bilinear map over the elliptic curves. Compared with the previously published schemes, our scheme provides group member authenticity without imposing extra mechanism. Furthermore, we give a scalability solution based on the subgroups, which has advantages over the existing schemes. Security analysis shows that our scheme satisfies both forward secrecy and backward secrecy. Keywords: multicast, bilinear pairing, key agreement Dual-Link Failure Resiliency Through Backup Link Mutual Exclusion Srinivasan Ramasubramanian, Member, IEEE, and Amit Chandak Abstract—Networks employ link protection to achieve fast recovery from link failures. While the first link failure can be protected using link protection, there are several alternatives for protecting against the second failure. This paper formally classifies the approaches to dual-link failure resiliency. One of the strategies to recover from dual-link failures is to employ link protection for the two failed links independently, which requires that two links may not use each other in their backup paths if they may fail simultaneously. Such a requirement is referred to as Backup Link Mutual Exclusion (BLME) constraint and the problem of identifying a backup path for every link that satisfies the above requirement is referred to as the BLME problem. This paper develops the necessary theory to establish the sufficient conditions for existence of a solution to the BLME problem. Solution methodologies for the BLME problem is developed using two approaches by: (1) formulating the backup path selection as an integer linear program; and (2) developing a polynomial time heuristic based on minimum cost path routing. The ILP formulation and heuristic are applied to six networks and their performance is compared to approaches that assume precise knowledge of dual-link failure. It is observed that a solution exists for all the six networks considered. The heuristic approach is shown to obtain feasible solutions that are resilient to most dual-link failures, although the backup path lengths may be significantly higher than optimal. In addition, the paper illustrates the significance of the knowledge of failure location by illustrating that network with higher connectivity may require lesser capacity than one with a lower connectivity to recover from dual-link failures Dual-resource TCP/AQM for processing-constrained networks Abstract—This paper examines congestion control issues for TCP flows that require in-network processing on the fly in network elements such as gateways, proxies, firewalls and even routers. Applications of these flows are increasingly abundant in the future as the Internet evolves. Since these flows require use of CPUs in network elements, both bandwidth and CPU resources can be a bottleneck and thus congestion control must deal with ―congestion‖ on both of these resources. In this paper, we show that conventional TCP/AQM schemes can significantly lose throughput and suffer harmful unfairness in this environment, particularly when CPU cycles become more scarce (which is likely the trend given the recent explosive growth rate of bandwidth). As a solution to this problem, we establish a notion of dual-resource proportional fairness and propose an AQM scheme, called DualResource Queue (DRQ), that can closely approximate proportional fairness for TCP Reno sources with in-network processing requirements. DRQ is scalable because it does not maintain perflow states while minimizing communication among different resource queues, and is also incrementally deployable because of no required change in TCP stacks. The simulation study shows that DRQ approximates proportional fairness without much implementation cost and even an incremental deployment of DRQ at the edge of the Internet improves the fairness and throughput of these TCP flows. Our work is at its early stage and might lead to an interesting development in congestion control research. Dynamic Signature Verification A stroke based algorithm for dynamic signature verification Tong Qu; El Saddik, A.; Adler, A. Electrical and Computer Engineering, 2004. Canadian Conference on Volume 1, Issue , 2-5 May 2004 Page(s): 461 - 464 Vol.1 Digital Object Identifier Summary: Dynamic signature verification (DSV) uses the behavioral biometrics of a hand-written signature to confirm the identity of a computer user. This paper presents a novel stroke-based algorithm for DSV. An algorithm is developed to convert sample signatures to a template by considering their spatial and t ime domain characteristics, and by extracting features in terms of individual strokes. Individual strokes are identified by finding the points where there is a: 1) decrease in pen tip pressure, 2) decrease in pen velocity, and 3) rapid change in pen angle. A significant stroke is discriminated by the maximum correlation with respect to the reference signatures. Between each pair of signatures, the local correlation comparisons are computed between portions of pressure and velocity signals using segment alignment by elastic matching. Experimental results were obtained for signatures from 10 volunteers over a four-month period. The result shows that stroke based features contain robust dynamic information, and offer greater accuracy for dynamic signature verification, in comparison to results without using stroke features. 1 TCP-LP: Low-Priority Service via End-Point Congestion Control Aleksandar Kuzmanovic and Edward W. Knightly Abstract—Service prioritization among different traffic classes is an important goal for the Internet. Conventional approaches to solving this problem consider the existing best-effort class as the low-priority class, and attempt to develop mechanisms that provide ―better-than-best-effort‖ service. In this paper, we explore the opposite approach, and devise a new distributed algorithm to realize a low-priority service (as compared to the existing best effort) from the network endpoints. To this end, we develop TCP Low Priority (TCP-LP), a distributed algorithm whose goal is to utilize only the excess network bandwidth as compared to the ―fair share‖ of bandwidth as targeted by TCP. The key mechanisms unique to TCP -LP congestion control are the use of one-way packet delays for early congestion indications and a TCP-transparent congestion avoidance policy. The results of our simulation and Internet experiments show that that: (1) TCP -LP is largely non-intrusive to TCP traffic; (2) both single and aggregate TCPLP flows are able to successfully utilize excess network bandwidth; moreover, multiple TCP-LP flows share excess bandwidth fairly; (3) substantial amounts of excess bandwidth are available to the low-priority class, even in the presence of ―greedy‖ TCP flows; (4) the response times of web connections in the best-effort class decrease by up to 90% when long-lived bulk data transfers use TCP-LP rather than TCP; (5) despite their low-priority nature, TCP-LP flows are able to utilize significant amounts of available bandwidth in a wide-area network environment. Keywords—TCP-LP, TCP, available bandwidth, service prioritization, TCP-transparency. Dynamic Load Balancing in Distributed Systems in the Presence of Delays: A Regeneration-Theory Approach Source IEEE Transactions on Parallel and Distributed Systems archiveVolume 18 , Issue 4 (April 2007) table of contentsPages 485-497 Year of Publication: 2007 ISSN:1045-9219 Authors Sagar Dhakal Jorge E. Pezoa Cundong Yang Senior Members David A. Bader Publisher Majeed M. Hayat IEEE IEEE IEEE Press Piscataway, NJ, USA ABSTRACT A regeneration-theory approach is undertaken to analytically characterize the average overall completion time in a distributed system. The approach considers the heterogeneity in the processing rates of the nodes as well as the randomness in the delays imposed by the communication medium. The optimal one-shot load balancing policy is developed and subsequently extended to develop an autonomous and distributed load-balancing policy that can dynamically reallocate incoming external loads at each node. This adaptive and dynamic load balancing policy is implemented and evaluated in a two-node distributed system. The performance of the proposed dynamic load-balancing policy is compared to that of static policies as well as existing dynamic load-balancing policies by considering the average completion time per task and the system processing rate in the presence of random arrivals of the external loads. Controlling IP Spoofing through Interdomain Packet Filters Source IEEE Transactions on Dependable and Secure Computing archive Volume 5 , Issue 1 (January 2008) Year of Publication: 2008 ISSN:1545-5971 ABSTRACT The Distributed Denial of Services (DDoS) attack is a serious threat to the legitimate use of the Internet. Prevention mechanisms are thwarted by th e ability of attackers to forge, or spoof, the source addresses in IP packets. By employing IP spoofing, attackers can evade detection and put a substantial burden on the destination network for policing attack packets. In this paper, we propose an inter domain packet filter (IDPF) architecture that can mitigate the level of IP spoofing on the Internet. A key feature of our scheme is that it does not require global routing information. IDPFs are constructed from the information implicit in BGP route updates and are deployed in network border routers. We establish the conditions under which the IDPF framework works correctly in that it does not discard packets with valid source addresses. Based on extensive simulation studies, we show that even with partial deployment on the Internet, IDPFs can proactively limit the spoofing capability of attackers. In addition, they can help localize the origin of an attack packet to a small number of candidate networks. C-TREND: Temporal Cluster Graphs for Identifying and Visualizing Trends in Multiattribute Transactional Data Adomavicius, G.; Bockstedt, J. Knowledge and Data Engineering, IEEE Transactions on Volume 20, Issue 6, June 2008 Page(s):721 - 735 Digital Object Identifier 10.1109/TKDE.2008.31 Summary:Organizations and firms are capturing increasingly more data about their customers, suppliers, competitors, and business environment. Most of this data is multiattribute (multidimensional) and temporal in nature. Data. mining and business intelligence, techniques are often used to discover patterns in such data; however, mining temporal relationships typically is a complex task. We propose a new data analysis and visualization technique for representing trends in multiattribute temporal data using a clustering- based approach. We introduce Cluster-based Temporal Representation of EveNt Data (C-TREND), a system that implements the temporal cluster graph construct, which maps multiattribute temporal data to a two dimensional directed graph that identifies trends in dominant data types over time. In this paper, we present our temporal clustering-based technique, discuss its algorithmic implementation and performance, demonstrate applications of the technique by analyzing data on wireless networking technologies and baseball batting statistics, and introduce a set of metrics for further analysis of discovered trends. Dynamic signature verification using discriminative training Russell, G.F. Jianying Hu Biem, A. Heilper, A. Markman, D. IBM TJ, Watson Res. Center, Yorktown Heights, NY, USA This paper appears in: Document Analysis and Recognition, 2005. Proceedings. Eighth International Conference on Publication Date: 29 Aug.-1 Sept. 2005 On page(s): 1260 - 1264 Vol. 2 Number of Pages: xxv+1290 ISSN: 1520-5263 Digital Object Identifier: 10.1109/ICDAR.2005.95 Posted online: 2006-01-16 09:05:15.0 Abstract In this paper we describe a new approach to dynamic signature verification using the discriminative training framework. The authentic and forgery samples are represented by two separate Gaussian Mixture models and discriminative training is used to achieve optimal separation between the two models. An enrollment sample clustering and screening procedure is described which improves the robustness of the system. We also introduce a method to estimate and apply subject norms representing the "typical" variation of the subject's signatures. The subject norm functions are parameterized, and the parameters are trained as an integral part of the discriminative training. The system was evaluated using 480 authentic signature samples and 260 skilled forgery samples from 44 accounts and achieved an equal error rate of 2.25%. An Augmented Lagrangian Approach for Distributed Supply Chain Planning for Multiple Companies Nishi, T.; Shinozaki, R.; Konishi, M. Automation Science and Engineering, IEEE Transactions on Volume 5, Issue 2, April 2008 Page(s):259 - 274 Digital Object Identifier 10.1109/TASE.2007.894727 Summary:Planning coordination for multiple companies has received much attention from viewpoints of global supply chain management. In practical situations, a plausible plan for multiple companies should be created by mutual negotiation and coordination without sharing such confidential information as inventory costs, setup costs, and due date penalties for each company. In this paper, we propose a framework for distributed optimization of supply chain planning using an augmented Lagrangian decomposition and coordination approach. A feature of the proposed method is that it can derive a near-optimal solution without requiring all of the information. The proposed method is applied to supply chain planning problems for a petroleum complex, and a midterm planning problem for multiple companies. Computational experiments demonstrate that the average gap between a solution derived by the proposed method and the optimal solution is within 3% of the performance index, even though only local information is used to derive a solution for each company. An Assessment of Dynamic Signature Forgery and Perception of Signature Strength Elliott, S. Hunt, A. Dept. of Ind. Technol., Purdue Univ., West Lafayette, IN This paper appears in: Carnahan Conferences Security Technology, Proceedings 2006 40th Annual IEEE International Publication Date: Oct. 2006 On page(s): 186 - 190 Number of Pages: 186 - 190 Location: Lexington, KY Digital Object Identifier: 10.1109/CCST.2006.313448 Posted online: 2007-02-20 06:36:18.0 Abstract Dynamic signature verification has many challenges associated with the creation of the impostor dataset. The literature discusses several ways of determining the impostor signature provider, but this paper takes a different approach - that of the opportunistic forger and his or her relationship to the genuine signature holder. The paper examines the accuracy with which an opportunistic forger assesses the various traits of the genuine signature, and whether the genuine signature holder believes that his or her signature is easy to forge Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode Gonzalez, T.F. Parallel and Distributed Systems, IEEE Transactions on Volume 19, Issue 8, Aug. 2008 Page(s):1034 - 1043 Digital Object Identifier 10.1109/TPDS.2007.70801 Summary:We consider the continuously delivery message dissemination (CDMD) problem over the n processor single-port complete (all links are present and are bidirectional) static network with the multicasting communication primitive. This problem has been shown to be NP-complete even when all messages have equal length. For the CDMD problem we present an efficient approximation algorithm to construct a message routing schedule with total communication time at most 3.5d, where d is the total length of the messages that each processor needs to send or receive. The algorithm takes O(qn) time, where n is the number of processors and q is the total number of messages that the processors receive. An agent-based testing approach for Web applications Qi, Y.; Kung, D.; Wong, E. Computer Software and Applications Conference, 2005. COMPSAC 2005. 29th Annual International Volume 2, Issue , 26-28 July 2005 Page(s): 45 - 50 Vol. 1 Digital Object Identifier 10.1109/COMPSAC.2005.42 Summary: In recent years, Web applications have grown so quickly that they have already become crucial to the success of businesses. However, since they are built on Internet and open standard technologies, Web applications bring new challenges to researchers, such as dynamic behaviors, heterogeneous representations, novel control flow and data flow mechanisms, etc. In this paper, we propose an agent-based approach for Web application testing. While the agentbased framework greatly reduces the complexity of Web applications, a f our-level dataflow test approach can be employed to perform structure testing on them. In this approach, data flow analysis is performed as function level testing, function cluster level testing, object level testing, and Web application level testing, fro m low abstract level to high abstract level. Each test agent in the framework takes charge of the testing in an abstract level for a particular type of Web document or object. Dynamic signature verification system using stroked based features Tong Qu Abdulmotaleb El Saddik Adler, A. VIVA Lab, Ottawa Univ., Ont., Canada This paper appears in: Haptic, Audio and Visual Environments and Their Applications, 2003. HAVE 2003. Proceedings. The 2nd IEEE Internatioal Workshop on Publication Date: 20-21 Sept. 2003 On page(s): 83 - 88 Number of Pages: viii+124 ISSN: Posted online: 2003-11-10 09:46:00.0 Abstract This paper presents a novel feature-based dynamic signature verification system. Data is acquired from a Patriot digital pad, using the Windows Pen API. The signatures are analyzed dynamically by considering their spatial and time domain characteristics. A stroke-based feature extraction method is studied, in which strokes are separated by the zero pressure points. Between each pair of signatures, the correlation comparisons are conducted for strokes. A significant stroke is discriminated by the maximum correlation with respect to the reference signatures. The correlation value and stroke length for the significant strokes are extracted as features for identifying genuine signatures against forgeries. The membership function and classifier are modeled based on the probabilistic distribution of selected features. Experimental results were obtained for signatures from 20 volunteers. The current 6-feature based signature verification system was calculated to have a false accept rate of 1.67% and false reject rate of 6.67%. Grid computing QoS-aware connection resilience for network-aware grid computing fault tolerance Valcarenghi, L. Castoldi, P. Center of Excellence for Commun. Networks Eng., Scuola Superiore Sant' Anna, Pisa, Italy This paper appears in: Transparent Optical Networks, 2005, Proceedings of 2005 7th International Conference Publication Date: 3-7 July 2005 Volume: 1 On page(s): 417 - 422 Vol. 1 Number of Pages: (2 vol. (x+448) ISSN: Digital Object Identifier: 10.1109/ICTON.2005.1505834 Posted online: 2005-09-12 09:08:00.0 Abstract Current grid computing fault tolerance leverages IP dynamic rerouting and schemes implemented in the application or in the middleware to overcome both software and hardware failures. Despite the flexibility of current grid computing fault tolerant schemes in recovering inter-service connectivity from an almost comprehensive set of failures, they might not be able to repristinate also connection QoS guarantees, such as minimum bandwidth and maximum delay. This phenomenon is exacerbated when, as in global grid computing, the grid computing sites are not connected by dedicated network resources but share the same network infrastructure with other Internet services. This paper aims at showing the advantages of integrating grid computing fault tolerance schemes with next generation networks (NGNs) resilient schemes. Indeed, by combining the utilization of generalized multi-protocol label switching (GMPLS) resilient schemes, such as path restoration, and application or middleware layer fault tolerant schemes, such as service migration or replication, it is possible to guarantee the necessary QoS to the connections between grid computing sites while limiting the required network and computational resources. Performance Analysis of a P2P-Based VoIP Software Gao Lisha Luo Junzhou Southeast University, Nanjing, China This paper appears in: Telecommunications, 2006. AICT-ICIW '06. International Conference on Internet and Web Applications and Services/Advanced International Conference on Publication Date: 19-25 Feb. 2006 On page(s): 11 - 11 Digital Object Identifier: 10.1109/AICT-ICIW.2006.147 Posted online: 2006-04-03 15:44:59.0 Abstract With the development of network, multimedia will be the main application in next generation network. Voice is one of the most important applications. Recently a kind of P2P-based VoIP software, Skype, has been receiving more and more attention both in academia and industry. Skype claims that it's better than other VoIP software, because of its high call completion rate and superior sound quality. This paper will reveal Skype's technique and have a performance comparison between Skype and MSN Messenger, which uses traditional VoIP protocol. The result indicates that the voice quality of Skype is no better than traditional VoIP software and the great benefit of P2P involved with VoIP is that it can solv e NAT and firewall problems. A model-based approach to evaluation of the efficacy of FEC coding in combating network packet losses Source IEEE/ACM Transactions on Networking (TON) archive Volume 16 , Issue 3 (June 2008) Year of Publication: 2008 ISSN:1063-6692 ABSTRACT We propose a model-based analytic approach for evaluating the overall efficacy of FEC coding combined with interleaving in combating packet losses in IP networks. In particular, by modeling the network path in terms of a single bottleneck node, described as a G/M/1/K queue, we develop a recursive procedure for the exact evaluation of the packet-loss statistics for general arrival processes, based on the framework originally introduced by Cidon et al., 1993. To include the effect s of interleaving, we incorporate a discrete-time Markov chain (DTMC) into our analytic framework. We study both single-session and multiple-session scenarios, and provide a simple algorithm for the more complicated multiple-session scenario. We show that the unified approach provides an integrated framework for exploring the tradeoffs between the key coding parameters; specifically, interleaving depths, channel coding rates and block lengths. The approach facilitates the selection of optimal coding strategies for different multimedia applications with various user quality-of-service (QoS) requirements and system constraints. We also provide an information-theoretic bound on the performance achievable with FEC coding in IP networks. Multicast communication in grid computing networks with background traffic Kouvatsos, D.D. Mkwawa, I.M. Dept. of Comput., Univ. of Bradford, UK This paper appears in: Software, IEE ProceedingsPublication Date: 26 Aug. 2003 Volume: 150 , On page(s): 257 - 264 ISSN: 1462-5970 Digital Object Identifier: 10.1049/ip-sen:20030810 Posted online: 2003-10-27 09:52:26.0 Abstract Grid computing is a computational concept based on an infrastructure that integrates and collaborates the use of high end computers, network s, databases and scientific instruments owned and managed by several organisations. It involves large amounts of data and computing which require secure and reliable resource sharing across organisational domains. Despite its high computing performance orientation, communication delays between grid computing nodes is a big hurdle due to geographical separation in a realistic grid computing environment. Communication schemes such as broadcasting, multicasting and routing should, therefore, take communication delay into consideration. Such communication schemes in a grid computing environment pose a great challenge due to the arbitrary nature of its topology. In this context, a heuristic algorithm for multicast communication is proposed for grid computing networks with finite capacity and bursty background traffic. The scheme facilitates inter -node communication for grid computing networks and it is applicable to a single -port mode of message passing communication. The scheme utilises a queue -by-queue decomposition algorithm for arbitrary open queueing network models, based on the principle of maximum entropy, in conjunction with an information theoretic decomposition criterion and graph theoretic concepts. Evidence based on empirical studies indicates the suitability of the scheme for achieving an optimal multicast communication cost, subject to system decomposition constraints. A Signature-Based Indexing Method for Efficient Content-Based Retrieval of Relative Temporal Patterns June 2008 (vol. 20 no. 6) pp. 825-835 A number of algorithms have been proposed for the discovery of temporal patterns. However, since the number of generated patterns can be large, selecting which patterns to analyze can be non-trivial. There is thus a need for algorithms and tools that can assist in the selection of discovered patterns so that subsequent analysis can be performed in an efficient and, ideally, interactive manner. In this paper, we propose a signature-based indexing method, to optimise the storage and retrieval of a large collection of relative temporal patterns. Concurrent Negotiations for Agent-Based Grid Computing Xiong Li Yujin Wu Kai Wang Zongchang Xu Dept. of Command & Adm. Acad., Armored Force Eng., Beijing This paper appears in: Cognitive Informatics, 2006. ICCI 2006. 5th IEEE International Conference on Publication Date: 17-19 July 2006 Volume: 1 On page(s): 31 - 36 Number of Pages: 31 - 36 Location: Beijing Digital Object Identifier: 10.1109/COGINF.2006.365673 Posted online: 2007-09-10 09:36:29.0 Abstract Since the grid and agent communities both develop concepts and mechanisms for open distributed systems, agent-based grid computing is put forward. However, there are challenges about effective load balancing for grid computing, bec ause of the highly heterogeneous and complex computing environments, even though agents and agent-based grid computing approach are used. To solve the problems, in this paper, a concurrent negotiations model is presented, in which an auction is mapped into a one-to-many negotiation between one seller agent and many buyer agents in service-oriented contexts. Thus, the mechanism and process of concurrent negotiations are studied. An agent negotiates with many other agents and coordinates balance in grid computing resources. The results of exploratory evaluation show that this concurrent negotiations model has a advantage in achieving more and higher utility agreements than other models to optimize computing resources allocation LOCATION AIDED ROUTING An efficient location-aided routing protocol for mobile ad hoc networks Nen-Chung Wang Si-Ming Wang Dept. of Comput. Sci. & Inf. Eng., Chaoyang Univ. of Technol., Taichung, Taiwan This paper appears in: Parallel and Distributed Systems, 2005. Proceedings . 11th International Conference on Publication Date: 20-22 July 2005 Volume: 1 On page(s): 335 - 341 Vol. 1 Number of Pages: 2 vol. (xxi+712) ISSN: 1521-9097 Digital Object Identifier: 10.1109/ICPADS.2005.82 Posted online: 2005-11-14 10:13:01.0 Abstract A mobile ad hoc network (MANET) consists of a set of mobile hosts that do not need a base station. Due to the high mobility of nodes, the network topology of MANETs always changes. This makes it more difficult to find the routes that message packets use when they are routed. In this paper, we propose an improved location-aided routing (ILAR) scheme to improve the efficiency of location-aided routing (LAR) scheme by using the global positioning system (GPS). In this scheme, we first decide a baseline, which is the line between the source node and the destination node, for route discovery. The request packet is broadcasted in a request zone based on the baseline to determine the next broadcasting node. The neighboring node with the shortest distance to the baseline is chosen as the next broadcasting node. Thus, we can find a better routing path than LAR scheme to reduce the network overhead. We also propose a partial reconstruction process that maintains a routing path. When a node on a routing path finds that a link is broken, the node starts the process of routing maintenance. Finally, experimental results show that the proposed ILAR scheme outperforms LAR scheme. A geometric approach to improving active packet loss measurement Source IEEE/ACM Transactions on Networking (TON) archive Volume 16 , Issue 2 (April 2008) table of contents Pages 307-320 Year of Publication: 2008 ISSN:1063-6692 Authors Joel Sommers Department of Computer Science, Colgate University, Hamilton, NY ABSTRACT Measurement and estimation of packet loss characteristics are challenging due to the relatively rare occurrence and typically short duration of packet loss episodes. While active probe tools are commonly used to measure packet loss on end -to-end paths, there has been little analysis of the accuracy of these tools or their impact on the network. The objective of our study is to understand how to measure packet loss episodes accurately with end-to-end probes. We begin by testing the capability of standard Poisson-modulated end-to-end measurements of loss in a controlled laboratory environment using IP routers and commodity end hosts. Our tests show that loss characteristics reported from such Poisson -modulated probe tools can be quite inaccurate over a range of traffic conditions. Motivated by these observations, we introduce a new algorithm for packet loss measurement that is designed to overcome the deficiencies in standard Poisson-based tools. Specifically, our method entails probe experiments that follow a geometric distribution to 1) enable an explicit trade-off between accuracy and impact on the network, and 2) enable more accurate measurements than standard Poisson probing at the same rate. We evaluate the capabilities of our methodology experimentally by developing and implementing a prototype tool, called BADABING. The experiments demonstrate the trade-offs between impact on the network and measurement accuracy. We show that BADABING reports loss characteristics far more accurately than traditional loss measurement tools. High-effect Location-Aided Routing Scheme for Ad Hoc Environment Shih Yang Lin Lin Yu Wu Chien-Ying Lai Ren-Song Ko Guang-Ming Wu Dept. of Inf. Manage., Nanhua Univ. This paper appears in: Advanced Communication Technology, The International Conference on Publication Date: 12-14 Feb. 2007 Volume: 1 On page(s): 40 - 45 Number of Pages: 40 - 45 Location: Gangwon-Do ISSN: 1738-9445 Digital Object Identifier: 10.1109/ICACT.2007.358256 Posted online: 2007-05-07 11:28:19.0 9th Abstract ILAR routing protocol was proposed to improve the efficiency of location -aided routing (LAR) protocol. It had less packets and better performance than LAR. However, ILAR still can be improved on hop counts for speed up routing discovery. We found two drawbacks in the ILAR. There are some nodes around the borders of broadcast coverages that could move out easily, it lead to a broken routing path. Another problem in the ILAR protocol was choosing the next forwarding node based on VDIST distance, but it can't choose better nodes that causes the far node's VDIST to be greater than the forwarding node. Therefore we propose a high-effect location-aided routing protocol (HLAR) and it solves the problems above. The simulation results our scheme has better performance than the ILAR scheme. A Geometric Approach to Improving Active Packet Loss Measurement Sommers, J.; Barford, P.; Duffield, N.; Ron, A. Networking, IEEE/ACM Transactions on Volume 16, Issue 2, April 2008 Page(s):307 - 320 Digital Object Identifier 10.1109/TNET.2007.900412 Summary:Measurement and estimation of packet loss characteristics are challenging due to the relatively rare occurrence and typically short duration of packet loss episodes. While active probe tools are commonly used to measure packet loss on end-to-end paths, there has been little analysis of the accuracy of these tools or their impact on the network. The objective of our study is to understand how to measure packet loss episodes accurately with end -to-end probes. We begin by testing the capability of standard Poisson -modulated end-toend measurements of loss in a controlled laboratory environment using IP routers and commodity end hosts. Our tests show that loss characteristics reported from such Poisson-modulated probe tools can be quite inaccurate over a range of traffic conditions. Motivated by these observations, we introduce a new algorithm for packet loss measurement that is designed to overcome the deficiencies in standard Poisson-based tools. Specifically, our method entails probe experiments that follow a geometric distribution to 1) enable an explicit trade -off between accuracy and impact on the network, and 2) enable more accurate measurements than standard Poisson probing at the same rate. We evaluate the capabilities of our methodology experimentally by developing and implementing a prototype tool, called BADABING. The experiments demonstrate the trade-offs between impact on the network and measurement accuracy. We show that BADABING reports loss characteristics far more accurately than traditional loss measurement tools. Velocity and location aided routing for mobile ad hoc networks Kai-Ten Feng Tse-En Lu Dept. of Commun. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan This paper appears in: Vehicular Technology Conference, 2004. VTC2004 -Fall. 2004 IEEE 60th Publication Date: 26-29 Sept. 2004 Volume: 4 On page(s): 2789 - 2793 Vol. 4 Number of Pages: 7 vol. (lxxxv+5334) ISSN: 1090-3038 Digital Object Identifier: 10.1109/VETECF.2004.1400566 Posted online: 2005-04-18 09:11:11.0 Abstract Many location-aware routing protocols have been proposed for mobile ad hoc networks in recent years. The efficiency of the routing protocols can be improved by considering the location information of the mobile nodes. However, the mobility characteristics of the mobile node have not been taken into account in most of the related work. In this paper, the proposed velocity aided routing (VAR) protocol determine its packet forwarding scheme based on the relative velocity between the intended forwarding node and the destination node. The routing performance can be further improved by the velocity and location aided routing (VLAR) protocol, which combines the location aided routing (LAR) protocol with the VAR algorithm. Two types of motion predictive models, the Gauss-Markov mobility model and the constant speed mobility model, are incorporated in the design of the VAR and VLAR algorithms. Simulation studies show that the proposed VLAR protocol outperforms other routing algorithms, especially for confined network topologies with higher mobility. A Fully Distributed Proactively Secure Threshold-Multisignature Scheme van der Merwe, J.; Dawoud, D.S.; McDonald, S. Parallel and Distributed Systems, IEEE Transactions on Volume 18, Issue 4, April 2007 Page(s):562 - 575 Digital Object Identifier 10.1109/TPDS.2007.1005 Summary:Threshold-multisignature schemes combine the properties of threshold group-oriented signature schemes and multisignature schemes to yield a signature scheme that allows a threshold (t) or more group members to collaboratively sign an arbitrary message. In contrast to threshold group signatures, the individual signers do not remain anonymous, but are publicly identifiable from the information contained in the valid threshold-multisignature. The main objective of this paper is to propose such a secure and efficient threshold-multisignature scheme. The paper uniquely defines the fundamental properties of threshold-multisignature schemes and shows that the proposed scheme satisfies these properties and eliminates the latest attacks to which other similar schemes are subject. The efficiency of the proposed scheme is analyzed and shown to be superior to its counterparts. The paper also proposes a discrete logarithm based distributed-key management infrastructure (DKMI), which consists of a round optimal, publicly verifiable, distributed-key generation (DKG) protocol and a one round, publicly verifiable, distributed-key redistribution/ updating (DKRU) protocol. The round optimal DKRU protocol solves a major problem with existing secret redistribution/updating schemes by giving group members a mechanism to identify malicious or faulty share holders in the first round, thus avoiding multiple protocol executions Hybrid Scheduling of Dynamic Task Graphs with Selective Duplication for Multiprocessors under Memory and Time Constraints Source IEEE Transactions on Parallel and Distributed Systems archive Volume 19 , Issue 7 (July 2008) Year of Publication: 2008 ISSN:1045-9219 ABSTRACT This paper presents a hybrid scheduling methodology for task graphs to multiprocessor embedded systems. The proposed methodology is designed for task graphs which are dynamic in nature due to the presence of conditional tasks as well as tasks whose execution times are unpredictable but bounded. We have presented the methodology as a three phase strategy in which task nodes are mapped to the processors in the first (static mapping) phase. In the second (selective duplication) phase some critical nodes are identified and duplicated for possible rescheduling at run-time depending on the code memory constraints of the processors. The third (online) phase is a run-time scheduling algorithm that performs list scheduling based on actual dynamics of the schedule up to the current time. We show that this technique provides better schedule length (up to 20%) compared to previous techniques which are predominantly static in nature with low overhead and comparable in complexity with existing online techniques. The effects of model parameters like number of processors, memory and various task graph parameters on performance are investigated in this paper. Location-Aided Multipath Routing Method for Mobile Ad Hoc Wireless Networks Ha Duyen Trung Benjapolakul, W. Dept. of Electr. Eng., Chulalongkorn Univ., Bangkok This paper appears in: Communications and Electronics, 2006. ICCE '06. First International Conference on Publication Date: 10-11 Oct. 2006 On page(s): 7 - 12 Number of Pages: 7 - 12 Location: Hanoi Digital Object Identifier: 10.1109/CCE.2006.350847 Posted online: 2007-04-23 10:14:40.0 Abstract In mobile ad hoc network (MANET), there are a number of routing schemes that have been proposed and several of these have been already extensively simulated or implemented as well. In this paper, we describe extension to routing algorithm based on location information to provide more efficient routing for mobile ad hoc networks. We propose replacing location-aided routing (LAR) with location-aided multipath routing (LAMR). We implemented LAMR through simulation using ns-2 and study its efficiency, and other properties. We use random waypoint mobility and compare LAMR approach versus ad hoc on-demand distant vector (AODV), ad hoc on-demand multipath distant vector (AOMDV) and LAR methods. Our simulation results demonstrate the performance benefits of LAMR over LAR and AODV in most movement scenarios. AOMDV does more frequent flooding of control packets and thus requires higher bandwidth usage than LAMR Provable Protection against Web Application Vulnerabilities Related to Session Data Dependencies Desmet, L.; Verbaeten, P.; Joosen, W.; Piessens, F. Software Engineering, IEEE Transactions on Volume 34, Issue 1, Jan.-Feb. 2008 Page(s):50 - 64 Digital Object Identifier 10.1109/TSE.2007.70742 Summary:Web applications are widely adopted and their correct functioning is mission critical for many businesses. At the same time, Web applications tend to be error prone and implementation vulnerabilities are readily and commonly exploited by attackers. The design of countermeasures that detect or prevent suc h vulnerabilities or protect against their exploitation is an important research challenge for the fields of software engineering and security engineering. In this paper, we focus on one specific type of implementation vulnerability, namely, broken dependencies on session data. This vulnerability can lead to a variety of erroneous behavior at runtime and can easily be triggered by a malicious user by applying attack techniques such as forceful browsing. This paper shows how to guarantee the absence of runtime errors due to broken dependencies on session data in Web applications. The proposed solution combines development -time program annotation, static verification, and runtime checking to provably protect against broken data dependencies. We have developed a prototype implementation of our approach, building on the JML annotation language and the existing static verification tool ESC/Java2, and we successfully applied our approach to a representative J2EE-based e-commerce application. We show that the annotation overhead is very small, that the performance of the fully automatic static verification is acceptable, and that the performance overhead of the runtime checking is limited. Mobile banking Assessment of today's mobile banking applications from the view of customer requirements Pousttchi, K. Schurig, M. Bus. Informatics & Syst. Eng., Augsburg Univ., Germany This paper appears in: System Sciences, 2004. Proceedings of the 37th Annual Hawaii International Conference on Publication Date: 5-8 Jan. 2004 On page(s): 10 pp. Number of Pages: lxxi+320 Digital Object Identifier: 10.1109/HICSS.2004.1265440 Posted online: 2004-02-26 10:51:06.0 Abstract Mobile banking is a subset of electronic banking which underlies not only the determinants of the banking business but also the special conditions of mobile commerce. This paper analyzes customer needs and expectations from the mobile applications' view and from the banking view in order to derive a defined set of requirements. Based on these results, existing mobile banking applications are assessed. Their major shortcomings are explained, opportunities for their improvement are shown and the impact of upcoming new technology is discussed. The outcome of the paper is a defined set of customer requirements to mobile banking applications, the identification and assessment of four standard types of current mobile banking applications and an explanation of major failure reasons along with opportunities for their improvement Performance of a speculative transmission scheme for scheduling-latency reduction Source IEEE/ACM Transactions on Networking (TON) archive Volume 16 , Issue 1 (February 2008) Year of Publication: 2008 ISSN:1063-6692 ABSTRACT Low latency is a critical requirement in some switching applications, specifically in parallel computer interconnection networks. The minimum latency in switches with centralized scheduling comprises two components, namely, the control -path latency and the data-path latency, which in a practical high-capacity, distributed switch implementation can be far greater than the cell duration. We introduce a speculative transmission scheme to significantly reduce the average control -path latency by allowing cells to proceed without waiting for a grant, under certai n conditions. It operates in conjunction with any centralized matching algorithm to achieve a high maximum utilization and incorporates a reliable delivery mechanism to deal with failed speculations. An analytical model is presented to investigate the efficiency of the speculative transmission scheme employed in a non -blocking N × NR input-queued crossbar switch with R receivers per output. Using this model, performance measures such as the mean delay and the rate of successful speculative transmissions are derived. The results demonstrate that the controlpath latency can be almost entirely eliminated for loads up to 50%. Our simulations confirm the analytical results Enabling Java-based VoIP backend platforms through JVM performance tuning Van Den Bossche, B. De Turck, F. Dhoedt, B. Demeester, P. Dept. of Inf. Technol., Ghent Univ., Belgium This paper appears in: VoIP Management and Security, 2006. 1st IEEE Workshop on Publication Date: 3 April 2006 On page(s): 41 - 46 Number of Pages: v+58 ISSN: Digital Object Identifier: 10.1109/VOIPMS.2006.1638121 Posted online: 2006-06-05 09:18:12.0 Abstract Software backend platforms are increasingly important in voice over IP (VoIP) service offering. Java, currently the most popular language, and the J2EE platform have evolved toward one of the important software frameworks for designing and implementing business logic on a telecom backend platform. Considering the popularity of Java, the question arises whether Java-based backend platforms can meet the requirements imposed by VoIP applications. SIP is an important example of a signaling protocol often used for VoIP. The SIP Servlet technology was developed for building Java based VoIP services. Therefore, we evaluated both the functionality and performance of the SIP Servlet specification and implementations. The evaluation procedure and the obtained results are reported upon. The influence of the Java virtual machine (JVM) tuning has been investigated and will be detailed in this paper. Moreover, performance of techniques based on the obtained results to optimize the garbage collector tuning of the JVM in general, and more specifically for VoIP related applications, will be presented. Performance evaluation of hardware models of Advanced Encryption Standard (AES) algorithm Yenuguvanilanka, J.; Elkeelany, O. Southeastcon, 2008. IEEE Volume , Issue , 3-6 April 2008 Page(s):222 - 225 Digital Object Identifier 10.1109/SECON.2008.4494289 Summary:In today's world most of the communication is done usin g electronic media. Data Security plays a vital role in such communication. Hence, there is a need to protect data from malicious attacks. Advanced Encryption Standard (AES), also known as Rijndael, is an encryption standard used for securing information. AES is a block cipher algorithm that has been analyzed extensively and is now used widely. The hardware implementation of AES algorithm is faster and more secure than software implementation. There are different hardware models to implement the Rijndael Encryption core. This paper addresses the performance of Rijndael AES Encryption algorithm of key length 128 bits. Two hardware models based on HDL and IP core are used to evaluate the performance of the algorithm. The encryption time and also the performance metrics such as size, speed and memory utilization are evaluated, using these models. Results are compared to a reference model and have shown an increase in the throughput per slice measure. Consumer Value Segments in Mobile Bill Paying Laukkanen, T. Kantanen, T. University of Kuopio This paper appears in: Information Technology: New Generations, 2006. ITNG 2006. Third International Conference on Publication Date: 10-12 April 2006 On page(s): 314 - 319 Digital Object Identifier: 10.1109/ITNG.2006.42 Posted online: 2006-04-24 14:03:43.0 Abstract The purpose of the present study was to explore consumer value in mobile banking and in mobile bill paying especially. Today mobile communications technologies offer an opportunity for vast additional value for consumers’ banking actions due to their always-on functionality and the option to bank virtually any time and anywhere. However, consumer value differs between individuals. It was measured in the context with five items namely privacy, accuracy, convenience, control and efficiency. An Internet questionnaire was developed and 82 usable responses from the users of mobile bill paying were collected. K-Means Clustering was used and five different value segments were identified. The results indicate that privacy and efficiency are the most valued items in mobile bill paying in general while individuals differing in their valuations. The study provides academics and bank managers with better understanding to consumer value in mobile banking and offers indications for value-based consumer segmentation. Optimal State Allocation for Multicast Communications With Explicit Multicast Forwarding De-Nian Yang Wanjiun Liao Nat. Taiwan Univ., Taipei; This paper appears in: Parallel and Distributed Systems, IEEE Transactions on Publication Date: April 2008 Volume: 19, Issue: 4 ISSN: 1045-9219 INSPEC Accession Number: 9903084 Digital Object Identifier: 10.1109/TPDS.2007.70754 Date Published in Issue: 2008-03-03 08:13:41.0 Abstract In this paper, we propose a scalable and adaptive multicast forwarding mechanism based on explicit multicast (Xcast). This mechanism optimizes the allocation of forwarding states in routers and can be used to improve the scalability of traditional IP multicast and source-specific multicast. Compared with previous work, our mechanism needs fewer routers in a multicast tree to store forwarding states and therefore leads to a more balanced distribution of forwarding states among routers. We focus on two problems and formulate each of them as an optimization problem. The first problem, referred to as minstate, minimizes the total number of routers that store forwarding states in a multicast tree. The second problem, referred to as balancestate, minimizes the maximum number of forwarding states stored in a router for all multicast groups, which is proved to be an NP-hard problem. We design a distributed algorithm that obtains the optimal solution to the first problem and propose an approximation algorithm for the second problem. We also prove that the approach adopted by most existing works to allocate forwarding states in the branching routers of a multicast tree is a special case of our mechanism. The simulation results show that the forwarding state allocation provided by previous work is concentrated on the backbone routers in the Internet, which may cause the scalability problem. In contrast, our mechanism can balance forwarding states stored among routers and reduce the number of routers that store the forwarding states for a multicast tree. Online Index Recommendations for High-Dimensional Databases Using Query Workloads Source IEEE Transactions on Knowledge and Data Engineering archive Volume 20 , Issue 2 (February 2008) Year of Publication: 2008 ISSN:1041-4347 ABSTRACT High-dimensional databases pose a challenge withrespect to efficient access. High-dimensional indexes do notwork because of the oft-cited "curse of dimensionality'. However, users are usually interested in querying data over a relativelysmall subset of the entire attribute set at a time. A potential solution is to use lower dimensional indexes that accurately represent the user access patterns. Query response using physical database design developed based on a static snapshot of the query workload may significantly degrade if the query patterns change.To address these issues, we introduce a parameterizable technique to recommend indexes based on index types frequently used forhigh -dimensional data sets and to dynamically adjust indexesas the underlying query workload changes. We incorporate aquery pattern change detection mechanism to determine when the access patterns have changed enough to warrant change inthe physical database design. By adjusting analysis parameters,we trade off analysis speed against analysis resolution. We perform experiments with a number of data sets, query sets, and parameters to show the effect that varying these characteristics has on analysis results. On the performance benefits of multihoming route control Source IEEE/ACM Transactions on Networking (TON) archive Volume 16 , Issue 1 (February 2008) Year of Publication: 2008 ISSN:1063-6692 ABSTRACT Multihoming is increasingly being employed by large enterprises and data centers to extract good performance and reliability from their ISP connections. Multihomed end networks today can employ a variety of route control products to optimize their Internet access performance and reliability. However, little is known about the tangible benefits that such products can offer, the mechanisms they employ and their trade-offs. This paper makes two important contributions. First, we present a study of the potential improvements in Internet round-trip times (RTTs) and transfer speeds from employing multihoming route control. Our analysis shows that multihoming to three or more ISPs and cleverly scheduling traffic across the ISPs can improve Internet RTTs and throughputs by up to 25% and 20%, respectively. However, a careful selection of ISPs is important to realize the performance improvements. Second, focusing on large enterprises, we propose and evaluate a wide-range of route control mechanisms and evaluate their design trade -offs. We implement the proposed schemes on a Linux-based Web proxy and perform a trace-based evaluation of their performance. We show that both passive and active measurement-based techniques are equally effective and could improve the Web response times of enterprise networks by up to 25% on average, compared to using a single ISP. We also outline several "best common practices" for the design of route control products. OCGRR: A New Scheduling Algorithm for Differentiated Services Networks Rahbar, Akbar Ghaffar Pour; Yang, Oliver Parallel and Distributed Systems, IEEE Transactions on Volume 18, Issue 5, May 2007 Page(s):697 - 710 Digital Object Identifier 10.1109/TPDS.2007.351711 Summary:We propose a new fair scheduling technique, called OCGRR (Output Controlled Grant-based Round Robin), for the support of DiffServ traffic in a core router. We define a stream to be the same-class packets from a given immediate upstream router destined to an output port of the core router. At each output port, streams may be isolated in separate buffers before being scheduled in a frame. The sequence of traffic transmission in a frame starts from higher-priority traffic and goes down to lower-priority traffic. A frame may have a number of small rounds for each class. Each stream within a class can transmit a number of packets in the frame based on its available grant, but only one packet per small round, thus reducing the intertransmission time from the same stream and achieving a smaller jitter and startup latency. The grant can be adjusted in a way to prevent the starvation of lower priority classes. We also verify and demonstra te the good performance of our scheduler by simulation and comparison with other algorithms in terms of queuing delay, jitter, and start-up latency. Mining E-Commerce Data to Analyze the Target Customer Behavior Yuantao Jiang; Siqin Yu Knowledge Discovery and Data Mining, 2008. WKDD 2008. International Workshop on Volume , Issue , 23-24 Jan. 2008 Page(s):406 - 409 Digital Object Identifier 10.1109/WKDD.2008.90 Summary:In the advent of the information era, e-commerce has developed rapidly and has become significant for every business. With the advanced information technologies, firms are now able to collect and store mountains of data describing their myriad offerings and diverse customer profiles, from which they seek to derive information about their customers' needs and wants. Traditional forecasting methods are no longer suitable for these business situations. This research used the principles of data mining to cluster customer segments by using k-means algorithm and data from Web log of various e-commerce Websites. Consequently, the results showed that there was a clear distinction between the segments in terms of customer behavior. Designing Less-Structured P2P Systems for the Expected High Churn Bustamante, F.E.; Qiao, Y. Networking, IEEE/ACM Transactions on Volume 16, Issue 3, June 2008 Page(s):617 - 627 Digital Object Identifier 10.1109/TNET.2007.903986 Summary:We address the problem of highly transient populations in unstructured and loosely structured peer-to-peer (P2P) systems. We propose a number of illustrative query-related strategies and organizational protocols that, by taking into consideration the expected session times of peers (their lifespans), yield systems with performance characteristics more resilient to the natural instability of their environments. We first demonstrate the benefits of lifespan-based organizational protocols in terms of end-application performance and in the context of dynamic and heterogeneous Internet environments. We do this using a number of currently adopted and proposed query-related strategies, including methods for query distribution, caching, and replication. We then show, through trace -driven simulation and wide-area experimentation, the performance advantages of lifespan-based, query-related strategies when layered over currently employed and lifespan-based organizational protocols. While merely illustrative, the evaluated strategies and protocols clearly demonstrate the advantages of considering peers' session time in designing widely-deployed P2P systems. Location-Based Spatial Query Processing with Data Sharing in Wireless Broadcast Environments Ku, Wei-Shinn; Zimmermann, Roger; Wang, Haixun Mobile Computing, IEEE Transactions on Volume 7, Issue 6, June 2008 Page(s):778 - 791 Digital Object Identifier 10.1109/TMC.2007.70791 Summary:Location-based spatial queries (LBSQs) refer to spatial queries whose answers rely on the location of the inquirer. Efficient processing of LBSQs is of critical importance with the ever-increasing deployment and use of mobile technologies. We show that LBSQs have certain unique characteristics that traditional spatial query processing in centralized databases does not address. For example, a significant challenge is presented by wireless broadcasting environments, which have excellent scalability but often exhibit high-latency database access. In this paper, we present a novel query processing technique that, while maintaining high scalability and accuracy, manages to reduce the latency considerably in answering location-based spatial queries. Our approach is based on peer-topeer sharing, which enables us to process queries without delay at a mobile host by using query results cached in its neighboring mobile peers. We demonstrate the feasibility of our approach through a probabilistic analysis, and we illustrate the appeal of our technique through extensive simulation results KEEL: A data mining software tool integrating genetic fuzzy systems Alcala-Fdez, J.; Garcia, S.; Berlanga, F.J.; Fernandez, A.; Sanchez, L.; del Jesus, M.J.; Herrera, F. Genetic and Evolving Systems, 2008. GEFS 2008. 3rd International Workshop on Volume , Issue , 4-7 March 2008 Page(s):83 - 88 Digital Object Identifier 10.1109/GEFS.2008.4484572 Summary:This work introduces the software tool KEEL to assess evolutionary algorithms for data mining problems including regression, classification, clustering, pattern mining and so on. It includes a big collection of genetic fuzzy system algorithms based on different approaches: Pittsburgh, Michigan, IRL and GCCL. It allows us to perform a complete analysis of any genetic fuzzy system in comparison to existing ones, including a statistical test module for comparison. The use of KEEL is illustrated through the analysis of one case study Intrusion Detection System Based on Data Mining Zhan Jiuhua Knowledge Discovery and Data Mining, 2008. WKDD 2008. International Workshop on Volume , Issue , 23-24 Jan. 2008 Page(s):402 - 405 Digital Object Identifier 10.1109/WKDD.2008.12 Summary:Analyzed recent IDS models, the development of IDS (Intrusion Detection System), and the current and gives a brief introduction to DM (Data Mining) technology. Presented a framework of IDS based on data mining for resolving the current problems IDS is facing. The system that pe rforms anomaly detection can detect intrusions known and unknown, reduce omissions and misstatements, improve accuracy and speed of intrusion detection and has good adaptive capacity and scalability Customer on the Move: Strategic Implications of Mobile Banking for Banks and Financial Enterprises Tiwari, R. Buse, S. Herstatt, C. Inst. of Technol. & Innovation Manage., Hamburg Univ. of Technol. This paper appears in: E-Commerce Technology, 2006. The 8th IEEE International Conference on and Enterprise Computing, E-Commerce, and E-Services, The 3rd IEEE International Conference on Publication Date: 2006 On page(s): 81 - 81 Number of Pages: 81 - 81 Location: San Francisco, CA Digital Object Identifier: 10.1109/CEC-EEE.2006.30 Posted online: 2006-07-10 09:49:00.0 Abstract The increased need/wish for mobility amongst various sections of the society, particularly amongst professionally active groups, is confronting credit institutions and other enterprises offering financial services, with challenges to adjust their service portfolio in a way to best suit the needs of their customers. On the other hand it also opens up a new arena of opportunities by making it possible to offer innovative, value-added services by actively inducing demand for new, mobilitycentric services. This paper examines strategic implications of changes in customer behavior as perceived by the banks. It introduces the findings of a bank survey conducted by the authors in Germany. The survey discovered that banks expect mobile banking to gain greater strategic relevance in near future and are positioning themselves not to be left behind Intrusion Detection in Homogeneous and Heterogeneous Wireless Sensor Networks Yun Wang; Xiaodong Wang; Bin Xie; Demin Wang; Agrawal, D.P. Mobile Computing, IEEE Transactions on Volume 7, Issue 6, June 2008 Page(s):698 - 711 Digital Object Identifier 10.1109/TMC.2008.19 Summary:Intrusion detection in Wireless Sensor Network (WSN) is of practical interest in many applications such as detecting an intruder in a battlefield. The intrusion detection is defined as a mechanism for a WSN to detect the existence of inappropriate, incorrect, or anomalous moving attackers. For this purpose, it is a fundamental issue to characterize the WSN parameters such as node density and sensing range in terms of a desirable detection probability. In this paper, we consider this issue according to two WSN models: homogeneous and heterogeneous WSN. Furthermore, we derive the detection probability by considering two sensing models: single-sensing detection and multiple-sensing detection. In addition, we discuss the network connectivity and broadcast reachability, which are necessary conditions to ensure the corresponding detection probability in a WSN. Our simulation results validate the analytical values for both homogeneous and heterogeneous WSNs iArgue: A Web-Based Argumentation System Supporting Collaboration Scripts with Adaptable Fading Bouyias, Y.N.; Demetriadis, S.N.; Tsoukalas, I.A. Advanced Learning Technologies, 2008. ICALT apos;08. Eighth IEEE International Conference on Volume , Issue , 1-5 July 2008 Page(s):477 - 479 Digital Object Identifier 10.1109/ICALT.2008.165 Summary:In this work we present the architecture of a Web-based system for argumentation (iArgue) that couples collaboration scripts with argumentation. The system takes into account latest research on collaboration scripts and implements script mechanisms for fading, rotation and repetition. The main goal of building this system is to investigate the fading mechanism and its impact on micro-script internalization and acquisition of argumentation skills. Secure Display and Secure Transactions Using a Handset Ghotra, Sandeep Singh Mandhan, Baldev Kumar Wei, Sam Shang Chun Song, Yi Steketee, Chris University of South Australia This paper appears in: Management of Mobile Business, 2007. ICMB 2007. International Conference on the Publication Date: 9-11 July 2007 On page(s): 51 - 51 Number of Pages: 51 - 51 Location: Toronto, ON, Canada Digital Object Identifier: 10.1109/ICMB.2007.56 Posted online: 2007-07-30 10:05:49.0 Abstract The security risks of using standard personal computers and operating systems for confidential transactions such as Internet banking are well-known. This is one reason for the interest in the mobile phone/ handset as a Personal Trusted Device (PTD). However, mobile phones have other shortcomings, for example the constraints of working with a small screen. This paper explores the use of a dedicated device ¿ a Secure Display Device (SDD) ¿ which, when used together with a mobile phone, combines the security of the phone as PTD with the characteristics, such as large display size, that can be offered by non -portable hardware. We describe three prototype SDD systems which we built in order to test these ideas. Two of them use a simulated SDD implemented entirely in software on a personal computer: a Mobile Banking system in which the SDD is used for its display capability, and a Payment System in which the SDD is an Automatic Teller Machine. In addition, we describe our work on a prototype hardware -based implementation of the Mobile Banking system that can be plugged into a standard computer monitor or TV. We conclude by analysing the lessons learnt and canvassing further use cases for SDD systems. Provably Secure Three-Party Authenticated Quantum Key Distribution Protocols DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TDSC.2007.13 January-March 2007 (vol. 4 no. 1) pp. 71-80 This work presents quantum key distribution protocols (QKDPs) to safeguard security in large networks, ushering in new directions in classical cryptography and quantum cryptography. Two three-party QKDPs, one with implicit user authentication and the other with explicit mutual authentication, are proposed to demonstrate the merits of the new combination, which include the following: 1) security against such attacks as man-in-the-middle, eavesdropping and replay, 2) efficiency is improved as the proposed protocols contain the fewest number of communication rounds among existing QKDPs, and 3) two parties can share and use a long-term secret (repeatedly). To prove the security of the proposed schemes, this work also presents a new primitive called the Unbiased -Chosen Basis (UCB) assumption. Web Usage Mining to Evaluate the Transfer of Learning in a Web -Based Learning Environment Chanchary, F.H. Haque, I. Khalid, S. Independent Univ., Dhaka; This paper appears in: Knowledge Discovery and Data Mining, 2008. WKDD 2008. International Workshop on Publication Date: 23-24 Jan. 2008 On page(s): 249-253 Location: Adelaide, SA, ISBN: 978-0-7695-3090-1 INSPEC Accession Number: 9905005 Digital Object Identifier: 10.1109/WKDD.2008.139 Current Version Published: 2008-03-12 Abstract Application of data mining for web log analysis has received significant attention in finding customers' behavioral pattern in e-commerce and learners' behavioral pattern in e- learning. While hit-counts indicate customers' interest in the product or purchasing behavior, a student's visits to a Learning Management System (LMS) do not necessarily involve transfer of learning. Addressing such complexity in e-learning, this study analyzed students' log of a Learning Management System (LMS) of two subjects at a university in Bangladesh, taught over six weeks duration. Data mining and statistical tools have been used to find relationships between students' LMS access behavior and overall performances. Results show that students having 'Low' access obtained poor grade, on campus access was higher than access from home. Background of students is very important for effective usage of web resources. Majority of the student considered LMS to be a quite helpful tool as teaching-learning method. Preparation and cleaning of the web-log files as well as application of data mining algorithms is important for learners' web usage analysis Mobile Banking Services Based On J2ME/J2EE Krol, Przemyslaw Nowak, Przemyslaw Sakowicz, Bartosz Department of Microelectronics and Computer Science, Technical University of Lodz, Poland. E-mail: sakowicz@dmcs.pl This paper appears in: CAD Systems in Microelectronics, 2007. CADSM '07. 9th International Conference - The Experience of Designing and Applications of Publication Date: 19-24 Feb. 2007 On page(s): 487 - 490 Number of Pages: 487 - 490 Location: Lviv, Ukraine Digital Object Identifier: 10.1109/CADSM.2007.4297626 Posted online: 2007-09-04 09:28:56.0 Abstract The article introduces alternative ways for providing mobile baking services aimed at J2ME enabled mobile devices. The scope of the discussed solution is the combination of J2EE and J2ME capabilities, means of overcoming the API and technical limitations, as well as security considerations. Additionally, proposals for further development are presented. Truth discovery with multiple conflicting information providers on the web Source Conference on Knowledge Discovery in Data archive Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents San Jose, California, USA SESSION: Industrial and government track short papers Year of Publication: 2007 ISBN:978-1-59593-609-7 ABSTRACT The world-wide web has become the most important information source for most of us. Unfortunately, there is no guarantee for the correctness of information on the web. Moreover, different web sites often provide conflicting information on a subject, such as different specifications for the same product. In this paper we propose a new problem called Veracity, i.e., conformity to truth, which studies how to find true facts from a large amount of conflicting information on many subjects that is provided by various web sites. We design a general framework for the Veracity problem, and invent an algorithm called TruthFinder, which utilizes the relationships between web sites and their information, i.e., a web site is trustworthy if it provides many pieces of true information, and a piece of information is likely to be true if it is provided by many trustworthy web sites. Our experiments show that TruthFinder successfully finds true facts among conflicting information, and identifies trustworthy web sites better than the popular search engines. Truth discovery with multiple conflicting information providers on the web Source Conference on Knowledge Discovery in Data archive Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents San Jose, California, USA SESSION: Industrial and government track short papers Year of Publication: 2007 ISBN:978-1-59593-609-7 ABSTRACT The world-wide web has become the most important information source for most of us. Unfortunately, there is no guarantee for the correctness of information on the web. Moreover, different web sites often provide conflicting information on a subject, such as different specifications for the same product. In this paper we propose a new problem called Veracity, i.e., conformity to truth, which stu dies how to find true facts from a large amount of conflicting information on many subjects that is provided by various web sites. We design a general framework for the Veracity problem, and invent an algorithm called TruthFinder, which utilizes the relationships between web sites and their information, i.e., a web site is trustworthy if it provides many pieces of true information, and a piece of information is likely to be true if it is provided by many trustworthy web sites. Our experiments show that TruthFinder successfully finds true facts among conflicting information, and identifies trustworthy web sites better than the popular search engines Bank Customers' Channel Preferences for Requesting Account Balances Laukkanen, T. Dept. of Bus. & Manage., Kuopio Univ. This paper appears in: System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on Publication Date: Jan. 2007 On page(s): 148a - 148a E-ISBN: 0-7695-2755-8 Number of Pages: 148a - 148a Location: Waikoloa, HI ISSN: 1530-1605 Digital Object Identifier: 10.1109/HICSS.2007.101 Posted online: 2007-01-29 15:00:17.0 Abstract Electronic applications in banking have enhanced customers' ability to control the balances and latest transactions of their bank accounts. Many banks today offer this service also via mobile channel further improving customers' capability to use the service anytime anywhere. This paper analyses online bank customers', namely Internet and mobile users', diverse electronic channel preferences for requesting account balances. Conjoint analysis is used in order to measure the utility these two groups of customers attach to different attributes of electronic channels. The results show that the two groups of customers face different needs in consumption of the service. While mobile users put the greatest attention to flexible service access point, the Internet users value the screen size of a device the most. The results suggest Nokia communicator type of device as an optimal channel for current mobile users, while those currently without experience in mobile banking show no interest in devices smaller than personal computer The Server Reassignment Problem for Load Balancing in Structured P2P Systems Chyouhwa Chen; Kun-Cheng Tsai Parallel and Distributed Systems, IEEE Transactions on Volume 19, Issue 2, Feb. 2008 Page(s):234 - 246 Digital Object Identifier 10.1109/TPDS.2007.70735 Summary:Application-layer peer-to-peer (P2P) networks are considered to be the most important development for next-generation Internet infrastructure. For these systems to be effective, load balancing among the peers is critical. Most structured P2P systems rely on ID-space partitioning schemes to solve the load imbalance problem and have been known to result in an imbalance factor of ominus(logN) in the zone sizes. This paper makes two contributions. First, we propose addressing the virtual-server-based load balancing problem systematically using an optimization-based approach and derive an effective algorithm to rearrange loads among the peers. We demonstrate the superior performance of our proposal in general and its advantages over previous strategies in particular. We also explore other important issues vital to the performance in the virtual server framework, such as the effect of the number of directories employed in the system and the performance ramification of user registration strategies. Second, and perhaps more significantly, we systematically characterize the effect of heterogeneity on load balancing algorithm performance and the conditions in which heterogeneity may be easy or hard to deal with based on an extensive study of a wide spectrum of load and capacity scenarios. Statistical techniques for detecting traffic anomalies through packet header data Source IEEE/ACM Transactions on Networking (TON) archive Volume 16 , Issue 3 (June 2008) table of contents Pages 562-575 Year of Publication: 2008 ISSN:1063-6692 ABSTRACT This paper proposes a traffic anomaly detector, operated in postmortem and in real-time, by passively monitoring packet headers of traffic. The frequent attacks on network infrastructure, using various forms of denial of service attacks, have led to an increased need for developing techniques for analyzing network traffic. If efficient analysis tools were available, it could become possible to detect the attacks, anomalies and to take action to contain the attacks appropriately before they have had time to propagate across the network. In this paper, we suggest a technique for traffic anomaly detection based on analyzing correlation of destination IP addresses in outgoing traffic at an egress router. This address correlation data are transformed using discrete wavelet transform for effective detection of anomalies through statistical analysis. Results from trace-driven evaluation suggest that proposed approach could provide an effective means of detecting anomalies close to the source. We also present a multidimensional indicator using the correlation of port numbers and the number of f lows as a means of detecting anomalies. Route Reservation in Ad Hoc Wireless Networks Source IEEE Transactions on Mobile Computing archive Volume 6 , Issue 1 (January 2007) Year of Publication: 2007 ISSN:1536-1233 ABSTRACT This paper investigates whether and when route reservation-based (RB) communication can yield better delay performance than non-reservation-based (NRB) communication in ad hoc wireless networks. In addition to posing this fundamental question, the requirements (in terms of route discovery, medium access control (MAC) protocol, and pipelining, etc.) for making RB switching superior to NRB switching are also identified. A novel analytical framework is developed and the network performance under both RB and NRB schemes is quantified. It is shown that if the aforementioned requirements are met, then RB schemes can indeed yield better delay performance than NRB schemes. This advantage, however, comes at the expense of lower throughput and goodput compared to NRB schemes. Rateless Forward Error Correction for Topology-Transparent Scheduling Syrotiuk, V.R.; Colbourn, C.J.; Yellamraju, S. Networking, IEEE/ACM Transactions on Volume 16, Issue 2, April 2008 Page(s):464 - 472 Digital Object Identifier 10.1109/TNET.2007.899018 Summary:Topology-transparent scheduling for mobile wireless ad hoc networks has been treated as a theoretical curiosity. This paper makes two contributions towards its practical deployment: (1) We generalize the combinatorial requirement on the schedules and show that the solution is a cover-free family. As a result, a much wider number and variety of constructions for schedules exist to match network conditions. (2) In simulation, we closely match the theoretical bound on expected throughput. The bound was derived assuming acknowledgments are available immediately. We use rate less forward error correction (RFEC) as an acknowledgment scheme with minimal computational overhead. Since the wireless medium is inherently unreliable, RFEC also offers some measure of automat ic adaptation to channel load. These contributions renew interest in topology transparent scheduling when delay is a principal objective. A mobile e-commerce solution Chi-Wei Lan Chun-Chou Chien Meng-Yen Hsieh Chen, I. Nat. Central Univ., Chung-Li, Taiwan ; This paper appears in: Multimedia Software Engineering, 2000. Proceedings. International Symposium on Publication Date: 11-13 Dec. 2000 On page(s): 215 - 222 Number of Pages: xiii+446 Meeting Date: 12/11/2000 - 12/13/2000 Location: Taipei Digital Object Identifier: 10.1109/MMSE.2000.897214 Posted online: 2002-08-06 23:26:08.0 Abstract With the popularity of WAP (Wireless Application Protocol), people can do mobile banking, mobile shopping and even access data on the Web via their cellular phones. In the future, there may be some other devices, such as PDAs (personal digital assistants) used by people to do mobile e-commerce, but different devices accept different data formats, and this means that we have to transform everything needed by these devices into many formats. In order to resolve this problem, we introduce an XML-based mobile e-commerce solution Rate and delay guarantees provided by Clos packet switches with load balancing Source IEEE/ACM Transactions on Networking (TON) archive Volume 16 , Issue 1 (February 2008) Year of Publication: 2008 ISSN:1063-6692 ABSTRACT The size of a single-hop cross-bar fabric is still limited by the technology, and the fabrics available on the market do not exceed the terabit capa city. A multihop fabric such as Clos network provides the higher capacity by using the smaller switching elements (SE). When the traffic load is balanced over the switches in a middle stage, all the traffic would get through the fabric, as long as the swit ch outputs are not overloaded. However, the delay that packets experience through the Clos switch depends on the granularity of flows that are balanced. We examine the maximum fabric utilization under which a tolerable delay is provided for various load balancing algorithms, and derive the general formula for this utilization in terms of the number of flows that are balanced. We show that the algorithms which balance flows with sufficiently coarse granularity provide both high fabric utilization and delay guarantees to the most sensitive applications. Since no admission control should be performed within the switch, the fast traffic-pattern changes can be accommodated in the proposed scalable architecture. J2ME end-to-end security for M-commerce Itani, W. Kayssi, A.I. Dept. of Electr. & Comput. Eng., American Univ. of Beirut, Lebanon This paper appears in: Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE Publication Date: 16-20 March 2003 Volume: 3 On page(s): 2015 - 2020 vol.3 Number of Pages: 3 vol.xxxviii+2138 ISSN: 1525-3511 Digital Object Identifier: 10.1109/WCNC.2003.1200696 Posted online: 2003-05-28 14:06:04.0 Abstract This paper shows an end-to-end application-layer security solution for wireless enterprise applications using the Java 2 Platform Micro Edition (J2ME). The proposed solution uses pure Java components to provide end-to-end client authentication and data confidentiality between wireless J2ME based clients and J2EE based servers. This solution can be implemented with the available limited resources of a Java MIDP device, without any modification to the underlying protocols or wireless network infrastructure. A mobile banking application is used to illustrate the implementation of the proposed solution. Network Border Patrol Albuquerque, C. Vickers, B.J. Suda, T. Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA; This paper appears in: INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE Publication Date: 26-30 March 2000 Volume: 1 On page(s): 322 - 331 vol.1 Number of Pages: 3 vol.(xxvi+1826) Meeting Date: 03/26/2000 - 03/30/2000 Location: Tel Aviv Digital Object Identifier: 10.1109/INFCOM.2000.832202 Posted online: 2002-08-06 23:06:07.0 Abstract The end-to-end nature of Internet congestion control is an important factor in its scalability and robustness. However, end-to-end congestion control algorithms alone are incapable of preventing the congestion collapse and unfair bandwidth allocations created by applications which are unresponsive to network congestion. In this paper, we propose and investigate a new congestion avoidance mechanism called Network Border Patrol (NBP). NBP relies on the exchange of feedback between routers at the borders of a network in order to detect and restrict unresponsive traffic flows before they enter the network. The NBP mechanism is compliant with the Internet philosophy of pushing complexity toward the edges of the network whenever possible. Simulation results show that NBP effectively eliminates congestion collapse, and that, when combined with fair queueing, NBP achieves approximately max-min fair bandwidth allocations for competing network flows Rate allocation and network lifetime problems for wireless sensor networks Source IEEE/ACM Transactions on Networking (TON) archive Volume 16 , Issue 2 (April 2008) table of contents Year of Publication: 2008 ISSN:1063-6692 ABSTRACT An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Since the objective of maximizing the sum of rates of all the nodes in the network can lead to a severe bias in rate allocation among the nodes, we advocate the use of lexicographical max-min (LMM) rate allocation. To calculate the LMM rate allocation vector, we develop a polynomial-time algorithm by exploiting the parametric analysis (PA) technique from linear program (LP), which we call serial LP with Parametric Analysis (SLP-PA). We show that the SLPPA can be also employed to address the LMM node lifetime problem much more efficiently than a state-of-the-art algorithm proposed in the literature. More important, we show that there exists an elegant duality relationship between the LMM rate allocation problem and the LMM node lifetime problem. Therefore, it is sufficient to solve only one of the two problems. Important insights can be obtained by inferring duality results for the other problem Ranked Reverse Nearest Neighbor Search Lee, K.C.K.; Baihua Zheng; Wang-Chien Lee Knowledge and Data Engineering, IEEE Transactions on Volume 20, Issue 7, July 2008 Page(s):894 - 910 Digital Object Identifier 10.1109/TKDE.2008.36 Summary:Given a set of data points P and a query point q in a multidimensional space, reverse nearest neighbor (RNN) query finds data points in P whose nearest neighbors are q. Reverse k-nearest neighbor (RkNN) query (where k ges 1) generalizes RNN query to find data points whose kNNs include q. For RkNN query semantics, q is said to have influence to all those answer data points. The degree of q's influence on a data point p (isin P) is denoted by kappap where q is the kappap-th NN of p. We introduce a new variant of RNN query, namely, ranked reverse nearest neighbor (RRNN) query, that retrieves t data points most influenced by q, i.e., the t data points having the smallest kappa's with respect to q. To answer this RRNN query efficiently, we propose two novel algorithms, kappacounting and kappa-browsing that are applicable to both monochromatic and bichromatic scenarios and are able to deliver results progressively. Through an extensive performance evaluation, we validate that the two proposed RRNN algorithms are superior to solutions derived from algorithms designed for RkNN query. Computation efficient multicast key distribution Lihao Xu Information Theory, 2003. Proceedings. IEEE International Symposium on Volume , Issue , 29 June-4 July 2003 Page(s): 425 Digital Object Identifier 10.1109/ISIT.2003.1228442 Summary: In this paper, we adopt a common model where session keys are issued and distributed by a central group controller (GC). The resources needed for the GC to distribute session keys to group members include communication, storage and computation resources. A new dynamic group key distribution scheme, in which the rekeying process that reduces computation complexity and yet maintain at least the same security degree of using symmetric encryption algorithms is also discussed Network border patrol: preventing congestion collapse and promoting fairness in the Internet Albuquerque, C. Vickers, B.J. Suda, T. Dept. of Networking & Data Link Control, Magis Networks, San Diego, CA, USA This paper appears in: Networking, IEEE/ACM Transactions on Publication Date: Feb. 2004 Volume: 12 , Issue: 1 On page(s): 173 - 186 ISSN: 1063-6692 Digital Object Identifier: 10.1109/TNET.2003.820248 Posted online: 2004-02-26 10:50:20.0 Abstract The Internet's excellent scalability and robustness result in part from the end -toend nature of Internet congestion control. End-to-end congestion control algorithms alone, however, are unable to prevent the congestion collapse and unfairness created by applications that are unresponsive to network congestion. To address these maladies, we propose and investigate a novel congestion -avoidance mechanism called network border patrol (NBP). NBP entails the exchange of feedback between routers at the borders of a network in order to detect and restrict unresponsive traffic flows before they enter the network, thereby preventing congestion within the network. Moreover, NBP is complemented with the proposed enhanced core-stateless fair queueing (ECSFQ) mechanism, which provides fair bandwidth allocations to competing flows. Both NBP and ECSFQ are compliant with the Internet philosophy of pushing complexity toward the edges of the network whenever possible. Simulation results show that NBP effectively eliminate s congestion collapse and that, when combined with ECSFQ, approximately maxmin fair bandwidth allocations can be achieved for competing flows. Quiver: Consistent and Scalable Object Sharing for Edge Services Reiter, M.K.; Samar, A. Parallel and Distributed Systems, IEEE Transactions on Volume 19, Issue 7, July 2008 Page(s):878 - 889 Digital Object Identifier 10.1109/TPDS.2007.70790 Summary:We present Quiver, a system that coordinates service proxies placed at the "edge" of the Internet to serve distributed clients accessing a service involving mutable objects. Quiver enables these proxies to perform consistent accesses to shared objects by migrating the objects to proxies performing operations on those objects. These migrations dramatically improve performance when operations involving an object exhibit geographic locality, since migrating this object into the vicinity of proxies hosting these operations will benefit all such operations. Other workloads benefit from Quiver, dispersing the computation load across the proxies and saving the costs of sending operation parameters over the wide area when these are large. Quiver also supports optimizations for single -object reads that do not involve migrating the object. We detail the protocols for implem enting object operations and for accommodating the addition, involuntary disconnection, and voluntary departure of proxies. We also evaluate Quiver through experiments on PlanetLab. Finally, we discuss the use of Quiver to build an e-commerce application and a distributed network traffic modeling service. A Fully Distributed Proactively Secure Threshold-Multisignature Scheme van der Merwe, J.; Dawoud, D.S.; McDonald, S. Parallel and Distributed Systems, IEEE Transactions on Volume 18, Issue 4, April 2007 Page(s):562 - 575 Digital Object Identifier 10.1109/TPDS.2007.1005 Summary:Threshold-multisignature schemes combine the properties of threshold group-oriented signature schemes and multisignature schemes to yield a signature scheme that allows a threshold (t) or more group members to collaboratively sign an arbitrary message. In contrast to threshold group signatures, the individual signers do not remain anonymous, but are publicly identifiable from the information contained in the valid threshold-multisignature. The main objective of this paper is to propose such a secure and efficient threshold-multisignature scheme. The paper uniquely defines the fundamental properties of threshold-multisignature schemes and shows that the proposed scheme satisfies these properties and eliminates the latest attacks to which other similar schemes are subject. The efficiency of the proposed scheme is analyzed and shown to be superior to its counterparts. The paper also proposes a discrete logarithm based distributed-key management infrastructure (DKMI), which consists of a round optimal, publicly verifiable, distributed-key generation (DKG) protocol and a one round, publicly verifiable, distributed-key redistribution/ updating (DKRU) protocol. The round optimal DKRU protocol solves a major problem with existing secret redistribution/updating schemes by giving group members a mechanism to identify malicious or faulty share holders in the first round, thus avoiding multiple protocol executions Towards Practical Network-to-Network Congestion Control Riihijarvi, J. Lili Wu Mahonen, P. RWTH Aachen University, Aachen, Germany This paper appears in: Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies , 2006. ICN/ICONS/MCL 2006. International Conference on Publication Date: 23-29 April 2006 On page(s): 53 - 53 Digital Object Identifier: 10.1109/ICNICONSMCL.2006.214 Posted online: 2006-05-08 09:30:21.0 Abstract We discuss the use of congestion control mechanisms at the network edges to complement traditional end-to-end congestion control. We argue that such mechanisms will be necessary in the future to deal with unresponsive and even misbehaving traffic flows. A flexible congestion control architecture is presented, together with concrete protocol designs building on the Network Border Patrol proposal. More precisely, we show how to integrate flexible flow aggregation and connection admission control mechanisms into the NBP framework, together with improvements to the original scheduling mechanism. Performance evaluation using the ns-2 simulator is presented, and possibilities for future enhancements and open issues are also discussed. Optimal multicast routing: modeling and discussion Yue Liu Bao-Xian Zhang Chang-Jia Chen Sch. of Electron. & Inf. Eng., Northern Jiaotong Univ., Beijing, China; This paper appears in: Communication Technology Proceedings, 2000. WCC ICCT 2000. International Conference on Publication Date: 21-25 Aug. 2000 Volume: 2 On page(s): 1449 - 1452 vol.2 Number of Pages: 2 vol. 1788 Meeting Date: 08/21/2000 - 08/25/2000 Location: Beijing Digital Object Identifier: 10.1109/ICCT.2000.890933 Posted online: 2002-08-06 23:40:04.0 Abstract Routing is an important issue in multicast and has great influence on system performance and network resource usage. To make maximum use of the network resources, the total cost in the system should be minimized, this corresponds to the optimal multicast routing (OMR) problem. Until now, there has been little work done on the modeling and theoretical analysis of this problem. The purpose of this paper is to present a theoretical framework for the OMR problem. A system -optimal multicast routing (SOMR) model is proposed and several conclusions are derived from this model, which give an insight into the OMR problem: 1) in the presence of block effect, the OMR problem has a unique link flow solution, 2) the optimal multicast routing is achieved only if the traffics are distributed on the minimal first derivative cost (MFDC) trees, and 3) even if the minimal tree (the Steiner tree) is built for each group, it usually doesn't mean the optimal solution A Grid-Powered Framework to Support Courses on Distributed Programmin g Maggi, P.; Sisto, R. Education, IEEE Transactions on Volume 50, Issue 1, Feb. 2007 Page(s):27 - 33 Digital Object Identifier 10.1109/TE.2006.879806 Summary:Grading programming assignments of courses on distributed programming can greatly benefit from extensive testing, especially if quality aspects such as portability, robustness, security, and performance have to be evaluated. This paper presents a framework that was developed at the Turin Polytechnic, Turin, Italy, to enable seamless and fast implementation of Web portals for automated management of student programming assignments. By using a computational grid facility to schedule testing jobs on different hosts, the framework offers high flexibility and scalability, thus enabling computationally intensive tests and some kinds of distributed tests, such as portability tests and field tests, which otherwise would be difficult to automate. The grid can be made of ordinary and even nondedicated or dismissed PCs, which, according to the authors' experience, is enough to offer students online extensive testing services. The framework was successfully used in two courses on distributed programming, located at different sites, partially overlapped in time, and attended by a total of 60 students. However, the framework should be scalable enough to work with increasing numbers of students and courses Optimal multicast routing in wireless ad hoc sensor networks Ping Yuan Chunlin Ji Yangyang Zhang Yue Wang Res. Center of Networks & Commun., Northeastern Univ., Shen Yang, China This paper appears in: Networking, Sensing and Control, 2004 IEEE International Conference on Publication Date: 21-23 March 2004 Volume: 1 On page(s): 367 - 371 Vol.1 Number of Pages: xxviii+1428 ISSN: 1810-7869 Digital Object Identifier: 10.1109/ICNSC.2004.1297464 Posted online: 2004-05-18 08:58:26.0 Abstract Multicasting in wireless ad hoc sensor networks, i.e. one terminal sends the same data to multiple receivers, is an active field of research. In this paper, th e optimal energy-aware multicast routing was studied in ad hoc sensor networks. The optimal multicast routing problem was formulated as an integer linear programming. A revised particle swarm optimization (PSO) algorithm, multi -phase discrete PSO was applied to solve this NP-hard problem in a distributed computing manner. To deal with the constraints e.g. connectivity constraint and broadcast constraint, a problem-independent constraint handling technique was proposed by introducing symbiosis mechanism to PSO algorithm. The performance of the algorithm was studied with different kinds of networks. Experiment results show that the presented algorithms can effectively solve the multicast routing problem in a reasonable time, even for large scale networks with numerous receivers. Routing multicast connections with optimal network cost in ATM networks Xiaohua Jia Lee, C.H. Ng, J.M. Chan, E. Dept. of Comput. Sci., Queensland Univ., Qld., Australia; This paper appears in: Computer Communications and Proceedings., Fourth International Conference on Publication Date: 20-23 Sept. 1995 On page(s): 66 - 71 Number of Pages: xviii+683 Meeting Date: 09/20/1995 - 09/23/1995 Location: Las Vegas, NV Digital Object Identifier: 10.1109/ICCCN.1995.540103 Posted online: 2002-08-06 20:11:09.0 Networks, 1995. Abstract Many applications of ATM networks require a multicast function, which is used to send the same packet to a group of destinations. This paper proposed an algorithm for multicast routing in ATM networks. We define the network cost of routing as the combination of the cast of establishing connections, the cost of the overall bandwidth and the cost of the overall switching. Our routing algorithm works on the original topology of ATM networks with physical switches and physical links and considers the different switching functions of VP (virtual path) switches and VC (virtual channel) switches. It generates optimal multicast routing with minimal overall network cost. Simulations have been carried out to compare the quality of the routing generated by our algorithm with those of other major algorithms Content-based image retrieval using both positive and negative feedback Feng-Cheng Chang Hsueh-Ming Hang Dept. of Electron. Eng., Nat. Chiao Tung Univ., Taiwan This paper appears in: Multimedia and Expo, 2004. ICME '04. 2004 IEEE International Conference on Publication Date: 27-30 June 2004 Volume: 3 On page(s): 1887 - 1890 Vol.3 Number of Pages: 3 vol (xxviii+2242) ISSN: Posted online: 2005-02-22 08:35:52.0 Abstract Satisfactory content-based search has long been considered a difficult task. One critical step in the content-based search is to estimate the user intention (perception) based on the query images. Our proposal is developed based on the combined weighted low-level image features. One distinct concept of our algorithm is that a sparse (scattered) feature is considered to be less important (which is not necessarily perceptually dissimilar). The other concept is that we define the image feature stability and include it in calculating the similarity measure. Yet, the third concept is using negative feedback as a pruning criterion to improve searching accuracy. Finally, quantitative simulation results are used to show the effectiveness of these concepts. Information retrieval based on conceptual network Junfang Zeng Yiping Yang Internet Res. & Dev. Center, Chinese Acad. of Sci., Beijing, China This paper appears in: Natural Language Processing and Knowledge Engineering, 2003. Proceedings. 2003 International Conference on Publication Date: 26-29 Oct. 2003 On page(s): 380 - 387 Number of Pages: 854 ISSN: Digital Object Identifier: 10.1109/NLPKE.2003.1275935 Posted online: 2004-03-22 16:55:34.0 Abstract With information exploding on the Internet, existing search engines encounter difficulty in accurate document positioning. Powerful content-based search engines are in need for helping us find useful information accurately and efficiently. Based on our self-established conceptual network platform ConNet, a novel information retrieval framework is discussed, which is being used to support semantic matching and concept based searching for multiple domains and multiple languages across widely distributed Internet environment. We developed ConNet platform under the conceptual network model (CNM), and mid-stage experiments have shown some encouraging results to illustrate our idea. A Precise Termination Condition of the Probabilistic Packet Marking Algorit hm DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TDSC.2007.70229 January-March 2008 (vol. 5 no. 1) pp. 6-21 ABSTRACT The probabilistic packet marking (PPM in short) algorithm is a promising way to discover the Internet map, or an attack graph, that the attack packets traversed during a distributed denial-of-service attack. Yet, the PPM algorithm is not prefect as its termination condition is not well-defined in the literature. More importantly, without a proper termination condition, the attack graph constructed by the PPM algorithm would be wrong with a very high probability. In this work, we provide a precise termination condition for the PPM algorithm and name the new algorithm the rectified probabilistic packet marking (RPPM in short) algorithm. The most significant merit of the RPPM algorithm is that when the algorithm terminates, the algorithm guarantees that the constructed attack graph is correct with a specified level of confidence. We carry out simulations on the RPPM algorithm and show that the RPPM algorithm can guarantee the correctness of the constructed attack graph under 1) different probabilities that a router marks the attack packets, and 2) different structures of the network graph. The RPPM algorithm provides an autonomous way for the original PPM algorithm to determine its termination, and it is a promising mean to enhance the reliability of the PPM algorithm. Content-based search and annotations in multimedia digital libraries Arias, J.A. Sanchez, J.A. Lab. of Interactive & Cooperative Technol., CENTIA, Puebla, Mexico This paper appears in: Computer Science, 2003. ENC 2003. Proceedings of the Fourth Mexican International Conference on Publication Date: 8-12 Sept. 2003 On page(s): 109 - 116 Number of Pages: xiii+347 ISSN: Digital Object Identifier: 10.1109/ENC.2003.1232883 Posted online: 2003-09-23 16:42:57.0 Abstract This paper describes a solution for the organization and management of multimedia collections in digital libraries. Video U-DL-A (VUDLA) is an extension to a digital library that allows for storage, indexing and annotation of multimedia documents. It functions in such way that text- and image-based queries can be issued in order to retrieve specific scenes from digital video collections. Technologies such as image and speech processing, video streaming, multimedia databases, information retrieval and graphical user interfaces are integrated to produce a novel multimedia, multimodal environment which re-evaluates text as an important medium for knowledge transmission. We have developed a fully operational testbed to explore multimedia data properties and organization possibilities as well as a wide range of practical applications A Tree-Based Peer-to-Peer Network with Quality Guarantees DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2007.70798 August 2008 (vol. 19 no. 8) pp. 1099-1110 ABSTRACT Peer-to-peer (P2P) networks often demand scalability, low communication latency among nodes, and low system-wide overhead. For scalability, a node maintains partial states of a P2P network and connects to a few nodes. For fast communication, a P2P network intends to reduce the communication latency between any two nodes as much as possible. With regard to a low system -wide overhead, a P2P network minimizes its traffic in maintaining its performance efficiency and functional correctness. In this paper, we present a novel tree -based P2P network with low communication delay and low system-wide overhead. The merits of our tree-based network include: $(i)$ a tree-shaped P2P network which guarantees that the degree of a node is constant in probability regardless of the system size. The network diameter in our tree-based network increases logarithmically with an increase of the system size. Specially, given a physical network with a power-law latency expansion property, we show that the diameter of our tree network is constant. $(ii)$ Our proposal has the provable performance guarantees. We evaluate our proposal by rigorous performance analysis, and validate by extensive simulations. Index Terms: Distributed networks, Distributed Systems, Multicast Citation: Hung-Chang Hsiao, Chih-Peng He, "A Tree-Based Peer-to-Peer Network with Quality Guarantees," IEEE Transactions on Parallel and Distributed Syste ms, vol. 19, no. 8, pp. 1099-1110, Aug., 2008 I-WAP: an intelligent WAP site management system Gwo-Jen Hwang Tseng, J.C.R. Yu-San Huang Dept. of Inf. Manage., Nat. Chi Nan Univ., Nan-Tou, Taiwan This paper appears in: Mobile Computing, IEEE Transactions on Publication Date: Apr-Jun 2002 Volume: 1 , Issue: 2 On page(s): 82 - 95 ISSN: 1536-1233 Digital Object Identifier: 10.1109/TMC.2002.1038345 Posted online: 2002-12-10 17:08:43.0 Abstract The popularity regarding wireless communications is such that more and more WAP sites have been developed with wireless markup language (WML). Meanwhile, to translate hypertext markup language (HTML) pages into proper WML ones becomes imperative since it is difficult for WAP users to read most contents designed for PC users via their mobile phone screens. However, for those sites that have been maintained with hypertext markup language (HTML), considerable time and manpower costs will be incurred to rebuild them with WML. In this paper, we propose an intelligent WAP site management system to cope with these problems. With the help of the intelligent management system, the original contents of HTML Web sites can be automatically translated to proper WAP content in an efficient way. As a consequence, the costs associated with maintaining WAP sites could be significantly reduced. The management system also allows the system manager to define the relevance of numerals and keywords for removing unimportant or meaningless contents. The original contents will be reduced and reorganized to fit the size of mobile phone screens, thus reducing the communication cost and enhancing readability. Numerical results gained through various experiments have evinced the effective performance of the WAP management system. A Web Usage Mining Framework for Mining Evolving User Profiles in Dynamic Web Sites February 2008 (vol. 20 no. 2) pp. 202-215 ABSTRACT In this paper, we present a complete framework and findings in mining web usage patterns from Web log files of a real website that has all the challenging aspects of real life web usage mining, including evolving user profiles and external data describing an ontology of the web content. Even though the website under study is part of a non-profit organization that does not "sell" any products, it was crucial to understand "who" the users were, "what" they looked at, and "how their interests changed with time", all of which are important questions in Customer Relationship Management (CRM). Hence, we present an approach to discover and track evolving user profiles. We also describe how to enrich the discovered user profiles with explicit information need that is inferred from search queries extracted from Web log data. Profiles are also enriched with other domain specific info rmation facets that give a panoramic view of the discovered mass usage modes. An objective validation strategy is also used to assess the quality of the mined profiles, and in particular, their adaptability in the face of evolving user behavior. Building a service-oriented ebanking platform Shan, T.C. Wachovia Corp., Charlotte, NC, USA This paper appears in: Services Computing, 2004. (SCC 2004). Proceedings. 2004 IEEE International Conference on Publication Date: 15-18 Sept. 2004 On page(s): 237 - 244 Number of Pages: xxi+653 ISSN: Digital Object Identifier: 10.1109/SCC.2004.1358011 Posted online: 2004-11-22 07:25:34.0 Abstract This paper describes an e-business solution model designed in Wachovia Corporation, one of the top largest banks in USA, serving millions of customers with a variety of financial services such as online banking, billpay and brokerage. A pragmatic process is designed to migrate conventional n-tier ecommerce systems to a service-oriented computing paradigm, which comprises service-oriented architecture (SOA), integration (SOI), process (SOP) and management (SOM). A hybrid methodology is developed to leverage the benefits of both top -down and bottom-up approaches. E-business patterns are applied to categorize various online services, which are subsequently mapped to appropriate technologies, products/tools, and infrastructure. Common business functionalities are built as shared services to be reused across channels. A multilayer model is conceived to converge the latest technologies such as portal, process orchestration, Web services, service bus, grid computing, business rules, etc. Best practices as well as lessons learned are discussed in the context. Adaptive Bilateral Filter for Sharpness Enhancement and Noise Removal Buyue Zhang; Allebach, J.P. Image Processing, 2007. ICIP 2007. IEEE International Conference on Volume 4, Issue , Sept. 16 2007-Oct. 19 2007 Page(s):IV - 417 - IV - 420 Digital Object Identifier 10.1109/ICIP.2007.4380043 Summary:In this paper, we present an adaptive bilateral filter (ABF) for sharpness enhancement and noise removal. ABF sharpens an image by increasing the slope of the edges without producing overshoot or undershoot. Our new approach to slope restoration significantly differs from the previous slope restoration algorithms in that ABF does not involve detecting edge orientations or edge profiles. Compared with the bilateral filter, ABF restored images are significantly sharper. Compared with an unsharp mask (USM) based sharpening method the optimal USM (OUM), ABF restored edges are as sharp as those rendered by the OUM, but without halo. ABF also outperforms the bilateral filter and the OUM in noise removal. Case study: online banking security Hole, K.J. Moen, V. Tjostheim, T. Bergen Univ., Norway This paper appears in: Security & Privacy Magazine, IEEE Publication Date: March-April 2006 Volume: 4 , Issue: 2 On page(s): 14 - 20 ISSN: 1540-7993 Digital Object Identifier: 10.1109/MSP.2006.36 Posted online: 2006-04-18 14:13:33.0 Abstract A description of attack scenarios over a two-year period illustrates several key security issues with Internet banking systems in Norway. Given the banks' security-by-obscurity policy, online customers knew little about security levels and falsely believed their assets were safe. An Adaptive Programming Model for Fault-Tolerant Distributed Computing Sergio Gorender; Raimundo Jose de Araujo Macedo; Michel Raynal Dependable and Secure Computing, IEEE Transactions on Volume 4, Issue 1, Jan.-March 2007 Page(s):18 - 31 Digital Object Identifier 10.1109/TDSC.2007.3 Summary:The capability of dynamically adapting to distinct runtime conditions is an important issue when designing distributed systems where negotiated quality of service (QoS) cannot always be delivered between processes. Providing fault tolerance for such dynamic environments is a challenging task. Considering such a context, this paper proposes an adaptive programming model for fault -tolerant distributed computing, which provides upper-layer applications with process state information according to the current system synchrony (or QoS). The underlying system model is hybrid, composed by a synchronous part (where there are time bounds on processing speed and message delay) and an asynchronous part (where there is no time bound). However, such a composition can vary over time, and, in particular, the system may become totally asynchronous (e.g., when the underlying system QoS degrade) or totally synchronous. Moreover, pro cesses are not required to share the same view of the system synchrony at a given time. To illustrate what can be done in this programming model and how to use it, the consensus problem is taken as a benchmark problem. This paper also presents an implementation of the model that relies on a negotiated quality of service (QoS) for communication channels Applications of Workflow in Supply Chain Management: A Case Study Dapeng Sun Xiaoping Zhang Ming Yu Res. Center for Modern Logistics, Tsinghua Univ., Shenzhen This paper appears in: Service Operations and Logistics, and Informatics, 2006. SOLI '06. IEEE International Conference on Publication Date: June 2006 On page(s): 540 - 544 Number of Pages: 540 - 544 Location: Shanghai Digital Object Identifier: 10.1109/SOLI.2006.328944 Posted online: 2007-03-12 12:43:57.0 Abstract Supply chain management is increasingly important in modern enterprises. Various information systems have been developed in the domain of services -oriented supply chain management. But as the complexity of supply chain, there are still two big problems. On the one hand, most of the traditional supply chain management systems can not really achieve integration among different organizations. On the other hand, few systems can adapt the changes of supply chain very quickly. In this paper, we attempted to achieve the combination of workflow management and supply chain management. Based on the theories of workflow, we developed a process-oriented and event-driven supply chain management system which could be much more flexible, quickly and efficient An agent-based framework for testing Web applications Kung, D. Computer Software and Applications Conference, 2004. COMPSAC 2004. Proceedings of the 28th Annual International Volume 2, Issue , 28-30 Sept. 2004 Page(s): 174 - 177 vol.2 Digital Object Identifier 10.1109/CMPSAC.2004.1342704 Summary: Software testing in general and Web applications testing in particular are knowledge-driven, labor intensive activities, which are best performed by intelligent, autonomous agents. The proposed framework is based on the Belief Desire-Intention (BDI) model of rational agents and the Unified Modeling Language (UML). We describe how Web applications testing can be modeled and reasoned using the framework. E-business and Information Integration in Supply Chain Management Zhao, X. Hui Zhao Jianrong Hou Coll. of Bus., Tennessee Univ., Knoxville, TN This paper appears in: Service Operations and Logistics, and Informatics, 2006. SOLI '06. IEEE International Conference on Publication Date: June 2006 On page(s): 919 - 924 Number of Pages: 919 - 924 Location: Shanghai Digital Object Identifier: 10.1109/SOLI.2006.329033 Posted online: 2007-03-12 12:44:04.0 Abstract The central theme of supply chain management is integration. General system theory provides the theoretical framework of integration, whereas information integration is the foundation of broader supply chain integration. E -business opens up communication and enlarges networking opportunities and thus tremendously affects information integration. By analyzing one recent trend of e -business, the ehub, we explore the mechanism of information integration as well as managerial and technical limitations. Although there are many challenges, e-hubs create value by aggregating buyers and sellers, creating marketplace liquidity, and reducing transaction cost. E-hubs also provide exchange information on transportation and logistics. Therefore, e-hubs could be a crucial solution to supply chain management An Efficient Clustering Scheme to Exploit Hierarchical Data in Network Traffic Analysis June 2008 (vol. 20 no. 6) pp. 752-767 ABSTRACT There is significant interest in the data mining and network management communities about the need to improve existing techniques for clustering multi variate network traffic flow records so that we can quickly infer underlying traffic patterns. In this paper we investigate the use of clustering techniques to identify interesting traffic patterns from network traffic data in an efficient manner. We develop a framework to deal with mixed type attributes including numerical, categorical and hierarchical attributes for a one-pass hierarchical clustering algorithm. We demonstrate the improved accuracy and efficiency of our approach in comparison to previous work on clustering network traffic. Index Terms: Traffic analysis, Network management, Network monitoring, Clustering, classification, and association rules Citation: Abdun Naser Mahmood, Christopher Leckie, Parampalli Udaya, "An Efficient Clustering Scheme to Exploit Hierarchical Data in Network Traffic Analysis," IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 6, pp. 752 -767, Jun., 2008 Agent-Supported Web Service Composition for Supply Chain Management Minhong Wang Cheung, W.K. W.K. Cheung Zongwei Lou Hong Kong Baptist Univ. This paper appears in: E-Commerce Technology, 2006. The 8th IEEE International Conference on and Enterprise Computing, E-Commerce, and E-Services, The 3rd IEEE International Conference on Publication Date: 2006 On page(s): 43 - 43 Number of Pages: 43 - 43 Location: San Francisco, CA Digital Object Identifier: 10.1109/CEC-EEE.2006.10 Posted online: 2006-07-10 09:48:59.0 Abstract Web service composition requires allocating suitable resources to a set of services that constitute a composite service. The problem is complicated by the fact that the availability of resources may be uncertain and change over time, and the constraints of component services may not be completely known in advance. It needs the ability to rapidly and dynamically identify suitable resources and coordinate them under various constraints. In this paper, an agent mediated coordination framework for Web service composition is proposed in the context of e-supply chain management (e-SCM). Global constraints to be satisfied by the composite service are first translated into local constraints of its component services. Service brokering agents dedicated to discovery of component services interact autonomously with each others for refining the local constraints based on the candidate services' instantaneous status until a sufficiently good composition is identified. Although presented in the context of supply chain management, this framework is applicable to other problem areas where a set of services are composed as a result of a large resource repository to be searched, scheduled and coordinated, especially in a real-time fashion An Efficient Clustering Scheme to Exploit Hierarchical Data in Network Traffic Analysis June 2008 (vol. 20 no. 6) pp. 752-767 ABSTRACT There is significant interest in the data mining and network management communities about the need to improve existing techniques for clustering multi variate network traffic flow records so that we can quickly infer underlying traffic patterns. In this paper we investigate the use of clustering techniques to identify interesting traffic patterns from network traffic data in an efficient manner. We develop a framework to deal with mixed type attributes including numerical, categorical and hierarchical attributes for a one-pass hierarchical clustering algorithm. We demonstrate the improved accuracy and efficiency of our approach in comparison to previous work on clustering network traffic. Index Terms: Traffic analysis, Network management, Network monitoring, Clustering, classification, and association rules Citation: Abdun Naser Mahmood, Christopher Leckie, Parampalli Udaya, "An Efficient Clustering Scheme to Exploit Hierarchical Data in Network Traffic Analysis," IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 6, pp. 752 -767, Jun., 2008 Computation efficient multicast key distribution Lihao Xu Information Theory, 2003. Proceedings. IEEE International Symposium on Volume , Issue , 29 June-4 July 2003 Page(s): 425 Digital Object Identifier 10.1109/ISIT.2003.1228442 Summary: In this paper, we adopt a common model where session keys are issued and distributed by a central group controller (GC). The resources needed for the GC to distribute session keys to group members include communication, storage and computation resources. A new dynamic group key distribution scheme, in which the rekeying process that reduces computation complexity and yet maintain at least the same security degree of using symmetric encryption algorithms is also discussed. Distributed data mining in credit card fraud detection Chan, P.K. Fan, W. Prodromidis, A.L. Stolfo, S.J. Florida Int. Univ., Miami, FL, USA ; This paper appears in: Intelligent Systems and Their Applications, IEEE [see also IEEE Intelligent Systems] Publication Date: Nov.-Dec. 1999 Volume: 14 , Issue: 6 On page(s): 67 - 74 ISSN: 1094-7167 Digital Object Identifier: 10.1109/5254.809570 Posted online: 2002-08-06 22:49:29.0 Abstract Credit card transactions continue to grow in number, taking an ever-larger share of the US payment system and leading to a higher rate of stolen account numbers and subsequent losses by banks. Improved fraud detection thus has become essential to maintain the viability of the US payment system. Banks have used early fraud warning systems for some years. Large scale data-mining techniques can improve the state of the art in commercial practice. Scalable techniques to analyze massive amounts of transaction data that efficiently compute fraud detectors in a timely manner is an important problem, especially for e -commerce. Besides scalability and efficiency, the fraud-detection task exhibits technical problems that include skewed distributions of training data and nonuniform cost per error, both of which have not been widely studied in the knowledge -discovery and data mining community. In this article, we survey and evaluate a number of techniques that address these three main issues concurrently. Our proposed methods of combining multiple learned fraud detectors under a "cost model" are general and demonstrably useful; our empirical results demonstrate that we can significantly reduce loss due to fraud through distributed data mining of fraud models Using the Conceptual Cohesion of Classes for Fault Prediction in Object -Oriented Systems March/April 2008 (vol. 34 no. 2) pp. 287-300 ABSTRACT High cohesion is a desirable property of software, as it positive ly impacts understanding, reuse, and maintenance. Currently proposed measures for cohesion in Object-Oriented (OO) software reflect particular interpretations of cohesion and capture different aspects of cohesion. The paper proposes a new measure for the cohesion of classes in an OO software system, based on the analysis of the unstructured information embedded in the source code, such as comments and identifiers. The measure, named the Conceptual Cohesion of Classes (C3), is inspired from the mechanisms used to measure textual coherence in cognitive psychology and computational linguistics. The paper presents the principles and the technology that stand behind the C3 measure. A large case study on three open source software systems is presented, which compa res the new measure with an extensive set of existing metrics and uses them to construct models that predict software faults. The case study shows that the novel measure captures different aspects of class cohesion compared to any of the existing cohesion measures. In addition, combining C3 with existing structural cohesion metrics proves to be a better predictor of faulty classes when compared to different combinations of structural cohesion metrics. Two techniques for fast computation of constrained shortest paths Source IEEE/ACM Transactions on Networking (TON) archiveVolume 16 , Issue 1 (February 2008) table of contentsPages 105-115 Year of Publication: 2008 ISSN:1063-6692 Authors Shigang Chen Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL Meongchul Song Systems R&D Laboratories, Samsung Electronics Company, Ltd., Gyeonggi-do, Korea Sartaj Sahni Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL Publisher IEEE Press Piscataway, NJ, USA Bibliometrics Downloads (6 Weeks): 25, Downloads (12 Months): 70, Count: 0 Citation ABSTRACT Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, MPLS path selection, ATM circuit routing, and traffic engineering. The problem is to find the cheapest path that satisfies certain constraints. In particular, finding the cheapest delay constrained path is critical for real-time data flows such as voice/video calls. Because it is NP-complete, much research has been designing heuristic algorithms that solve the ε-approximation of the problem with an adjustable accuracy. A common approach is to discretize (i.e., scale and round) the link delay or link cost, which transforms the original problem to a simpler one solvable in polynomial time. The efficiency of the algorithms directly relates to the magnitude of the errors introduced during discretization. In this paper, we propose two techniques that reduce the discretization errors, which allows faster algorithms to be designed. Reducing the overhead of computing constrained shortest paths is practically important for the successful design of a high-throughput QoS router, which is limited at both processing power and memory space. Our simulations show that the new algorithms reduce the execution time by an order of magnitude on power law topologies with 1000 nodes. The reduction in memory space is similar Customer relationship management momentum for business improvement Harej, K. Horvat, R.V. Inst. of Informatics, Maribor Univ., Slovenia This paper appears in: Information Technology Interfaces, 2004. 26th International Conference on Publication Date: 2004 On page(s): 107 - 111 Vol.1 Number of Pages: 778 ISSN: Posted online: 2005-01-10 09:02:29.0 Abstract Aligned with the appearance of e-Business the view on business had to change. Many new organizations with new business models, business cases, and new processes were established. An example of new processes is also "customer relationship management". We describe the importance of customers for an organization and stress the basics for customer relationship management implementation. Also main phases of successful CRM integration are presented. CRM key success factors and reasons for CRM implementation failure should also be considered. Toward Broadcast Reliability in Mobile Ad Hoc Networks with Double CoverageWei Lou Jie Wu Dept. of Comput., Hong Kong Polytech. Univ., Ko wloon;This paper appears in: Mobile Computing, IEEE Transactions onPublication Date: Feb. 2007Volume: 6, Issue: 2On page(s): 148-163ISSN: 1536-1233INSPEC Accession Number: 9271827Digital Object Identifier: 10.1109/TMC.2007.31Date Published in Issue: 2006-12-26 08:38:32.0 AbstractThe broadcast operation, as a fundamental service in mobile ad hoc networks (MANETs), is prone to the broadcast storm problem if forwarding nodes are not carefully designated. The objective of reducing broadcast redundancy wh ile still providing high delivery ratio under high transmission error rate is a major challenge in MANETs. In this paper, we propose a simple broadcast algorithm, called double-covered broadcast (DCB), which takes advantage of broadcast redundancy to improve the delivery ratio in an environment that has rather high transmission error rate. Among the 1-hop neighbors of the sender, only selected forwarding nodes retransmit the broadcast message. Forwarding nodes are selected in such a way that 1) the sender's 2-hop neighbors are covered and 2) the sender's 1-hop neighbors are either forwarding nodes or nonforwarding nodes covered by at least two forwarding neighbors. The retransmissions of the forwarding nodes are received by the sender as the confirmation of their reception of the packet. The nonforwarding 1-hop neighbors of the sender do not acknowledge the reception of the broadcast. If the sender does not detect all its forwarding nodes' retransmissions, it resends the packet until the maximum number of retries is reached. Simulation results show that the proposed broadcast algorithm provides good performance under a high transmission error rate environment Application of Theory of Inventive Problem Solving in Customer Relationship Management Movarrei, R. Vessal, S.R. Project Manage. R&D Center, PIDM Co., Tehran This paper appears in: Management of Innovation and Technology, 2006 IEEE International Conference on Publication Date: June 2006 Volume: 1 On page(s): 263 - 267 Number of Pages: 263 - 267 Location: Singapore, China Digital Object Identifier: 10.1109/ICMIT.2006.262164 Posted online: 2006-12-26 08:36:29.0 Abstract In today's competitive world it is not easy to attract costumers and keep them loyal just because of existence of rigorous competition and the increase of customer awareness about competing products or services. It is often said that attracting a new customer will cost 3 up to 5 times more than retaining a current one. So it is of great importance for a company to make its present customers loyal through better relationships with them. Methods and techniques applied by different companies to manage and improve their relationship with different customers, vary considerably and most of them are experimental. These methods and techniques are classified under the title: 'Customer Relationship Management' or 'CRM'. In the meantime, theory of inventive problem solving (TRIZ) suggests that anything which has an innovative nature, like methods and techniques of CRM, can be made systematic. So in the first stage of this research, authors tried to extract CRM tricks applied by the well-known American retailer, Sears. Then they were sorted with regard to TRIZ principles. Results are shown here through a representative description of Sears's operations. Then a comparison between CRM tricks and TRIZ 40 inventive principles is made. For better recognition of the relationship, both the tricks and the principles are shown in groups. Based on analysis of this comparison, analogies have been developed to help and facilitate development of new CRM tricks in future. In the conclusion section some major difficulties of TRIZ application in CRM is discussed Strategyproof Mechanisms for Scheduling Divisible Loads in Bus-Networked Distributed Systems Carroll, T.E.; Grosu, D. Parallel and Distributed Systems, IEEE Transactions on Volume 19, Issue 8, Aug. 2008 Page(s):1124 - 1135 Digital Object Identifier 10.1109/TPDS.2007.70818 Summary:The scheduling of arbitrarily divisible loads on a distributed system is studied by Divisible Load Theory (DLT). DLT has the underlying assumption that the processors will not cheat. In the real world, this assumption is unrealistic as the processors are owned and operated by autonomous rational organizations t hat have no a priori motivation for cooperation. Consequently, they will manipulate the algorithms if it benefits them to do so. In this work, we propose strategyproof mechanisms for scheduling divisible loads on three types of bus-connected distributed systems. These mechanisms provide incentives to the processors to obey the prescribed algorithms and to truthfully report their parameters, leading to an efficient load allocation and execution. Intelligent data mining and personalisation for customer relationship management Kok Wai Wong Chun Che Fung Gedeon, T. Chai, D. Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore, Singapore This paper appears in: Control, Automation, Robotics and Vision Conference, 2004. ICARCV 2004 8th Publication Date: 6-9 Dec. 2004 Volume: 3 On page(s): 1796 - 1801 Vol. 3 Number of Pages: 3 vol. (xxxiv+2341) ISSN: Digital Object Identifier: 10.1109/ICARCV.2004.1469431 Posted online: 2005-07-25 08:19:22.0 Abstract Customer relationship management (CRM) initiatives have gained much attention in recent years. With the aid of data mining technology, businesses can formulate specific strategies for different customer bases more precisely. Additionally, personalisation is another important issue in CRM - especially when a company has a huge product range. This paper presents a case model and investigates the use of computational intelligent techniques for CRM. These techniques allow the complex functions of relating customer behaviour to internal business processes to be learned more easily and the industry expertise and experience from business managers to be integrated into the modelling framework directly. Hence, they can be used in the CRM framework to enhance the creation of targeted strategies for specific customer bases. Rateless Forward Error Correction for Topology-Transparent Scheduling Syrotiuk, V.R.; Colbourn, C.J.; Yellamraju, S. Networking, IEEE/ACM Transactions on Volume 16, Issue 2, April 2008 Page(s):464 - 472 Digital Object Identifier 10.1109/TNET.2007.899018 Summary:Topology-transparent scheduling for mobile wireless ad hoc networks has been treated as a theoretical curiosity. This paper makes two contributions towards its practical deployment: (1) We generalize the combinatorial requi rement on the schedules and show that the solution is a cover-free family. As a result, a much wider number and variety of constructions for schedules exist to match network conditions. (2) In simulation, we closely match the theoretical bound on expected throughput. The bound was derived assuming acknowledgments are available immediately. We use rate less forward error correction (RFEC) as an acknowledgment scheme with minimal computational overhead. Since the wireless medium is inherently unreliable, RFEC also offers some measure of automatic adaptation to channel load. These contributions renew interest in topology transparent scheduling when delay is a principal objective Performance analysis of reliable multicast protocol using transparent proxy servers over hybrid networks Sung-Kwan Youm Meejoung Kim Chul-Hee Kang Dept. of Electron. Eng., Korea Adv. Energy Res. Inst., Seoul, South Korea This paper appears in: Performance, Computing, and Communications Conference, 2005. IPCCC 2005. 24th IEEE International Publication Date: 7-9 April 2005 On page(s): 257 - 264 Number of Pages: xvii+642 ISSN: 1097-2641 Digital Object Identifier: 10.1109/PCCC.2005.1460566 Posted online: 2005-07-05 08:27:26.0 Abstract We consider the reliable multicast transport protocols used in hybrid networks that include wired and wireless networks and transparent proxy servers in it, which cache multicast packets at the base station and perform local retransmissions across the wireless link. We present two extreme reliable multicast transport protocols, sender-initiated and receiver-initiated, and two analytic performance models supported and unsupported by transparent proxy servers in each reliable multicast protocol, and analyze the throughput of each model. Numeri cal results show that in any case the protocol with transparent proxy servers effect overall performance more than the one without transparent proxy servers, and furthermore the receiver initiated reliable multicast supported by transparent proxy servers gives better performance of total throughput than the one sender initiated reliable multicast. We provide efficiency criterion of the number of transparent proxy servers for each protocols for varying wireless loss probabilities. Provably Secure Three-Party Authenticated Quantum Key Distribution ProtocolsDOI Bookmark: ABSTRACT This work presents quantum key distribution protocols (QKDPs) to safeguard security in large networks, ushering in new directions in classical cryptography and quantum cryptography. Two three-party QKDPs, one with implicit user authentication and the other with explicit mutual authentication, are proposed to demonstrate the merits of the new combination, which include the following: 1) security against such attacks as man-in-the-middle, eavesdropping and replay, 2) efficiency is improved as the proposed protocols contain the fewest number of communication rounds among existing QKDPs, and 3) two parties can share and use a long-term secret (repeatedly). To prove the security of the proposed schemes, this work also presents a new primitive called the Unbiased -Chosen Basis (UCB) assumption. A novel cache scheme for cluster-based streaming proxy server Song Wu Hai Jin Jie Chu Kaiqin Fan Cluster & Grid Comput. Lab., Huazhong Univ. of Sci. & Technol., Wuhan, China This paper appears in: Distributed Computing Systems Workshops, 2005. 25th IEEE International Conference on Publication Date: 6-10 June 2005 On page(s): 727 - 733 Number of Pages: xxxii+956 Digital Object Identifier: 10.1109/ICDCSW.2005.18 Posted online: 2005-06-20 11:37:52.0 Abstract For traditional client-server streaming service pattern, a centralized multimedia stream server serves client's requests. But with the increasing popularity of streaming applications, this pattern introduces new challenges over best-effort network: high latency and loss rates can not provide good quality audio/video streaming to client, centralized server has a limit on delivering many simultaneously streams, the same stream sessions can not share data between each other. To address these issues, we deploy a streaming proxy server close to client to cache media objects in memory and disk to reduce the network traffic, the server load and the data delivery latency. In this paper, we propose a novel cache of streaming proxy server based on cluster architecture. In particular, dynamic shared running memory cache (DSRMC), network prefetch and cache admission policy are integrated in streaming caching design. Simulation results demo nstrate the effectiveness of this novel cache. Probabilistic Group Nearest Neighbor Queries in Uncertain Databases June 2008 (vol. 20 no. 6) pp. 809-824 ABSTRACT The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous work have studied many query types such as nearest neighbor query, range query, top-$k$ query, skyline query, and similarity join. In this paper, we focus on another important query, namely probabilistic group nearest neighbor query (PGNN), in the uncertain database, which also has many applications. Specifically, given a set, Q, of query points, a PGNN query retrieves data objects that minimize the aggregate distance (e.g. sum, min, and max) to query set Q. Due to the inherent uncertainty of data objects, previous techniques to answer group nearest neighbor query (GNN) cannot be directly applied to our PGNN problem. Motivated by this, we propose effective pruning methods, namely spatial pruning and probabilistic pruning, to reduce the PGNN search space, which can be seamlessly integrated into our PGNN query procedure. Extensive experiments have demonstrated the efficiency and effectiveness of our proposed approach, in terms of the wall clock time and the speed-up ratio against linear scan. Index Terms: Query processing, Search process Citation: Xiang Lian, Lei Chen, "Probabilistic Group Nearest Neighbor Queries in Uncertain Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 6, pp. 809-824, Feb., 2008 Intelligent P2P VoIP through Extension of Existing Protocols Sanghan, S. Hasan, M.M. Sch. of Technol., Shinawatra Univ. This paper appears in: Advanced Communication International Conference on Publication Date: 12-14 Feb. 2007 Volume: 3 On page(s): 1597 - 1601 Number of Pages: 1597 - 1601 Location: Gangwon-Do ISSN: 1738-9445 Digital Object Identifier: 10.1109/ICACT.2007.358675 Posted online: 2007-05-07 11:28:43.0 Technology, The 9th Abstract The main propose of the Intelligent P2P VoIP architecture through extension of existing protocols is to enable a VoIP user tracking and calling other users anywhere on the Net using just their e-mail IDs. We propose a pure P2P VoIP architecture which decentralizes the mechanism of call establishment and termination as well as user tracking without going through a centralized VoIP proxy or redirection server. We extend and adapted asynchronous multimedia communication protocols (namely, SMTP) and VoIP related protocols (namely, SIP) to facilitate synchronous voice communication over the Internet. Callee's location is probed intelligently using his or her SMTP server log. Present VoIP systems are generally based on a hybrid architecture where a SIP proxy or redirection server controls every voice call. Since all voice calls are mediated by a central server, such a system suffers from scalability and a single point of failure problems. Moreover, in such a system users are tied with a particular VoIP service provider. Decentralization of the existing hybrid architecture into the proposed architecture, explained in this report, frees the user from having to subscribe to a VoIP provider. In this research, we focus on using open source software components to setup an enterprise VoIP system to demonstrate the proposed architecture. Nevertheless, the approach can be extended easily beyond the enterprise intranet. Security Issues in VOIP Applications Hung, P.C.K. Martin, M.V. Univ. of Ontario Inst. of Technol., Oshawa, Ont. This paper appears in: Electrical and Computer Engineering, Canadian Conference on Publication Date: May 2006 On page(s): 2361 - 2364 Number of Pages: 2361 - 2364 Location: Ottawa, Ont. Digital Object Identifier: 10.1109/CCECE.2006.277789 Posted online: 2007-01-15 13:02:11.0 Abstract Recent voice over Internet protocol (VoIP) technology is attracting more and more attention and interest in the industry. VoIP applications such as IP telephony systems involve sending voice transmissions as data packets over private or public IP networks as well as reassembled and decoded on the receiving side. Security concerns are always the major barrier that prevents many businesses from employing VoIP technologies. In this paper, we discuss various VoIP security threats and possible approaches to tackle the threats in VoIP applications On the Suitability of GRID Service Technology for Distributed Measurements Based on Complex Digital Signal Processing Algorithms Angrisani, L.; Battaglia, L.; Napolitano, A.; Lo Moriello, R.S. Instrumentation and Measurement, IEEE Transactions on Volume 57, Issue 1, Jan. 2008 Page(s):25 - 33 Digital Object Identifier 10.1109/TIM.2007.909505 Summary:Digital signal processing algorithms are nowadays playing an increasingly more important role in most measurement processes. Furthermore, in the presence of poorly digitized data, reliable and repeatable measurement results can often be assured by complementing the adopted procedure with a suitable processing stage. The realization of a ldquocollectionrdquo of measurement algorithms to be shared among researchers and technicians who work on similar topics should, thus, be advisable. Complex algorithms, however, suffer from critical drawbacks, in terms of computational burden and hardware resources, when applied to very long acquired records. The authors suggest the adoption of GRID Service as an innovative solution to provide researchers with a ldquocollectionrdquo of measurement algorithms and concurrently overcome the cited drawbacks. GRID Service is a new hardware/software approach that is capable of merging the higher computational performance of parallel GRID computing with key mechanisms and standards of Web service. It would be very possible to migrate complex measurement algorithms into services that are available and accessible on the Internet. As an application example, the authors present a GRID service mandated to power measurement in digital wireless communication systems. OCGRR: A New Scheduling Algorithm for Differentiated Services Networks Rahbar, Akbar Ghaffar Pour; Yang, Oliver Parallel and Distributed Systems, IEEE Transactions on Volume 18, Issue 5, May 2007 Page(s):697 - 710 Digital Object Identifier 10.1109/TPDS.2007.351711 Summary:We propose a new fair scheduling technique, called OCGRR (Output Controlled Grant-based Round Robin), for the support of DiffServ traffic in a core router. We define a stream to be the same-class packets from a given immediate upstream router destined to an output port of the core router. At each output port, streams may be isolated in separate buffers before being scheduled in a frame. The sequence of traffic transmission in a frame starts from higher-priority traffic and goes down to lower-priority traffic. A frame may have a number of small rounds for each class. Each stream within a class can transmit a number of packets in the frame based on its available grant, but only one packet per small round, thus reducing the intertransmission time from the same stream and achieving a smaller jitter and startup latency. The grant can be adjusted in a way to prevent the starvation of lower priority classes. We also verify and demonstrate the good performance of our scheduler by simulation and comparison with other algorithms in terms of queuing delay, jitter, and start-up latency Multicast Routing with Delay and Delay Variation Constraints for Collaborative Applications on Overlay Networks Banik, S.M.; Radhakrishnan, S.; Sekharan, C.N. Parallel and Distributed Systems, IEEE Transactions on Volume 18, Issue 3, March 2007 Page(s):421 - 431 Digital Object Identifier 10.1109/TPDS.2007.45 Summary:Computer supported collaborative applications on overlay networks are gaining popularity among users who are geographically dispersed. Examples of these kinds of applications include video-conferencing, distributed database replication, and online games. This type of application requires a multicasting subnetwork, using which messages should arrive at the destinations within a specified delay bound. These applications also require that destinations receive the message from the source at approximately the same time. The problem of finding a multicasting subnetwork with delay and delay-variation bound has been proved to be an NP complete problem in the literature and heuristics have been proposed for this problem. In this paper, we provide an efficient heuristic to obtain a multicast subnetwork on an overlay network, given a source and a set of destinations that is within a specified maximum delay and a specified maximum variation in the delays from a source to the destinations. The time-complexity of our algorithm is O(|E|+nk log(|E|/n)+m2k), where n and |E| are the number of nodes and edges in the network, respectively, k is the number of shortest paths determined, and m is the number of destinations. We have shown that our algorithm is significantly better in terms of time-complexity than existing algorithms for the same problem. Our extensive empirical studies indicate that our heuristic uses significantly less runtime in comparison with the best-known heuristics while achieving the tightest delay variation for a given end-to-end delay bound Hiding Sensitive Association Rules with Limited Side Effects Yi-Hung Wu; Chia-Ming Chiang; Chen, A.L.P. Knowledge and Data Engineering, IEEE Transactions on Volume 19, Issue 1, Jan. 2007 Page(s):29 - 42 Digital Object Identifier 10.1109/TKDE.2007.250583 Summary:Data mining techniques have been widely used in various applications. However, the misuse of these techniques may lead to the disclosure of sensitive information. Researchers have recently made efforts at hiding sensitive association rules. Nevertheless, undesired side effects, e.g., nonsensitive rules falsely hidden and spurious rules falsely generated, may be produced in the rule hiding process. In this paper, we present a novel approach that strategically modifies a few transactions in the transaction database to decrease the supports or confidences of sensitive rules without producing the side effects. Since the correlation among rules can make it impossible to achieve this goal, in this paper, we propose heuristic methods for increasing the number of hidden sensitive rules and reducing the number of modified entries. The experimental results show the effectiveness of our approach, i.e., undesired side effects are avoided in the rule hiding process. The results also report that in most cases, all the sensitive rules are hidden without spurious rules falsely generated. Moreover, the good scalability of our approach in terms of database size and the influence of the correlation among rules on rule hiding are observed Voice over Internet Protocol on Mobile Devices Mao, Guo Fang Talevski, Alex Chang, Elizabeth Curtin University, Australia This paper appears in: Computer and Information Science, 2007. ICIS 2007. 6th IEEE/ACIS International Conference on Publication Date: 11-13 July 2007 On page(s): 163 - 169 Number of Pages: 163 - 169 Location: Melbourne, Australia Digital Object Identifier: 10.1109/ICIS.2007.196 Posted online: 2007-07-23 09:43:32.0 Abstract Voice over Internet Protocol (VoIP) is a way to carry out a telephone conversation over a data network. VoIP products promise converged telecommunications and data services that are cheapel; more versatile and provide good voice quality as compared to traditional offerings. Although VoIP is widely used, VoIP on mobile devices is still in its infancy. Currently, there are a number of VoIP solutions for mobile phones. Howevel; VoIP solutions developed using Java 2 Platfomz Micro Edition(J2ME) are not available. Java based solutions are widely compatible with many devices. In this papel; strong focus has been granted to cross -device compatibility through the use of the widely supported J2ME framework. The implementation details of VoIP client using J2ME are illustrated. Enhancing Search Performance in Unstructured P2P Networks Based on Users' Common Interest June 2008 (vol. 19 no. 6) pp. 821-836 Peer-to-Peer (P2P) networks establish loosely-coupled application-level overlays on top of the Internet to facilitate efficient sharing of resources. They can be roughly classified as either structured or unstructured networks. Without stringent constraints over the network topology, unstructured P2P networks can be constructed very efficiently and are therefore considered suitable to the Internet environment. However, the random search strategies adopted by these networks usually perform poorly with large network size. In this paper, we seek to enhance the search performance in unstructured P2P networks through exploiting users' common interest patterns captured within a probability-theoretic framework termed the user interest model (UIM). A search protocol and a routing table updating protocol are further proposed in order to expedite the search process through self organizing the P2P network into a small world. Both theoretical and experimental analysis are conducted and demonstrated the effectiveness and efficiency of our approach. Index Terms: Unstructured Peer-to-peer network, search performance, user interest model Citation: Gang Chen, Chor Ping Low, Zhonghua Yang, "Enhancing Search Performance in Unstructured P2P Networks Based on Users' Common Interest," IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 6, pp. 821 -836, Feb., 2008 Efficient Routing in Intermittently Connected Mobile Networks: The Multiple -Copy Case Spyropoulos, T.; Psounis, K.; Raghavendra, C.S. Networking, IEEE/ACM Transactions on Volume 16, Issue 1, Feb. 2008 Page(s):77 - 90 Digital Object Identifier 10.1109/TNET.2007.897964 Summary:Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc networks, etc. In this context, conventional routing schemes fail, because they try to establish complete end-to-end paths, before any data is sent. To deal with such networks researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention which can significantly degrade their performance. Furthermore, proposed efforts to reduce the overhead of flooding based schemes have often been plagued by large delays. With this in mind, we introduce a new family of routing schemes that "spray" a few message copies into the network, and then route each copy independently towards the destination. We show that, if carefully designed, spray routing not only performs significantly fewer transmissions per message, but also has lower average delivery delays than existing schemes; furthermore, it is highly scalable and retains good performance under a large range of scenarios. Finally, we use our theoretical framework proposed in our 2004 paper to analyze the performance of spray routing. We also use this theory to show how to choose the number of copies to be sprayed and how to optimally distribute these copies to relays. Efficient Approximate Query Processing in Peer-to-Peer Networks Arai, B.; Das, G.; Gunopulos, D.; Kalogeraki, V. Knowledge and Data Engineering, IEEE Transactions on Volume 19, Issue 7, July 2007 Page(s):919 - 933 Digital Object Identifier 10.1109/TKDE.2007.1064 Summary:Peer-to-peer (P2P) databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large-scale ad hoc analysis queries, for example, aggregation queries, on these databases poses unique challenges. Exact solutions can be time consuming and difficult to implement, given the distributed and dynamic nature of P2P databases. In this paper, we present novel sampling -based techniques for approximate answering of ad hoc aggregation queries in such databases. Computing a high-quality random sample of the database efficiently in the P2P environment is complicated due to several factors: the data is distributed (usually in uneven quantities) across many peers, within each peer, the data is often highly correlated, and, moreover, even collecting a random sample of the peers is difficult to accomplish. To counter these problems, we have developed an adaptive two-phase sampling approach based on random walks of the P2P graph, as well as block-level sampling techniques. We present extensive experimental evaluations to demonstrate the feasibility of our proposed solution Discriminative Learning and Recognition of Image Set Classes Using Canonical Correlations Source IEEE Transactions on Pattern Analysis and Machine Intelligence archiveVolume 29 , Issue 6 (June 2007) table of contentsPages 1005-1018 Year of Publication: 2007 ISSN:0162-8828 Authors Tae-Kyun Kim Members Josef Kittler IEEE Roberto Cipolla IEEE Publisher IEEE Computer Society Washington, DC, USA ABSTRACT We address the problem of comparing sets of images for object recognition, where the sets may represent variations in an object's appearance due to changing camera pose and lighting conditions. Canonical Correlations (also known as principal or canonical angles), which can be thought of as the angles between two d\hbox{-}\rm dimensional subspaces, have recently attracted attention for image set matching. Canonical correlations offer many benefits in accuracy, efficiency, and robustness compared to the two main classical methods: parametric distribution-based and nonparametric sample-based matching of sets. Here, this is first demonstrated experimentally for reasonably sized data sets using existing methods exploiting canonical correlations. Motivated by their proven effectiveness, a novel discriminative learning method over sets is proposed for set classification. Specifically, inspired by classical Linear Discriminant Analysis (LDA), we develop a linear discriminant function that maximizes the canonical correlations of within-class sets and minimizes the canonical correlations of between-class sets. Image sets transformed by the discriminant function are then compared by the canonical correlations. Classical orthogonal subspace method (OSM) is also investigated for the similar purpose and compared with the proposed method. The proposed method is evaluated on various object recognition problems using face image sets with arbitrary motion captured under different illuminations and image sets of 500 general objects taken at different views. The method is also applied to object category recognition using ETH-80 database. The proposed method is shown to outperform the state-of-the-art methods in terms of accuracy and efficiency WASP: Protecting Web Applications Using Positive Tainting and Syntax-Aware Evaluation DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TSE.2007.70748 January 2008 (vol. 34 no. 1) pp. 65-81 ABSTRACT Many software systems have evolved to include a web-based component makes them available to the public via the Internet and can expose them variety of web-based attacks. One of these attacks is SQL injection, which can attackers unrestricted access to the databases underlying web applications has become increasingly frequent and serious. that to a give and This paper presents a new, highly automated approach for protecting web applications against SQL injection that has both conceptual and practical advantages over most existing techniques. From a conceptual standpoint, the approach is based on the novel idea of positive tainting and on the concept of syntax-aware evaluation. From a practical standpoint, our technique is precise and efficient and has minimal deployment requirements. We also present an extensive empirical evaluation of our approach performed using WASP, a tool that implements our technique. In the evaluation, we used WASP to protect a wide range of web applications while subjecting them to a large and varied set of attacks and legitimate accesses. WASP was able to stop all attacks and did not generate any false positives . Our studies also show that the overhead imposed by WASP was negligible in most cases. Index Terms: Protection mechanisms, Security and Protection Citation: William Halfond, Alex Orso, Pete Manolios, "WASP: Protecting Web Applications Using Positive Tainting and Syntax-Aware Evaluation," IEEE Transactions on Software Engineering, vol. 34, no. 1, pp. 65-81, Jan., 2008 Voice over Internet protocol (VoIP) Goode, B. AT&T Labs., Weston, CT, USA; This paper appears in: Proceedings of the IEEE Publication Date: Sept. 2002 Volume: 90 , Issue: 9 On page(s): 1495 - 1517 ISSN: 0018-9219 Digital Object Identifier: 10.1109/JPROC.2002.802005 Posted online: 2002-12-10 17:14:50.0 Abstract During the Internet stock bubble, articles in the trade press frequently said that, in the near future, telephone traffic would be just another application running over the Internet. Such statements gloss over many engineering details that preclude voice from being just another Internet application. This paper deals with the technical aspects of implementing voice over Internet protocol (VoIP), without speculating on the timetable for convergence. First, the paper discusses the factors involved in making a high-quality VoIP call and the engineering tradeoffs that must be made between delay and the efficient use of bandwidth. After a discussion of codec selection and the delay budget, there is a discussion of various techniques to achieve network quality of service. Since call setup is very important, the paper next gives an overview of several VoIP call signaling protocols, including H.323, SIP, MGCP, and Megaco/H.248. There is a section on telephony routing over IP (TRIP). Finally, the paper explains some VoIP issues with network address translation and firewalls Wise-ShopFloor: An Integrated Approach for Web-Based Collaborative Manufacturing Lihui Wang Integrated Manuf. Technol. Inst., Nat. Res. Council of Canada, London, ON; This paper appears in: Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on Publication Date: July 2008 Volume: 38, Issue: 4 On page(s): 562-573 ISSN: 1094-6977 INSPEC Accession Number: 10075785 Digital Object Identifier: 10.1109/TSMCC.2008.923868 Date Published in Issue: 2008-06-20 14:12:10.0 Abstract This paper presents an integrated approach for Web-based collaborative manufacturing, including distributed process planning, dynamic scheduling, real time monitoring, and remote control. It is enabled by a Web-based integrated sensor-driven e-ShopFloor (Wise-ShopFloor) framework targeting distributed yet collaborative manufacturing environments. Utilizing the latest Java technologies (Java 3D and Java Servlet) for system implementation, this approach allows users to plan and control distant shop floor operations based on runtime information from the shop floor. The objective of this research is to develop methodology and algorithms for Web based collaborative planning and control, supported by real-time monitoring for dynamic scheduling. Details on the principle of the Wise-ShopFloor framework, system architecture, and a proof-of-concept prototype are reported in this paper. An example of distributed process planning for remote machining is chosen as a case study to demonstrate the effectiveness of this approach toward Web-based collaborative manufacturing