2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)最新文献_第3页

Automated debugging of SLO violations in enterprise systems 企业系统中SLO违规的自动调试

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5432008

M. Natu, Sangameshwar Patil, V. Sadaphal, H. Vin

引用次数: 7

A scheduling and Call Admission Control algorithm for WiMax mesh network with strict QoS guarantee 一种具有严格QoS保证的WiMax网状网络调度和呼叫接纳控制算法

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431997

Pulkit Goyal, A. Sahoo

{"title":"A scheduling and Call Admission Control algorithm for WiMax mesh network with strict QoS guarantee","authors":"Pulkit Goyal, A. Sahoo","doi":"10.1109/COMSNETS.2010.5431997","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431997","url":null,"abstract":"The IEEE 802.16 standard (commonly known as WiMax) has emerged as a broadband wireless technology covering large geographical area while providing high speed data rates with native Quality of Service (QoS) support. In this paper, we study mesh mode of operation of WiMax with centralized scheduling for UGS and RTPS service classes. We briefly discuss two known routing algorithms (to find the path of a request) and propose two new routing algorithms. We present a novel scheduling and Call Admission Control (CAC) algorithm for UGS and RTPS service class. The scheduling and CAC algorithm make sure that each and every packet of admitted request strictly meets its delay and jitter constraints. Since an RTPS request can change its data rate requirement, we propose an efficient algorithm for computing extra bandwidth request for RTPS service class which perform much better in terms of average packet delay and packet drop percentage compared to some simple algorithms. We present simulation results comparing our scheduling algorithm with two other algorithms proposed in the literature. We also present results which show that our scheduling does provide strict QoS guarantee for every packet.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131667311","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}

引用次数: 20

Socio-technical aspects of video phones 视频电话的社会技术方面

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431971

Vikram Chandrasekaran, Siva Dantu, Priyanka Kadiyala, R. Dantu, S. Phithakkitnukoon

{"title":"Socio-technical aspects of video phones","authors":"Vikram Chandrasekaran, Siva Dantu, Priyanka Kadiyala, R. Dantu, S. Phithakkitnukoon","doi":"10.1109/COMSNETS.2010.5431971","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431971","url":null,"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.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130837646","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}

引用次数: 4

ADWISER: An integrated approach for Internet access bandwidth and performance management of an enterprise network adwise:一种针对企业网络的互联网接入带宽和性能管理的集成方法

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431962

P. Kumar, K. Vasudev, M. Hegde, S. Anand, Anurag Kumar, J. Kuri

引用次数: 6

Experimental validation of analytical performance models for IEEE 802.11 networks IEEE 802.11网络分析性能模型的实验验证

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431957

Shrirang Mare, D. Kotz, A. Kumar

引用次数: 11

On the effectiveness of IP reputation for spam filtering 论IP信誉对垃圾邮件过滤的有效性

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431981

H. Esquivel, Aditya Akella, Tatsuya Mori

{"title":"On the effectiveness of IP reputation for spam filtering","authors":"H. Esquivel, Aditya Akella, Tatsuya Mori","doi":"10.1109/COMSNETS.2010.5431981","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431981","url":null,"abstract":"Modern SMTP servers apply a variety of mechanisms to stem the volume of spam delivered to users. These techniques can be broadly classified into two categories: pre-acceptance approaches, which apply prior to a message being accepted (e.g. IP reputation), and post-acceptance techniques which apply after a message has been accepted (e.g. content based signatures). We argue that the effectiveness of these measures varies based on the SMTP sender type. This paper focuses on the most light-weight pre-acceptance filtering mechanism — IP reputation. We first classify SMTP senders into three main categories: legitimate servers, end-hosts, and spam gangs, and empirically study the limits of effectiveness regarding IP reputation filtering for each category. Next, we develop new techniques that build custom IP reputation lists, which significantly improve the performance of existing IP reputation lists. In compiling these lists, we leverage a somewhat surprising fact that both legitimate domains and spam domains often use the DNS Sender Policy Framework (SPF) in an attempt to pass simple authentication checks. That is, good/bad IP addresses can be systematically compiled by collecting good/bad domains and looking up their SPF resource records. We also evaluate the effectiveness of these lists over time. Finally, we aim to understand the characteristics of the three categories of email senders in depth. Overall, we find that it is possible to construct IP reputation lists that can identify roughly 90% of all spam and legitimate mail, but some of the lists, i.e. the lists for spam gangs, must be updated on a constant basis to maintain this high level of accuracy.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121184884","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}

引用次数: 32

Understanding topological mesoscale features in community mining 了解社区采矿的拓扑中尺度特征

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431994

S. Moon, Jinyoung You, Haewoon Kwak, Daniel Kim, Hawoong Jeong

{"title":"Understanding topological mesoscale features in community mining","authors":"S. Moon, Jinyoung You, Haewoon Kwak, Daniel Kim, Hawoong Jeong","doi":"10.1109/COMSNETS.2010.5431994","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5431994","url":null,"abstract":"Community detection has been one of the major topics in complex network research. Recently, several greedy algorithms for networks of millions of nodes have been proposed, but one of their limitations is inconsistency of outcomes [1]. Kwak et al. propose an iterative reinforcing approach to eliminate inconsistency in detected communities. In this paper we delve into structural characteristics of communities identified by Kwak's method with 12 real networks. We find that about 40% of nodes are grouped into communities in an inconsistent way in Orkut and Cyworld. Interestingly, they are only two out of 12 networks whose community size distribution follow power-law. As a first step towards interpretation of communities, we use Guimera and Amaral's method [2] to classify nodes into seven classes based on the z-score and the participation coefficient. Using the z-P analysis, we identify the roles of nodes in Karate and Autonomous System (AS) networks and match them against known roles for evaluation. We apply topological mesoscale information to compare two AS produced by Oliveira et al. [3], and Dhamdhere and Dovrolis [4] We report that even though their AS graphs differ in size, their topological characteristics are very similar.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121242162","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}

引用次数: 9

Efficiency of social connection-based routing in P2P VoIP networks P2P VoIP网络中基于社交连接的路由效率研究

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5431975

Vikram Chandrasekaran, R. Dantu, Neeraj K. Gupta, Xiaohui Yang, D. Wijesekera

引用次数: 2

Vector method based coverage hole recovery in Wireless Sensor Networks 基于矢量法的无线传感器网络覆盖孔恢复

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5432001

P. Sahoo, J. Tsai, Hong-Lin Ke

{"title":"Vector method based coverage hole recovery in Wireless Sensor Networks","authors":"P. Sahoo, J. Tsai, Hong-Lin Ke","doi":"10.1109/COMSNETS.2010.5432001","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432001","url":null,"abstract":"In Wireless Sensor Networks (WSN), sensors form the network dynamically without help of any infrastructure. The accidental death of the nodes due to technical failures or death due to power exhaustion may disturb the existing coverage and connectivity of the network. In this paper, distributed coverage hole recovery algorithms for the wireless sensor networks are designed that use the vector methods to decide the magnitude and direction of the mobile nodes. In the post deployment scenario, coverage holes of the network are repaired by moving the nodes in a self organized manner. To minimize the energy consumption of the nodes due to mobility, algorithms are designed in such a way that the mobility is limited within only one-hop of the nodes and highest coverage (k-coverage) of a node is not increased after its mobility. Performance evaluation of the proposed algorithms show that cent percent of coverage recovery could be possible by moving the nodes within their communication range. Besides, the average mobility distance of the nodes is very small to recover the coverage holes by our algorithms.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131781480","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}

引用次数: 32

Probabilistic routing using contact sequencing in delay tolerant networks 时延容忍网络中基于接触排序的概率路由

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010) Pub Date : 2010-01-05 DOI: 10.1109/COMSNETS.2010.5432013

Rugved Jathar, Arobinda Gupta

{"title":"Probabilistic routing using contact sequencing in delay tolerant networks","authors":"Rugved Jathar, Arobinda Gupta","doi":"10.1109/COMSNETS.2010.5432013","DOIUrl":"https://doi.org/10.1109/COMSNETS.2010.5432013","url":null,"abstract":"Delay tolerant networks (DTNs) are characterized by intermittent node connectivity and unavailability of end-to-end paths for most of the time. Routing in such networks is a challenge because of these characteristics. Some existing routing protocols try to improve the delivery ratio by replicating some messages and hence perform poorly if the nodes have limited buffer space, or alternatively, if the number of messages is high. Some existing protocols also use the underlying movement pattern to improve routing efficiency. In many real life scenarios, movement patterns show repetitive contacts between nodes occurring in some time sequence. In this paper, we propose a probabilistic routing protocol that uses both the repetitive contacts and their time sequencing to improve routing. The protocol does not replicate any message and hence can work with low buffer size in mobile nodes. The novel feature of this protocol is the use of sequences of contacts which has not been used in earlier protocols. Simulation results show that the proposed protocol achieves high message delivery ratio with no message replication compared to some of the existing protocols.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134488698","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}

引用次数: 27