A method for simulating a mobile telephone network with shared-access channels. The simulation method includes the steps of simulating at least a first and a second configuration of the mobile telephone network that are statistically independent one from the other. Each one of the steps of simulating includes at least the steps of: determining a number of mobile terminals generating a packet data traffic; assigning to a list of mobile terminals included in the number of mobile terminals generating a packet data traffic, at least one shared-access channel of the mobile telephone network to be simulated; and performing a scheduling management algorithm of the list of mobile terminals on the shared-access channel.

Patent
   9215602
Priority
Nov 12 2004
Filed
Nov 12 2004
Issued
Dec 15 2015
Expiry
Feb 20 2032
Extension
2656 days
Assg.orig
Entity
Large
0
8
currently ok
1. A method, implemented using at least one computer including at least one processor configured to execute instructions, for simulating a mobile telephone network with shared-access channels, the method comprising at least the steps of:
simulating, using the at least one processor, a first configuration of said mobile telephone network;
simulating, using the at least one processor, a second configuration of said mobile telephone network;
said first and second configurations of said mobile telephone network being statistically independent one from the other;
each one of said steps of simulating comprising at least the steps of:
determining, using the at least one processor, a number of mobile terminals generating a packet data traffic;
assigning, using the at least one processor, to a list of mobile terminals in said number of mobile terminals generating the packet data traffic, at least one shared-access channel of said mobile telephone network to be simulated; and
performing, using the at least one processor, a scheduling management process of said list of mobile terminals on said shared-access channel.
10. A system for simulating at least a first and a second configuration of a mobile telephone network, said first and second configuration of said mobile telephone network being statistically independent one from the other and each comprising a number of mobile terminals to be simulated generating a packet data traffic, the system for simulating comprising:
at least one computer including at least one processor configured to execute computer-executable instructions;
at least one memory loaded with the computer-executable instructions for performing a simulation process program,
wherein the simulation process program includes at least one object representing a network controller belonging to said mobile telephone network;
said at least one object comprising modules configured for:
simulating, using the at least one processor, a first configuration of the mobile telephone network;
simulating, using the at least one processor, a second configuration of the mobile telephone network;
the first and second configuration of the mobile telephone network being statistically independent one from the other;
assigning, using the at least one processor, to a list of mobile terminals in said number of mobile terminals generating the packet data traffic, at least one shared-access channel of said mobile telephone network to be simulated; and
performing, using the at least one processor, a scheduling managing process of said list of mobile terminals on said shared-access channel.
2. The method according to claim 1, wherein said step of performing the scheduling management process comprises the step of:
enabling, using the at least one processor, in succession the mobile terminals in said list of mobile terminals for transmitting/receiving on said shared-access channel.
3. The method according to claim 2, wherein said step of enabling in succession the mobile terminals in said list of mobile terminals, comprises the steps of:
selecting, using the at least one processor, a first mobile terminal on said list of mobile terminals, said first mobile terminal occupying a first position on said list of mobile terminals;
enabling, using the at least one processor, said first mobile terminal for transmitting/receiving on said shared-access channel;
moving, using the at least one processor, said first mobile terminal from said first position on said list of mobile terminals to a last position on said list of mobile terminals;
selecting, using the at least one processor, a second mobile terminal on said list of mobile terminals, said second mobile terminal occupying said first position on said list of mobile terminals;
enabling, using the at least one processor, said second mobile terminal for transmitting/receiving on said shared-access channel;
moving, using the at least one processor, said second mobile terminal from said first position on said list of mobile terminals to a last position on said list of mobile terminals; and
repeating, using the at least one processor, the previous steps for each mobile terminal on said list of mobile terminals.
4. The method according to claim 3, wherein said steps of moving said first and second mobile terminal from said first position on said list of mobile terminals comprises the step of:
disabling, using the at least one processor, said first and second mobile terminal from transmitting/receiving on said shared-access channel.
5. The method according to claim 1, wherein said packet data traffic is of the continuous type.
6. The method according to claim 1, wherein said packet data traffic is of the world wide web type.
7. The method according to claim 1, wherein said scheduling management process is based on a time division mode.
8. The method according to claim 1, wherein each one of said steps of simulating a configuration of said mobile telephone network further comprises the steps of:
determining, using the at least one processor, a number of mobile terminals generating voice traffic; and
processing, using the at least one processor, at least one radio resources management event related to a voice traffic distribution associated with said number of mobile terminals generating the voice traffic.
9. The method according to claim 8, wherein said radio resources management event is a power control event.
11. A non-transitory computer-readable storage medium loaded with a computer program, when executed by a processor, performs the steps of the method according to claim 1.

