1.

POPI A User-Level Tool for Inferring Router Packet
This paper appears in: Networking, IEEE/ACM Transactions on Issue Date: Feb. 2010 Volume: 18 Issue:1 On page(s): 1 - 14 ISSN: 1063-6692 INSPEC Accession Number: 11137954 Digital Object Identifier: 10.1109/TNET.2009.2020799 Date of Publication: 09 September 2009 Date of Current Version: 17 February 2010 Sponsored by: IEEE Computer Society IEEE Communications Society Association for Computing Machinery ABSTRACT:Packet forwarding prioritization (PFP) in routers is one of the mechanisms commonly available to network operators. PFP can have a significant impact on the accuracy of network measurements, the performance of applications and the effectiveness of network troubleshooting procedures. Despite its potential impacts, no information on PFP settings is readily available to end users. In this paper, we present an end-to-end approach for PFP inference and its associated tool, POPI. This is the first attempt to infer router packet forwarding priority through end-toend measurement. POPI enables users to discover such network policies through measurements of packet losses of different packet types. We evaluated our approach via statistical analysis, simulation and wide-area experimentation in Planet Lab. We employed POPI to analyze 156 paths among 162 Planet Lab sites. POPI flagged 15 paths with multiple priorities, 13 of which were further validated through hop-by-hop loss rates measurements. In addition, we surveyed all related network operators and received responses for about half of them all confirming our inferences. Besides, we compared POPI with the inference mechanisms through other metrics such as packet reordering [called out-of-order (OOO)]. OOO is unable to find many priority paths such as those implemented via traffic policing. On the other hand, interestingly, we found it can detect existence of the mechanisms which induce delay differences among packet types such as slow processing path in the router and port-based load sharing.

2. QoS Based Many casting Over Optical Burst switched Network
This paper appears in: Networking, IEEE/ACM Transactions on Issue Date: Feb. 2010 Volume: 18 Issue:1 On page(s): 271 - 283 ISSN: 1063-6692 INSPEC Accession Number: 11137935 Digital Object Identifier: 10.1109/TNET.2009.2024498 Date of Publication: 06 October 2009 Date of Current Version: 17 February 2010 Sponsored by: IEEE Computer Society IEEE Communications Society Association for Computing Machinery ABSTRACT:Many distributed applications require a group of destinations to be coordinated with a single source. Multicasting is a communication paradigm to implement these distributed applications. However in multicasting, if at least one of the members in the group cannot satisfy the service requirement of the application, the multicast request is said to be blocked. On the contrary in manycasting, destinations can join or leave the group, depending on whether it satisfies the service requirement or not. This dynamic membership based destination group decreases request blocking. We study the behavior of manycasting over optical burst-switched networks (OBS) based on multiple quality of service (QoS) constraints. These multiple constraints can be in the form of physical-layer impairments, transmission delay, and reliability of the link. Each application requires its own QoS threshold attributes. Destinations qualify only if they satisfy the required QoS constraints set up by the application. We have developed a mathematical model based on lattice algebra for this multiconstraint problem. Due to multiple constraints, burst blocking could be high. We propose two algorithms to minimize request blocking for the multiconstrained manycast (MCM) problem. Using extensive simulation results, we have calculated the average request blocking for the proposed algorithms. Our simulation results show that MCM-shortest path tree (MCM-SPT) algorithm performs better than MCM-dynamic membership (MCM-DM) for delay constrained services and real-time service, where as data services can be better provisioned using MCM-DM algorithm.

3. on wireless scheduling algorithm for minimizing the queueoverflow probability
This paper appears in: Networking, IEEE/ACM Transactions on Issue Date: June 2010 Volume: 18 Issue:3 On page(s): 788 - 801 ISSN: 1063-6692 Digital Object Identifier: 10.1109/TNET.2009.2037896 Date of Publication: 19 January 2010 Date of Current Version: 14 June 2010 Sponsored by: IEEE Computer Society IEEE Communications Society Association for Computing Machinery ABSTRACT:In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a large-deviation setting, we are interested in algorithms that maximize the asymptotic decay rate of the queue-overflow probability, as the queue-overflow threshold approaches infinity. We first derive an upper bound on the decay rate of the queue-overflow probability over all scheduling policies. We then focus on a class of scheduling algorithms collectively referred to as the “$alpha$ -algorithms.” For a given $alphageq 1$, the $alpha$-algorithm picks the user for service at each time that has the largest product of the transmission rate multiplied by the backlog raised to the power $alpha$. We show that when the overflow metric is appropriately modified, the minimum-cost-to-overflow under the $alpha$-algorithm can be achieved by a simple linear path, and it can be written as the solution of a vector-optimization problem. Using this structural property, we then show that when $alpha$ approaches infinity, the $alpha$ -algorithms asymptotically achieve the largest decay rate of the queue-overflow probability. Finally, this result enables us to design scheduling algorithms that are both close to optimal in terms of the asymptotic decay rate of the overflow probability and empirically shown to maintain small queue-overflow probabilities over queue-length ranges of practical interest.

Traditional maximal-weight scheduling (MWS). Furthermore.4. Simulations verify the effectiveness of the algorithm. is difficult to implement in distributed networks. Some of the major advantages of the algorithm are that it applies to a very general interference model and that it is simple. . we introduce an adaptive carrier sense multiple access (CSMA) scheduling algorithm that can achieve the maximal throughput distributive. designing distributed scheduling algorithms to achieve the maximal throughput is a challenging problem because of the complex interference constraints among different links. distributed.2009.11 networks.2035046 Date of Publication: 24 November 2009 Date of Current Version: 14 June 2010 Sponsored by: IEEE Computer Society IEEE Communications Society Association for Computing Machinery ABSTRACT:In multihop wireless networks. a distributed greedy protocol similar to IEEE 802. although throughputoptimal. IEEE/ACM Transactions on Issue Date: June 2010 Volume: 18 Issue:3 On page(s): 960 .1109/TNET.972 ISSN: 1063-6692 INSPEC Accession Number: 11364639 Digital Object Identifier: 10. the adaptive CSMA scheduling is a modular MAC-layer algorithm that can be combined with various protocols in the transport layer and network layer. Finally. On the other hand. A distributed CSMA algorithm for Throughput and utility Maximization in wireless networks This paper appears in: Networking. the paper explores some implementation issues in the setting of 802. the algorithm is combined with congestion control to achieve the optimal utility and fairness of competing flows. Also. In this paper. and asynchronous.11 does not guarantee the maximal throughput.

. like sensor networks. the average number of messages is 2(n . in which γis the Euler constant. this is the first contribution that possesses the distributed and scalable properties for the min-max multicast problem and is especially desirable to the large-scale resource-limited multihop wireless networks.. 2010 Volume: 18 Issue:4 On page(s): 1067 .2038998 Date of Publication: 12 January 2010 Date of Current Version: 16 August 2010 Sponsored by: IEEE Computer Society IEEE Communications Society Association for Computing Machinery ABSTRACT:We consider the problem of finding a multicast tree rooted at the source node and including all the destination nodes such that the maximum weight of the tree arcs is minimized. the maximum-lifetime multicast problem in multihop wireless networks. which provides a unified explanation for some important while separated results in the recent literature.γ) -2 ln(n-1) + m at most.1076 ISSN: 1063-6692 INSPEC Accession Number: 11473499 Digital Object Identifier: 10. To our best knowledge. our theoretical analysis shows that the expected communication complexity of our distributed algorithm is in the order of O(m). It is of paramount importance for many optimization problems.1109/TNET. e. in the data networking community. A distributed algorithm for min-max and max-min cut problems in communication networks This paper appears in: Networking. IEEE/ACM Transactions on Issue Date: Aug. In random networks with n nodes and m arcs.1 .g.2009. We also apply the theorem to derive an algorithm that can construct a global optimal min-max multicast tree in a distributed fashion.5. We explore some important properties of this problem from a graph theory perspective and obtain a min-max-tree max-min-cut theorem. Specifically.

We also present a novel queuing model that models crosspoint buffered switches under uniform traffic.2010. 2010 Volume: 18 Issue:4 On page(s): 1119 . and then transferred to the output port.2042460 Date of Publication: 22 February 2010 Date of Current Version: 16 August 2010 Sponsored by: IEEE Computer Society IEEE Communications Society Association for Computing Machinery ABSTRACT:Crosspoint buffered switches are emerging as the focus of research in high-speed routers. where N is the switch size. . A cell is first delivered to a crosspoint buffer. We prove that both schemes can achieve 100% throughput for any admissible Bernoulli traffic.1131 ISSN: 1063-6692 INSPEC Accession Number: 11473494 Digital Object Identifier: 10.1109/TNET. called SQUISH and SQUID. Crosspoint buffered switches have a buffer at each crosspoint. we propose two 100% throughput scheduling algorithms without speedup for crosspoint buffered switches. Both schemes have a low time complexity of O(logN). Simulation results show a delay performance comparable to output-queued switches. They have simpler scheduling algorithms and achieve better performance than bufferless crossbar switches.6. SQUID: A Practical 100% Throughput Scheduler This paper appears in: Networking. IEEE/ACM Transactions on Issue Date: Aug. With a speedup of 2. with the minimum required crosspoint buffer size being as small as a single cell buffer. In this paper. a crosspoint buffered switch has previously been proved to provide 100% throughput.

Our evaluations show that a route selection strategy that is aware of network coding opportunities leads to higher end-to-end throughput when compared to coding-oblivious routing strategies. Second. including some derived from contemporary mesh network test beds. we analyze throughput improvements obtained by COPE-type network coding in wireless networks from a theoretical perspective. Using our formulations. we advocate that routing be made aware of network coding opportunities rather than. presented by Katti (Proc. we compare the performance of traditional unicast routing and network coding with coding-oblivious and coding-aware routing on a variety of mesh network topologies. . 2010 Volume: 18 Issue:4 On page(s): 1158 .1109/TNET.7. We make two key contributions.1170 ISSN: 1063-6692 INSPEC Accession Number: 11473487 Digital Object Identifier: 10. We handle scheduling of broadcast transmissions subject to wireless transmit/receive diversity and link interference in our optimization framework. pp. In this paper. as in COPE. our model considers the tradeoff between routing flows close to each other for utilizing coding opportunities and away from each other for avoiding wireless interference. we obtain a theoretical formulation for computing the throughput of network coding on any wireless network topology and any pattern of concurrent unicast traffic sessions. 243-254)-for improving the throughput of unicast traffic in wireless multihop networks exploits the broadcast nature of the wireless medium through opportunistic network coding. More importantly. being oblivious to it.2042727 Date of Publication: 25 March 2010 Date of Current Version: 16 August 2010 Sponsored by: IEEE Computer Society IEEE Communications Society Association for Computing Machinery ABSTRACT:A recent approach-COPE. ACM SIGCOMM 2006. Network Coding-aware routing in wireless networks This paper appears in: Networking. Our theoretical formulation provides a method for computing source-destination routes and utilizing the best coding opportunities from available ones so as to maximize the throughput. First. IEEE/ACM Transactions on Issue Date: Aug.2010.

