Anirban Mahanti - Academia.edu (original) (raw)

Papers by Anirban Mahanti

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 2009

Lecture Notes in Computer Science, 2008

Abstract. Broadcast communication plays a critical role in ad hoc net-works especially vehicular ... more Abstract. Broadcast communication plays a critical role in ad hoc net-works especially vehicular communication where a large number of ap-plications are being envisioned to use the broadcast services of IEEE 802.11p. These safety applications exchange messages at very low ...

2011 Fifth IEEE International Conference on Advanced Telecommunication Systems and Networks (ANTS), 2011

Bio: B. S. Muralidhar has over 20 years of Telecom software engineering design, development and S... more Bio: B. S. Muralidhar has over 20 years of Telecom software engineering design, development and Solution Architecting experience. He was part of Industry research group from Germany working on NMS ITU-T standards in SDH and SONET domains. He specializes in Telecom Management solutions and custom solutions for various Telecom OSSBSS requirements. He is also associated across verticals like BFSI, HLS, Transportation and CIR for Enterprise and Industry specific solutions. He is currently part of Strategy, Solution, Architecture and Consulting for HP ES and a Chief SA for Industry solutions as a part of CT Office, India Apps Cluster.

IEEE Transactions on Smart Grid, 2014

ABSTRACT

Proceedings of the 18th International Conference on World Wide Web, 2009

Video sharing services that allow ordinary Web users to upload video clips of their choice and wa... more Video sharing services that allow ordinary Web users to upload video clips of their choice and watch video clips uploaded by others have recently become very popular. This paper identifies invariants in video sharing workloads, through comparison of the workload characteristics of four popular video sharing services. Our traces contain meta-data on approximately 1.8 million videos which together have been viewed approximately 6 billion times. Using these traces, we study the similarities and differences in use of several Web 2.0 features such as ratings, comments, favorites, and propensity of uploading content. In general, we find that active contribution, such as video uploading and rating of videos, is much less prevalent than passive use. While uploaders in general are skewed with respect to the number of videos they upload, the fraction of multi-time uploaders is found to differ by a factor of two between two of the sites. The distributions of life-time measures of video popularity are found to have heavy-tailed forms that are similar across the four sites. Finally, we consider implications for system design of the identified invariants. To gain further insight into caching in video sharing systems, and the relevance to caching of life-time popularity measures, we gathered an additional data set tracking views to a set of approximately 1.3 million videos from one of the services, over a twelve week period. We find that life-time popularity measures have some relevance for large cache (hot set) sizes (i.e., a hot set defined according to one of these measures is indeed relatively "hot"), but that this relevance substantially decreases as cache size decreases, owing to churn in video popularity.

2002 IEEE International Conference on Personal Wireless Communications, 2000

A Heuristic Search for'Generalized Cellular Network Planning Swamp Mandal, Debas... more A Heuristic Search for'Generalized Cellular Network Planning Swamp Mandal, Debashis Saha, Ambuj Mahanti Indian Institute of Management Calcutta Joka ... available limited-memory, and yet can produce a high quality acceptable solution when it is subjected to run under the ...

Proceedings of the 24th International Conference on World Wide Web - WWW '15, 2015

Increased popularity of smartphones has attracted a large number of developers to develop apps fo... more Increased popularity of smartphones has attracted a large number of developers to develop apps for various smartphone platforms. As a result, app markets are also populated with spam apps, which reduce the users' quality of experience and increase the workload of app market operators. The latter resort to remove those apps, upon user complaints or to deny the developers' publication approval requests by relying on continuous human efforts to check the app compliance with anti-spam policies. Apps can be "spammy" in multiple ways including not having a specific functionality, unrelated app description or unrelated keywords and publishing similar apps several times and across diverse categories. Through a systematic crawl of a popular app market and by identifying a set of removed apps, we propose a method to detect spam apps solely using apps' metadata available at the time of publication. We first propose a methodology to manually label a sample of removed apps, according to a set of checkpoint heuristics to reveal the reasons behind apps removal. This analysis suggests that approximately 35% of the apps being removed are very likely to be spam apps. We then map the identified heuristics to several quantifiable features and show how distinguishing these features are for spam apps. Finally, we build an Adaptive Boost classifier for early identification of spam apps using only the metadata of the apps. Our classifier achieves an accuracy over 95% with precision varying between 85%-95% and recall varying between 38%-98%. By applying the classifier on a set of apps present at the app market at the time of our crawl, we estimate that at least 2.7% of them are spam apps.