This application is a national phase application based on PCT/IB2004/003710, filed Nov. 12, 2004, the content of which is incorporated herein by reference.

1. Field of the Invention

The present invention refers in general to the field of mobile telephones and in particular to a mobile telephone network. More in particular, the present invention refers to a method and a system for simulating the behaviour of a mobile telephone network, that can provide services through shared-access channels, based for example on the GSM/GPRS (Global System for Mobile Communications/General Packet Radio Service) standard or on the EDGE (Enhanced Data for GSM Evolution) standard or on the HSDPA (High-Speed Downlink Packet Access) standard or on the UMTS (Universal Mobile Telecommunication System) standard.

2. Description of the Related Art

Planning of a network requires the designers to evaluate performances of a network based on geographic data, on network configurations and on expected service requests. The tools that simulate the operation of a network provide a practical method for planning the network itself. The network planning tools allow the designers to simulate the operation of various network configurations by performing modifications on the network based on statistical data obtained as simulation output.

Currently-available cellular network planning tools are generally based on simulators of the static type or of the dynamic type.

In static simulations, the time variable is not taken into account, but the network is analysed in a particular state, as if it were analysed through a photograph. By carrying out many network analyses (many “photographs” called “snapshots”) in different states, it is possible to obtain a global network evaluation.

A static simulation of a GSM network is described, for example, in T. M. Gill “A simulation of a GSM network with frequency hopping”, 1991 Sixth International Conference on Mobile Radio and Personal Communications (Conf. Pul. No. 351) p. 167-74.

In dynamic simulations, the time variable is instead taken into account and the subsequent changes of the network state are regulated by “events”; each “event” represents the realisation of a condition that determines the change of the network state. By carrying out a simulation that takes into account the network state evolution for a certain time length, it is possible to obtain a global network evaluation.

In WO 02/104055, in the name of the Applicant itself, a dynamic simulation system is for example disclosed, characterised by a modular structure based on interchangeable objects that are able to be selectively activated, which comprises a simulation engine and a plurality of modules representative of apparatuses and elements of the network to be simulated. Due to such structure, the system allows simulating highly complex networks.

Dynamic simulators are also used for simulating the mobile telephone networks with shared-access channels (such as for example the GPRS network). The shared-access channels are physical channels, generally used for packet data transmission, which can be shared among many users. For example, the shared-access channels can be used when the packet data transmission is of the intermittent type (such as the download of a Web page) or when a mobile terminal uses a service of the Best-Effort type, namely a service for which the mobile telephone operator cannot guarantee a high quality level. Suitable algorithms, so-called scheduling algorithms, which are part of the set of procedures/algorithms for managing radio resources (Radio Resource Management or RRM) in a mobile telephone network, schedule, in time, the sharing of a single physical channel among different users.

Dynamic simulators, taking into account the time variable, are able to simulate the behaviour of the mobile telephone networks with shared-access channels. In particular, the use of dynamic simulators allows evaluating the effect/impact of scheduling algorithms on performances of this type of networks.

The Applicant has however observed that the use of dynamic simulators implies rather high simulation times if compared with simulation times obtained by using static simulators, above all when networks to be simulated are big-sized and with high complexity.

The Applicant therefore posed itself the problem of making a static simulator that is able to simulate a mobile telephone network with shared-access channels with adequate accuracy and reliability, though without taking into account the time variable.

