Sathya Rao, G. Bianchi, J. Garcia-Alfaro, Francisco Romero, B. Trammell, A. Berger, G. Lioudakis, Eugenia Papagianakopoulou, Mariza Koukovini, Karel Mittig
{"title":"System architecture for collaborative security and privacy monitoring in multi-domain networks","authors":"Sathya Rao, G. Bianchi, J. Garcia-Alfaro, Francisco Romero, B. Trammell, A. Berger, G. Lioudakis, Eugenia Papagianakopoulou, Mariza Koukovini, Karel Mittig","doi":"10.1109/IMSAA.2011.6156360","DOIUrl":"https://doi.org/10.1109/IMSAA.2011.6156360","url":null,"abstract":"The System architecture presented in this paper is developed in DEMONS project of the European FP7 framework project to realize the trustworthy multi-domain network with collaborative and decentralized security and privacy monitoring system. The system architecture so developed comprises of five sub-systems: (i) programmable monitoring nodes called BlockMon nodes providing the monitoring infrastructure data plane, ii) BlockMon Controller, iii) Mitigation Control Point, in charge of providing a unique interface towards mitigation equipments, iv) an Inter-domain Exchange Point devised to provide gateway functionalities (at both control and data plane) from/to external administrative domains, and v) a Workflow Planner and Orchestrator Controller for authorization, brokerage, and run-time control service towards the deployed monitoring and mitigation primitives on the basis of the application needs, operational requirements, and regulatory provisions. The DEMONS system architecture further comprises two external interfaces to the end users, namely i) a Programming and Administrative Interface through which the system and its components are programmed, administered and maintained, and ii) an Application User Interface through which the system is used for monitoring by users in a given domain, plus a number of dedicated interfaces among the internal DEMONS' sub-systems / components.","PeriodicalId":445751,"journal":{"name":"2011 IEEE 5th International Conference on Internet Multimedia Systems Architecture and Application","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129001199","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Novel rate distortion optimized region of interest video coding for embedded video SOCs","authors":"N. Srinivasamurthy, S. Nagori, Manoj Koul","doi":"10.1109/IMSAA.2011.6156348","DOIUrl":"https://doi.org/10.1109/IMSAA.2011.6156348","url":null,"abstract":"In this paper we present a state of the art, practical, realtime, region of interest (ROI) video encoder implemented on the Texas Instruments TMS320DM3x SOC. The proposed algorithm is a novel rate distortion optimized ROI coding algorithm with low complexity making it ideal for implementing on embedded video SOCs with low computational and memory resources while achieving excellent perceptual quality. The proposed solution is a complete solution incorporating ROI processing in the entire video chain from front-end face detection to back-end video compression. It is probably one of the first video capture and compression system implemented on an embedded SOC which relies on specialized rate distortion method for ROI coding using object detection methods from the front end or user inputs. Extensive subjective evaluation has been performed on the proposed algorithm for various resolutions ranging from CIF to 1080p video resolutions at different bitrates for over 300 test cases. Significant subjective quality enhancements have been observed for video sequences over all the different video resolutions at various different bitrates. With the proposed algorithm competitive subjective quality is achieved for video conferencing sequences at 300 kbps for 720p and at 96 kbps for CIF when compared to the case where no ROI based rate distortion methods for coding are used. On the Texas Instruments TMS320DM3x SOC the ROI videoencoder achieved realtime performance for 1080p video resolution at 30 fps.","PeriodicalId":445751,"journal":{"name":"2011 IEEE 5th International Conference on Internet Multimedia Systems Architecture and Application","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116263757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Route detection and mobility based clustering","authors":"M. Saravanan, S. Pravinth, Pavan Holla","doi":"10.1109/IMSAA.2011.6156372","DOIUrl":"https://doi.org/10.1109/IMSAA.2011.6156372","url":null,"abstract":"Telecommunication companies maintain a large database of all user communications for billing purpose. This data is now being utilized by the network providers to assess the current needs of the subscribers. Logs of Telecommunication providers not only contain connectivity data but also location data of users. Analyzing this social network along with location data helps identify social interactions amongst people. This paper will discuss a novel method to mine the daily routes of users and analyze city-wide mass movement patterns from telecommunication data. Combining this with the user profiles generated from the same data, we outline a framework for Location-Based-Advertising.","PeriodicalId":445751,"journal":{"name":"2011 IEEE 5th International Conference on Internet Multimedia Systems Architecture and Application","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124152604","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Study of advanced-opportunistic proportionate fairness scheduler for LTE medium access control","authors":"S. Chaudhuri, D. Das, R. Bhaskaran","doi":"10.1109/IMSAA.2011.6156352","DOIUrl":"https://doi.org/10.1109/IMSAA.2011.6156352","url":null,"abstract":"Medium Access Control (MAC) scheduler entity forms one of the most important parts of any high speed packet access system like HSDPA or LTE. To the best of our knowledge the LTE MAC schedulers that had been proposed so far constitute of sub-carrier resource scheduling mostly based on single criteria like user throughput, link conditions, buffer constraints or power requirement. The above LTE MAC scheduler algorithms do not take care of user's queue weight calculation taking all the above mentioned parameters into consideration. In this paper, we proposed a novel algorithm to support dynamic queue weight calculation and referred it as Advanced-Opportunistic Proportionate Fairness Scheduler for LTE (A-OPFS-LTE). The A-OPFS-LTE, calculates the queue weight based on multiple parameters like flow control feedback, hybrid automatic repeat request (HARQ) retransmission status, service class type, guaranteed bit rate, access terminal (AT's) channel condition, queue's buffer utilization and later assigns the physical resource block. A-OPFS-LTE was able to schedule 14 uncompressed VoIP calls or 5 streaming type video calls every 1 milli-second scheduling cycle with packet loss less than 2%. Compared with MAC scheduler [10, 11], A-OPFS-LTE scheduler supports 10% cell throughput improvement and 30% more users","PeriodicalId":445751,"journal":{"name":"2011 IEEE 5th International Conference on Internet Multimedia Systems Architecture and Application","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114400018","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jules Pagna Disso, K. Jones, P. Williams, Alan Steer
{"title":"A distributed attack detection and mitigation framework","authors":"Jules Pagna Disso, K. Jones, P. Williams, Alan Steer","doi":"10.1109/IMSAA.2011.6156366","DOIUrl":"https://doi.org/10.1109/IMSAA.2011.6156366","url":null,"abstract":"Despite the efforts of security communities, the gap between the available protection against cyber-attacks and the number of successful attacks remains significant. The need for new countermeasures is clear and urgent as cyber-attacks are more than ever capable of causing loss of human life; destroying the environment, and causing a high level of disruption to critical infrastructures. The impact of cyber-attacks is sometimes comparable to the impact of traditional military actions. However, the lack of understanding of the scope of attacks and how they operate could lead to unsuccessful protection mechanisms. We have analysed attacks targeting IT and business network, and Critical infrastructure, as a result we present four levels of visibility of attacks that need to be considered when designing or implementing security mechanisms. In our discussion of these four levels of visibility of attacks, we particularly focus on one level where malicious users actions are direct threats to the targeted system but yet not visible by the targeted systems. We conclude by presenting our detection and mitigation framework concept.","PeriodicalId":445751,"journal":{"name":"2011 IEEE 5th International Conference on Internet Multimedia Systems Architecture and Application","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129710686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Paromita Choudhury, K. R. P. Kumar, G. Athithan, Sukumar Nandi
{"title":"A mechanism to recover voice from logged VoIP sessions based on RTP","authors":"Paromita Choudhury, K. R. P. Kumar, G. Athithan, Sukumar Nandi","doi":"10.1109/IMSAA.2011.6156339","DOIUrl":"https://doi.org/10.1109/IMSAA.2011.6156339","url":null,"abstract":"The convergence of voice and data on Internet Protocol (IP) networks has led to tremendous growth of Voice over IP (VoIP). While SIP/ H.323 are dominant signaling protocols, RTP is widely used for media transfer. Certain situations may require logging of RTP sessions along with the signaling information for call and voice analysis. Recovering voice from RTP packets requires explicit handling of RTP stack and decoding. In this paper, we propose a scheme that uses softphones with appropriate codec support for voice recovery from logged RTP packets. It is done using inherent provisions of RTP, specifically SSRC-multiplexing. The scheme also suggests the possibility of an active stream injection attack in RTP based VoIP.","PeriodicalId":445751,"journal":{"name":"2011 IEEE 5th International Conference on Internet Multimedia Systems Architecture and Application","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128297300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Near optimum detection of TCM signals in coloured noise","authors":"Prem Singh, K. Vasudevan","doi":"10.1109/IMSAA.2011.6156349","DOIUrl":"https://doi.org/10.1109/IMSAA.2011.6156349","url":null,"abstract":"Viterbi Algorithm is the optimum technique for detection of coded signals in white noise. However in many practical situations noise is coloured or correlated. The optimum detection techniques for both uncoded and coded (Trellis coded) signals in additive coloured Gaussian noise (ACGN) have been derived earlier in the literature. For detection of coded signals in coloured noise, the linear equalizer-predictive Viterbi algorithm (LE-PVA) is the optimum scheme. The whitening property of the prediction filter is the basis for the optimal performance of the LE-PVA. However the performance degradation in the practical LE-PVA is mainly due to the fact that the LE trained using the LMS algorithm may not converge to the global minimum and perfect estimates of the autocorrelation of the error signal at the T-spaced sampler output are not available. In this paper, we simulate a near ideal LE-PVA which consists of a filter matched to the received pulse, a T-spaced sampler and a near optimum T-spaced equalizer followed by PVA, whose predictor coefficients are computed from theory. Note that it is not possible to implement the ideal LE-PVA since it requires an infinite length T-spaced equalizer and an infinite length predictor.","PeriodicalId":445751,"journal":{"name":"2011 IEEE 5th International Conference on Internet Multimedia Systems Architecture and Application","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128393697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Group key exchange with non-linear trust","authors":"Mithun Paul, M. C. Gorantla, A. Saxena","doi":"10.1109/IMSAA.2011.6156359","DOIUrl":"https://doi.org/10.1109/IMSAA.2011.6156359","url":null,"abstract":"Group Key Exchange allows a set of parties to communicate over a public network and securely establish a secret session key. Thus, it is a critical protocol for emerging network applications that require collaborated output from various peers. There have been many protocols have been proposed, designed and implemented for group key exchange. However, in all the protocols proposed so far for group key exchange a scenario of linear trust is assumed i.e. either all the nodes in the group are uniformly considered trustworthy or completely trustless. We present, in this paper, a novel problem of how to deal with establishing a session key in a scenario where the trust is non-linearly distributed and a solution there of. A protocol is proposed using which every time a session key refresh happens in a group, it recognizes and eliminates the malicious node in the group thus securing every protocol session. We argue that our protocol is best suited in highly dynamic scenarios like Mobile Adhoc Networks (MANET).","PeriodicalId":445751,"journal":{"name":"2011 IEEE 5th International Conference on Internet Multimedia Systems Architecture and Application","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121433564","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Suman K Pathapati, Subhashini Venugopalan, Ashok Kumar, A. Bhamidipaty
{"title":"People and entity retrieval in implicit social networks","authors":"Suman K Pathapati, Subhashini Venugopalan, Ashok Kumar, A. Bhamidipaty","doi":"10.1109/IMSAA.2011.6156373","DOIUrl":"https://doi.org/10.1109/IMSAA.2011.6156373","url":null,"abstract":"Online social networks can be viewed as implicit real world networks, that manage to capture a wealth of information about heterogeneous nodes and edges, which are highly interconnected. Such abundant data can be beneficial in finding and retrieving relevant people and entities within these networks. Effective methods of achieving this can be useful in systems ranging from recommender systems to people and entity discovery systems. Our main contribution in this paper is the proposal of a novel localized algorithm that operates on the sub graph of the social graph and retrieves relevant people or entities. We also demonstrate how such an algorithm can be used in large real world social networks and graphs to efficiently retrieve relevant people/entities.","PeriodicalId":445751,"journal":{"name":"2011 IEEE 5th International Conference on Internet Multimedia Systems Architecture and Application","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116084672","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Crawlers for social networks & structural analysis of Twitter","authors":"Atul Saroop, A. Karnik","doi":"10.1109/IMSAA.2011.6156368","DOIUrl":"https://doi.org/10.1109/IMSAA.2011.6156368","url":null,"abstract":"Online social networks are growing at a rapid pace, both in terms of addition of new links between existing nodes and addition of new nodes to the network. Due to this continuous evolution of such networks, it is important to constantly crawl for information the overall network in general, and specific subnetworks in times of need. Precise information about social networks is important for devising strategies for improved dispersion of targeted information through the masses, for fine tuning messaging in marketing campaigns and for measuring the effectiveness of such marketing efforts. With the objective of gathering precise up-to-date information, we explore designs of fast crawlers for online social networks. Our experiments, carried on data downloaded from Twitter, show that node discovery strategies of random walk with backtrack and random search show promise as fast network crawlers. We implement the random search crawler for purposes of crawling Twitter for large amounts of information on network structure, user profile information and Tweet-level data. We present a summary of the data thus collected from Twitter. We also try to design generative models for Twitter-like networks that can be used in our simulations going forward, rather than having to depend upon downloading of large amounts of network information related data from online social networks.","PeriodicalId":445751,"journal":{"name":"2011 IEEE 5th International Conference on Internet Multimedia Systems Architecture and Application","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128693964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}