and multiple gateways can further shorten the total hop count distance. However. wireless mesh networks need to maximize throughput. Multicast provides efficient data distribution among a group of nodes.46 Date of Publication: 21 March 2009 Date of Current Version: 01 December 2009 Sponsored by: IEEE Computer Society ABSTRACT:The wireless mesh network is an emerging technology that provides high quality service to end users as the "last milerdquo of the Internet. The algorithms build efficient multicast trees by minimizing the number of relay nodes and total hop count distances of the trees.2009.99 ISSN: 1045-9219 INSPEC Accession Number: 11000082 Digital Object Identifier: 10. Efficient multicast algorithm for multichannel This paper appears in: Parallel and Distributed Systems. We also demonstrate that using partially overlapping channels can further diminish the interference.1109/TPDS. multicast communication is a key technology for wireless mesh networks. Furthermore. Furthermore. unlike other wireless networks. where multicast algorithms are designed to be energy efficient and to achieve optimal route discovery among mobile nodes. additional interfaces help to increase the bandwidth. such as sensor networks and MANETs. IEEE Transactions on Issue Date: Jan. . We also observe that MCM achieves better throughput and shorter delay while LCA can be realized in distributed manner. This paper proposes two multicast algorithms: the level channel assignment (LCA) algorithm and the multichannel multicast (MCM) to improve the throughput for multichannel and multi-interface mesh networks.8. The algorithms use dedicated channel assignment strategies to reduce the interference to improve the network capacity. Simulations show that those algorithms greatly outperform the single-channel multicast algorithm. 2010 Volume: 21 Issue:1 On page(s): 86 .

2008. AZ ISSN: 0743-166X Print ISBN: 978-1-4244-2025-4 INSPEC Accession Number: 9962388 Digital Object Identifier: 10. Performance analysis via simulations on the proposed algorithms using a custom simulator is presented. . The first extension applies network coding to both dynamic and static forwarding node selection approaches.9. to restricted sectors.209 Date of Current Version: 02 May 2008 ABSTRACT:In this paper. With the help of network coding. Efficient Broadcasting using network coding and directional antennas in MANET This paper appears in: INFOCOM 2008.1507 Location: Phoenix. In the second extension. We also study two extensions. we consider the issue of efficient broadcasting in mobile ad hoc networks (MANETs) using network coding and directional antennas. the total number of transmissions can be reduced compared to broadcasting using the same forwarding nodes without coding. In the proposed scheme using a directional antenna. forwarding nodes selected locally only need to transmit broadcast messages. IEEE Issue Date: 13-18 April 2008 On page(s): 1499 . A node equipped with directional antennas can divide the omnidirectional transmission range into several sectors and turns some of them on for transmission. Network coding-based broadcasting focuses on reducing the number of transmissions each forwarding node performs in the multiple source/multiple message broadcast application.1109/INFOCOM. We exploit the usage of directional antennas to network coding-based broadcasting to further reduce energy consumption. we design two approaches for the single source/single message issue in the network coding-based broadcast application. original or coded. where each forwarding node combines some of the received messages for transmission. The 27th Conference on Computer Communications.

IEEE Transactions on Issue Date: Feb. We demonstrate the significant capacity and resequencing delay improvements of this novel design with a voice-data traffic mixing example..10.A Multichannel Scheduler for High-Speed wireless backhaul links with packet concatenation This paper appears in: Mobile Computing. call admission control (CAC) of a broad range of scheduling algorithms can be obtained. the use of multiple parallel channels and employing packet concatenation were treated as separate solutions to these problems. 2010 Volume: 9 Issue: 2 On page(s): 201 . we propose a scheduler that concatenates small packets into large frames and sends them through multiple parallel channels with an intelligent channel selection algorithm between neighboring nodes. The problem may get even worse when there are many applications transmitting packets with small data payloads. However. e.214 ISSN: 1536-1233 INSPEC Accession Number: 11049372 Digital Object Identifier: 10.2009.1109/TMC. . Based on the delay bound formula.g. there is no available work on the integrated design and performance analysis of a complete scheduler architecture combining these two schemes. In this paper. It is shown that the proposed packet concatenation and channel selection algorithms greatly outperform the round-robin scheduler in a multihop scenario. Previously. Both the multihop nature and the large per packet channel access overhead can lead to its low channel efficiency. via both numerical and simulation results. Besides the expected capacity improvements.110 Date of Publication: 2009-06-12 13:06:37. Voice over Internet protocol (VoIP). we also derive delay bounds for this scheduler.0 Date of Current Version: 31 December 2009 ABSTRACT:Capacity has been an important issue for many wireless backhaul networks.

IEEE Transactions on Issue Date: Sept.1307 ISSN: 1536-1233 INSPEC Accession Number: 11430146 Digital Object Identifier: 10. the WMN achieves global load balancing. and as a result. With the proposed scheme.2010. the traffic load tends to be unevenly distributed over the network.11.1109/TMC. Based on the routing metrics. A cluster head estimates traffic load in its cluster. The structure of this method makes it possible to implement the proposed routing scheme in a fully distributed way. by using the dual decomposition method. . the cluster head increases the routing metrics of the routes passing through the cluster. a WMN is divided into multiple clusters for load control. As the estimated load gets higher. 2010 Volume: 9 Issue:9 On page(s): 1293 . Efficient Load-Aware Routing Scheme for Wireless Mesh Networks This paper appears in: Mobile Computing. We design a routing scheme which maximizes the utility.e. i. enhance the overall network capacity.85 Date of Publication: 20 May 2010 Date of Current Version: 19 July 2010 Sponsored by: IEEE Computer Society ABSTRACT:This paper proposes a load-aware routing scheme for wireless mesh networks (WMNs). In a WMN. and consequently. the degree of user satisfaction.. the load-aware routing scheme can balance the load. In this situation. We present the numerical results showing that the proposed scheme effectively balances the traffic load and outperforms the routing algorithm using the expected transmission time (ETT) as a routing metric. user traffic takes a detour to avoid overloaded areas.

. . We implement the DCAR system in NS-2 and conduct extensive evaluation. thus eliminating the "two-hop" coding limitation in (S.1109/ICDCS. 2006) has two fundamental limitations: 1) the coding opportunity is crucially dependent on the established routes. DCAR can detect coding opportunities on the entire path. we propose DCAR. Katti et al. DCAR has the potential to find high throughput paths with coding opportunities while conventional routing fails to do so. ICDCS '08. 2008.DCAR: Distributed Coding-Aware Routing in Wireless Networks This paper appears in: Distributed Computing Systems.84 Date of Current Version: 12 August 2008 ABSTRACT:The practical network coding system proposed in (S. and (b) the detection for potential network coding opportunities. which shows that DCAR achieves 7% to 20% throughput gain over the coding system in [1].2008. To overcome these limitations. the first distributed coding-aware routing mechanism which combines (a) the discovery for available paths between a given source and destination. The 28th International Conference on Issue Date: 17-20 June 2008 On page(s): 462 . Katti et al. We also propose a novel routing metric called "CRM" (coding-aware routing metric) which facilitates the comparison between coding-possible and coding-impossible paths.12.469 Location: Beijing ISSN: 1063-6927 Print ISBN: 978-0-7695-3172-4 INSPEC Accession Number: 10131664 Digital Object Identifier: 10.. 2) the coding structure is limited within a two-hop region. In addition. 2006).

while ensuring that the medium access is contentionfree. there is no need for a separate routing protocol in a DGRAM network.. The design is based on slot reuse to reduce latency of a node in accessing the medium.2010. We provide detailed design of time slot assignment and delay analysis of the protocol. IEEE Transactions on Issue Date : Oct. .e. We have simulated DGRAM using ns2 simulator and compared the results with those of FlexiTP. The transmission and reception slots of nodes are carefully computed so that data is transported from the source toward the sink while the nodes could sleep at the other times to conserve energy. 2010 Volume : 9 . DGRAM: A delay Guaranteed Routing and MAC Protocol for Wireless Sensor Networks This paper appears in: Mobile Computing. DGRAM is a TDMA-based protocol designed to provide deterministic delay guarantee in an energy-efficient manner. which makes the maximum possible delay much lesser than that of Flexi.1109/TMC. The average delay experienced by packets and the average total energy spent in the network are much lesser in a network using DGRAM than that using Flexi or the basic TDMA MAC. Issue:10 On page(s): 1407 .107 Date of Publication : 06 June 2010 Date of Current Version : 19 August 2010 Sponsored by : IEEE Computer Society ABSTRACT:This paper presents an integrated MAC and routing protocol called Delay Guaranteed Routing and MAC (DGRAM)for delay sensitive wireless sensor network (WSN) applications. the TDMA frame size with DGRAM is always lesser compared to that of Flexi. Also. and with those of a basic TDMA MAC.13.1423 ISSN : 1536-1233 INSPEC Accession Number: 11476874 Digital Object Identifier : 10. which is another TDMA protocol that claims to provide delay guarantee. i. Simulation results show that the delay experienced by data packets is always less than the analytical delay bound for which the protocol is designed. routes of data packets are integrated into DGRAM. Thus.

43 Date of Publication : 12 March 2009 Date of Current Version : 01 December 2009 Sponsored by : IEEE Computer Society ABSTRACT:In peer-to-peer file sharing systems.2009. leading to inefficient file update and hence high possibility of outdated file response. Despite significant interdependencies between them. 2010 Volume : 21 . unnecessary replicas and hence extra consistency maintenance overhead. .1109/TPDS.14. It dramatically reduces overhead and yields significant improvements on the efficiency of both file replication and consistency maintenance approaches. This paper presents an Integrated file Replication and consistency Maintenance mechanism (IRM) that integrates the two techniques in a systematic and harmonized manner. IEEE Transactions on Issue Date : Jan. Most file replication methods rigidly specify replica nodes. which avoids unnecessary file replications and updates. Simulation results demonstrate the effectiveness of IRM in comparison with other approaches. Most consistency maintenance methods propagate update messages based on message spreading or a structure without considering file replication dynamism. each node determines file replication and update polling by dynamically adapting to time-varying file query and update rates. IRM: Integrated File Replication and Consistency Maintenance in P2P Systems This paper appears in: Parallel and Distributed Systems. leading to low replica utilization. these two issues are typically addressed separately. It achieves high efficiency in file replication and consistency maintenance at a significantly low cost. Issue:1 On page(s): 100 . file replication and consistency maintenance are widely used techniques for high system performance. Instead of passively accepting replicas and updates.113 ISSN : 1045-9219 INSPEC Accession Number: 11002164 Digital Object Identifier : 10.