The invention solves the above-stated technical problem by introducing, in a static simulator, a module that is able to simulate the management of user scheduling on the shared-access channels of the mobile telephone network to be simulated.

According to the present invention, during each analysis (“photograph or snapshot”) of the mobile telephone network to be simulated, the module that manages the user scheduling in turn enables all (or a substantial portion of) the users, that generate a packet data traffic, to transmit/receive on at least one of the shared-access channels being present in the network itself. At the end of the simulation, the mean throughput can be calculated, namely the mean of information transferred, per time unit, from each mobile terminal onto the shared-access channels on which it has been enabled to transmit/receive during the simulation.

The Applicant has observed that the above-stated problem can be solved by a method for simulating a mobile telephone network with shared-access channels comprising at least the steps of:

Another aspect of the present invention refers to a system for simulating at least a first and a second configuration of a mobile telephone network, said first and second configuration of said mobile telephone network being statistically independent one from the other and each comprising a number of mobile terminals to be simulated generating a packet data traffic, said simulating system including:

A further aspect of the present invention refers to a computer program product that can be loaded in the memory of at least one electronic processor and comprising portions of software code for performing the process according to the invention when the product is executed on a processor: in this context such statement must be deemed wholly equivalent to the mention of means that can be read by a computer comprising instructions for checking a network of computers in order to perform a process according to the invention. The reference to “at least one electronic processor” is obviously aimed to enlighten the chance of performing the arrangement according to the invention in a de-centralised context.

Further preferred aspects of the present invention are described in the dependent claims and in the present description.

The characteristics and the advantages of the present invention will appear from the herein below description of an embodiment thereof, provided merely as a non-limiting example, with reference to the enclosed drawings, in which:

FIG. 1 shows a client-server architecture through which the simulation method according to the invention operates;

FIG. 2 shows an exemplified structure of a simulator made according to the invention;

FIG. 3 shows simulation objects used by the simulator in FIG. 2; and

FIGS. 4 and 5 show flow diagrams related to the simulation method according to the invention.

With reference to FIG. 1, the method for simulating a mobile telephone network, providing services through shared-access channels according to the invention, can operate through a client-server architecture 1, of a known type, described below. As a non-limiting example, the mobile telephone network which will be referred to in the following description is a mobile telephone network of the GSM/GPRS type (herein below called “GSM/GPRS network”). However the simulation method according to the invention can be applied also to mobile telephone networks based for example on the EDGE or HSDPA or UMTS standards.

Moreover, the following description will define as GSM mobile terminals all mobile terminals that are able to generate a voice-type traffic and as GPRS mobile terminals all mobile terminals that are able to generate a packet data traffic. In particular, the packet data traffic generated by the GPRS mobile terminals can be, for example:

Always with reference to FIG. 1, the client-server architecture 1 comprises: a client processor 2, for example a Personal Computer, on which a graphic interface program 3, of a known type, is installed; a server processor 4, for example a Work Station, on which a simulator 5, of the static type, is installed, for simulating the GSM/GPRS network.

Specifically, the simulator 5 receives as input:

As shown in FIG. 1, client processor 2 and server processor 4 are mutually interconnected through a data network 9, of a known type, based for example on a protocol of the TCP/IP type. Alternatively, client processor 2 and server processor 4 can be a single processor.

The network configuration parameters included in the configuration file 6 can for example comprise:

Moreover, the statistical data obtained as output from the simulator 5 and stored in the simulation data base 8 can, for example, comprise:

For each shared-access channel, the signal/noise ratio measured from the GPRS mobile terminal corresponds to the ratio between power associated with data packets that the mobile terminal is receiving on such channel and the remaining power received by the mobile terminal on the same channel.

With reference to FIG. 2, the simulator 5, implemented for example in ANSI C++ programming language by means of a project platform of the UML (“Unified Modelling Language”) type, comprises, according to a so-called object-oriented approach:

According to the object-oriented approach, the elementary decomposition unit is not the operation (procedure), but the object, represented as an aggregation of variables, data structures and procedures which are considered a single entity by the simulator. In the examined case, the simulation objects correspond, in general, to real entity models (real world objects).

Moreover, it can be noted that, during the simulation, each simulation object directly interacts with the remaining objects, by sending information elements called “messages”. Specifically, the communication through messages is characterised in that the reception of information by the destination object occurs simultaneously with the transmission by the source object.

With reference to FIG. 3, the plurality of objects 12 can comprise:

More in detail:

The simulation method according to the invention will now be described with reference to FIG. 3 and to the flow diagram shown in FIG. 4. In detail, the flow diagram in FIG. 4 shows a simulation algorithm 100 that operates according to the invention.

It can be stated that the evolution of the simulation algorithm 100 depends on the simulation engine 10 that controls the sequence of simulation steps included in the algorithm itself.

In detail, the simulation algorithm 100 according to the invention can comprise a step of initialisation of the simulation 110 and one or more iterative steps of event-based micro-simulation 120.

In each event-based micro-simulation step 120, a network configuration is simulated (in terms of mobile terminals distribution), and all network configurations simulated during the simulation are statistically independent one from the other.

In the following description and claims, the term “statistically independent” means that two network configurations simulated in two following event-based micro-simulations are not the temporal evolution one of the other.

In detail, the step of initialisation of the simulation 110 can comprise the following steps performed by the simulation engine 10:

Always with reference to FIG. 4, each event-based micro-simulation 120 step can comprise the following steps, performed by the simulation engine 10:

More specifically, the step of initialising the event-based micro-simulation 130 can comprise the following steps, performed by objects 17 of the BSC_MC type, objects 18 of the BTS_MC type and objects 19 of the MS_MC type:

Moreover, the first step of processing a radio resources management event 140 comprises at least a step of processing a power control event, performed by objects 19 of the MS_MC type simulating the behaviour of the GSM mobile terminals (defined herein below as “GSM-type objects”). During such step, the GSM-type objects transmit/receive on dedicated-access channels assigned thereto by module BCS_RRM_MC 20 and, simultaneously, through the respective modules MS_PHY_MC 25, perform measures on such channels, for example of the RXLEV parameter representing the level of received power and the RXQUAL parameter representing the quality level of the received service. Correspondingly, modules BTS_PHY_MC 23 perform, on the same channels, the measures of RXLEV and RXQUAL parameters received by them. These parameters are useful to obtain, at the end of the step of processing the power control event, the update of its own transmission power by each GSM-type object and each module BTS_PHY_MC 23.

In a preferred embodiment, the updated of its own transmission power by each GSM-type object and each module BTS_PHY_MC 23 can provide for the cyclic repetition, for a number of times established in the configuration file 6, of the following steps:

sending to module BSC_RRM_MC 20 by modules MS_PHY_MC 25 a report message containing the measured values of RXLEL and RXQUAL parameters (arrow 39 in FIG. 3);

The second step of processing a radio resources management event 150 provides for the simulation of a scheduling management algorithm of objects 19 of the MS_MC type simulating the behaviour of the GPRS mobile terminals (defined herein below as “GPRS-type objects”) on the shared-access channels of the GSM/GPRS network.

In a preferred embodiment of the present invention, the simulated scheduling management algorithm uses a time division mode for managing the scheduling. In this mode, time is divided into elementary units (for example 20 ms long) called block periods: for each block period, the scheduling management algorithm assigns to at least one mobile terminal at least one shared-access channel: such mobile terminal is then enabled to transmit on such channel during such block period.

Specifically, the scheduling management algorithm is simulated through module BSC_MAC_MC 22, included in object 17 of the BSC_MC type, that during the second step of processing a radio resources management event 150, performs one or more scheduling events (each simulating one block period) as will be better described in the following description.

More in detail, the second step of processing a radio resources management event 150 starts when module BSC_RR_MC 21 sends to module BSC_MAC_MC 22 a configuration message (arrow 40 in FIG. 3) containing at least the following elements:

Module BSC_MAC_MC 22, through the simulation engine 10, performs the NumRBslot scheduling events provided in the configuration message sent by module BSC_RR_MC 21, with a timing that, for example, is 20 ms. During each scheduling event, module BSC_MAC_MC 22 performs the following operations:

The operation proceeds similarly to what is described above for each one of the NumRBslot scheduling events provided in the configuration message sent by module BSC_RR_MC 21 to module BSC_MAC_MC 22 at the beginning of the second step of processing a radio resources management event 150.

At the end of each scheduling event, a step for collecting and processing 150e all measures of signal/noise ratio performed by each GPRS-type object, is also provided. During this step, the mean signal/noise ratio measured by each GPRS-type object is also calculated. All mean signal/noise ratios calculated in the step of collecting and processing 150e are then stored in the simulation data base 8.

Now the simulation engine 10 verifies whether the module BSC_MAC_MC 22 has performed all scheduling events provided in the configuration message sent by module BSC_RR_MC 21. If the check has a positive result, the simulation engine 10 ends the second step of processing a radio resources management event 150 and, in a preferred embodiment of the present invention, controls the execution of a step for calculating 160 the mean throughput associated with each GPRS-type object. If instead, the check has a negative result, the simulation engine 10 controls the execution of a new scheduling event.

In particular, the mean throughput is calculated depending on the formula:

T MS = i = 1 N TS T TS , i * N RB , TX numRBslot
where TTS,i is the mean throughput related to the i-th shared-access channel assigned to the GPRS-type object (this value is calculated by using curves, set in the configuration file 6, that, for each shared-access channel assigned to the GPRS-type object during the step of executing the event-based micro-simulation 140, link the values of mean signal/noise ratio to the values of mean throughput); NRB,TX is the number of scheduling events in which the GPRS-type object has been enabled to transmission/reception by module BSC_MAC_MC 22; numRBslot is the number of scheduling events performed by module BSC_MAC_MC 22; NTS is the number of shared-access channels assigned to the GPRS-type object during the second step of processing a radio resources management event 150. All values of mean throughput calculated during the step of calculating 160 are then stored in the simulation data base 8.

Now the simulation engine 10 verifies whether the simulation algorithm 100 has performed all event-based micro-simulations steps 120 provided in the configuration file 6. If the check has a positive result, the simulation engine 10 ends the simulation algorithm 100 (stop), otherwise it controls the execution of a new event-based micro-simulation step 120.

In FIG. 5 an operating example of module BSC_MAC_MC 22 is shown. In particular, in the example in FIG. 5 a first 200, a second 210 and a third 220 scheduling event are simulated in succession regarding four GPRS-type objects (MS_MC1, MS_MC2, MS_MC3, MS_MC4) on a first 230, a second 240 and a third 250 shared-access channel for the uplink connection (namely for the communication occurring from mobile terminal to transceiver station).

As shown in FIG. 5, the sub-list of GPRS-type objects (MS_MC1, MS_MC2) is assigned to the first shared-access channel 230; the sub-list of GPRS-type objects (MS_MC1, MS_MC2, MS_MC4) is assigned to the second shared-access channel 240; the sub-list of GPRS-type objects (MS_MC2, MS_MC3) is assigned to the third shared-access channel 250.

During the first scheduling event 200, module BSC_MAC_MC 22 selects on each shared-access channel 230, 240, 250, the GPRS-type object that occupies the first position of the sub-list assigned to such channel, namely: the GPRS-type object (MS_MC1) is selected on the first shared-access channel 230, the GPRS-type object (MS_MC4) is selected on the second shared-access channel 240, the GPRS-type object (MS_MC3) is selected on the third shared-access channel 250.

After having selected the GPRS-type objects MS_MC1, MS_MC4, MS_MC3, occupying the first place of the respective sub-list, module BSC_MAC_MC 22 enables them for receiving on the shared-access channel assigned thereto, namely: the GPRS-type object (MS_MC1) is enabled for receiving on the first shared-access channel 230, the GPRS-type object (MS_MC4) is enabled for receiving on the second shared-access channel 240, the GPRS-type object (MS_MC3) is enabled for receiving on the third shared-access channel 250.

