@conference {322, title = {A Decentralized Marketplace Application on the Ethereum Blockchain}, booktitle = {IEEE 4th International Conference on Collaboration and Internet Computing (CIC)}, year = {2018}, month = {10/2018}, publisher = {IEEE}, organization = {IEEE}, address = {Philadelphia, PA, USA}, abstract = {

Modern centralized online marketplaces such as eBay offer an alternative option for consumers to both sell and purchase goods with relative ease. However, drawbacks to these marketplaces include the platform{\textquoteright}s ability to block merchants at their own whim, the fees paid to the platform when listing a product and when selling a product, and the lack of privacy of users{\textquoteright} data. In this paper, we propose an application that remedies all three of these drawbacks through use of the Ethereum blockchain platform. The application was developed using the Truffle development framework. The application{\textquoteright}s functions were contained within an Ethereum smart contract, which was then migrated to the Ethereum network. The user{\textquoteright}s input was read through a web interface and sent to the Ethereum network via the web3.js API. Statistics about the application were gathered on the Rinkeby test network. The application was shown to have an average transaction runtime of 3.8 seconds, and an average gas consumption of 4.6 wei. Contract creation times for the application were shown to be less than a second. A cost analysis of the application was then conducted. The gas consumption of the transactions needed to both buy and sell a product was converted into US dollars, and the gas cost of the application was then compared to the cost to use an online auction marketplace such as eBay as well as an in-person auction house such as Sotheby{\textquoteright}s. The results showed that selling on the application is cheaper than existing online options as well as existing in-person options. These tests showed that our application was successful in addressing the drawbacks of current auction marketplaces.

}, keywords = {API, application program interfaces, auction marketplaces, average gas consumption, blockchain, centralized online marketplaces, Computer science, contract creation times, cost analysis, Cryptocurrency, decentralized, decentralized marketplace application, e-commerce, eBay, electronic commerce, Ethereum, Ethereum blockchain platform, Ethereum network, Ethereum smart contract, gas cost, human factors, in-person options, Internet, marketplace, Measurement, online auction marketplace, online options, peer-to-peer computing, Rinkeby test network, security of data, smart contract, Truffle development framework, user data, user interfaces, Web interface}, doi = {10.1109/CIC.2018.00023}, author = {Ranganthan, Vishnu Prasad and Ram Dantu and Paul, Aditya and Mears, Paula and Morozov, Kirill} } @conference {237, title = {Socio-technical aspects of video phones}, booktitle = {2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)}, year = {2010}, month = {Jan}, abstract = {

The widespread use of voice over Internet protocol has paved the way for video over Internet protocol. In the past, certain technical shortcomings have prevented the popularity of videophones in the market. With present-day technology, videophones have just about everything required for day-to-day functions. Under such circumstances, certain socio-technical aspects require attention so that videophones can become as widespread and as technically streamlined as a plain old telephone system (POTS) with its additional benefits. A frequently brushed-upon topic is optimum features in the video phone for day-to-day social interactions. We carried out several experiments on different kinds of codecs and video formats to address two issues: i) the size of a video screen and ii) perception of motion and distance. From the measurements, we observed that a small frame rate with low bandwidth is adequate and can result in satisfactory video quality. We also observed that H263 performs well for all the day-to-day social networking activities. Standing 4 feet from the camera can still give reasonably good video quality in the currently available codecs. We believe that socio-technical issues will emerge more clearly over the next several years and they are germane to deployment of PC-based soft phones as well as hard phones.

}, keywords = {Bandwidth, Cameras, Codecs, Computer science, Internet telephony, plain old telephone system, Protocols, social aspects of automation, Social factors, social interactions, social issues, Social network services, social networking activities, sociotechnical aspects, Streaming media, technical issues, video codecs, video coding, video phones, video quality, Videoconference, videophone quality, videophones, videotelephony, voice over Internet protocol}, doi = {10.1109/COMSNETS.2010.5431971}, author = {Chandrasekaran, Vikram and Dantu, Siva and Kadiyala, Priyanka and Ram Dantu and Phithakkitnukoon, Santi} } @conference {76, title = {A society-integrated testbed architecture for peer-to-peer telecommunications}, booktitle = {Testbeds and Research Infrastructures for the Development of Networks Communities and Workshops, 2009. TridentCom 2009. 5th International Conference on}, year = {2009}, month = {April}, abstract = {

Exploiting and deploying telecommunication services on Internet Telephony are imperative for a large market share. However, the distributed nature of peer-to-peer (P2P) network makes services implementation very difficult. In order to meet the research goals of achieving P2P telecommunication services through the union of social and computer networks, we present a society-integrated testbed architecture for P2P voice over IP (VoIP). By introducing an architecture that exploits and entailing social structure based connection establishment, the testbed presents an organic integration of social functionalities with good portability. The testbed also serves as a flexible tool suite that can be used to run experiments and obtain timely feedback based on the performance measurements.

}, keywords = {Computer architecture, computer network, computer networks, Computer science, Feedback, file organisation, Internet telephony, network traffic, P2P voice-over-IP, Peer to peer computing, peer-to-peer computing, peer-to-peer telecommunication service, portable social DHT function, Routing protocols, Social network services, society-integrated testbed architecture, software architecture, Telecommunication services, telecommunication traffic, Testing}, doi = {10.1109/TRIDENTCOM.2009.4976215}, author = {Yang, Xiaohui and Ram Dantu and Wijesekera, Duminda} } @conference {55, title = {A testbed for mobile social computing}, booktitle = {Testbeds and Research Infrastructures for the Development of Networks Communities and Workshops, 2009. TridentCom 2009. 5th International Conference on}, year = {2009}, month = {April}, abstract = {

We present a testbed for mobile social computing that can be used to perform research in security, privacy, and context-awareness policies and mechanisms appropriate for a wide range of applications. We compare several mobile platforms and present the rational for our design choices and reasons we chose Android as the primary smartphone for this testbed. We also discuss some of the possible experiments that can be conducted using the testbed.

}, keywords = {Acoustic sensors, Computer science, Computer security, context-awareness policy, data privacy, Feedback, Global Positioning System, mobile computing, mobile social computing, Performance evaluation, Privacy, privacy policy, security of data, security policy, Social network services, Testing}, doi = {10.1109/TRIDENTCOM.2009.4976250}, author = {Alazzawe, Ahmed and Alazzawe, Anis and Wijesekera, Duminda and Ram Dantu} } @conference {99, title = {Call Algebra}, booktitle = {2008 5th IEEE Consumer Communications and Networking Conference}, year = {2008}, month = {Jan}, abstract = {

In every day life, people communicate through a voice(e.g., VoIP) network with different social groups that range from known people such as family members, friends, and distant relatives to unknown people such as spammers, telemarketers, and phishers. We believe that there exists a human/social dynamics between individuals by the way calls are generated, handled and received. In this paper we present how this dynamics can be used for detecting and filtering unwanted calls. In this paper, we first enumerate the communication patterns between the called party (callee) and the calling parties (callers). Next, we discuss operations on caller-callee matrices constructed based on their communication patterns, and derive call-constructs that can be used for determining the legitimacy of the calls and the callers. Finally, we discuss how these communication patterns and operations can be grouped for solutions to few of the existing IP telephony problems. These solutions can complement the existing no-call-lists in voice networks.

}, keywords = {Algebra, call algebra, caller-callee matrices, communication pattern, Computer science, Context modeling, Filtering, Humans, Internet telephony, IP networks, IP telephony problem, matrix algebra, Mood, Peer to peer computing, social aspects of automation, social group, Social network services, voice-over-IP, VoIP network}, doi = {10.1109/ccnc08.2007.199}, author = {Kolan, Prakash and Ram Dantu} } @conference {60, title = {Quantifying presence using calling patterns}, booktitle = {Communication Systems Software and Middleware and Workshops, 2008. COMSWARE 2008. 3rd International Conference on}, year = {2008}, month = {Jan}, abstract = {

Presence technology is going to be an integral part of the next generation of communication technology. It can eliminate telephone tag between two parties (caller and callee), which will increase productivity of the parties and reduce unnecessary bandwidth usage of unwanted calls. In this paper, we propose a Willingness Estimator that computes willingness level of a callee for receiving calls from a specified caller. By knowing the willingness value of the callee the caller can decide on proceeding with the call or not. The proposed Willingness Estimator is tested with real mobile user data, and these results are highly accurate. We measure willingness based on calling patterns (arrival time, location, day) of a caller to a callee and this could serve as one of the future presence based services. The results can be used in telecommunication networks such as PSTN, Cellular networks, and Voice over IP networks.

}, keywords = {cellular networks, Communications technology, Computer science, Computer security, Intrusion detection, Laboratories, Mobile handsets, mobile user data, Network servers, next generation communication, Next generation networking, presence technology, Productivity, PSTN, telecommunication networks, telephony, user calling pattern, voice over IP networks, willingness estimator}, doi = {10.1109/COMSWA.2008.4554403}, author = {Husna, Husain and Phithakkitnukoon, Santi and Baatarjav, Enkh-Amgalan and Ram Dantu} } @conference {56, title = {Quantifying the Presence of Phone Users}, booktitle = {2008 5th IEEE Consumer Communications and Networking Conference}, year = {2008}, month = {Jan}, abstract = {

Presence-enabled telephony services can reduce telephone tag and improve customer satisfaction. In this paper we proposed the Bayesian inference model to calculate the willingness level of the callee to accept calls. Before making a call, the caller may use the willingness calculator to find out whether the callee is available. Based on this level the user can make a decision whether to make a call. For validation of our results, we used actual call logs of 100 users collected at MIT by the Reality Mining Project group for a period of 8 months. We used time of the day, day of the week, talk-time and location for calculating the willingness level Our results show a good agreement between computed willingness level and the number of missed/rejected calls. This service can be included as part of the presence server. When deployed, this service can increase productivity, avoid unwanted calls and reduce the call traffic congestion. This service is beneficial to both subscribers and phone service providers. However, in order to make this service a reality, we need to take into account other factors such social closeness, proximity, multiplexity and reputation of the caller.

}, keywords = {Bayes methods, Bayesian inference model, Bayesian methods, call traffic congestion, Computer science, Context, customer satisfaction, Multimedia communication, Multimedia systems, Network servers, phone service provider, presence-enabled telephony service, Productivity, Roads, telecommunication congestion control, telecommunication traffic, telephony, willingness calculator}, doi = {10.1109/ccnc08.2007.206}, author = {Zhang, Huiqi and Ram Dantu} } @conference {58, title = {Automatic Calibration Using Receiver Operating Characteristics Curves}, booktitle = {2007 2nd International Conference on Communication Systems Software and Middleware}, year = {2007}, month = {Jan}, abstract = {

Application-level filters, such as e-mail and VoIP spam filters, that analyze dynamic behavior changes are replacing static signature-recognition filters. These application-level filters learn behavior and use that knowledge to filter unwanted requests. Because behavior of a service request{\textquoteright}s participating entities changes rapidly, filters must adapt quickly by using end user{\textquoteright}s preferences about receiving that service request message. Many adaptive filters learn from the participating entities{\textquoteright} behavior; however, none configure themselves automatically to an end user{\textquoteright}s changing tolerance levels. Also, filter administrators cannot manually change the threshold for each service request in real time. Traditional adaptive filters fail when administrators must optimize multiple filter thresholds manually and often. Thus, to improve a filter{\textquoteright}s learning, we must automate its threshold-update process. We propose an automatic threshold-calibration mechanism using Receiver Operating Characteristics (ROC) curves that updates the threshold based on an end user{\textquoteright}s feedback. To demonstrate the mechanism{\textquoteright}s real-time applicability, we integrated it in a Voice over IP (VoIP) spam filter that analyzes incoming Spam over IP Telephony (SPIT) calls. Using this mechanism, we observed good improvement in the VoIP spam filter{\textquoteright}s accuracy. Further, computing and updating the optimum threshold in realtime does not impede the filter{\textquoteright}s temporal performance because we update thresholds after each call{\textquoteright}s completion. Because we reach an optimum threshold for any initial setting, this mechanism works efficiently when we cannot predict end-user behavior. Furthermore, automatic calibration proves efficient when using multiple threshold values.

}, keywords = {adaptive filters, application-level filter learning, automatic threshold-calibration mechanism, behavior, calibration, Computer science, Computer worms, Electronic mail, end user feedback, Filtering, information filtering, information filters, Internet telephony, learning (artificial intelligence), Protocols, receiver operating characteristics curves, sensitivity analysis, service request message, telecommunication traffic, Threshold, tolerance, Viruses (medical)}, doi = {10.1109/COMSWA.2007.382484}, author = {Kolan, Prakash and Vaithilingam, Ram and Ram Dantu} } @conference {62, title = {Goliath: A Configurable Approach for Network Testing}, booktitle = {Testbeds and Research Infrastructure for the Development of Networks and Communities, 2007. TridentCom 2007. 3rd International Conference on}, year = {2007}, month = {May}, abstract = {

When testing a network environment and/or application many aspects need to be taken into consideration. For example, different software needs to be deployed at different nodes and different topologies may also need to be tested. The manual execution of these tasks are very time consuming and a configurable environment to facilitate these tasks and consequently improve testing performance is desired. In this paper a virtual network environment that can be easily reconfigured is presented to address this problem. Also presented is a case study with the results of deployment and containing a worm propagation attack.

}, keywords = {automated network testing, Computational modeling, computer networks, Computer science, Computer worms, Distributed computing, Goliath, Intrusion detection, network topologies, Network topology, Protocols, security of data, Software testing, System testing, telecommunication computing, telecommunication network topology, telecommunication security, virtual network environment, virtual private networks, worm propagation attack}, doi = {10.1109/TRIDENTCOM.2007.4444667}, author = {Fagen, Wade and Cangussu, Jo{\~a}o and Ram Dantu} } @conference {86, title = {Unwanted SMTP Paths and Relays}, booktitle = {2007 2nd International Conference on Communication Systems Software and Middleware}, year = {2007}, month = {Jan}, abstract = {

Based on the social interactions of an email user, incoming email traffic can be divided into different categories such as, telemarketing, Opt-in family members and friends. Due to a lack of knowledge in the different categories, most of the existing spam filters are prone to high false positives and false negatives. Moreover, a majority of the spammers obfuscate their email content inorder to circumvent the content-based spam filters. However, they do not have access to all the fields in the email header. Our classification method is based on the path traversed by email (instead of content analysis) since we believe that spammers cannot forge all the fields in the email header. We based our classification on three kinds of analyses on the header: i) EndToEnd path analysis, which tries to establish the legitimacy of the path taken by an email and classifies them as either spam or non-spam; ii) Relay analysis, which verifies the trustworthiness of the relays participating in the relaying of emails; iii) Emails wantedness analysis, which measure the recipients wantedness of the senders emails. We use the IMAP message status flags such as, message has been read, deleted, answered, flagged, and draft as an implicit feed back from the user in Emails wantedness analysis. Finally we classify the incoming emails as i) socially close (such as, legitimate emails from family, and friends), ii) socially distinct emails from strangers, iii) spam emails (for example, emails from telemarketers, and spammers) and iv) opt-in emails. Based on the relation between spamminess of the path taken by spam emails and the unwantedness values of the spammers, we classify spammers as i) prospective spammers, ii) suspects, iii) recent spammers and iv) serial spammers. Overall, our method resulted in far less false positives compared to current filters like SpamAssassin. We achieved a precision of 98.65\% which is better than the precisions achieved by SPF and DNSBL blacklists.

}, keywords = {Computer science, content-based spam filters, Counterfeiting, Credit cards, email spam filters, emails wantedness analysis, end-to-end path analysis, Filters, IMAP message status flags, information filtering, information filters, Information security, Legislation, Multimedia communication, relay analysis, Relays, SMTP paths analysis, unsolicited e-mail, Unsolicited electronic mail, Web page design}, doi = {10.1109/COMSWA.2007.382440}, author = {Palla, Srikanth and Ram Dantu} }