performance adaptive UDP (henceforth PA-UDP).15. PA-UDP is efficient not only for high-speed research networks. it is critical that the protocol scales gracefully to prevent buffer overflow and packet loss. we implemented a prototype under Linux. Issue:1 On page(s): 114 . When the bottleneck for data transfer occurs in the system itself and not in the network. IEEE Transactions on Issue Date : Jan.125 ISSN : 1045-9219 INSPEC Accession Number: 11000077 Digital Object Identifier : 10. giving rise to new classes of protocols designed to circumvent TCP's shortcomings.1109/TPDS.A Dynamic Performance-Based Flow Control Method for High-Speed Data Transfer This paper appears in: Parallel and Distributed Systems. It is typical in these highperformance applications. A mathematical model and related algorithms are proposed to describe the theoretical basis behind effective buffer and CPU management. however.37 Date of Publication : 06 March 2009 Date of Current Version : 01 December 2009 Sponsored by : IEEE Computer Society ABSTRACT:New types of specialized network applications are being created that need to be able to transmit large amounts of data across dedicated network links. that the system hardware is simply incapable of saturating the bandwidths supported by the network infrastructure. and the experimental results demonstrate that PA-UDP outperforms other existing high-speed protocols on commodity hardware in terms of throughput. packet loss. . but also for reliable high-performance bulk data transfer over dedicated local area networks where congestion and fairness are typically not a concern. Based on these models.2009. TCP fails to be a suitable method of bulk data transfer in many of these applications. 2010 Volume : 21 . and CPU utilization. A novel delay-based rate-throttling model is also demonstrated to be very accurate under diverse system latencies. This paper develops such a protocol. which aims to dynamically and autonomously maximize performance under different systems. It is therefore necessary to build a high-speed protocol adaptive to the performance of each system by including a dynamic performance-based flow control.

. The 27th Conference on Computer Communications. Most research on the establishment of primary and backup paths has focused on minimizing the added capacity required by the backup paths in the network. One of our most important conclusions is that when one seeks to maximize revenue. We present efficient heuristics which are shown to have excellent performance. IEEE Issue Date : 13-18 April 2008 On page(s): 2324 . this so-called spare capacity allocation (SCA) metric is less practical for network operators who have a fixed capacitated network and want to maximize their revenues. Their main advantage is that their backup paths are established in advance. local recovery should be the recovery scheme of choice. We present the first polynomial-time algorithms for the split table version of the problem. before a failure event takes place.2332 Location: Phoenix. Maximizing Restorable Throughput in MPLS Networks This paper appears in: INFOCOM 2008. we provide a lower bound for the approximation ratio. In this paper we present a comprehensive study on restorable throughput maximization in MPLS networks.301 Date of Current Version : 02 May 2008 ABSTRACT:MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. However.16. AZ ISSN : 0743-166X Print ISBN: 978-1-4244-2025-4 INSPEC Accession Number: 9945310 Digital Object Identifier : 10.2008. For the unsplittable version.1109/INFOCOM.

17. Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks
This paper appears in: Distributed Computing Systems, 2006. ICDCS 2006. 26th IEEE International Conference on Issue Date : 2006 On page(s): 15 - 15 ISSN : 1063-6927 Print ISBN: 0-7695-2540-7 Digital Object Identifier : 10.1109/ICDCS.2006.35 Date of Current Version : 24 July 2006 ABSTRACT:Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of network nodes and the non-uniform and timevarying file popularity. Existing DHT load balancing algorithms are mainly focused on the issues caused by node heterogeneity. To deal with skewed lookups, this paper presents an elastic routing table (ERT) mechanismfor query load balancing, based on the observation that high degree nodes tend to experience more traffic load. The mechanism allows each node to have a routing table of variable size corresponding to its capacity. The indegree and outdegree of the routing table can also be adjusted dynamically in response to the change of file popularity and network churn. Theoretical analysis proves the routing table degree is bounded. The ERT mechanism facilitates locality-aware randomized query forwarding to further improve lookup efficiency. By relating query forwarding to a supermarket customer service model, we prove a 2-way randomized query forwarding policy leads to an exponential improvement in query processing time over random walking. Simulation results demonstrate the effectiveness of the ERT mechanism and its related query forwarding policy forcongestion and query load balancing. In comparison with the existing "virtual-server"-based load balancing algorithm and other routing table control approaches, the ERTbased congestion control protocol yields significant improvements in query lookup efficiency.

18. Improving Reliability for Application-Layer Multicast Overlays
This paper appears in: Parallel and Distributed Systems, IEEE Transactions on Issue Date : Aug. 2010 Volume : 21 , Issue:8 On page(s): 1103 - 1116 ISSN : 1045-9219 INSPEC Accession Number: 11388499 Digital Object Identifier : 10.1109/TPDS.2009.166 Date of Publication : 07 January 2010 Date of Current Version : 28 June 2010 Sponsored by : IEEE Computer Society ABSTRACT:Reliability of tree-like multicast overlays caused by nodes' abrupt failures is considered as one of the major problems for the Internet application-layer media streaming service. In this paper, we address this problem by designing a distributed and light-weighted protocol named the instantaneous reliability oriented protocol (IRP). Unlike most of existing empirical solutions, we first define the overlay reliability problem formally, and propose a protocol containing a node joining algorithm (IRP-Join), a node preemption algorithm (IRP-Preempt), and a node switching algorithm (IRP-Switch) for reactively constructing and repairing the overlay, as well as proactively maintaining the overlay. With the formal problem presentation, we set up a paradigm for solving the overlayreliability problem by theoretically proving the effectiveness of our algorithms. Moreover, by comparing IRP with existing solutions via simulation-based experiments and real-world deployment, we show that IRP achieves a better reliability, while incurs fewer structural adjustments on the multicast overlay, thus, providing a superior overall performance.

19. Towards an Effective XML Keyword Search
This paper appears in: Knowledge and Data Engineering, IEEE Transactions on Issue Date : Aug. 2010 Volume : 22 , Issue:8 On page(s): 1077 - 1092 ISSN : 1041-4347 Digital Object Identifier : 10.1109/TKDE.2010.63 Date of Publication : 22 April 2010 Date of Current Version : 24 June 2010 Sponsored by : IEEE Computer Society ABSTRACT:Inspired by the great success of information retrieval (IR) style keyword search on the web, keyword search onXML has emerged recently. The difference between text database and XML database results in three new challenges: 1) Identify the user search intention, i.e., identify the XML node types that user wants to search for and search via. 2) Resolve keyword ambiguity problems: a keyword can appear as both a tag name and a text value of some node; a keyword can appear as the text values of different XML node types and carry different meanings; a keyword can appear as the tag name of different XML node types with different meanings. 3) As thesearch results are subtrees of the XML document, new scoring function is needed to estimate its relevance to a given query. However, existing methods cannot resolve these challenges, thus return low result quality in term of query relevance. In this paper, we propose an IRstyle approach which basically utilizes the statistics of underlying XML data to address these challenges. We first propose specific guidelines that a search engine should meet in both search intention identification and relevance oriented ranking for search results. Then, based on these guidelines, we design novel formulae to identify the search for nodes and search via nodes of a query, and present a novel XML TF*IDF ranking strategy to rank the individual matches of all possible search intentions. To complement our result ranking framework, we also take the popularity into consideration for the results that have comparable relevance scores. Lastly, extensive experiments have been conducted to show the effectiveness of our approach.

144 Date of Publication : 11 June 2009 Date of Current Version : 20 May 2010 Sponsored by : IEEE Computer Society ABSTRACT:User profiling is a fundamental component of any personalization applications..e. Experimental results show that profiles which capture and utilize both of the user's positive and negative preferences perform the best. In this paper. we focus on search engine personalization and develop several concept-based user profiling methods that are based on both positive and negative preferences. positive preferences). but not the objects that users dislike (i. The separation provides a clear threshold for an agglomerative clustering algorithm to terminate and improve the overall quality of the resulting query clusters.1109/TKDE.e.2009. Most existing user profiling strategies are based on objects that users are interested in (i.982 ISSN : 1041-4347 INSPEC Accession Number: 11341010 Digital Object Identifier : 10. IEEE Transactions on Issue Date : July 2010 Volume : 22 . . We evaluate the proposed methods against our previously proposed personalized query clustering method. An important result from the experiments is that profiles with negative preferences can increase the separation between similar and dissimilar queries. Issue:7 On page(s): 969 . negative preferences).. Deriving Concept-Based User Profiles from Search Engine Logs This paper appears in: Knowledge and Data Engineering.20.

21. Extensive experimental results also demonstrate that. LIGHT is designed over generic DHTs and hence can be easily implemented and deployed in any DHT-based P2P system. compared with state of the art over-DHT indexing schemes.2009. Unfortunately.g. as uniform hashing employed in DHTsdestroys data locality. Issue:1 On page(s): 59 . In addition. we propose LIGhtweight Hash Tree (LIGHT)-a query-efficient yet low maintenance indexing scheme. existing overDHT indexing schemes suffer from either query inefficiency or high maintenance cost. IEEE Transactions on Issue Date : Jan. In order to support efficient processing of such complex queries. LIGHT employs a novel naming mechanism anda tree summarization strategy for graceful distribution of its index structure. LIGHT saves 50-75 percent ofindex maintenance cost and substantially improves query performance in terms of both response time and bandwidth consumption. 2010 Volume : 22 . In this paper.. LIGHT: A Query-Efficient yet Low-Maintenance Indexing Scheme over DHTs This paper appears in: Knowledge and Data Engineering. apopular solution is to build indexes on top of the DHT. it is not a trivial task to support complex queries (e. . We show through analysis that it can support various complex queries with near-optimal performance.75 ISSN : 1041-4347 INSPEC Accession Number: 10995214 Digital Object Identifier : 10.1109/TKDE. However. range queries and knearest-neighbor queries) in DHT-based P2P systems.47 Date of Publication : 13 February 2009 Date of Current Version : 24 November 2009 Sponsored by : IEEE Computer Society ABSTRACT:DHT is a widely used building block for scalable P2P systems.

