{"title":"An Evaluation of Transport Protocols in Peer-to-Peer Media Streaming","authors":"Jeng-Yuh Chang, Xiao Su","doi":"10.1109/NAS.2008.46","DOIUrl":"https://doi.org/10.1109/NAS.2008.46","url":null,"abstract":"To solve the scalability issue of the traditional client-server architecture, many media streaming applications have adopted peer-to-peer (P2P) architecture in their implementations. Because of the success of using TCP in client-server streaming applications, most P2P streaming applications also use TCP as their transport protocol. On the other hand, some researchers argue that UDP is a better choice of transport protocol, as it is light-weight and meets the requirements of real-time streaming. However, there is no comparison study of using two transport protocols in global deployment of P2P applications. In this paper, we describe our efforts along this line. We first describe the designs of two P2P streaming systems: one using TCP, and the other using UDP. To simulate real deployment scenarios, both systems are developed based on similar designs used in current popular P2P streaming software products and comparative experiments are carried out on PlanetLab, a global Internet simulation platform.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134300373","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":"Dynamic Route Diversion in Connectionless Mobile Ad Hoc Networks","authors":"Y. H. Ho, K. Hua, Ning Jiang, Fei Xie","doi":"10.1109/NAS.2008.54","DOIUrl":"https://doi.org/10.1109/NAS.2008.54","url":null,"abstract":"In a mobile ad hoc network (MANET), communication connections need to adapt to frequent unpredictable topology changes due to the mobility, energy constraints, and limited computing power of the mobile hosts. Early solutions address this fundamental requirement by employing techniques that can reconnect a broken link quickly with low overhead. This strategy, however, cannot cope with a high frequency of broken links in a high mobility environment. To address this problem, a few connectionless-oriented techniques, e.g., connectionless approach (CLA), have emerged. These schemes rely on any mobile hosts along the general direction towards the destination node to help forward the data packets. Extensive simulation results have shown that these methods are more robust, and perform significantly better than connection-oriented techniques. The current connectionless methods, however, may suffer from packet drops since traffic congestion is not considered in the packet forwarding policy. In this paper, we address this weakness by applying a cross-layer design, where the physical and MAC layer knowledge of the wireless medium is shared with higher layer, in order to provide efficient methods of establish and maintain routes. We proposed two connectionless-oriented dynamic route diversion techniques; and give simulation results, based on GloMoSim, to illustrate their performance advantage.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115551490","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":"Parallel Job Scheduling with Overhead: A Benchmark Study","authors":"Richard A. Dutton, W. Mao, Jie Chen, W. Watson","doi":"10.1109/NAS.2008.26","DOIUrl":"https://doi.org/10.1109/NAS.2008.26","url":null,"abstract":"We study parallel job scheduling, where each job may be scheduled on any number of available processors in a given parallel system. We propose a mathematical model to estimate a job's execution time when assigned to multiple parallel processors. The model incorporates both the linear computation speedup achieved by having multiple processors to execute a job and the overhead incurred due to communication, synchronization, and management of multiple processors working on the same job. We show that the model is sophisticated enough to reflect the reality in parallel job execution and meanwhile also concise enough to make theoretical analysis possible. In particular, we study the validity of our overhead model by running well-known benchmarks on a parallel system with 1024 processors. We compare our fitting results with the traditional linear model without the overhead. The comparison shows conclusively that our model more accurately reflects the effect of the number of processors on the execution time. We also summarize some theoretical results for a parallel job schedule problem that uses our overhead model to calculate execution times.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130395699","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":"Component-based Network Protocol Architecture for Multi-core","authors":"Chen Tianzhou, Cao Mingteng, Shi Qingsong","doi":"10.1109/NAS.2008.57","DOIUrl":"https://doi.org/10.1109/NAS.2008.57","url":null,"abstract":"The architecture and implementation of network protocol stack is very important for network communication. And now CMP(Chip Multi-processor) architecture is the trend of CPU because of its excellent parallelism and high efficiency. So this paper proposes a Component-based Network Protocol Architecture(CNPAM) based on Intel Multi-core. In this architecture, two important modules are brought in: distribution module and migration module. Distribution module takes charge of distributing close function components to the same core group in which the two cores share the L2 cache. And migration module guarantees the load balance of all cores. The performance of CNPAM gets a significant improvement.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129673857","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":"Accurate Performance Modeling and Guidance to the Adoption of an Inconsistency Detection Framework","authors":"Yijun Lu, Xueming Li, Hong Jiang","doi":"10.1109/NAS.2008.12","DOIUrl":"https://doi.org/10.1109/NAS.2008.12","url":null,"abstract":"With the increased popularity of replica-based services in distributed systems such as the Grid, consistency control among replicas becomes more and more important. To this end, IDF (inconsistency detection framework), a two-layered overlay-based architecture, has been proposed as a new way to solve this problem-instead of enforcing a predefined consistency control protocol, IDF detects inconsistency in a timely manner when it occurs and resolves it based on applicationspsila semantics.This paper presents a comprehensive analytical study of the two-layer detection mechanism. We develop an analytical model to characterize IDF and, based on this model, evaluating the successful rate of inconsistency detection within the top layer, which directly impacts the performance of IDF. We also derive a unified formula to model the performance of IDF with regard to a wide range of applications. Based on the modeling results, we illustrate how practitioners can use these quantitative insights to tune the IDF parameters for specific applications.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125854789","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":"Goal-based Dependability Analysis and Improvement Framework for Network Storage Systems","authors":"Hua Wang, Ke Zhou","doi":"10.1109/NAS.2008.49","DOIUrl":"https://doi.org/10.1109/NAS.2008.49","url":null,"abstract":"On the basis of deep research on dependability of computer system, we extend the notion of dependability attribute, which is the dependability analysis object of traditional dependability theory, and present the multidimensional dependability object. We put forward a scientific and practical goal-based dependability analysis and improvement framework for computer systems. Aiming at the characteristics of network storage systems, we devise a reusable database for dependability analysis and improvement. According to the framework and the reusable database, a user can be directed and elicited to perform the analysis and improvement towards a network storage system.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"490 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125603906","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}
Qingyang Song, Xingwei Wang, Zhongfeng Wen, Yao Lv, Feifei Xu
{"title":"A Dynamic Interface Activation Scheme for Vertical Handoffs","authors":"Qingyang Song, Xingwei Wang, Zhongfeng Wen, Yao Lv, Feifei Xu","doi":"10.1109/NAS.2008.40","DOIUrl":"https://doi.org/10.1109/NAS.2008.40","url":null,"abstract":"This paper presents a dynamic interface activation scheme for making vertical handoff decisions. Interface activating interval is intelligently adjusted according to the actually varying network conditions. The simulation results demonstrate that the proposal succeeds in trading off between interfacespsila activating interval against deciding timeliness.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133444585","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":"Joint Topology-Transparent Scheduling and QoS Routing in Mobile Ad Hoc Networks","authors":"Yi-Sheng Su, S. Su, Jung-Shian Li","doi":"10.1109/NAS.2008.62","DOIUrl":"https://doi.org/10.1109/NAS.2008.62","url":null,"abstract":"In this paper, a framework for joint topology-transparent scheduling (TTS) and quality-of-service (QoS) routing in mobile ad hoc networks is proposed. Inspired by the fact that TTS can guarantee single-hop QoS support without the overhead due to the re-computation of transmission schedules when the network topology changes, TTS is chosen as the medium access control (MAC) in both the control and data channels. An interference model which captures the difference between communication and interference ranges is considered. Under this interference model, mechanisms in the control channel are designed to collect information of nodes outside a node's communication range in order to provide QoS support. Based on the information collected, bandwidth calculation and reservation at individual nodes are developed to efficiently utilize the data channel resources provided by TTS. A routing protocol with (end-to-end) QoS support is then proposed by giving routing access to bandwidth information. The proposed framework using TTS as the underlying MAC to design a QoS routing protocol is demonstrated by means of simulations.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116465148","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 Analytical Performance Model of IP-SAN","authors":"Min Wang, Liu Liu, W. Xu, Lu Xu","doi":"10.1109/NAS.2008.38","DOIUrl":"https://doi.org/10.1109/NAS.2008.38","url":null,"abstract":"In this paper we propose a component-based analytical performance model for IP-SAN. We model four key components within IP-SAN individually and they are IP network, cache, RAID and disks. We validate these component models and compose them to give an entire IP-SAN performance model. The entire IP-SAN model analyzes the performance of an IP-SAN configuration under multiple synchronous workloads by using closed queueing network model and under asynchronous workload by using open queueing network model. We also validate the entire IP-SAN performance model against a real IP-SAN system. The theoretical results are compared with the results from a real IP-SAN using a variety of synthetic workloads. These experiments prove that the component-based method is an appropriate way to build performance model for a complex storage system. To our knowledge, this is the first exploration into building analytical performance model for entire IP-SAN system and validating against a real system. We also identify areas for future research in the performance analysis of real IP-SAN.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126608491","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 e-Learning Services Discovery Algorithm Based on User Satisfaction","authors":"Zheng-Zhou Zhu, Zhongfu Wu, Shangbo Zhou","doi":"10.1109/NAS.2008.36","DOIUrl":"https://doi.org/10.1109/NAS.2008.36","url":null,"abstract":"There are more and more Web services used in collaborative learning, hence it has become increasingly important to locate proper Web services in an accurate and efficient way. In this paper, an annexed algorithm, called eLSDAUS, is proposed to improve the existing semantic-based matchmaking algorithm. In the algorithm, we introduce and incorporate in a new factor - user satisfaction, which is the user's level of satisfaction about the result of service discovery. This algorithm allows users to take part in the process of e-Learning service discovery, and evaluate the result of service discovery. User's evaluation in the form of user satisfaction is fed back to the system. Adopting an amendatory function that takes the user satisfaction as an input, the system modifies the weights of each property of the advertise service, and then total match degree of service discovery up to best. Experiment indicates that the precision of the service discovery improved 5 percent as the number of advertisement services up to 1000. After learning for one week, over 93% students are satisfied with the e-Learning service discovery result.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129660309","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}