Proceedings of the Acm Mobicom Workshop, Sep 11, 2014

Conventional video consists of a single sequence of video frames. During a client's playback peri... more Conventional video consists of a single sequence of video frames. During a client's playback period, frames are viewed sequentially from some specified starting point. The fixed frame ordering of conventional video enables efficient scheduled broadcast delivery, as well as efficient near on-demand delivery to large numbers of concurrent clients through use of periodic broadcast protocols in which the video file is segmented and transmitted on multiple channels. This paper considers the problem of devising scalable protocols for near on-demand delivery of "non-linear" media files whose content may have a tree or graph, rather than linear, structure. Such media allows personalization of the media playback according to individual client preferences. We formulate a mathematical model for determination of the optimal periodic broadcast protocol for non-linear media with piecewise-linear structures. Our objective function allows differing weights to be placed on the startup delays required for differing paths through the media. Studying a number of simple non-linear structures we provide insight into the characteristics of the optimal solution. For cases in which the cost of solving the optimization model is prohibitive, we propose and evaluate an efficient approximation algorithm.

Page 1. Locality Characteristics of Web Streams Revisited Aniket Mahanti Anirban Mahanti Carey Wi... more Page 1. Locality Characteristics of Web Streams Revisited Aniket Mahanti Anirban Mahanti Carey Williamson Department of Computer Science, University of Calgary, 2500 University Drive NW, Calgary, AB, Canada T2N 1N4 Email: {amahanti, mahanti, carey}@cpsc.ucalgary.ca ...

Finding frequent patterns from databases has been the most time consuming process in data mining ... more Finding frequent patterns from databases has been the most time consuming process in data mining tasks, like association rule mining. Frequent pattern mining in real-time is of increasing thrust in many business applications such as e-commerce, recommender systems, and supply-chain management and group decision support systems, to name a few. A plethora of efficient algorithms have been proposed till date, among which, vertical mining algorithms have been found to be very effective, usually outperforming the horizontal ones. However, with dense datasets, the performances of these algorithms significantly degrade. Moreover, these algorithms are not suited to respond to the real-time need. In this paper, we describe BDFS(b)-diff-sets, an algorithm to perform real-time frequent pattern mining using diff-sets and limited computing resources. Empirical evaluations show that our algorithm can make a fair estimation of the probable frequent patterns and reaches some of the longest frequent patterns much faster than the existing algorithms.

This paper presents a first look at some of the challenges associated with enabling a seamless we... more This paper presents a first look at some of the challenges associated with enabling a seamless web experience on Optical Head Mounted Display wearables such as Google Glass from the perspective of web content providers, client device, and the network. We conducted experiments to study the impact of choosing the application layer protocol (e.g., HTTP vs HTTPS) and of individual web components on the performance of Glass browser, by measuring webpage load time, temperature variation and power consumption and compare it to a smartphone. Our findings suggest that (a) performance of Glass compared to a smartphone in terms of total power consumption and webpage load time deteriorates with increasing number of web objects, number of servers accessed and number of JavaScripts on a webpage, (b) execution time for popular JavaScript benchmarks is about 3 to 8 times higher on Glass compared to a smartphone, (c) popular 3rd party analytics and ad scripts on Glass takes about 2x more time to execute than a smartphone (d) WebP is an energy efficient image format compared to JPEG and PNG on Glass, (e) cost of HTTPS on Glass compared to a smartphone increases with increasing number of web objects, webpage size and the number of servers accessed on a webpage, and (f) seven out of 50 websites studied in this paper are providing better wearable web experience by specifically serving fewer or smaller images, fewer JavaScripts, fewer CSS and no ads to Glass than a smartphone.

Many important parallel applications are data parallel, and may be efficiently implemented on a w... more Many important parallel applications are data parallel, and may be efficiently implemented on a workstation cluster by allocating each workstation a contiguous partition of the data domain. Implementation on non-dedicated clusters, however, is complicated by the possibility of changes in workstation availability. For example, a personal workstation may be reclaimed by its primary user for interactive use. In such situations, a node must be removed from the collection of workstations forming the "virtual parallel machine" allocated to the application, and data redistributed accordingly. Conversely, workstations may become available to join the virtual parallel machine.

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005., 2005