Experimental evaluation on three data corpora shows that the proposed method can improve the performance especially only with a small amount of labeled positive data.58 ISSN : 1041-4347 INSPEC Accession Number: 10995213 Digital Object Identifier : 10. Instead. but most of these methods do not work well when only a small amount of labeled positive data are available. We develop an iterative algorithm that can obtain the local optimum of the objective function. IEEE Transactions on Issue Date : Jan. Several approaches for solving this problem have been proposed in the past. 2010 Volume : 22 . A large amount of unlabeled data are easier to obtain. . In this paper. Issue:1 On page(s): 46 . these are the only labeled examplesavailable for the learning system. which is a purely unsupervised framework. we propose a novel algorithm called TopicSensitive pLSA to solve this problem. The supervision from users is in the form of indicating which documents fit the users' interests.1109/TKDE. by injecting a small amount of supervision information from the user. How to make use of thepositive and unlabeled data for learning is a critical problem in machine learning and information retrieval. This algorithm extends the original probabilistic latent semantic analysis (pLSA). users often find it easier to indicate just a few positive examples of what he or she likes. By introducing the penalty terms for these constraints. and thus.2009. we propose an objective function that trades off the likelihood of the observed data and the enforcement of the constraints.22.56 Date of Publication : 27 February 2009 Date of Current Version : 24 November 2009 Sponsored by : IEEE Computer Society ABSTRACT:It is often difficult and time-consuming to provide a large amount of positive and negative examples for training a classification system in many applications such as information retrieval. The supervision is encoded into a set of constraints. Learning with Positive and Unlabeled Examples Using Topic-Sensitive PLSA This paper appears in: Knowledge and Data Engineering.

23. With extensive experiments. IEEE Transactions on Issue Date : May 2010 Volume : 22 . We also propose two approaches to processing the aggregate VkNN query. Issue:5 On page(s): 665 .681 ISSN : 1041-4347 INSPEC Accession Number: 11180161 Digital Object Identifier : 10. with two variants differing in how to prune objects during the search process. we are only interested in objects that are directly visible from query points. Our experimental results show that the latter outperforms the former.1109/TKDE. whereas the other variant applies visibility pruning to index nodes as well. we formulate the visible nearest neighbor (VkNN) query and present incremental algorithms as a solution. . One variant applies visibility pruning to only objects.158 Date of Publication : 09 July 2009 Date of Current Version : 18 March 2010 Sponsored by : IEEE Computer Society ABSTRACT:In many applications involving spatial objects. Incremental Evaluation of Visible Nearest Neighbor Queries This paper appears in: Knowledge and Data Engineering. One accesses the database via multiple VkNN queries. We further propose the aggregate VkNN query that finds the visible k nearest objects to a set of query points based on an aggregate distance function. whereas the other issues an aggregate nearest neighbor query to retrieve objects from the database and then re-rank the results based on the aggregate visible distance metric.2009. In this paper. we show that the latter approach consistently outperforms the former one.

24. Issue:7 On page(s): 982 .1109/TMC. we propose a novel multicast authenticationprotocol.2010. divide a multicast stream into blocks. The correlation among packets makes them vulnerable to packet loss. namely MABS. associate each block with a signature. We also present an enhanced scheme MABS-E. In this paper. Moreover. and communication overhead due to an efficient cryptographic primitive called batch signature. and spread the effect of the signature across all the packets in the block through hash graphs or coding algorithms. MABS: Multicast Authentication Based on Batch Signature This paper appears in: Mobile Computing. the lack of Denial of Service (DoS) resilience renders most of them vulnerable to packet injection in hostile environments. IEEE Transactions on Issue Date : July 2010 Volume : 9 . which supports the authentication of any number of packets simultaneously.993 ISSN : 1536-1233 INSPEC Accession Number: 11307712 Digital Object Identifier : 10. computation. . which combines the basic scheme with a packet filtering mechanism to alleviate the DoS impact while preserving the perfect resilience to packet loss. which is inherent in the Internet and wireless networks.37 Date of Publication : 18 March 2010 Date of Current Version : 20 May 2010 Sponsored by : IEEE Computer Society ABSTRACT:Conventional block-based multicast authentication schemes overlook the heterogeneity of receivers by letting the sender choose the block size. including two schemes. The basic scheme (MABS-B) eliminates the correlation among packets and thus provides the perfect resilience to packet loss. and it is also efficient in terms of latency.

We also formulate an optimization problem to minimize the endto-end energy consumption under given security constraints. In this paper. the adversary still cannot pinpoint the routes traversed by each packet.954 ISSN : 1536-1233 INSPEC Accession Number: 11313708 Digital Object Identifier : 10. . We argue that classic multipath routing approaches are vulnerable to such attacks. the generated routes are also highly dispersive and energy efficient. We analytically investigate the security and energy performance of the proposed schemes.1109/TMC. hence. making all information sent over these routes vulnerable to its attacks. Issue:7 On page(s): 941 . mainly due to their deterministic nature. we study data delivery mechanisms that can with high probability circumvent black holes formed by these attacks. we develop mechanisms that generate randomized multipath routes. Under our designs. making them quite capable of circumventing black holes. Secure Data Collection in Wireless Sensor Networks Using Randomized Dispersive Routes This paper appears in: Mobile Computing. the routes taken by the ¿ shares¿ of different packets change over time.2010.36 Date of Publication : 18 March 2010 Date of Current Version : 20 May 2010 Sponsored by : IEEE Computer Society ABSTRACT:Compromised node and denial of service are two key attacks in wireless sensor networks (WSNs). So even if the routing algorithm becomes known to the adversary. So once the adversary acquires the routing algorithm. Besides randomness. it can compute the same routes known to the source. IEEE Transactions on Issue Date : July 2010 Volume : 9 .25. Extensive simulations are conducted to verify the validity of our mechanisms. In this paper.

26. Experimental studies show that the heuristic algorithms achieve good performance in reducing communication cost and are close to optimal solutions. we investigate the problem of optimal allocation of sensitive data objects that are partitioned by using secret sharing scheme or erasure coding scheme and/or replicated.64 ISSN : 1545-5971 INSPEC Accession Number: 11136128 Digital Object Identifier : 10. we consider data partitioning (both secret sharing and erasure coding) and dynamic replication in data grids. We develop two heuristic algorithms for the two sub problems. . IEEE Transactions on Issue Date : Jan. Secure Data Objects Replication in Data Grid This paper appears in: Dependable and Secure Computing. We decompose the share replica allocation problem into two sub problems: the optimal intercluster resident set problem (OIRSP) that determines which clusters need share replicas and the optimal intracluster share allocation problem (OISAP) that determines the number of share replicas needed in a cluster and their placements. The topology within each cluster is represented by a tree graph. in which security and data access performance are critical issues. multiple clusters form a network topology that can be represented by a general graph.-March 2010 Volume : 7 . In the upper layer. In this paper. More specifically. Issue:1 On page(s): 50 .1109/TDSC. and availability of critical information.2008. The grid topology we consider consists of two layers.19 Date of Publication : 10 June 2008 Date of Current Version : 08 February 2010 Sponsored by : IEEE Computer Society ABSTRACT:Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality. these data fragmentation approaches can be combined with dynamic replication. To achieve performance goals in data accesses. integrity.

1109/TPDS. has emerged as a larger threat to network services.2009. Issue:8 On page(s): 1203 . To identify application Do attack. Owing to its high similarity to legitimate traffic and much lower launching overhead than classic DoS attack. which not only offers a theoretical method to obtain short detection delay and low false positive/negative rate. More specifically. according to specific testing matrices. Detecting Application Denial-of-Service Attacks: A GroupTesting-Based Approach This paper appears in: Parallel and Distributed Systems. Based on this framework. this new assault type cannot be efficiently detected or prevented by existing detection solutions. . we propose a two-mode detection mechanism using some dynamic thresholds to efficiently identify the attackers. but also provides an underlying framework against general network attacks. then redistribute the client service requests to multiple virtual servers embedded within each back-end server machine. Further discussions over implementation issues and performance enhancements are also appended to show its great potentials. we propose a novel group testing (GT)-based approach deployed on backend servers. 2010 Volume : 21 . compared to the classic DoS attack. IEEE Transactions on Issue Date : Aug. which aims at disrupting application service rather than depleting the network resource. we first extend classic GT model with size constraints for practice purposes. We also provide preliminary simulation results regarding the efficiency and practicability ofthis new scheme.1216 ISSN : 1045-9219 INSPEC Accession Number: 11388500 Digital Object Identifier : 10.147 Date of Publication : 03 September 2009 Date of Current Version : 28 June 2010 Sponsored by : IEEE Computer Society ABSTRACT:Application DoS attack. The focus of this work lies in the detection algorithms proposed and the corresponding theoretical complexity analysis.27.

28.80 Date of Publication : 22 April 2010 Date of Current Version : 24 May 2010 Sponsored by : IEEE Computer Society ABSTRACT With abundant aggregate network bandwidth.g.2010. Existing strategies explore data stream authentication by using message authentication codes (MACs) on a certain number of data packets (a data block) to generate a message digest. Modeling-based analysis and experiments conducted on unimplemented prototype system in an LAN and over the Internet show that our proposed scheme is efficient and practical. which is not acceptable under some circumstances (e.g..1109/TC. In this paper. which consumes more critical resources (e. we propose a novel strategy. there is an increasing demand of authenticating these data streams. Sending the digest out-of-band incurs additional communication overhead. power in wireless devices for receiving information) besides network bandwidth. IEEE Transactions on Issue Date : July 2010 Volume : 59 . then either embedding the digest into the original data. Embedding approaches inevitably change the original data.954 ISSN : 0018-9340 INSPEC Accession Number: 11314145 Digital Object Identifier : 10. when sensitive information is included in the data).. which effectively authenticates data streams by selectively adjusting some interspaced delay. An Application-Level Data Transparent Authentication Scheme without Communication Overhead This paper appears in: Computers. This authentication scheme requires no change to the original data and no additional communication overhead. or sending the digest out-ofband to the receiver. Issue:7 On page(s): 943 . Correspondingly. . DaTA. continuous data streams are commonly used in scientific and commercial applications.

