Wen-Chung Shih, Chao-Tung Yang, Chun-Jen Chen, S. Tseng
{"title":"Parallel Loop Scheduling Using Knowledge-Based Workload Estimation on Grid Environments","authors":"Wen-Chung Shih, Chao-Tung Yang, Chun-Jen Chen, S. Tseng","doi":"10.1109/SAINT.2007.20","DOIUrl":"https://doi.org/10.1109/SAINT.2007.20","url":null,"abstract":"Parallel loop scheduling on grid environments is a challenging problem, especially for loops with irregular workload distribution. In the past, this problem of load imbalance resulting from irregular workload was not explicitly addressed. This paper proposes a new approach to schedule loop iterations with irregular workload on grid environments. Based on knowledge-based estimation of workload, the proposed method can dispatch an appropriate proportion of workload to each node for execution according to its performance. In addition, the scheduler uses historical statistics of CPU usage and network bandwidth to estimate the dynamically changing performance of each node. Two applications, regular type and irregular one respectively, are implemented and executed on a grid test-bed, which consists of four schools. Experimental results show that the new approach improves the performance on previous schemes","PeriodicalId":440345,"journal":{"name":"2007 International Symposium on Applications and the Internet","volume":"8 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116777155","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}
Kaori Maeda, Masahide Ishino, Eitaro Kohno, T. Kishida
{"title":"A Userland Network Emulator with Packet Capture and Replay","authors":"Kaori Maeda, Masahide Ishino, Eitaro Kohno, T. Kishida","doi":"10.1109/SAINT.2007.7","DOIUrl":"https://doi.org/10.1109/SAINT.2007.7","url":null,"abstract":"Testing of communication protocols and applications using simulated networks is necessary. In this paper, we show the development of a network emulator called as \"Lenet\". Since our objective is to provide a network emulator as a user can use it more convenient, Lenet is developed as a userland application which is typically used by end users. Even though a userland application, Lenet has similar functions and accuracy to the existing software emulators of an in-kernel implementation type. Lenet gives two kinds of emulation. One is by parameters to simulate specific network conditions for an end-to-end. Another type of emulation is to replay the behavior of a real network using a replay scenario created by packet capture or written by a user. We present some evaluation results of Lenet on performance and convenience","PeriodicalId":440345,"journal":{"name":"2007 International Symposium on Applications and the Internet","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114830998","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 Component Framework for Document-Centric Network Processing","authors":"I. Satoh","doi":"10.1109/SAINT.2007.5","DOIUrl":"https://doi.org/10.1109/SAINT.2007.5","url":null,"abstract":"A component framework for defining content-based network processing is presented. It is unique among other existing approaches because it enables contents to naturally define their own processing and end-users to easily define network processing. By using it, we can dynamically make an enriched document as a nested composition of software components corresponding to various content, e.g., text, images, and windows. It enables each component or document to migrate over a network under its own control by using mobile agent technology. Moreover, it introduces components as carriers or forwarders because it enables them to carry or transmit other components as first class objects to other locations. It offers several basic operations for network processing, e.g., forwarding, duplication, and synchronization. It allows end-users to easily define their own content-based or application-specific network processing by assembling these components in through GUI manipulations. This paper describes the framework and its implementation, which currently uses Java as the implementation language as well as a component development language, and then illustrates several interesting applications that demonstrate its utility and flexibility","PeriodicalId":440345,"journal":{"name":"2007 International Symposium on Applications and the Internet","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131509377","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 Effect of Scale-Free Structure of Network Topology on End-to-End Performance","authors":"H. Ohsaki, Koutaro Yagi, M. Imase","doi":"10.1109/SAINT.2007.18","DOIUrl":"https://doi.org/10.1109/SAINT.2007.18","url":null,"abstract":"In recent years, it has been reported that several existing networks including the Internet have scale-free structure. In this paper, through a simple numerical analysis, we investigate effect of the scale-free structure of communication networks on their end-to-end performance. As network topologies, a random network and a scale-free network with the equal number of nodes and the equal number of links are used. We compare end-to-end performance of flows (i.e., throughput) in both random and scale-free networks. Consequently, we show that when the average degree of a network is small (i.e., when the number of links is small), a scale-free network shows better end-to-end performance. On the contrary, when the average degree of a network is large (i.e., when the number of links is large), we show that a random network shows better end-to-end performance","PeriodicalId":440345,"journal":{"name":"2007 International Symposium on Applications and the Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131346028","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":"SPRED: Active Queue Management Mechanism for Wide-Area Networks","authors":"H. Ohsaki, Hideyuki Yamamoto, M. Imase","doi":"10.1109/SAINT.2007.24","DOIUrl":"https://doi.org/10.1109/SAINT.2007.24","url":null,"abstract":"AQM (active queue management) mechanism is a congestion control mechanism at a router for controlling the number of packets in the router's buffer by actively discarding an arriving packet. AQM mechanism can shorter the average delays in the router's buffer and can also achieve high throughput. RED (random early detection) is a representative AQM mechanism, which probabilistically discards an arriving packet. However, it is reported that the performance of RED degrades in a wide-area network with a large propagation delay. In this paper, we therefore propose an AQM mechanism called SPRED (Smith Predictor for random early detection) for wide-area networks. The notable feature of SPRED is realizing high steady-state and transient-state performance by using a delay compensator called Smith Predictor for compensating a large feedback delay. In this paper, we show the effectiveness of SPRED by both analysis and simulation experiments","PeriodicalId":440345,"journal":{"name":"2007 International Symposium on Applications and the Internet","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124723055","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}
Toshiaki Osada, G. Kitagata, D. Chakraborty, T. Suganuma, N. Shiratori
{"title":"An Effective Application-Level QoS Routing Scheme for MANETs","authors":"Toshiaki Osada, G. Kitagata, D. Chakraborty, T. Suganuma, N. Shiratori","doi":"10.1109/SAINT.2007.8","DOIUrl":"https://doi.org/10.1109/SAINT.2007.8","url":null,"abstract":"In this research, our aim is to construct an effective quality of service (QoS) routing scheme for mobile ad hoc networks (MANET) that provides the service to satisfy required quality by absorbing dynamic changes of network resources. In this paper, we propose an application-level QoS routing scheme for MANETs (ALRS) as a novel QoS routing, that includes following three significant features: (1) estimation of consumed bandwidth on each node using 2-hop neighbors' traffic information, (2) route construction combined with admission control on each application session using (1), and (3) route maintenance based on (1) and (2). ALRS realizes control of generated traffic in MANET effectively and enables to provide the service to satisfy required quality for dynamic changes of network resources. By using our proposed scheme, it is expected that the availability of bandwidth would greatly improve for high-load communication, such as multimedia application on MANET. From our simulation results, it has shown, that our proposed scheme, by effective suppression of traffic, increased delivery ratio up to 40%, without any deterioration of throughput compared to traditional method. Results show that our proposed scheme enables to provide the service to satisfy the required quality","PeriodicalId":440345,"journal":{"name":"2007 International Symposium on Applications and the Internet","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125945771","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":"Live E! Project; Sensing the Earth with Internet Weather Stations","authors":"H. Esaki, H. Sunahara","doi":"10.1109/SAINT.2007.16","DOIUrl":"https://doi.org/10.1109/SAINT.2007.16","url":null,"abstract":"The Live E! project, www.live-e.org, is an open research consortium among industry and academia to explore the platform to share the digital information related with the Earth and our living environment. We have getting a lot of low cost sensor nodes with Internet connectivity. The deployment of broadband and ubiquitous networks will enable autonomous and global digital information sharing over the globe. In this paper, we describe the technical and operational overview of Live E! project, while discussing the objective, such as education, disaster protection/reduction/recovery or business cases, and goal of this project activity","PeriodicalId":440345,"journal":{"name":"2007 International Symposium on Applications and the Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130727113","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":"TCP-friendly Congestion Control for HighSpeed Network","authors":"T. Hatano, H. Shigeno, Ken-ichi Okada","doi":"10.1109/SAINT.2007.26","DOIUrl":"https://doi.org/10.1109/SAINT.2007.26","url":null,"abstract":"The currently used TCP congestion control, TCP Reno, has two weaknesses. To solve this TCP Reno drawback, highspeed TCP and scalable TCP were proposed. However, the fairness between these proposed TCP and TCP Reno is not considered, when both connections coexist. Secondly, TCP Reno connections share bandwidth unfairly, when TCP flows with different RTTs use the same link. Many researches have been proposed to solve this issue. However, no single method has been proposed to solve both issues. This paper proposes a new TCP congestion control algorithm, which is based on the generalized additive increase multiplicative decrease (AIMD) rules. Our algorithm (1) sends packets efficiently in high-speed networks, (2) is TCP-friendly with TCP Reno and (3) shares fair bandwidth between flows with different RTTs. We evaluate the capabilities of our proposal by computer simulations and compare it with existing TCP","PeriodicalId":440345,"journal":{"name":"2007 International Symposium on Applications and the Internet","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126233226","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}