With the advent of a multi-operator regime in the sector of cellular mobile services, users becam... more With the advent of a multi-operator regime in the sector of cellular mobile services, users became sensitive to the Quality of Service (QoS), and, as a result service providers started offering differentiated services. Each operator shall ensure the promised QoS to every subscriber even during busy hours of a day when the network operates at the maximum load. During off-peak hours the load on the network will decrease. As a result, the network designed to meet the QoS requirement during busy hours of a day will leave a large amount idle resource during off-peak hours of the day. In this scenario, a service provider faces the problem of maximizing revenue while satisfying resource and QoS constraints. A dynamic differentiated pricing strategy (DDPS) for the cellular mobile service is a solution to the above problem. In this paper, we have proposed a DDPS which, to the best of our knowledge, is the first of its kind in the literature. We have compared the performance of our proposed solution with the static differentiated pricing strategies (SDPSs) with respect to revenue earned and average network resource utilization. The experimental results show that our proposed solution provides a substantial improvement over the SDPSs.

Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06), 2006

Real-time frequent pattern mining for business intelligence systems are currently in the focal ar... more Real-time frequent pattern mining for business intelligence systems are currently in the focal area of research. In a number of areas of doing business, especially in the arena of supply chain management systems, real-time frequent pattern mining is in need. The need is being felt more due to the possibility of real-time knowledge discovery along with the gradual acceptance of

Many Web users have accounts with multiple different social networking services. This scenario ha... more Many Web users have accounts with multiple different social networking services. This scenario has prompted development of "social aggregation" services such as FriendFeed that aggregate the information available through various services. Using five weeks of activity of more than 100,000 Friend-Feed users, we consider questions such as what types of services users aggregate content from, the relative popularity of services, who follows the aggregated content feeds, and why.

Lecture Notes in Computer Science, 2008

In this paper we collect and analyze traceroute measurements to show that large content providers... more In this paper we collect and analyze traceroute measurements to show that large content providers (eg, Google, Microsoft, Yahoo!) are deploying their own wide-area networks, bringing their networks closer to users, and bypassing Tier-1 ISPs on many paths. This ...

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 2009

Lecture Notes in Computer Science, 2008

Abstract. Broadcast communication plays a critical role in ad hoc net-works especially vehicular ... more Abstract. Broadcast communication plays a critical role in ad hoc net-works especially vehicular communication where a large number of ap-plications are being envisioned to use the broadcast services of IEEE 802.11p. These safety applications exchange messages at very low ...

2011 Fifth IEEE International Conference on Advanced Telecommunication Systems and Networks (ANTS), 2011

Bio: B. S. Muralidhar has over 20 years of Telecom software engineering design, development and S... more Bio: B. S. Muralidhar has over 20 years of Telecom software engineering design, development and Solution Architecting experience. He was part of Industry research group from Germany working on NMS ITU-T standards in SDH and SONET domains. He specializes in Telecom Management solutions and custom solutions for various Telecom OSSBSS requirements. He is also associated across verticals like BFSI, HLS, Transportation and CIR for Enterprise and Industry specific solutions. He is currently part of Strategy, Solution, Architecture and Consulting for HP ES and a Chief SA for Industry solutions as a part of CT Office, India Apps Cluster.

IEEE Transactions on Smart Grid, 2014

ABSTRACT

Proceedings of the 18th International Conference on World Wide Web, 2009

Video sharing services that allow ordinary Web users to upload video clips of their choice and wa... more Video sharing services that allow ordinary Web users to upload video clips of their choice and watch video clips uploaded by others have recently become very popular. This paper identifies invariants in video sharing workloads, through comparison of the workload characteristics of four popular video sharing services. Our traces contain meta-data on approximately 1.8 million videos which together have been viewed approximately 6 billion times. Using these traces, we study the similarities and differences in use of several Web 2.0 features such as ratings, comments, favorites, and propensity of uploading content. In general, we find that active contribution, such as video uploading and rating of videos, is much less prevalent than passive use. While uploaders in general are skewed with respect to the number of videos they upload, the fraction of multi-time uploaders is found to differ by a factor of two between two of the sites. The distributions of life-time measures of video popularity are found to have heavy-tailed forms that are similar across the four sites. Finally, we consider implications for system design of the identified invariants. To gain further insight into caching in video sharing systems, and the relevance to caching of life-time popularity measures, we gathered an additional data set tracking views to a set of approximately 1.3 million videos from one of the services, over a twelve week period. We find that life-time popularity measures have some relevance for large cache (hot set) sizes (i.e., a hot set defined according to one of these measures is indeed relatively "hot"), but that this relevance substantially decreases as cache size decreases, owing to churn in video popularity.