. Using that URL. from a website trusted by the target website. WRAPS does not require changes to web client software and is extremely lightweight for referrer websites. IEEE Transactions on Issue Date : April-June 2010 Volume : 7 . at the cost of small overheads on the website's ISP's edge routers.2008. Our empirical study demonstrates that WRAPS enables legitimate clients to connect to a website smoothly in spite of a very intensive flooding attack. the client can get privileged access to the target website in a manner that is far less vulnerable to a distributed denial-of-service (DDoS) flooding attack than normal access would be. WRAPS allows a legitimate client to obtain a privilege URL through a simple click on a referral hyperlink. In this paper. We present the design ofWRAPS. with millions of websites interlinked together. we propose to usethis web sitegraph structure to mitigate flooding attacks on a website. Issue:2 On page(s): 203 . and the implementation of a prototype system used to evaluate our proposal. Using Web-Referral Architectures to Mitigate Denial-ofService Threats This paper appears in: Dependable and Secure Computing.216 ISSN : 1545-5971 INSPEC Accession Number: 11340845 Digital Object Identifier : 10. The massive scale of the websitegraph could deter attempts to isolate a website through blocking all referrers. using a new web referral architecture for privileged service (“WRAPS”).1109/TDSC. which makes its deployment easy.56 Date of Publication : 10 October 2008 Date of Current Version : 18 May 2010 Sponsored by : IEEE Computer Society ABSTRACT:The web is a complicated graph. We discuss the security properties of WRAPS and a simple approach to encourage many small websites to help protect an important site during DoS attacks.29.

to iteratively identify duplicates in the query results from multiple Web databases. Experimental results show that UDD works well for the Web database scenario where existing supervised methods do not apply. Most stateof-the-art record matching methods are supervised.1109/TKDE. which. Such records are query-dependent and a prelearned method using training examples from previous query results may fail on the results of a new query. online recordmatching method. Record Matching over Query Results from Multiple Web Databases This paper appears in: Knowledge and Data Engineering. which identifies the records that represent the same real-world entity. the ¿presumed¿ nonduplicate records from the same source can be used as training examples alleviating the burden of users having to manually label training examples. These methods are not applicable for the Web database scenario. .589 ISSN : 1041-4347 INSPEC Accession Number: 11151913 Digital Object Identifier : 10. UDD. To address the problem of record matching in the Web database scenario. a weighted component similarity summing classifier and an SVM classifier. for a given query.2009. which requires the user to provide training data.30. After removal of the same-source duplicates. IEEE Transactions on Issue Date : April 2010 Volume : 22 . Starting from the nonduplicate set.where the records tomatch are query results dynamically generated on-the-fly. Issue:4 On page(s): 578 . we use two cooperating classifiers. can effectively identify duplicates from the query resultrecords of multiple Web databases. we present an unsupervised.90 Date of Publication : 23 April 2009 Date of Current Version : 25 February 2010 Sponsored by : IEEE Computer Society ABSTRACT:Record matching. is an important step for data integration.

Vulnerability Discovery with Attack Injection This paper appears in: Software Engineering. . The observation of an unexpected behavior suggests the presence of a vulnerability that was triggered by some particular attack (or group of attacks). compromising the security of systems.31. IEEE Transactions on Issue Date : May-June 2010 Volume : 36 . This is even more relevant as new threats and forms of attack are constantly being revealed. several attack injection campaigns were performed with 16 publicly available POP and IMAP servers. follows an approach similar to hackers and security analysts to discover vulnerabilities in network-connected servers. it monitors the execution of the server in the target system and the responses returned to the clients. AJECT uses a specification of the server's communication protocol and predefined test case generation algorithms to automatically create a large number of attacks. Then. The proposed methodology.370 ISSN : 0098-5589 INSPEC Accession Number: 11325660 Digital Object Identifier : 10. To assess the usefulness of this approach.91 Date of Publication : 07 January 2010 Date of Current Version : 27 May 2010 Sponsored by : IEEE Computer Society ABSTRACT:The increasing reliance put on networked computer systems demands higher levels of dependability. The results show that AJECT could effectively be used to locate vulnerabilities. Issue:3 On page(s): 357 .1109/TSE. implemented in AJECT. even on well-known servers tested throughout the years. This paper addresses this problem by presenting an attack injection methodology for the automatic discovery of vulnerabilities in software components. This attack can then be used to reproduce the anomaly and to assist the removal of the error.2009. while it injects these attacks through the network.

Our study defines new methodologies and metrics. we capture all packets crossing a (lightly utilized) operational access router from a Tier-1 provider. In particular. IEEE/ACM Transactions on Issue Date : June 2009 Volume : 17 . without model assumptions. and at achievable computational cost.2008. and reporting.802 ISSN : 1063-6692 INSPEC Accession Number: 10704986 Digital Object Identifier : 10. .32.1109/TNET. and use them to provide a detailed examination of router congestion and packet delays. The complete capture enables not just statistics as seen from outside the router. but also an accurate physical router model to be identified. Issue:3 On page(s): 789 . Capturing Router Congestion and Delay This paper appears in: Networking. the traffic reporting enables a rich description of the diversity of micro congestion behavior.927258 Date of Publication : 25 July 2008 Date of Current Version : 16 June 2009 Sponsored by : Association for Computing Machinery ABSTRACT:Using a unique monitoring experiment. measurement. This enables a comprehensive examination of congestion andb delay from three points of view: the understanding of origins.

interleaved with some indexing information for query processing.e. Continuous Monitoring of Spatial Queries in Wireless Broadcast This paper appears in: Mobile Computing. we propose an air indexing framework that 1) outperforms the existing (i. the data are continuously broadcast by the server.14 Date of Publication : 19 January 2009 Date of Current Version : 21 August 2009 Sponsored by : IEEE Computer Society ABSTRACT:Wireless data broadcast is a promising technique for information dissemination that leverages the computational capabilities of the mobile devices in order to enhance the scalability of the system.1311 ISSN : 1536-1233 INSPEC Accession Number: 10840273 Digital Object Identifier : 10. Under this environment. Previous work on spatial query processing for wireless broadcast systems has only considered snapshot queries over static data. IEEE Transactions on Issue Date : Oct.2009.1109/TMC. snapshot) techniques in terms of energy consumption while achieving low access latency and 2) constitutes the first method supporting efficient processing of continuous spatial queries over moving objects.. 2009 Volume : 8 . Clients may then tune in the broadcast channel and process their queries locally without contacting the server. In this paper. Issue:10 On page(s): 1297 .33. .

the end-to-end QoS metric can be tracked. We show that if the coherence time is greater than the spreading period. Energy Maps for Mobile Wireless networks coherence Time Versus Spreading Period This paper appears in: Mobile Computing. We focus on the energy consumption as the endto-end QoS metric. Finally. the end-to-end quality-of-service (QoS) metrics can be stationary when the mobile network is viewed in the aggregate.2009. IEEE Transactions on Issue Date : June 2009 Volume : 8 . and describe a novel method by which an energy map can be constructed and refined in the joint memory of the mobile nodes. Issue:6 On page(s): 778 .791 ISSN : 1536-1233 INSPEC Accession Number: 10587490 Digital Object Identifier : 10. we show how energy maps can be utilized by an application that aims to minimize a node's total energy consumption over its near-future trajectory. We define the coherence time as the maximum duration for which the end-to-end QoS metric remains roughly constant.1109/TMC.32 Date of Publication : 02 February 2009 Date of Current Version : 21 April 2009 Sponsored by : IEEE Computer Society ABSTRACT:We show that even though mobile networks are highly unpredictable when viewed at the individual node scale. .34. and the spreading period as the minimum duration required to spread QoS information to all the nodes.

we show that the routes chosen by our algorithm (centralized and distributed) are more energy efficient than the state of the art.1109/TMC. Under certain assumptions on how links are scheduled. Issue:5 On page(s): 668 . we develop an energy-efficient routing scheme that takes into account the interference created by existing flows in the network.35. We also develop a distributed version of the algorithm. Using simulations. we explicitly study the impact of routing a new flow on the energy consumption of the network. Our algorithm automatically detours around a congested area in the network. IEEE Transactions on Issue Date : May 2009 Volume : 8 .165 Date of Publication : 17 November 2008 Date of Current Version : 21 March 2009 Sponsored by : IEEE Computer Society ABSTRACT:In this paper. Unlike previous works. which helps mitigate network congestion and improve overall network performance.681 ISSN : 1536-1233 INSPEC Accession Number: 10520185 Digital Object Identifier : 10. The routing scheme chooses a route such that the network expends the minimum energy satisfying with the minimum constraints of flows. . we can show that our proposed algorithm is asymptotically (in time) optimal in terms of minimizing the average energy consumption. Energy-Efficient SINR-Based Routing for Multihop Wireless This paper appears in: Mobile Computing.2008.

We develop two complementary vulnerability definitions using set theoretic and circuit theoretic interpretations of the security of network traffic. Issue:2 On page(s): 111 . We discuss the availability of security parameters to the adversary and show that unknown parameters can be estimated using probabilistic analysis. a Greedy Node capture Approximation using Vulnerability Evaluation. We formalize node capture attacks using the vulnerability metric as a nonlinear integer programming minimization problem and propose the GNAVE algorithm. IEEE Transactions on Issue Date : April-June 2009 Volume : 6 .60 Date of Publication : 07 November 2008 Date of Current Version : 08 May 2009 Sponsored by : IEEE Computer Society ABSTRACT:Joint analysis of security and routing protocols in wireless networks reveals vulnerabilities of secure network traffic that remain undetected when security and routing protocols are analyzed independently.36. Evaluating the Vulnerability of Network Traffic Using Joint This paper appears in: Dependable and Secure Computing.1109/TDSC. We formulate a class of continuous metrics to evaluate the vulnerability of network traffic as a function of security and routing protocols used in wireless networks. .2008. We demonstrate vulnerability evaluation using the proposed metrics and node capture attacks using the GNAVE algorithm through detailed examples and simulation.123 ISSN : 1545-5971 INSPEC Accession Number: 10630567 Digital Object Identifier : 10. allowing a network analyst or an adversary to determine weaknesses in the secure network.

