Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240654
A. Boukerche, Harold Owens
While multimedia synchronization in wired environments has been well studied in the past, very little studies have been done for wireless networks. In this paper, we study the multimedia synchronization problem for wireless and mobile networks. We present a performance evaluation of MoSych algorithm and investigate the effect of four media packet scheduling algorithms on MoSych (first in first out, highest priority first, weighted fair Queuing and round robin). We also report the results we have obtained to analyze the effect of these four packet scheduling algorithms in terms of mobile client's buffer usage and delay between multiple data streams.
{"title":"Performance evaluation of packet scheduling and synchronization algorithms for wireless multimedia systems","authors":"A. Boukerche, Harold Owens","doi":"10.1109/MASCOT.2003.1240654","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240654","url":null,"abstract":"While multimedia synchronization in wired environments has been well studied in the past, very little studies have been done for wireless networks. In this paper, we study the multimedia synchronization problem for wireless and mobile networks. We present a performance evaluation of MoSych algorithm and investigate the effect of four media packet scheduling algorithms on MoSych (first in first out, highest priority first, weighted fair Queuing and round robin). We also report the results we have obtained to analyze the effect of these four packet scheduling algorithms in terms of mobile client's buffer usage and delay between multiple data streams.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129238467","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240651
Shahram Ghandeharizadeh, C. Papadopoulos, M. Cai, Runfang Zhou, P. Pol
Web services are an emerging software technology that employ XML to share and exchange data. They may serve as wrappers for legacy data sources, integrate multiple remote data sources, filter information by processing queries (function shipping), etc. With those that interact with an end user, a fast response time might be the difference between a frustrated and a satisfied user. A Web service may employ a loss-less compression technique, e.g., Zip, XMill, etc., to reduce the size of an XML message in order to enhance its transmission time. This saving might be outweighed by the overhead of compressing the output of a Web service at a server and decompressing it at a client. The primary contribution of this paper is NAM, a middleware that strikes a compromise between these two factors in order to enhance response time. NAM decides when to compress data based on the available client and server processor speeds, and network characteristics. When compared with today's common practice to transmit the output of a Web service uncompressed always, our experimental results show NAM either provides similar or significantly improved response times (at times more than 90% improvement) with Internet connections that offer bandwidths ranging between 80 to 100 Mbps.
{"title":"NAM: a network adaptable middleware to enhance response time of Web services","authors":"Shahram Ghandeharizadeh, C. Papadopoulos, M. Cai, Runfang Zhou, P. Pol","doi":"10.1109/MASCOT.2003.1240651","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240651","url":null,"abstract":"Web services are an emerging software technology that employ XML to share and exchange data. They may serve as wrappers for legacy data sources, integrate multiple remote data sources, filter information by processing queries (function shipping), etc. With those that interact with an end user, a fast response time might be the difference between a frustrated and a satisfied user. A Web service may employ a loss-less compression technique, e.g., Zip, XMill, etc., to reduce the size of an XML message in order to enhance its transmission time. This saving might be outweighed by the overhead of compressing the output of a Web service at a server and decompressing it at a client. The primary contribution of this paper is NAM, a middleware that strikes a compromise between these two factors in order to enhance response time. NAM decides when to compress data based on the available client and server processor speeds, and network characteristics. When compared with today's common practice to transmit the output of a Web service uncompressed always, our experimental results show NAM either provides similar or significantly improved response times (at times more than 90% improvement) with Internet connections that offer bandwidths ranging between 80 to 100 Mbps.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122260895","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240649
R. Fujimoto, K. Perumalla, Alfred Park, Hao Wu, M. Ammar, G. Riley
Parallel and distributed simulation tools are emerging that offer the ability to perform detailed, packet-level simulations of large-scale computer networks on an unprecedented scale. The state-of-the-art in large-scale network simulation is characterized quantitatively. For this purpose, a metric based on the number of packet transmissions that can be processed by a simulator per second of wallclock time (PTS) is used as a means to quantitatively assess packet-level network simulator performance. An approach to realizing scalable network simulations that leverages existing sequential simulation models and software is described. Results from a recent performance study are presented concerning large-scale network simulation on a variety of platforms ranging from workstations to cluster computers to supercomputers. These experiments include runs utilizing as many as 1536 processors yielding performance as high as 106 million PTS. The performance of packet-level simulations of web and ftp traffic, and denial of service attacks on networks containing millions of network nodes are briefly described, including a run demonstrating the ability to simulate a million web traffic flows in near real-time. New opportunities and research challenges to fully exploit this capability are discussed.
{"title":"Large-scale network simulation: how big? how fast?","authors":"R. Fujimoto, K. Perumalla, Alfred Park, Hao Wu, M. Ammar, G. Riley","doi":"10.1109/MASCOT.2003.1240649","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240649","url":null,"abstract":"Parallel and distributed simulation tools are emerging that offer the ability to perform detailed, packet-level simulations of large-scale computer networks on an unprecedented scale. The state-of-the-art in large-scale network simulation is characterized quantitatively. For this purpose, a metric based on the number of packet transmissions that can be processed by a simulator per second of wallclock time (PTS) is used as a means to quantitatively assess packet-level network simulator performance. An approach to realizing scalable network simulations that leverages existing sequential simulation models and software is described. Results from a recent performance study are presented concerning large-scale network simulation on a variety of platforms ranging from workstations to cluster computers to supercomputers. These experiments include runs utilizing as many as 1536 processors yielding performance as high as 106 million PTS. The performance of packet-level simulations of web and ftp traffic, and denial of service attacks on networks containing millions of network nodes are briefly described, including a run demonstrating the ability to simulate a million web traffic flows in near real-time. New opportunities and research challenges to fully exploit this capability are discussed.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"69 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126108980","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240652
B. Zeigler
The DEVS modeling and simulation framework its fundamental concepts are discussed from the standpoint of discrete event information processing with an example drawn from recent experiments on infant cognition is reviewed. We also cover the DEVS formalism's atomic and coupled models and its hierarchical, modular composition approach. Some industrial applications of the methodology are discussed in depth to highlight the formalism's utility in the development of commercial and defense information technologies.
{"title":"DEVS today: recent advances in discrete event-based information technology","authors":"B. Zeigler","doi":"10.1109/MASCOT.2003.1240652","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240652","url":null,"abstract":"The DEVS modeling and simulation framework its fundamental concepts are discussed from the standpoint of discrete event information processing with an example drawn from recent experiments on infant cognition is reviewed. We also cover the DEVS formalism's atomic and coupled models and its hierarchical, modular composition approach. Some industrial applications of the methodology are discussed in depth to highlight the formalism's utility in the development of commercial and defense information technologies.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122697616","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240668
Lance Titchkosky, M. Arlitt, C. Williamson
Many Web sites today dynamically generate responses when user requests are received. Dynamic content creation enables features that might otherwise not be possible. One disadvantage of dynamically generating Web content is the impact on Web server performance. In this paper, we experimentally evaluate the impact of three different dynamic content technologies on Web server performance. The results show that the overheads of dynamic content generation reduce the peak response rate of a Web server by a factor of 2 to 8, depending on the workload characteristics and the specific Web technologies used.
{"title":"Performance benchmarking of dynamic Web technologies","authors":"Lance Titchkosky, M. Arlitt, C. Williamson","doi":"10.1109/MASCOT.2003.1240668","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240668","url":null,"abstract":"Many Web sites today dynamically generate responses when user requests are received. Dynamic content creation enables features that might otherwise not be possible. One disadvantage of dynamically generating Web content is the impact on Web server performance. In this paper, we experimentally evaluate the impact of three different dynamic content technologies on Web server performance. The results show that the overheads of dynamic content generation reduce the peak response rate of a Web server by a factor of 2 to 8, depending on the workload characteristics and the specific Web technologies used.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128103722","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240678
J. Abawajy, S. Dandamudi
This paper addresses the problem of an on-line coordinated allocation of processor and I/O resources in large-scale shared heterogeneous cluster computing systems. Most research in job scheduling study has focused solely on the allocation of processors to jobs. However, since I/O is also a critical resource for many jobs, the allocation of processor and I/O resources must be coordinated to allow the system to operate most effectively. To this end, we present an efficient job scheduling policy and study its performance under various system and workload parameters. We also compared the performance of the proposed policy with static space time sharing policy. The results show that the proposed policy performs substantially better than the static space time sharing policy.
{"title":"Scheduling parallel jobs with CPU and I/O resource requirements in cluster computing systems","authors":"J. Abawajy, S. Dandamudi","doi":"10.1109/MASCOT.2003.1240678","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240678","url":null,"abstract":"This paper addresses the problem of an on-line coordinated allocation of processor and I/O resources in large-scale shared heterogeneous cluster computing systems. Most research in job scheduling study has focused solely on the allocation of processors to jobs. However, since I/O is also a critical resource for many jobs, the allocation of processor and I/O resources must be coordinated to allow the system to operate most effectively. To this end, we present an efficient job scheduling policy and study its performance under various system and workload parameters. We also compared the performance of the proposed policy with static space time sharing policy. The results show that the proposed policy performs substantially better than the static space time sharing policy.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133415644","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240648
Bo Hong, S. Brandt, D. Long, E. L. Miller, K. Glocer, Zachary N. J. Peterson
Access latency to secondary storage devices is frequently a limiting factor in computer system performance. New storage technologies promise to provide greater storage densities at lower latencies than is currently obtainable with hard disk drives. MEMS-based storage devices use orthogonal magnetic or physical recording techniques and thousands of simultaneously active MEMS-based read-write tips to provide high-density low-latency nonvolatile storage. These devices promise seek times 10-20 times faster than hard drives, storage densities 10 times greater, and power consumption an order of magnitude lower. Previous research has examined data layout and request ordering algorithms that are analogs of those developed for hard drives. We present an analytical model of MEMS device performance that motivates a computationally simple MEMS-based request scheduling algorithm called ZSPTF, which has average response times comparable to shortest positioning time first (SPTF) but with response time variability comparable to circular scan (C-SCAN).
{"title":"Zone-based shortest positioning time first scheduling for MEMS-based storage devices","authors":"Bo Hong, S. Brandt, D. Long, E. L. Miller, K. Glocer, Zachary N. J. Peterson","doi":"10.1109/MASCOT.2003.1240648","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240648","url":null,"abstract":"Access latency to secondary storage devices is frequently a limiting factor in computer system performance. New storage technologies promise to provide greater storage densities at lower latencies than is currently obtainable with hard disk drives. MEMS-based storage devices use orthogonal magnetic or physical recording techniques and thousands of simultaneously active MEMS-based read-write tips to provide high-density low-latency nonvolatile storage. These devices promise seek times 10-20 times faster than hard drives, storage densities 10 times greater, and power consumption an order of magnitude lower. Previous research has examined data layout and request ordering algorithms that are analogs of those developed for hard drives. We present an analytical model of MEMS device performance that motivates a computationally simple MEMS-based request scheduling algorithm called ZSPTF, which has average response times comparable to shortest positioning time first (SPTF) but with response time variability comparable to circular scan (C-SCAN).","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"3 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120807312","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240650
Mingwei Gong, C. Williamson
This paper uses a probe-based sampling approach to study the behavioural properties of Web server scheduling strategies, such as processor sharing (PS) and shortest remaining processing time (SRPT). The approach is general purpose, in that it can be used to estimate the mean and variance of the job response time, for arbitrary arrival processes, service time distributions, and scheduling policies. In the paper, we apply the approach to trace-driven simulation of Web server scheduling to compare and contrast the PS and SRPT scheduling policies. We identify two types of unfairness, called endogenous and exogenous unfairness. We quantify each, focusing on the mean and variance of slowdown, conditioned on job size, for a range of system loads. Finally, we confirm recent theoretical results regarding the asymptotic convergence of scheduling policies with respect to slowdown, and illustrate typical performance results for a practical range of job sizes from an empirical Web server workload.
{"title":"Quantifying the properties of SRPT scheduling","authors":"Mingwei Gong, C. Williamson","doi":"10.1109/MASCOT.2003.1240650","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240650","url":null,"abstract":"This paper uses a probe-based sampling approach to study the behavioural properties of Web server scheduling strategies, such as processor sharing (PS) and shortest remaining processing time (SRPT). The approach is general purpose, in that it can be used to estimate the mean and variance of the job response time, for arbitrary arrival processes, service time distributions, and scheduling policies. In the paper, we apply the approach to trace-driven simulation of Web server scheduling to compare and contrast the PS and SRPT scheduling policies. We identify two types of unfairness, called endogenous and exogenous unfairness. We quantify each, focusing on the mean and variance of slowdown, conditioned on job size, for a range of system loads. Finally, we confirm recent theoretical results regarding the asymptotic convergence of scheduling policies with respect to slowdown, and illustrate typical performance results for a practical range of job sizes from an empirical Web server workload.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131846667","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240669
J. Tomasik, I. Kotuliak, T. Atmaca
Switch architectures applicable to fixed-length optical packet networks is studied and we compare their performance in terms of packet loss ratio. We propose analytical models of these switches (as discrete time Markov chains) and we compare their performance with those obtained by simulation, varying statistical properties of incoming traffic. We show that Markovian models of future optical architectures can be applied as a tool to studies of network design.
{"title":"Markovian performance analysis of a synchronous optical packet switch","authors":"J. Tomasik, I. Kotuliak, T. Atmaca","doi":"10.1109/MASCOT.2003.1240669","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240669","url":null,"abstract":"Switch architectures applicable to fixed-length optical packet networks is studied and we compare their performance in terms of packet loss ratio. We propose analytical models of these switches (as discrete time Markov chains) and we compare their performance with those obtained by simulation, varying statistical properties of incoming traffic. We show that Markovian models of future optical architectures can be applied as a tool to studies of network design.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129895262","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}
Pub Date : 2003-10-27DOI: 10.1109/MASCOT.2003.1240679
J. Bradley, N. Dingle, S. Gilmore, W. Knottenbelt
A technique for defining and extracting passage-time densities from high-level stochastic process algebra models is presented. Our high-level formalism is PEPA, a popular Markovian process algebra for expressing compositional performance models. We introduce ipc, a tool which can process PEPA-specified passage-time densities and models by compiling the PEPA model and passage specification into the DNAmaca formalism. DNAmaca is an established modelling language for the low-level specification of very large Markov and semiMarkov chains. We provide performance results for ipc/DNAmaca and comparisons with another tool which supports PEPA, PRISM. Finally, we generate passage-time densities and quantiles for a case study of a high-availability Web server.
{"title":"Derivation of passage-time densities in PEPA models using ipc: the imperial PEPA compiler","authors":"J. Bradley, N. Dingle, S. Gilmore, W. Knottenbelt","doi":"10.1109/MASCOT.2003.1240679","DOIUrl":"https://doi.org/10.1109/MASCOT.2003.1240679","url":null,"abstract":"A technique for defining and extracting passage-time densities from high-level stochastic process algebra models is presented. Our high-level formalism is PEPA, a popular Markovian process algebra for expressing compositional performance models. We introduce ipc, a tool which can process PEPA-specified passage-time densities and models by compiling the PEPA model and passage specification into the DNAmaca formalism. DNAmaca is an established modelling language for the low-level specification of very large Markov and semiMarkov chains. We provide performance results for ipc/DNAmaca and comparisons with another tool which supports PEPA, PRISM. Finally, we generate passage-time densities and quantiles for a case study of a high-availability Web server.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133623350","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：