A traffic shaping scheduling method for controlling traffic entering a network in a certain period of time, comprising: distributing to each subscriber a unique Subscriber Queue identifier, SQID, and making it correspond to a Subscriber Queue, SQ, wherein multiple Flow Queues, FQs, corresponding to multiple services of each SQ are separately configured to different Flow Group Queues, FGQs; storing in a storage list a scheduling result of a previous level scheduling; obtaining (100; 200), by a query module, a SQID of a SQ passing the previous-level scheduling, and capable of entering a present-level scheduling, said present-level scheduling comprising: querying, by said query module all FGQ, identifiers, FGQID, corresponding or relevant to the SQID, wherein each FGQID corresponds to one FGQ; wherein a token bucket corresponding to each FGQID is for limiting data traffic allowed to enter the network corresponding to the FGQ, and the number of currently remaining tokens in a token bucket of the FGQ represents the data traffic of the FGQ currently allowed to be transmitted; reading the number of the currently remaining tokens in the token bucket respectively corresponding to each queried FGQID; and judging (101; 203), by a judgement module, if the number of the currently remaining tokens of the FGQID is greater than or equal to a preset threshold of the FGQID, determining that the FQ corresponding to the FGQID in the SQ satisfies a scheduling condition, and if the number of the currently remaining tokens of the FGQID is smaller than the preset threshold of the FGQID, determining that the FQ corresponding to the FGQID in the SQ fails to satisfy the scheduling condition, and scheduling the FQ, satisfying the scheduling condition out of the queue. distributing to each subscriber a unique Subscriber Queue identifier, SQID, and making it correspond to a Subscriber Queue, SQ, wherein multiple Flow Queues, FQs, corresponding to multiple services of each SQ are separately configured to different Flow Group Queues, FGQs; storing in a storage list a scheduling result of a previous level scheduling; obtaining (100; 200), by a query module, a SQID of a SQ passing the previous-level scheduling, and capable of entering a present-level scheduling, said present-level scheduling comprising: querying, by said query module all FGQ, identifiers, FGQID, corresponding or relevant to the SQID, wherein each FGQID corresponds to one FGQ; wherein a token bucket corresponding to each FGQID is for limiting data traffic allowed to enter the network corresponding to the FGQ, and the number of currently remaining tokens in a token bucket of the FGQ represents the data traffic of the FGQ currently allowed to be transmitted; reading the number of the currently remaining tokens in the token bucket respectively corresponding to each queried FGQID; and judging (101; 203), by a judgement module, if the number of the currently remaining tokens of the FGQID is greater than or equal to a preset threshold of the FGQID, determining that the FQ corresponding to the FGQID in the SQ satisfies a scheduling condition, and if the number of the currently remaining tokens of the FGQID is smaller than the preset threshold of the FGQID, determining that the FQ corresponding to the FGQID in the SQ fails to satisfy the scheduling condition, and scheduling the FQ, satisfying the scheduling condition out of the queue. querying, by said query module all FGQ, identifiers, FGQID, corresponding or relevant to the SQID, wherein each FGQID corresponds to one FGQ; wherein a token bucket corresponding to each FGQID is for limiting data traffic allowed to enter the network corresponding to the FGQ, and the number of currently remaining tokens in a token bucket of the FGQ represents the data traffic of the FGQ currently allowed to be transmitted; reading the number of the currently remaining tokens in the token bucket respectively corresponding to each queried FGQID; and judging (101; 203), by a judgement module, if the number of the currently remaining tokens of the FGQID is greater than or equal to a preset threshold of the FGQID, determining that the FQ corresponding to the FGQID in the SQ satisfies a scheduling condition, and if the number of the currently remaining tokens of the FGQID is smaller than the preset threshold of the FGQID, determining that the FQ corresponding to the FGQID in the SQ fails to satisfy the scheduling condition, and scheduling the FQ, satisfying the scheduling condition out of the queue.