2002 IEEE International Conference on Personal Wireless Communications, 2000

A Heuristic Search for'Generalized Cellular Network Planning Swamp Mandal, Debas... more A Heuristic Search for'Generalized Cellular Network Planning Swamp Mandal, Debashis Saha, Ambuj Mahanti Indian Institute of Management Calcutta Joka ... available limited-memory, and yet can produce a high quality acceptable solution when it is subjected to run under the ...

Proceedings of the 24th International Conference on World Wide Web - WWW '15, 2015

Increased popularity of smartphones has attracted a large number of developers to develop apps fo... more Increased popularity of smartphones has attracted a large number of developers to develop apps for various smartphone platforms. As a result, app markets are also populated with spam apps, which reduce the users' quality of experience and increase the workload of app market operators. The latter resort to remove those apps, upon user complaints or to deny the developers' publication approval requests by relying on continuous human efforts to check the app compliance with anti-spam policies. Apps can be "spammy" in multiple ways including not having a specific functionality, unrelated app description or unrelated keywords and publishing similar apps several times and across diverse categories. Through a systematic crawl of a popular app market and by identifying a set of removed apps, we propose a method to detect spam apps solely using apps' metadata available at the time of publication. We first propose a methodology to manually label a sample of removed apps, according to a set of checkpoint heuristics to reveal the reasons behind apps removal. This analysis suggests that approximately 35% of the apps being removed are very likely to be spam apps. We then map the identified heuristics to several quantifiable features and show how distinguishing these features are for spam apps. Finally, we build an Adaptive Boost classifier for early identification of spam apps using only the metadata of the apps. Our classifier achieves an accuracy over 95% with precision varying between 85%-95% and recall varying between 38%-98%. By applying the classifier on a set of apps present at the app market at the time of our crawl, we estimate that at least 2.7% of them are spam apps.

Proceedings of the Acm Mobicom Workshop, Sep 11, 2014

Conventional video consists of a single sequence of video frames. During a client's playback peri... more Conventional video consists of a single sequence of video frames. During a client's playback period, frames are viewed sequentially from some specified starting point. The fixed frame ordering of conventional video enables efficient scheduled broadcast delivery, as well as efficient near on-demand delivery to large numbers of concurrent clients through use of periodic broadcast protocols in which the video file is segmented and transmitted on multiple channels. This paper considers the problem of devising scalable protocols for near on-demand delivery of "non-linear" media files whose content may have a tree or graph, rather than linear, structure. Such media allows personalization of the media playback according to individual client preferences. We formulate a mathematical model for determination of the optimal periodic broadcast protocol for non-linear media with piecewise-linear structures. Our objective function allows differing weights to be placed on the startup delays required for differing paths through the media. Studying a number of simple non-linear structures we provide insight into the characteristics of the optimal solution. For cases in which the cost of solving the optimization model is prohibitive, we propose and evaluate an efficient approximation algorithm.

Page 1. Locality Characteristics of Web Streams Revisited Aniket Mahanti Anirban Mahanti Carey Wi... more Page 1. Locality Characteristics of Web Streams Revisited Aniket Mahanti Anirban Mahanti Carey Williamson Department of Computer Science, University of Calgary, 2500 University Drive NW, Calgary, AB, Canada T2N 1N4 Email: {amahanti, mahanti, carey}@cpsc.ucalgary.ca ...

Finding frequent patterns from databases has been the most time consuming process in data mining ... more Finding frequent patterns from databases has been the most time consuming process in data mining tasks, like association rule mining. Frequent pattern mining in real-time is of increasing thrust in many business applications such as e-commerce, recommender systems, and supply-chain management and group decision support systems, to name a few. A plethora of efficient algorithms have been proposed till date, among which, vertical mining algorithms have been found to be very effective, usually outperforming the horizontal ones. However, with dense datasets, the performances of these algorithms significantly degrade. Moreover, these algorithms are not suited to respond to the real-time need. In this paper, we describe BDFS(b)-diff-sets, an algorithm to perform real-time frequent pattern mining using diff-sets and limited computing resources. Empirical evaluations show that our algorithm can make a fair estimation of the probable frequent patterns and reaches some of the longest frequent patterns much faster than the existing algorithms.