We believe that the formal tools developed in this work could be extended to be used in more concrete settings and in more realistic models.1109/TMC.a model for mobile wireless networks in which vertices move in random directions in the unit torus. We provide precise asymptotic results for the expected length of theconnectivity and disconnectivity periods of the network. Issue:6 On page(s): 821 .37. The model presented here follows the one described.2009. IEEE Transactions on Issue Date : June 2009 Volume : 8 .835 ISSN : 1536-1233 INSPEC Accession Number: 10587486 Digital Object Identifier : 10. in the same manner as the development of the connectivity threshold for static random geometric graphs has affected a lot of research done on ad hoc networks. .42 Date of Publication : 20 February 2009 Date of Current Version : 21 April 2009 Sponsored by : IEEE Computer Society ABSTRACT:We provide the first rigorous analytical results for the connectivity of dynamic random geometric graphs .Large Connectivity for Dynamic Random Geometric Graphs This paper appears in: Mobile Computing.

targeted subpaths of a path in the network. Issue:1 On page(s): 80 .38.Measuring Capacity Bandwidth of Targeted Path Segments This paper appears in: Networking.92 ISSN : 1063-6692 INSPEC Accession Number: 10475543 Digital Object Identifier : 10. best-practice techniques for the former are inefficient and techniques for the latter are only able to observe bottlenecks visible at end-to-end scope. we develop end-to-end probing methods which can measure bottleneck capacity bandwidth alongarbitrary. In this paper.2008. 2009 Volume : 17 .2008702 Date of Publication : 12 December 2008 Date of Current Version : 18 February 2009 Sponsored by : Association for Computing Machinery ABSTRACT:Accurate measurement of network bandwidth is important for network management applications as well as flexible Internet applications and protocols which actively manage and dynamically adapt to changing utilizationof network resources. We evaluate our technique through ns simulations. We also describe a number of applications which we foresee as standing to benefit from solutions to this problem. . IEEE/ACM Transactions on Issue Date : Feb. to optimized replica placement.1109/TNET. ranging from network troubleshooting and capacity provisioning to optimizing the layout of application-level overlay networks. then provide a comparative Internet performance evaluation against hop-by-hop and end-to-end techniques. and measuring it end-to-end along a path. Extensive work has focused on two approaches to measuring bandwidth: measuring it hop-by-hop. including subpaths shared by a set of flows. Unfortunately.

We propose an algorithm called GUIDE for the identification ofcompromised users in the system based on the set of control channels that are jammed.33 Date of Publication : 06 February 2009 Date of Current Version : 17 July 2009 Sponsored by : IEEE Computer Society ABSTRACT:Availability of service in many wireless networks depends on the ability for network users to establish and maintain communication channels using control messages from base stations and other users. The use of spread spectrum techniques can deter an external adversary from such control channel jamming attacks. IEEE Transactions on Issue Date : Sept. Issue:9 On page(s): 1221 . we propose a framework for control channelaccess schemes using the random assignment of cryptographic keys to hide the location of control channels.1109/TMC. .2009. We discuss various design trade-offs between robustness to control channel jamming and resource expenditure. For the case of internal adversaries. malicious colluding insiders or an adversary who captures or compromises system users is not deterred by spread spectrum. as they know the required spreading sequences. We propose and evaluate metrics to quantify the probabilistic availability of service under control channel jammingby malicious or compromised users and show that the availability of service degrades gracefully as the number ofcolluding insiders or compromised users increases. Mitigation of Control Channel Jamming Under Node Capture Attacks This paper appears in: Mobile Computing. However.1234 ISSN : 1536-1233 INSPEC Accession Number: 10780872 Digital Object Identifier : 10. 2009 Volume : 8 . We evaluate the estimation error using the GUIDE algorithm in terms of the false alarm and miss rates in the identification problem.39. An adversary with knowledge of the underlying communication protocol can mount an efficient denial of service attack by jammingthe communication channels used to exchange control messages.

40. For high-mobility MTs. 2009 Volume : 8 . The Multicast HMIP strategy limits the registration processes in the GFAs.2009. it provides lowest mobility signaling delay compared to the HMIP and DHMIP approaches. IEEE Transactions on Issue Date : Oct. we propose an analytic model to evaluate the mean signaling delay and the mean bandwidth per call according to the type of MT mobility. . The mobile Internet protocol (MIP) has been proposed to support global mobility in IP networks. yielding to highmobility signaling.36 Date of Publication : 13 February 2009 Date of Current Version : 21 August 2009 Sponsored by : IEEE Computer Society ABSTRACT In wireless networks. the MHMIP outperforms the DHMIP and MIP strategies in almost all the studied cases. it is resource consuming strategy unless for frequent MT mobility. For high-mobility MTs. Issue:10 On page(s): 1312 .1109/TMC. Several mobility management strategies have been proposed which aim reducing the signaling traffic related to the Mobile Terminals (MTs) registration with the Home Agents (HAs) whenever their Care-of-Addresses (CoAs) change. the Hierarchical MIP (HMIP) and Dynamic HMIP (DHMIP) strategies localize the registration in FAs and GFAs. However. The main contribution of this paper is the analytic model that allows the mobility management approaches performance evaluation.1325 ISSN : 1536-1233 INSPEC Accession Number: 10840274 Digital Object Identifier : 10.Mobility Management Approaches for Mobile IP Networks This paper appears in: Mobile Computing. In our analysis. Hence. efficient management of mobility is a crucial issue to support mobile users. They use different foreign agents (FAs) and Gateway FAs (GFAs) hierarchies to concentrate the registration processes.

. In this paper we present MRC.Multiple Routing Configurations for Fast IP Network Recovery This paper appears in: Networking. MRC is based on keeping additional routing information in the routers.2008. To assure fast recovery from link and node failures in IP networks.1109/TNET. and without knowing the root cause of the failure. Issue:2 On page(s): 473 . and thus reduce the chances of congestion when MRC is used. We also show how an estimate of the traffic demands in the network can be used to improve the distribution of the recovered traffic.41. It can be implemented with only minor changes to existing solutions. we present a new recovery scheme called Multiple Routing Configurations (MRC). and load distribution after a failure. backup path lengths. MRC is strictly connectionless.486 ISSN : 1063-6692 INSPEC Accession Number: 10572993 Digital Object Identifier : 10. the slow convergence ofrouting protocols after a network failure becomes a growing problem. using a single mechanism to handle both link and node failures.926507 Date of Publication : 25 July 2008 Date of Current Version : 14 April 2009 Sponsored by : Association for Computing Machinery ABSTRACT:As the Internet takes an increasingly central role in our communications infrastructure. and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure. IEEE/ACM Transactions on Issue Date : April 2009 Volume : 17 . and assumes only destination based hop-by-hop forwarding. and analyze its performance with respect to scalability. Our proposed scheme guarantees recovery in all single failure scenarios.

the proposed method can reduce bandwidth consumption by several orders of magnitude compared to prior approaches while simultaneously achieving higher accuracy.2008. .1109/TNET. which divides a given observation window into two halves and samples users ldquocreatedrdquo in the first half every Delta time units until they die or the observation period ends. we propose a completely different approach for sampling user dynamics that keeps track of only residual lifetimes of peers and uses a simple renewal-process model to recover the actual lifetimes from the observed residuals.2001727 Date of Publication : 03 October 2008 Date of Current Version : 16 June 2009 Sponsored by : Association for Computing Machinery ABSTRACT:Existing methods of measuring lifetimes in P2P systems usually rely on the so-called Create-Based Method (CBM). this approach has no rigorous accuracy or overhead analysis in the literature. Issue:3 On page(s): 726 . Residual-Based Estimation of Peer and Link Lifetimes in P2P Networks This paper appears in: Networking. however.1. To shed more light on its performance. We finish the paper by implementing a two-tier Gnutella network crawler equipped with the proposed sampling method and obtain the distribution of ultra peer lifetimes in a network of 6.42.4 million users and 60 million links.739 ISSN : 1063-6692 INSPEC Accession Number: 10704994 Digital Object Identifier : 10. Our experimental results show that ultra peer lifetimes are Pareto with shape alpha ap 1.8. we first derive a model for CBM and show that small window size or large Delta may lead to highly inaccurate lifetime distributions. Instead. which does not allow any fundamental improvement to the method. We then show that create-based sampling exhibits an inherent tradeoff between overhead and accuracy. Our analysis indicates that for reasonably large systems. link lifetimes exhibit much lighter tails with alpha ap 1. Despite its frequent use. IEEE/ACM Transactions on Issue Date : June 2009 Volume : 17 .