After each GPRS-type object (MS_MC1, MS_MC4, MS_MC3) enabled for receiving has performed the respective measures of signal/noise ratio, module BSC_MAC_MC 22 disables it and removes it from the first position of the respective sub-list in order to insert it at the bottom of the sub-list itself. In this way, the following is obtained: the first position of the sub-list assigned to the first shared-access channel 230 is now occupied by the GPRS-type object (MS_MC2) while the GPRS-type object (MS_MC1) is at the bottom of the sub-list; the first position of the sub-list assigned to the second shared-access channel 240 is also occupied by the GPRS-type object (MS_MC2), while object MS_MC4 is at the bottom of the sub-list; the first position of the sub-list assigned to the third shared-access channel 250 is also occupied by the GPRS-type object (MS_MC2) while the GPRS-type object (MS_MC3) is at the bottom of the sub-list.

Now, module BSC_MAC_MC 22 performs the second scheduling event 210 in which it selects on each shared-access channel 230, 240, 250, the GPRS-type object that now occupies the first position of the sub-list assigned to such channel. In this case on all three shared-access channels 230, 240, 250, the GPRS-type object (MS_MC2) is selected.

After the GPRS-type object (MS_MC2) has been selected, module BSC_MAC_MC 22 enables it for receiving on the shared-access channels 230, 240, 250 and, after the GPRS-type object (MS_MC2) has performed the respective measures of signal/noise ratio, module BSC_MAC_MC 22 disables it and removes it from the first position of each sub-list in order to insert it at the bottom of the sub-list itself. In this way, the following is obtained: the first position of the sub-list assigned to the first shared-access channel 230 is now occupied again by the GPRS-type object (MS_MC1) while the GPRS-type object (MS_MC2) is at the bottom of the sub-list; the first position of the sub-list assigned to the second shared-access channel 240 is now occupied by the GPRS-type object (MS_MC1), while the GPRS-type object (MS_MC2) is at the bottom of the sub-list; the first position of the sub-list assigned to the third shared-access channel 250 is again occupied by the GPRS-type object (MS_MC3) while the GPRS-type object (MS_MC2) is at the bottom of the sub-list.

Now, module BSC_MAC_MC 22 performs the third scheduling event 220, in which it selects on each shared-access channel 230, 240, 250, the GPRS-type object that now occupies the first position of the sub-list assigned to such channel, namely: the GPRS-type object (MS_MC1) is selected on the first and on the second shared-access channel 230, 240, while the (MS_MC3)-type object is again selected on the third shared-access channel 250.

After having selected the GPRS-type objects MS_MC1, MS_MC3, occupying the first place of the respective sub-list, module BSC_MAC_MC 22 enables them for receiving on the shared-access channel assigned thereto, namely: the GPRS-type object (MS_MC1) is enabled for receiving on the first and the second shared-access channel 230, 240, while the (MS_MC3)-type object is again enabled for receiving on the third shared-access channel 250. Then, module BSC_MAC_MC 22 ends the scheduling events simulation.

Advantageously, the simulation method according to the invention allows to simulate, with adequate accuracy and reliability, the scheduling management procedures/algorithms used in mobile telephone networks with shared-access channels without taking into account the time variable and thereby minimising the required times for simulation.

It is finally clear that numerous modifications and variations, all falling within the inventive concept, as defined by the enclosed claims, can be made to the simulation method and its related simulator, herein described and shown.

The simulator 5 can for example be made using any type of computer (Intel, SUN, Apple, etc.) and operating system (Windows, Linux, Unix, MAC OS, etc.).

Moreover, the use of ANSI C++ programming language for implementing the simulator 5 is only one possible choice; the simulator 5 can be implemented also using other programming languages, such as for example Java, Delphi, Visual Basic, etc. The choice of the ANSI C++ language has been dictated by the good programming flexibility offered by said programming language and by the high level of performance that can be obtained in the finished program in terms of execution speed.

