{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:02:06Z","timestamp":1757541726782},"reference-count":14,"publisher":"IGI Global","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"abstract":"<jats:p>Discrete event simulation is the most important and essential part in network simulation. The node-oriented model of discrete event scheduling is a model that allocates computing resources as nodes and makes the discrete event simulation as a simulation task on nodes. In this article the reason of low performance in large-scale network simulation is analyzed, and an ideal node-oriented model of discrete event scheduling is presented and a resource-limited node-oriented model of discrete event scheduling by adding some restrictions on network resources is proposed. Then, the authors complete contrast experiments of the resource-limited node-oriented model of discrete event scheduling and NS2. Finally, packet loss in resource-limited node-oriented model of discrete event scheduling is examined. Also, NS2 is discussed in this article and the authors have proposed an improved method for the packet loss algorithm in a resource-limited node-oriented model of discrete event scheduling.<\/jats:p>","DOI":"10.4018\/joeuc.2019070104","type":"journal-article","created":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T18:42:22Z","timestamp":1555353742000},"page":"67-82","source":"Crossref","is-referenced-by-count":9,"title":["A Node-Oriented Discrete Event Scheduling Algorithm Based on Finite Resource Model"],"prefix":"10.4018","volume":"31","author":[{"given":"Yu","family":"Huang","sequence":"first","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Wanxing","family":"Sheng","sequence":"additional","affiliation":[{"name":"China Electric Power Research Institute, Beijing, China"}]},{"given":"Peipei","family":"Jin","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Baicuan","family":"Nie","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Meikang","family":"Qiu","sequence":"additional","affiliation":[{"name":"Pace University, New York City, USA"}]},{"given":"Guangquan","family":"Xu","sequence":"additional","affiliation":[{"name":"Tianjin University, Tianjin, China"}]}],"member":"2432","reference":[{"key":"JOEUC.2019070104-0","doi-asserted-by":"crossref","unstructured":"Gladisch, A., Daher, R., & Tavangarian, D. (2012). Node-oriented Internet Protocol: A novel concept for enhancement of mobility and multi-homing in Future Internet. In 2012 IEEE 37th Conference on Local Computer Networks Workshops (pp. 1070-1077).","DOI":"10.1109\/LCNW.2012.6424045"},{"key":"JOEUC.2019070104-1","first-page":"1","article-title":"A node-oriented branch and bound algorithm for the capacitated minimum spanning tree problem.","author":"J.Han","year":"2003","journal-title":"28th Annual IEEE International Conference on Local Computer Networks"},{"key":"JOEUC.2019070104-2","doi-asserted-by":"publisher","DOI":"10.1109\/PADS.2003.1207427"},{"issue":"5","key":"JOEUC.2019070104-3","first-page":"742","article-title":"Packet Network Simulation: Speedup and Accuracy Versus Timing Granularity.","volume":"4","author":"S. A.Jong","year":"1996","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"JOEUC.2019070104-4","doi-asserted-by":"publisher","DOI":"10.1109\/ICTC.2014.6983226"},{"key":"JOEUC.2019070104-5","doi-asserted-by":"publisher","DOI":"10.1109\/CCAA.2015.7148434"},{"key":"JOEUC.2019070104-6","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2010.30"},{"key":"JOEUC.2019070104-7","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2002.1003854"},{"key":"JOEUC.2019070104-8","first-page":"153","article-title":"Conservative Synchronization of Large-Scale Network Simulations.","author":"A.Park","year":"2004","journal-title":"Proceedings of the 18th Workshop on Parallel and Distributed Simulation"},{"key":"JOEUC.2019070104-9","first-page":"1339","article-title":"Phase-Change Memory Optimization for Green Cloud with Genetic Algorithm.","volume":"65","author":"M.Qiu","year":"2017","journal-title":"IEEE Transactions on Computers"},{"key":"JOEUC.2019070104-10","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1988.23946"},{"key":"JOEUC.2019070104-11","author":"X. F.Wang","year":"2007","journal-title":"Research on improving the performance of large-scale discrete event network simulation"},{"key":"JOEUC.2019070104-12","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2507177"},{"key":"JOEUC.2019070104-13","first-page":"147","article-title":"Incremental scheduling of discrete event systems.","author":"S.Ware","year":"2016","journal-title":"13th International Workshop on Discrete Event Systems"}],"container-title":["Journal of Organizational and End User Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=227341","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T09:47:24Z","timestamp":1651830444000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/JOEUC.2019070104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":14,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.4018\/joeuc.2019070104","relation":{},"ISSN":["1546-2234","1546-5012"],"issn-type":[{"value":"1546-2234","type":"print"},{"value":"1546-5012","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7]]}}}