This paper presents a first look at some of the challenges associated with enabling a seamless we... more This paper presents a first look at some of the challenges associated with enabling a seamless web experience on Optical Head Mounted Display wearables such as Google Glass from the perspective of web content providers, client device, and the network. We conducted experiments to study the impact of choosing the application layer protocol (e.g., HTTP vs HTTPS) and of individual web components on the performance of Glass browser, by measuring webpage load time, temperature variation and power consumption and compare it to a smartphone. Our findings suggest that (a) performance of Glass compared to a smartphone in terms of total power consumption and webpage load time deteriorates with increasing number of web objects, number of servers accessed and number of JavaScripts on a webpage, (b) execution time for popular JavaScript benchmarks is about 3 to 8 times higher on Glass compared to a smartphone, (c) popular 3rd party analytics and ad scripts on Glass takes about 2x more time to execute than a smartphone (d) WebP is an energy efficient image format compared to JPEG and PNG on Glass, (e) cost of HTTPS on Glass compared to a smartphone increases with increasing number of web objects, webpage size and the number of servers accessed on a webpage, and (f) seven out of 50 websites studied in this paper are providing better wearable web experience by specifically serving fewer or smaller images, fewer JavaScripts, fewer CSS and no ads to Glass than a smartphone.

Many important parallel applications are data parallel, and may be efficiently implemented on a w... more Many important parallel applications are data parallel, and may be efficiently implemented on a workstation cluster by allocating each workstation a contiguous partition of the data domain. Implementation on non-dedicated clusters, however, is complicated by the possibility of changes in workstation availability. For example, a personal workstation may be reclaimed by its primary user for interactive use. In such situations, a node must be removed from the collection of workstations forming the "virtual parallel machine" allocated to the application, and data redistributed accordingly. Conversely, workstations may become available to join the virtual parallel machine.

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005., 2005

With the advent of a multi-operator regime in the sector of cellular mobile services, users becam... more With the advent of a multi-operator regime in the sector of cellular mobile services, users became sensitive to the Quality of Service (QoS), and, as a result service providers started offering differentiated services. Each operator shall ensure the promised QoS to every subscriber even during busy hours of a day when the network operates at the maximum load. During off-peak hours the load on the network will decrease. As a result, the network designed to meet the QoS requirement during busy hours of a day will leave a large amount idle resource during off-peak hours of the day. In this scenario, a service provider faces the problem of maximizing revenue while satisfying resource and QoS constraints. A dynamic differentiated pricing strategy (DDPS) for the cellular mobile service is a solution to the above problem. In this paper, we have proposed a DDPS which, to the best of our knowledge, is the first of its kind in the literature. We have compared the performance of our proposed solution with the static differentiated pricing strategies (SDPSs) with respect to revenue earned and average network resource utilization. The experimental results show that our proposed solution provides a substantial improvement over the SDPSs.

Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06), 2006

Real-time frequent pattern mining for business intelligence systems are currently in the focal ar... more Real-time frequent pattern mining for business intelligence systems are currently in the focal area of research. In a number of areas of doing business, especially in the arena of supply chain management systems, real-time frequent pattern mining is in need. The need is being felt more due to the possibility of real-time knowledge discovery along with the gradual acceptance of

Many Web users have accounts with multiple different social networking services. This scenario ha... more Many Web users have accounts with multiple different social networking services. This scenario has prompted development of "social aggregation" services such as FriendFeed that aggregate the information available through various services. Using five weeks of activity of more than 100,000 Friend-Feed users, we consider questions such as what types of services users aggregate content from, the relative popularity of services, who follows the aggregated content feeds, and why.

Lecture Notes in Computer Science, 2008

In this paper we collect and analyze traceroute measurements to show that large content providers... more In this paper we collect and analyze traceroute measurements to show that large content providers (eg, Google, Microsoft, Yahoo!) are deploying their own wide-area networks, bringing their networks closer to users, and bypassing Tier-1 ISPs on many paths. This ...