Moreover, the simulator 5 according to the invention can be used also for simulating other types of mobile telephone networks in which there are shared-access channels. In such case it is necessary to provide for the insertion of a module similar to the third module BSC_MAC_MC 22 that has been described previously, that takes care of managing the scheduling of mobile terminals, which generate a packet data traffic on the shared-access channels. For example, it is possible to simulate the UMTS-FDD (Universal Mobile Telecommunications System—Frequency Division Duplex) mobile telephone network by taking into account the DSCH (Downlink Shared CHannel) channels, or the HS-DSCH (High Speed Downlink Shared CHannel) network, or also the EDGE (Enhanced Data rate for Global Evolution) network.

A further advantage of the simulator 5 is given by the chance of using some of the results provided by a simulator of the dynamic type or provided by measures performed on the real network, in order to calculate, for example, the number of GPRS-type objects to be simulated, according to the type of traffic that has to be taken into account.

As already previously mentioned, the simulator 5 can also be used for simulating GPRS mobile terminals generating a data traffic that is different from a data traffic of the FTP (File Transfer Protocol) type. For example, the simulator 5 can also be used for simulating GPRS mobile terminals generating a packet data traffic of the WWW (World Wide Web) type. In this case, the number of GPRS-type objects generating a packet data traffic of the WWW type that can be simulated through the simulator 5 can be computed by taking into account, for example, the following factors:

Such probability value must be used for obtaining the mean number of shared-access channels to be simulated, and is calculated by taking into account the following factors:

Franceschini, Daniele, Trogolo, Alessandro, Goria, Paolo, Ferrato, Marco, Guerrini, Claudio, Zucca, Enrico, Micocci, Angela

Patent Priority Assignee Title
Patent Priority Assignee Title
7181360, Jan 30 2004 Spirent Communications Methods and systems for generating test plans for communication devices
20020004407,
20020193106,
20030086405,
20040111502,
20060058038,
WO2104055,
WO3094538,
////////
Executed onAssignorAssigneeConveyanceFrameReelDoc
Nov 12 2004Telecom Italia S.p.A.(assignment on the face of the patent)
Dec 10 2004FERRATO, MARCOTELECOM ITALIA S P A ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0200190232 pdf
Dec 10 2004FRANCESCHINI, DANIELETELECOM ITALIA S P A ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0200190232 pdf
Dec 10 2004GORIA, PAOLOTELECOM ITALIA S P A ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0200190232 pdf
Dec 10 2004GUERRINI, CLAUDIOTELECOM ITALIA S P A ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0200190232 pdf
Dec 10 2004TROGOLO, ALESSANDROTELECOM ITALIA S P A ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0200190232 pdf
Dec 10 2004ZUCCA, ENRICOTELECOM ITALIA S P A ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0200190232 pdf
Dec 10 2004MICOCCI, ANGELATELECOM ITALIA S P A ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0200190232 pdf
Date Maintenance Fee Events
Nov 18 2015ASPN: Payor Number Assigned.
Jun 17 2019M1551: Payment of Maintenance Fee, 4th Year, Large Entity.
Jun 15 2023M1552: Payment of Maintenance Fee, 8th Year, Large Entity.


Date Maintenance Schedule
Dec 15 20184 years fee payment window open
Jun 15 20196 months grace period start (w surcharge)
Dec 15 2019patent expiry (for year 4)
Dec 15 20212 years to revive unintentionally abandoned end. (for year 4)
Dec 15 20228 years fee payment window open
Jun 15 20236 months grace period start (w surcharge)
Dec 15 2023patent expiry (for year 8)
Dec 15 20252 years to revive unintentionally abandoned end. (for year 8)
Dec 15 202612 years fee payment window open
Jun 15 20276 months grace period start (w surcharge)
Dec 15 2027patent expiry (for year 12)
Dec 15 20292 years to revive unintentionally abandoned end. (for year 12)