2008.SIMPS Using Sociology for Personal Mobility This paper appears in: Networking. instead. Starting from established research in sociology. Although our model defines only two simple individual behaviors.SIMPS leads to results that agree with scaling laws observed both in small-scale and large-scale human motion.2003337 Date of Publication : 03 October 2008 Date of Current Version : 16 June 2009 Sponsored by : Association for Computing Machinery ABSTRACT:Assessing mobility in a thorough fashion is a crucial step toward more efficient mobile network design. path formation.1109/TNET. and evolution). rendered by two complimentary behaviors. IEEE/ACM Transactions on Issue Date : June 2009 Volume : 17 . we observe many emerging collective behaviors (group formation/splitting.43.842 ISSN : 1063-6692 INSPEC Accession Number: 10704997 Digital Object Identifier : 10. that regulate an individual with regard to her/his own sociability level. we propose SIMPS. Recent research on mobility has focused on two main points: analyzing models and studying their impact on data transport. Issue:3 On page(s): 831 . This model defines a process called sociostation. In this paper. we focus on the causes of mobility. These works investigate the consequences of mobility. . a mobility model of human crowds with pedestrian motion. namely socialize and isolate.

assuming that it is anomaly-free.44. Throughout. .1109/TNET. and (ii) a model-based approach modeling traffic using a Markov modulated process. thus. identifying traffic anomalies in real-time.2001468 Date of Publication : 09 September 2008 Date of Current Version : 16 June 2009 Sponsored by : Association for Computing Machinery ABSTRACT:We introduce an Internet traffic anomaly detection mechanism based on large deviations results for empirical measures. we compare the two approaches presenting their advantages and disadvantages to identify and classify temporal network anomalies. We also demonstrate how our framework can be used to monitor traffic from multiple network elements in order to identify both spatial and temporal anomalies. Issue:3 On page(s): 685 .697 ISSN : 1063-6692 INSPEC Accession Number: 10704990 Digital Object Identifier : 10. Spatio-Temporal Network Anomaly Detection by Assessing Deviations of Empirical Measures This paper appears in: Networking. We validate our techniques by analyzing real traffic traces with time-stamped anomalies. Using past traffic traces we characterize network traffic during various time-of-day intervals. We present two different approaches to characterize traffic: (i) a model-free approach based on the method of types and Sanov's theorem. Using these characterizations as a reference we continuously monitor traffic and employ large deviations and decision theory results to ldquocomparerdquo the empirical measure of the monitored traffic with the corresponding reference characterization.2008. Our experimental results show that applying our methodology (even short-lived) anomalies are identified within a small number of observations. IEEE/ACM Transactions on Issue Date : June 2009 Volume : 17 .

In particular. reaching an aggregate switching bandwidth of 320 Gbps.8 ns. We further propose a hardware implementation of our algorithm for a 16 times 16 buffered crossbar switch.262 Date of Publication : 31 December 2008 Date of Current Version : 28 April 2009 Sponsored by : IEEE Computer Society ABSTRACT:Internet traffic is a mixture of unicast and multicast flows.On the Integration of Unicast and Multicast Cell Scheduling in Buffered Crossbar Switches This paper appears in: Parallel and Distributed Systems. on the other hand. are known to have better performance than their buffer-less predecessors due to their potential in simplifying the scheduling and improving the switching performance. we propose an integrated round-robin-based scheduler that efficiently services bothunicast and multicast traffic simultaneously. Issue:6 On page(s): 818 .45. Our scheme. The implementation results suggest that MURS can run at 20 Gbps line rate and a clock cycle time of 2. has been shown to outperform all existing schemes under various traffic patterns. Integrated schedulers capable of dealing with both traffic types have been designed mainly for Input Queued (IQ) buffer-less crossbar switches.1109/TPDS. IEEE Transactions on Issue Date : June 2009 Volume : 20 . The design of integrated schedulers in CICQ switches has thus far been neglected. we propose a novel CICQ architecture that supports both unicast and multicast traffic along with its appropriate scheduling. . Simulation results suggested that we can trade the size of the internal buffers for the number of input multicast queues. named multicast and unicast round robin scheduling (MURS). Combined Input and crossbar queued (CICQ) switches.830 ISSN : 1045-9219 INSPEC Accession Number: 10601748 Digital Object Identifier : 10. In this paper.2008.

. a novel securemulticast routing protocol designed to withstand insider attacks from colluding adversaries. In this work. We propose BSMR. The multihop communication offers increased coverage for such services but also makes them more vulnerable to insider (or Byzantine) attacks coming from compromised nodes that behave arbitrarily to disrupt the network. Issue:4 On page(s): 445 .46. IEEE Transactions on Issue Date : April 2009 Volume : 8 .1109/TMC.2008.134 Date of Publication : 12 September 2008 Date of Current Version : 20 February 2009 Sponsored by : IEEE Computer Society ABSTRACT:Multihop wireless networks rely on node cooperation to provide multicast services.BSMR: Byzantine-Resilient Secure Multicast Routing in Multihop Wireless Networks This paper appears in: Mobile Computing. we identify vulnerabilities of on-demand multicast routing protocols for multihop wireless networks and discuss the challenges encountered in designing mechanisms to defend against them. We present simulation results that demonstrate that BSMR effectively mitigates the identified attacks.459 ISSN : 1536-1233 INSPEC Accession Number: 10476389 Digital Object Identifier : 10. Our protocol is a software-based solution and does not require additional or specialized hardware.

IEEE Transactions on Issue Date : May 2009 Volume : 8 . we explicitly study the impact of routing a new flow on the energy consumption of the network.2008. we can show that our proposed algorithm is asymptotically (in time) optimal in terms of minimizing the average energy consumption. Under certain assumptions on how links are scheduled.681 ISSN : 1536-1233 INSPEC Accession Number: 10520185 Digital Object Identifier : 10. Unlike previous works. The routing scheme chooses a route such that the network expends the minimum energy satisfying with the minimum constraints of flows. Our algorithm automatically detours around a congested area in the network.165 Date of Publication : 17 November 2008 Date of Current Version : 21 March 2009 Sponsored by : IEEE Computer Society ABSTRACT:In this paper.Energy-Efficient SINR-Based Routing for Multihop Wireless Networks This paper appears in: Mobile Computing. .47. we show that the routes chosen by our algorithm (centralized and distributed) are more energy efficient than the state of the art. which helps mitigate network congestion and improve overall network performance.1109/TMC. Issue:5 On page(s): 668 . We also develop a distributed version of the algorithm. we develop an energy-efficient routing scheme that takes into account the interference created by existing flows in the network. Using simulations.

IEEE/ACM Transactions on Issue Date : Feb.48. Issue:1 On page(s): 116 . . Unfortunately. BRA works by maintaining multi-hop reverse routes for unidirectional links and provides three new abilities: improved connectivity by taking advantage of the unidirectional links.BRA: A Bidirectional Routing Abstraction for Asymmetric Mobile Ad Hoc Networks This paper appears in: Networking. routing protocols for mobile ad -hoc networks typically work well only in bidirectional networks. non-uniform environmental noise. USA ISSN : 1063-6692 INSPEC Accession Number: 9816703 Digital Object Identifier : 10.1109/TNET. This paper first presents a simulation study quantifying the impact of asymmetric links on network connectivity and routing performance. and detection packet loss on unidirectional links. It then presents a framework called BRA that provides a bidirectional abstraction of the asymmetric network to routing protocols. CA. reverse route forwarding of control packets to enable off-the-shelf routing protocols. 2008 Volume : 16 . and other signal propagation phenomena. Extensive simulations of AODV layered on BRA show that packet delivery increases substantially (two-fold in some instances) in asymmetric networks compared to regular AODV.2007.129 Location: San Francisco.912064 Date of Current Version : 15 February 2008 Sponsored by : Association for Computing Machinery ABSTRACT:Wireless links are often asymmetric due to heterogeneity in the transmission power of devices. which only routes on bidirectional links.

In this paper. Issue:4 On page(s): 1530 . Header overhead for voice traffic is also reduced significantly. Further.49. A session admission control algorithm is presented to admit voice traffic into the system with QoS guarantee. we propose mechanisms to enhance the WLAN with voice quality of service (QoS) provisioning capability when supporting hybrid voice/data traffic. IEEE Transactions on Issue Date : April 2007 Volume : 6 .1541 ISSN : 1536-1276 INSPEC Accession Number: 9413104 Digital Object Identifier : 10. The real-time nature of voice traffic determines that controlled access rather than random access should be adopted. to fully exploit the capacity of the WLAN supporting voice traffic. Capacity Improvement and Analysis for Voice/Data Traffic over WLANs This paper appears in: Wireless Communications. Voice multiplexing is achieved by a polling mechanism in the contentionfree period and deterministic priority access for voice traffic in the contention period.2007. it is essential to explore statistical multiplexing and to suppress the large overhead. Analytical and simulation results demonstrate the effectiveness and efficiency of our proposed solutions .348349 Date of Current Version : 23 April 2007 Sponsored by : IEEE Communications Society ABSTRACT:Voice over wireless local area network (VoWLAN) is an emerging application taking advantage of the promising voice over Internet Protocol (VoIP) technology and the wide deployment of WLANs all over the world. Delay-tolerant data traffic is guaranteed an average portion of service time in the long run.1109/TWC.

a dynamic fully decentralized protocol that significantly reduces the duplicate messages by eliminating unnecessary cycles. ease of deployment. which introduce numerous duplicate messages in the system.2007. . Gnutella) and two-layer super peer implementations (for example. DCMP: A Distributed Cycle Minimization Protocol for Peer-to-Peer Networks This paper appears in: Parallel and Distributed Systems. contains many cyclic paths. we describe the distributed cycle minimization protocol (DCMP). distributed maintenance is performed efficiently even if peers quit the system without notification. Although such messages can be identified and ignored. it applies cycle elimination symmetrically around some powerful peers to keep the average path length small. and versatility.1109/TPDS. The experimental results from our simulator and the prototype implementation on Planet Lab confirm that DCMPsignificantly improves the scalability of unstructured P2P systems without sacrificing their desirable properties. are extremely popular nowadays due to their simplicity. The unstructured network topology. As queries are transmitted through the peers. With the information collected during this process. Instead. DCMP avoids creating a hierarchical organization. they still consume a large proportion of the bandwidth and other resources.50.377 ISSN : 1045-9219 INSPEC Accession Number: 9836274 Digital Object Identifier : 10. causing bottlenecks in the entire network. In order to preserve the fault resilience and load balancing properties of unstructured P2P systems. In this paper. DCMP identifies the problematic paths and attempts to break the cycles while maintaining the connectivity of the network.70732 Date of Current Version : 31 January 2008 Sponsored by : IEEE Computer Society ABSTRACT:Broadcast-based peer-to-peer (P2P) networks. IEEE Transactions on Issue Date : March 2008 Volume : 19 . The overall structure is constructed fast with very low overhead. however. Kazaa). including flat (for example. Issue:3 On page(s): 363 .

1109/TPDS. without the prerequisite of uniform distribution. address. 51. Each node is expected to have O(ln(n)) long links.Moreover.70725 Date of Current Version : 04 January 2008 Sponsored by : IEEE Computer Society ABSTRACT:This paper presents Harmonic Ring (HRing). Analyses and simulations demonstrate the efficiency of query routing and the effectiveness of the long link construction method.158 ISSN : 1045-9219 INSPEC Accession Number: 9767645 Digital Object Identifier : 10. Routing queries achieve O(ln(n)) hops. Issue:2 On page(s): 145 . HRing supports multidimensional range queries. so they can preserve the semantics and range locality of data objects. . string. HRing: A Structured P2P Overlay Based on Harmonic Series This paper appears in: Parallel and Distributed Systems. 2008 Volume : 19 . node IDs can be any form. In addition. a structured peer-topeer (P2P) overlay where long links are built along the ring with decreasing probabilities coinciding with the Harmonic Series. The construction of O(ln(n)) long links for a node costs (O(ln(n)) messages.2007. like number. and date. It supports leave-and-rejoin load balance without incurring uneven long link distribution. due to its simplicity. HRing constructs routing tablesbased on the distance between node positions instead of node IDs in order to eliminate the effect of node ID distribution on the long link distribution and load balance. IEEE Transactions on Issue Date : Feb. DCMP can be easily implemented in various existing P2P systems and is orthogonal to the search algorithms.

This research consists of two cases. making them insufficient to use on practical MANETs. Issue:3 On page(s): 358 .371 ISSN : 1536-1233 INSPEC Accession Number: 9818384 Digital Object Identifier : 10. Message Complexity Analysis of Mobile Ad Hoc Network Address Auto configuration Protocols This paper appears in: Mobile Computing. The missing procedures that were filled in have been developed based on the most logical procedures being accurate to the original protocol publications. smaller overhead.2007. the IPv6 lowpower wireless personal address network (6LoWPAN)). where the first case deals with the message complexity analysis of the single-node joining case (SJC) and the second case deals with the complexity analysis of the MANET group merging case (GMC). but. as a result. The original publications on the AAPs had incomplete parts. The research in this paper finds applications in wireless networks that apply reduced addresses to achieve less memory usage. .70730 Date of Current Version : 22 January 2008 Sponsored by : IEEE Computer Society ABSTRACT:This paper proposes a novel method to perform a quantitative analysis of message complexity and applies this method in comparing the message complexity among the mobile ad hoc network (MANET) addressautoconfiguration protocols (AAPs). IEEE Transactions on Issue Date : March 2008 Volume : 7 . and higher throughput (for example. Therefore. the first objective of the research was to complete the AAPs by filling in the missing gaps to make them operational. possess a high address duplication probability.52.1109/TMC.

OCGRR: A New Scheduling Algorithm for Differentiated Services Networks This paper appears in: Parallel and Distributed Systems.1109/TPDS. 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. streams may be isolated in separate buffers before being scheduled in a frame. thus reducing the inter transmission time from the same stream and achieving a smaller jitter and startup latency. Issue:5 On page(s): 697 .53. but only one packet per small round. A frame may have a number of small rounds for each class. We also verify and demonstrate the good performance of our scheduler by simulation and comparison with other algorithms in terms of queuing delay. At each output port. IEEE Transactions on Issue Date : May 2007 Volume : 18 . Each stream within a class can transmit a number of packets in the frame based on its available grant.2007. jitter. and start-up latency.710 ISSN : 1045-9219 Digital Object Identifier : 10. The grant can be adjusted in a way to prevent the starvation of lower priority classes. The sequence of traffic transmission in a frame starts from higher-priority traffic and goes down to lower-priority traffic. called OCGRR (Output Controlled Grant-based Round Robin). .351711 Date of Current Version : 23 April 2007 Sponsored by : IEEE Computer Society ABSTRACT:We propose a new fair scheduling technique. for the support of DiffServ traffic in a core router.

Issue:99 On page(s): 1 .1077 Date of Publication : 10 June 2008 Sponsored by : IEEE Computer Society ABSTRACT:Wireless Peer-to-Peer (P2P) file sharing is widely envisioned as one of the major applications of ad hoc networks in the near future. IEEE Transactions on Volume : PP . We propose a new protocol which consists of two components. namely Adjacency Set Construction (ASC) and Community-Based Asynchronous Wakeup (CAW). .1109/TMC. On Localized Application-Driven Topology Control for Energy Efficient Wireless Peer-to-Peer File Sharing This paper appears in: Mobile Computing.1 ISSN : 1536-1233 Digital Object Identifier : 10. we believe that the topology control mechanism should be application driven in that we should try to achieve an efficient connectivity among mobile devices in order to better serve the file sharing application. Our proposed protocol is shown to be able to enhance the fairness and provide incentive mechanism in wireless P2P file sharing applications. This trend is largely motivated by the recent advances in high speed wireless communication technologies and high traffic demand for P2P file sharing applications.2007. we need a scalable topology control protocol to solve the neighbor discovery problem and network organization problem. It is also capable of increasing the energy efficiency. To achieve the ambitious goal of realizing a practical wireless P2P network.54. Indeed.

70735 Date of Current Version : 04 January 2008 Sponsored by : IEEE Computer Society ABSTRACT:Application-layer peer-to-peer (P2P) networks are considered to be the most important development for next-generation Internet infrastructure. IEEE Transactions on Issue Date : Feb.2007.55. such as the effect of the number of directories employed in the system and the performance ramification of user registration strategies. 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. 2008 Volume : 19 .246 ISSN : 1045-9219 INSPEC Accession Number: 9767648 Digital Object Identifier : 10. We also explore other important issues vital to the performance in the virtual server framework. The Server Reassignment Problem for Load Balancing in Structured P2P Systems This paper appears in: Parallel and Distributed Systems. 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.1109/TPDS. . 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. We demonstrate the superior performance of our proposal in general and its advantages over previous strategies in particular. and perhaps more significantly. load balancing among the peers is critical. Second. Issue:2 On page(s): 234 . For these systems to be effective. This paper makes two contributions. First.

it resends the packet until the maximum number of retries is reached. called double-covered broadcast (DCB). The retransmissions of the forwarding nodes are received by the sender as the confirmation of their reception of the packet. as a fundamental service in mobile ad hoc networks (MANETs). If the sender does not detect all its forwarding nodes' retransmissions. which takes advantage of broadcast redundancy to improve the delivery ratio in an environment that has rather high transmission error rate. Forwarding nodes are selected in such a way that 1) the sender's 2-hop neighbors are covered and 2) the sender's 1hop neighbors are either forwarding nodes or no forwarding nodes covered by at least two forwarding neighbors.1109/TMC. we propose a simple broadcast algorithm. only selected forwarding nodes retransmit the broadcast message. Issue:2 On page(s): 148 . The objective of reducing broadcast redundancy while still providing high delivery ratio under high transmission error rate is a major challenge in MANETs.2007.163 ISSN : 1536-1233 INSPEC Accession Number: 9271827 Digital Object Identifier : 10. In this paper.31 Date of Current Version : 26 December 2006 Sponsored by : IEEE Computer Society ABSTRACT:The broadcast operation. The no forwarding 1-hop neighbors of the sender do not acknowledge the reception of the broadcast. 2007 Volume : 6 . Simulation results show that the proposed broadcast algorithm provides good performance under a high transmission error rate environment .56. IEEE Transactions on Issue Date : Feb. Toward Broadcast Reliability in Mobile Ad Hoc Networks with Double Coverage This paper appears in: Mobile Computing. is prone to the broadcast storm problem if forwarding nodes are not carefully designated. Among the 1-hop neighbors of the sender.

however. Issue:1 On page(s): 56 . It is shown that if the aforementioned requirements are met. medium access control (MAC) protocol. This advantage.) for making RB switching superior to NRB switching are also identified. the requirements (in terms of route discovery.1109/TMC.71 ISSN : 1536-1233 INSPEC Accession Number: 9239188 Digital Object Identifier : 10. In addition to posing this fundamental question. IEEE Transactions on Issue Date : Jan. etc.2007. A novel analytical framework is developed and the network performance under both RB and NRB schemes is quantified. 2007 Volume : 6 . then RB schemes can indeed yield better delay performance than NRB schemes. Route Reservation in Ad Hoc Wireless Networks This paper appears in: Mobile Computing. and pipelining.250671 Date of Current Version : 30 November 2006 Sponsored by : IEEE Computer Society ABSTRACT:This paper investigates whether and when route reservation-based (RB) communication can yield better delay performance than nonreservation-based (NRB) communication in ad hoc wireless networks.57. comes at the expense of lower throughput and good put compared to NRB schemes .

and LPP can be obtained from different graph models. LDA. The Laplacianfaces are the optimal linear approximations to the eigenfunctions of the Laplace Beltrami operator on the face manifold.1109/TPAMI. IEEE Transactions on Issue Date: March 2005 Volume: 27 Issue:3 On page(s): 328 . and obtains a face subspace that best detects the essential face manifold structure.340 ISSN: 0162-8828 INSPEC Accession Number: 8327483 Digital Object Identifier: 10. Theoretical analysis shows that PCA. and pose may be eliminated or reduced. the face images are mapped into a face subspace for analysis. Experimental results suggest that the proposed Laplacianface approach provides a better representation and achieves lower error rates in face recognition.58. In this way. We compare the proposed Laplacianface approach with Eigenface and Fisher face methods on three different face data sets. the unwanted variations resulting from changes in lighting.55 Date of Current Version: 31 January 2005 PubMed ID: 15747789 Sponsored by: IEEE Computer Society ABSTRACT:We propose an appearance-based face recognition method called the Laplacianface approach. . LPP finds an embedding that preserves local information. Face Recognition Using Laplacian faces This paper appears in: Pattern Analysis and Machine Intelligence. Different from principal component analysis (PCA) and linear discriminate analysis (LDA) which effectively see only the Euclidean structure of face space. facial expression.2005. By using locality preserving projections (LPP).

59. Devnagari.5 percent for complete text lines consisting of an average of seven words. Hebrew.1109/TPAMI. or Roman.2004. Han. The increase in usage of handheld devices which accept handwritten input has created a growing demand for algorithms that can efficiently analyze and retrieve handwritten data. The classification accuracy improves to 95 percent as the number of words in the test sample is increased to five.1261096 Date of Current Version : 14 June 2004 Sponsored by : IEEE Computer Society ABSTRACT:Automatic identification of handwritten script facilitates many important applications such as automatic transcription of multilingual documents and search for documents on the Web containing a particular script. The proposed system attains an overall classification accuracy of 87. The classification is based on 11 different spatial and temporal features extracted from the strokes of the words. and to 95. This paper proposes a method to classify words and lines in an online handwritten document into one of the six major scripts: Arabic. 2004 Volume : 26 . Online Handwritten Script Recognition This paper appears in: Pattern Analysis and Machine Intelligence.379 words. Issue:1 On page(s): 124 . Cyrillic. IEEE Transactions on Issue Date : Jan.1 percent at the word level with 5-fold cross validation on a data set containing 13. .130 ISSN : 0162-8828 INSPEC Accession Number: 7879989 Digital Object Identifier : 10.

By combining each node’s view we are able to tell if (and which type of) an attack happened or if the channel is just saturated. 2006. are a threat to wireless networks because they are at the same time easy to mount and difficult to detect and stop.1109/ISCC.60. ISCC '06. Proceedings. and jamming in particular.2006. Wireless Intrusion detection system and a new attack model This paper appears in: Computers and Communications. However.22 Date of Current Version : 11 September 2006 ABSTRACT:Denial-of-Service attacks. . this system opens the possibility for misuse.40 ISSN : 1530-1346 Print ISBN: 0-7695-2588-1 Digital Object Identifier : 10. We propose a distributed intrusion detection system in which each node monitors the traffic flow on the network and collects relevant statistics about it. We discuss the impact of the misuse on the system and the best strategies for each actor. 11th IEEE Symposium on Issue Date : 26-29 June 2006 On page(s): 35 .

Sign up to vote on this title
UsefulNot useful