{"title":"Dependable quality-of-service provisioning through aggregate scheduling of multiple service classes on heterogeneous wireless channels","authors":"S. Ahmad, M. Qadir, M. Akbar","doi":"10.1109/ICFIN.2009.5339576","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339576","url":null,"abstract":"In this paper, we analyze the impact of end-to-end (E2E) delay variation on stripped sessions, whose packets are distributed over multiple links of multi-mode mobile terminal (MMT). The results of this analysis signify the importance of minimized out-of-sequence (OOS) arrival of packets belonging to a stream, while traversing through multiple radio networks to reach their destination. We, then propose a multi-server delay-budget ordered (MDO) scheduling scheme, that schedules back-logged packets on multiple interfaces of MMT according to their residual delay-budget metrics. In the proposed scheme, the impact of E2E delay variation on in-order packet arrival has been minimized through a link ranking function that reduces the impact of delay fluctuations. The simulation results show a consistently high performance metrics for the scheme with respect to end-to-end delay variations, packet drop rate, E2E throughput and in-order arrival which are highly desirable for interactive/ live, and buffered video streams running on MMT devices in uplink or/and downlink paths.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129186095","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":"An ISP-friendly multiple IPv6 addresses configuration scheme","authors":"Li Zimu, Jilong Wang, Li Xing, Jianping Wu","doi":"10.1109/ICFIN.2009.5339572","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339572","url":null,"abstract":"Internet is becoming an indispensible infrastructure of essential media, which makes a great burden for ISP's security and traffic management. Especially the situation will be much more serious in NGI (the Next-Generation Internet) because of its innumerable users, mobile device, information appliances (IA) and networked sensors etc with 128-bit IPv6 address. For the reason of lacking scalability, ISP's current security and traffic management scheme will be unavailable in NGI environment unless novel architecture and protocol proposed. In this paper, we studied the problem ISP faced and introduced an IPv6-based multiple addresses configuration scheme to ease ISP's traffic management in NGI environment. In the scheme, each type of service has its own source IPv6 address so that ISP can easily deploy security and traffic management policy with scalability. At the same time, QoS is improved and bandwidth is saved. In addition, some key technologies of the scheme are proposed in detail for future research activities focus on.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114143823","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":"A realtime community detection algorithm: incremental label propagation","authors":"Sheng Pang, Changjia Chen, Ting Wei","doi":"10.1109/ICFIN.2009.5339592","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339592","url":null,"abstract":"Most networks will evolve with time instead of keeping unchanged in reality. Therefore, we proposed the incremental label propagation (ILP) algorithm to detect community structures in complex networks in realtime. ILP algorithm will only take the local changed vertexes into consideration. The computation time is greatly decreased, while vertex (edge) is changed. The algorithm will definitely converge for the original version of label propagation algorithm is converged. We also applied ILP to real-time community detection in a relationship network of online game.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121159287","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":"Adaptive Cross-layer QoS for priority-based video streaming over wireless channel","authors":"Zhiling Li, Jinhe Zhou","doi":"10.1109/ICFIN.2009.5339566","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339566","url":null,"abstract":"Real-time streaming over wireless networks is a challenging proposition due to the highly variable nature of wireless links and the resource-poor nature of mobile device. In such a context, transmission control schemes have to dynamically adapt both to the application requirements and to the channel conditions. In this paper, we propose an adaptive cross-layer quality-of-service (QoS) scheme for wireless channel and streaming applications. For the sake of adaptive QoS, the Cross-layer architecture assumed that layers information could be exchanged between application layers and lower layers. In addition, priority-based adaptive QoS scheduling for MPEG video streams was proposed here. Simulation results show that our cross-layer architecture allows graceful video degradation while minimizing the mean packet delay and frame jitter. Finally, we outline future cross-layer research of multi-play over IP network.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121719546","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":"Improving data QoS in vehicular communication","authors":"Brijesh Kadri Mohandas, O. Yang, R. Liscano","doi":"10.1109/ICFIN.2009.5339575","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339575","url":null,"abstract":"The ability to provide various application services introduces more traffic and therefore the problem of data traffic congestion in a VANET (Vehicular Ad-Hoc Network), and hence the QoS (Quality of Service) of the application deteriorates. This paper studies an adaptive PI rate-controller to improve/restore the QoS. The controller controls the source sending rate based on the instantaneous queue length of the congested node. Our simulations demonstrate that this controller is capable of providing a smooth throughput at the source as desired by most of the applications.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133930238","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":"KarmaNET: Leveraging trusted social paths to create judicious forwarders","authors":"M. Spear, Xiaoming Lu, N. Matloff, S. F. Wu","doi":"10.1109/ICFIN.2009.5339559","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339559","url":null,"abstract":"Many existing problems in distributed systems can be linked to routing being orthogonal to trust and ignoring the social connectivity. This paper introduces a novel and economical protocol, entitled KarmaNET, which binds any routing protocol with trust to build a trusted social path and create judicious forwarders. This creates incentives for nodes to build good karma, and excises any node that has accumulated too much bad karma. KarmaNET requires only local knowledge, cuts off malicious nodes at the source, adapts to dynamic changes in behavior, bounds the number of unwanted messages a node can generate in its lifetime (even in the presence of collusion, part-time spammers, and errors in marking the outcome), and achieves an expected 0 spams received per node in the limit. KarmaNET ostracizes spammers, freeloaders, and minimizes Sybil attacks with negligible false positive and negative rates (less than 0.5%). We theoretically prove bounds on the damage an attacker can cause, that KarmaNET achieves exponentially fast adaptation to a node's dynamic behavior, and show that our simulation matches the theory.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114086823","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":"On the robustness of multiuser diversity in diversity combine systems with channel estimation error","authors":"Dong Tang, Mingxia Lv, B. Liu, Gaofei Huang","doi":"10.1109/ICFIN.2009.5339564","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339564","url":null,"abstract":"The robustness differences of multiuser maximum ratio combining (MRC), MIMO-MRC and optimum combining (OC) systems with imperfect channel state information are analyzed. Using the multiuser average capacity difference CDR with channel estimation error, the robustness of the three systems are illustrated in a flat Rayleigh fading channel with multiple interferers. Performance results show that OC system always outperforms the MIMO-MRC and MRC systems when there are no co-channel interferences, whereas MIMO-MRC and MRC outperform the OC system when there are multiple co-channel interferences.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122285883","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":"RouteLite: One-hop path splicing with path migration","authors":"P. Du, A. Nakao","doi":"10.1109/ICFIN.2009.5339605","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339605","url":null,"abstract":"As Internet applications demand high flexibility and reliability, giving an end-user control over routing while not breaking the Internet has been attractive to both end-users and Internet Services Providers (ISPs). In this paper, we present RouteLite, a lightweight routing scheme that achieves “controlled flexibility”, i.e., provide users with flexibility in selecting routes while only behaving users are granted such flexibility. RouteLite consists of one-hop path splicing and path migration, where we can migrate traffic seamlessly between different paths during transmission based on an end-user's behavior. RouteLite can not only grant an end-user control over routing through her behavior but also help ISPs operate their network efficiently and securely while achieving flexibility on the part of the users. The controlled flexibility can be realized through a credit-based accounting mechanism, through measurement based on the feedback on end-user's past behavior to control and trigger the path migration. We implement a prototype of such a RouteLite system and the experimental and simulation results show the efficiency of our proposed RouteLite scheme even with malicious users attempting to abuse the system causing DDoS-type congestion.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125639638","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":"Topology-based hierarchical scheduling using Deficit Round Robin: Flow protection and isolation for triple play service","authors":"Hao Yu, Ying Yan, M. Berger","doi":"10.1109/ICFIN.2009.5339606","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339606","url":null,"abstract":"This paper proposes a topology-based hierarchical scheduling scheme using Deficit Round Robin (DRR). The main idea of the topology-based hierarchical scheduling is to map the topology of the connected network into the logical structure of the scheduler, and combine several token schedulers according to the topology. The mapping process could be completed through the network management plane or by manual configuration. Based on the knowledge of the network, the scheduler can manage the traffic on behalf of other less advanced nodes, avoid potential traffic congestion, and provide flow protection and isolation. Comparisons between hierarchical scheduling, flow-based scheduling, and class-based scheduling schemes have been carried out under a symmetric tree topology. Results have shown that the hierarchical scheduling scheme provides better flow protection and isolation from attack of malicious traffic. This is significant for IPTV services in Carrier Ethernet networks.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133973363","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":"An approach for resource selection and allocation in grid based on trust management system","authors":"Cheng Chen, Gu Li-ze, Niu Xin-xin, Yang Yi-xian","doi":"10.1109/ICFIN.2009.5339585","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339585","url":null,"abstract":"In grid computing, resources can be given and retrieved by grid nodes freely. The wide range of selection and the high degree of strangeness bring lots of problems in secure selection of grid. Efficient resource allocation and utilization can hardly be achieved without the assurance of a high degree of confidence relation. In this paper, we propose a solution based on trust mechanism. The trust management system maintains a trust value for each participant node in its grid domain based on the performance and behavior of each node. The resource allocation utilization procedure makes decision based on the trust value provided by the trust management system. The simulation result shows that our approach can achieve lower failure percentage. Besides, the approach can get rid of the bad node with malicious behavior in history.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124466373","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}